oj.uz

Submission #575897

# Submission time Handle Problem Language Result Execution time Memory
575897 2022-06-11T14:17:27 Z eecs Tenis (COCI20_tenis) C++17
50 / 110
 1000 ms 2048 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 100010;
int n, p[3][maxn], q[3][maxn], ans[maxn];
long long cnt[3];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n;
    for (int i = 0; i < 3; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> p[i][j], q[i][p[i][j]] = j;
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            array<int, 3> res{INT_MAX, 0, 0};
            for (int k = 0; k < 3; k++) {
                int x = q[k][i], y = q[k][j];
                res = min(res, array<int, 3>{min(x, y), max(x, y), k});
            }
            (q[res[2]][i] < q[res[2]][j] ? ans[i] : ans[j])++, cnt[res[2]]++;
        }
    }
    cout << cnt[0] << " " << cnt[1] << " " << cnt[2] << "\n";
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << " ";
    }
    return 0;
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 117 ms 468 KB Output is correct

Subtask #3
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 117 ms 468 KB Output is correct
5 Execution timed out 1080 ms 2048 KB Time limit exceeded
6 Halted 0 ms 0 KB -