답안 #1068069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068069 2024-08-21T07:06:03 Z Plurm Archery (IOI09_archery) C++11
14 / 100
2000 ms 5064 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) {
    for (int i = 0; i < r; i++) {
        one_round(archers);
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> r;
    r = min(r, 3 * n);
    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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 2094 ms 348 KB Time limit exceeded
3 Correct 7 ms 348 KB Output is correct
4 Execution timed out 2097 ms 348 KB Time limit exceeded
5 Correct 1 ms 344 KB Output is correct
6 Correct 68 ms 432 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 344 KB Output isn't correct
2 Incorrect 45 ms 344 KB Output isn't correct
3 Execution timed out 2048 ms 348 KB Time limit exceeded
4 Execution timed out 2048 ms 992 KB Time limit exceeded
5 Execution timed out 2076 ms 4564 KB Time limit exceeded
6 Correct 84 ms 348 KB Output is correct
7 Execution timed out 2072 ms 348 KB Time limit exceeded
8 Execution timed out 2061 ms 740 KB Time limit exceeded
9 Execution timed out 2063 ms 992 KB Time limit exceeded
10 Execution timed out 2087 ms 348 KB Time limit exceeded
11 Execution timed out 2071 ms 992 KB Time limit exceeded
12 Execution timed out 2067 ms 348 KB Time limit exceeded
13 Execution timed out 2061 ms 3344 KB Time limit exceeded
14 Execution timed out 2058 ms 604 KB Time limit exceeded
15 Execution timed out 2039 ms 1244 KB Time limit exceeded
16 Incorrect 45 ms 344 KB Output isn't correct
17 Execution timed out 2029 ms 344 KB Time limit exceeded
18 Execution timed out 2066 ms 348 KB Time limit exceeded
19 Execution timed out 2037 ms 344 KB Time limit exceeded
20 Execution timed out 2045 ms 344 KB Time limit exceeded
21 Execution timed out 2088 ms 992 KB Time limit exceeded
22 Execution timed out 2047 ms 1244 KB Time limit exceeded
23 Execution timed out 2033 ms 4816 KB Time limit exceeded
24 Correct 39 ms 344 KB Output is correct
25 Execution timed out 2069 ms 348 KB Time limit exceeded
26 Execution timed out 2045 ms 604 KB Time limit exceeded
27 Execution timed out 2074 ms 992 KB Time limit exceeded
28 Execution timed out 2065 ms 3544 KB Time limit exceeded
29 Execution timed out 2047 ms 344 KB Time limit exceeded
30 Execution timed out 2039 ms 600 KB Time limit exceeded
31 Execution timed out 2077 ms 992 KB Time limit exceeded
32 Execution timed out 2068 ms 4556 KB Time limit exceeded
33 Correct 47 ms 344 KB Output is correct
34 Correct 45 ms 348 KB Output is correct
35 Execution timed out 2047 ms 344 KB Time limit exceeded
36 Execution timed out 2071 ms 348 KB Time limit exceeded
37 Execution timed out 2051 ms 992 KB Time limit exceeded
38 Execution timed out 2069 ms 1048 KB Time limit exceeded
39 Correct 40 ms 348 KB Output is correct
40 Execution timed out 2062 ms 348 KB Time limit exceeded
41 Execution timed out 2083 ms 344 KB Time limit exceeded
42 Execution timed out 2029 ms 344 KB Time limit exceeded
43 Execution timed out 2033 ms 600 KB Time limit exceeded
44 Execution timed out 2048 ms 604 KB Time limit exceeded
45 Execution timed out 2028 ms 988 KB Time limit exceeded
46 Execution timed out 2069 ms 992 KB Time limit exceeded
47 Execution timed out 2057 ms 5064 KB Time limit exceeded