Star's Blog

1
#include <iostream>
2

3
using namespace std;
4

5
int main() {
6
    int a, b, c;
7
    cin >> a >> b >> c;
8
    cout << a * 3 + b * 4 + c * 5 << endl;
9
    return 0;
10
}

1
#include <iostream>
2

3
using namespace std;
4

5
int main() {
6
    int d, t;
7
    cin >> d;
8
    while (cin >> t) {
9
        if (d <= t) break;
10
        else d += t;
11
    }
12
    cout << d << endl;
13
    return 0;
14
}

1
#include <iostream>
2
#include <vector>
3
#include <algorithm>
4

5
using namespace std;
6

7
vector<int> sc, bk;
8

9
int main() {
10
    int n;
11
    scanf("%d", &n);
12
    sc.resize(n);
13
    for (int i = 0; i < n; ++i) {
14
        scanf("%d", &sc[i]);
15
    }
16
    bk = sc;
17
    sort(sc.begin(), sc.end());
18
    auto ls = unique(sc.begin(), sc.end());
19
    sort(sc.begin(), ls, greater<int>());
20
    int cnt = 0;
21
    cout << sc[2] << ' ';
22
    for (int s : bk) {
23
        if (s == sc[2]) cnt++;
24
    }
25
    cout << cnt << endl;
26
    return 0;
27
}

1
#include <iostream>
2

3
using namespace std;
4

5
char check(string s, string t, char a, char b) {
6
    bool flag = false;
7
    for (char c : s) {
8
        if (b == c) return 0;
9
        if (a == c) flag = true;
10
    }
11
    if (!flag) return 0;
12
    char res = 0;
13
    for (int i = 0, j = 0; i <= s.length(); ++i) {
14
        if (s[i] == t[j]) j++;
15
        else if (s[i] == a && t[j] == b) j++;
16
        else if (res == 0 || res == s[i]) res = s[i];
17
        else return 0;
18
    }
19
    return res == 0 ? '-' : res;
20
}
21

22
int main() {
23
    ios::sync_with_stdio(0);
24
    cin.tie(0), cout.tie(0);
25
    string s, t;
26
    cin >> s >> t;
27
    for (char i = 'a'; i <= 'z'; ++i) {
28
        for (char j = 'a'; j <= 'z'; ++j) {
29
            if (i == j) continue;
30
            else {
31
                char c = check(s, t, i, j);
32
                if (c) {
33
                    cout << i << ' ' << j << endl;
34
                    cout << c << endl;
35
                    return 0;
36
                }
37
            }
38
        }
39
    }
40
    return 0;
41
}

1
#include <iostream>
2
#include <vector>
3

4
using namespace std;
5

6
int n, m, res;
7
vector<vector<char>> mp;
8
vector<vector<bool>> vis;
9

10
int val(char c) {
11
    if (c == 'S') return 1;
12
    else if (c == 'M') return 5;
13
    else return 10;
14
}
15

16
void dfs(int x, int y) {
17
    if (vis[x][y] || mp[x][y] == '*') return;
18
    vis[x][y] = true;
19
    res += val(mp[x][y]);
20
    if (x < n - 1) dfs(x + 1, y);
21
    if (y < m - 1) dfs(x, y + 1);
22
    if (x > 0) dfs(x - 1, y);
23
    if (y > 0) dfs(x, y - 1);
24
}
25

26

27
int main() {
28
    ios::sync_with_stdio(0);
29
    cin.tie(0), cout.tie(0);
30
    cin >> n >> m;
31
    mp = vector<vector<char>>(n, vector<char>(m));
32
    vis = vector<vector<bool>>(n, vector<bool>(m));
33
    for (int i = 0; i < n; ++i) {
34
        for (int j = 0; j < m; ++j) {
35
            cin >> mp[i][j];
36
        }
37
   }
38
    int x, y;
39
    cin >> x >> y;
40
    dfs(x, y);
41
    cout << res << endl;
42
    return 0;
43
}

1
#include <iostream>
2

3
using namespace std;
4

5
const int N = 2010;
6

7
char s[N][N];
8

9
int main() {
10
    int T;
11
    scanf("%d", &T);
12
    while (T--) {
13
        int n, m;
14
        scanf("%d%d", &n, &m);
15
        for (int i = 1; i <= n; ++i) {
16
            scanf("%s", s[i] + 1);
17
        }
18
        int lx = n / 2, ly = m / 2, rx = 0, ry = 0;
19
        for (int i = 1; i <= n; ++i) {
20
            for (int j = 1; j <= m; ++j) {
21
                if (s[i][j] != s[n - i + 1][j] || s[i][j] != s[i][m - j + 1]) {
22
                    // cout << "! " << i << ' ' << j << endl;
23
                    lx = min(lx, i), ly = min(ly, j);
24
                    rx = max(rx, i), ry = max(ry, j);
25
                }
26
            }
27
        }
28
        printf("%d\n", min(lx - 1, n - rx) * min(ly - 1, m - ry));
29
    }
30
    return 0;
31
}

1
#include <iostream>
2
#include <map>
3

4
using namespace std;
5

6
map<int, int> mp;
7

8
int main() {
9
    int T;
10
    scanf("%d", &T);
11
    while (T--) {
12
        int n, k;
13
        scanf("%d%d", &n, &k);
14
        for (int i = 1; i <= n; ++i) {
15
            int t;
16
            scanf("%d", &t);
17
            mp[t]++;
18
        }
19
        int l = 0, r = n;
20
        while (l < r) {
21
            int mid = l + r >> 1;
22
            int t = 0;
23
            for (auto [_, cnt] : mp) {
24
                t += max(0, cnt - mid + 1);
25
            }
26
            if (t <= k + 1) r = mid;
27
            else l = mid + 1;
28
        }
29
        int res = -1;
30
        for (auto [val, cnt] : mp) {
31
            if (cnt >= l) res = max(res, val);
32
        }
33
        cout << res << endl;
34
        mp.clear();
35
    }
36
    return 0;
37
}