oj.uz

답안 #1068044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068044 2024-08-21T06:54:21 Z Plurm Archery (IOI09_archery) C++11
14 / 100
 2000 ms 7652 KB 
#include <bits/stdc++.h>
using namespace std;

int n, r;
int t;
void one_round(vector<int> &archers) {
    vector<int> narchers(archers.begin(), archers.end());
    for (int i = 2; i <= n; i++) {
        if (archers[2 * (i - 1)] < archers[2 * (i - 1) + 1]) {
            narchers[2 * (i - 2) + 1] = archers[2 * (i - 1)];
            narchers[2 * (i - 1)] = archers[2 * (i - 1) + 1];
        } else {
            narchers[2 * (i - 2) + 1] = archers[2 * (i - 1) + 1];
            narchers[2 * (i - 1)] = archers[2 * (i - 1)];
        }
    }
    if (archers[0] < archers[1]) {
        narchers[2 * (n - 1) + 1] = archers[1];
        narchers[0] = archers[0];
    } else {
        narchers[2 * (n - 1) + 1] = archers[0];
        narchers[0] = archers[1];
    }
    swap(archers, narchers);
}
void tournament(vector<int> &archers) {
    r %= 2 * (n - 1);
    for (int i = 0; i < r; i++) {
        one_round(archers);
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> r;
    int me;
    cin >> me;
    vector<int> archers;
    for (int i = 2; i <= 2 * n; i++) {
        int x;
        cin >> x;
        archers.push_back(x);
    }
    int ans = -1;
    int mn = 2 * n + 1;
    for (int i = 0; i < 2 * n; i++) {
        vector<int> tmp = archers;
        tmp.insert(tmp.begin() + i, me);
        tournament(tmp);
        int ending = find(tmp.begin(), tmp.end(), me) - tmp.begin();
        if (ending <= mn) {
            mn = ending;
            ans = i / 2 + 1;
        }
    }
    cout << ans << endl;
    return 0;
}

Subtask #1
2.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1168 ms 492 KB Output isn't correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Execution timed out 2037 ms 344 KB Time limit exceeded
5 Incorrect 1 ms 344 KB Output isn't correct
6 Correct 18 ms 344 KB Output is correct

Subtask #2
12.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Incorrect 29 ms 452 KB Output isn't correct
3 Execution timed out 2039 ms 344 KB Time limit exceeded
4 Execution timed out 2033 ms 992 KB Time limit exceeded
5 Execution timed out 2080 ms 6348 KB Time limit exceeded
6 Incorrect 7 ms 348 KB Output isn't correct
7 Incorrect 50 ms 348 KB Output isn't correct
8 Execution timed out 2001 ms 992 KB Time limit exceeded
9 Execution timed out 2062 ms 1248 KB Time limit exceeded
10 Incorrect 1644 ms 480 KB Output isn't correct
11 Execution timed out 2062 ms 1248 KB Time limit exceeded
12 Execution timed out 2085 ms 344 KB Time limit exceeded
13 Execution timed out 2020 ms 5076 KB Time limit exceeded
14 Execution timed out 2037 ms 604 KB Time limit exceeded
15 Execution timed out 2080 ms 1620 KB Time limit exceeded
16 Correct 12 ms 348 KB Output is correct
17 Execution timed out 2059 ms 348 KB Time limit exceeded
18 Execution timed out 2073 ms 348 KB Time limit exceeded
19 Execution timed out 2037 ms 600 KB Time limit exceeded
20 Execution timed out 2037 ms 600 KB Time limit exceeded
21 Execution timed out 2073 ms 1248 KB Time limit exceeded
22 Execution timed out 2052 ms 1532 KB Time limit exceeded
23 Execution timed out 2047 ms 7120 KB Time limit exceeded
24 Correct 9 ms 348 KB Output is correct
25 Execution timed out 2091 ms 348 KB Time limit exceeded
26 Execution timed out 2057 ms 604 KB Time limit exceeded
27 Execution timed out 2016 ms 1244 KB Time limit exceeded
28 Execution timed out 2086 ms 5076 KB Time limit exceeded
29 Execution timed out 2093 ms 344 KB Time limit exceeded
30 Execution timed out 2073 ms 604 KB Time limit exceeded
31 Execution timed out 2029 ms 1244 KB Time limit exceeded
32 Execution timed out 2041 ms 6856 KB Time limit exceeded
33 Correct 25 ms 344 KB Output is correct
34 Correct 16 ms 348 KB Output is correct
35 Execution timed out 2096 ms 348 KB Time limit exceeded
36 Execution timed out 2057 ms 348 KB Time limit exceeded
37 Execution timed out 2029 ms 988 KB Time limit exceeded
38 Execution timed out 2052 ms 1320 KB Time limit exceeded
39 Correct 26 ms 344 KB Output is correct
40 Correct 1809 ms 348 KB Output is correct
41 Incorrect 386 ms 348 KB Output isn't correct
42 Execution timed out 2075 ms 348 KB Time limit exceeded
43 Execution timed out 2075 ms 604 KB Time limit exceeded
44 Execution timed out 2052 ms 856 KB Time limit exceeded
45 Execution timed out 2079 ms 1248 KB Time limit exceeded
46 Execution timed out 2091 ms 1248 KB Time limit exceeded
47 Execution timed out 2062 ms 7652 KB Time limit exceeded