oj.uz

답안 #228733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228733 2020-05-02T12:31:55 Z osaaateiasavtnl Archery (IOI09_archery) C++14
19 / 100
 2000 ms 6620 KB 
#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
int get(vector <int> a, int x, int R) {
    if (a.size() == 2)
        return 0;
    for (int t = 0; t < R; ++t) {
        for (int i = 0; i < a.size(); i += 2) {
            if (a[i] > a[i + 1])
                swap(a[i], a[i + 1]);
        }   
        vector <int> b = a;
        b[1] = a[2];
        for (int i = 4; i < a.size(); i += 2) {
            b[i - 2] = a[i];            
        }   
        b[(int)b.size() - 2] = a[1];

        a = b;
    }    
    for (int i = 0; i < a.size(); ++i)
        if (a[i] == x)
            return i / 2;
}   
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n, R;
    cin >> n >> R;

    R %= 2 * n;

    int my;
    cin >> my;
    vector <int> p(2 * n - 1);
    for (int i = 0; i < 2 * n - 1; ++i)
        cin >> p[i];
    int ans = 1e9;
    int start = -1;
    for (int to = 0; to < 2 * n; ++to) {
        vector <int> t = p;
        t.insert(t.begin() + to, my);
        int nn = get(t, my, R);
        if (nn <= ans) {
            ans = nn;
            start = to / 2;
        }   
    }       

    #ifdef HOME
    cout << "ans : " << ans << endl;
    #endif

    cout << start + 1 << endl;
}

Compilation message

archery.cpp: In function 'int get(std::vector<int>, int, int)':
archery.cpp:16:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < a.size(); i += 2) {
                         ~~^~~~~~~~~~
archery.cpp:22:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 4; i < a.size(); i += 2) {
                         ~~^~~~~~~~~~
archery.cpp:29:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); ++i)
                     ~~^~~~~~~~~~
archery.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
 }   
 ^

Subtask #1
3.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Execution timed out 2075 ms 384 KB Time limit exceeded
3 Correct 26 ms 384 KB Output is correct
4 Execution timed out 2097 ms 384 KB Time limit exceeded
5 Correct 5 ms 384 KB Output is correct
6 Correct 19 ms 384 KB Output is correct

Subtask #2
16.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 45 ms 384 KB Output is correct
3 Execution timed out 2079 ms 400 KB Time limit exceeded
4 Execution timed out 2080 ms 1016 KB Time limit exceeded
5 Execution timed out 2098 ms 5700 KB Time limit exceeded
6 Incorrect 13 ms 384 KB Output isn't correct
7 Incorrect 141 ms 436 KB Output isn't correct
8 Execution timed out 2074 ms 896 KB Time limit exceeded
9 Execution timed out 2017 ms 988 KB Time limit exceeded
10 Correct 1194 ms 424 KB Output is correct
11 Execution timed out 2077 ms 1072 KB Time limit exceeded
12 Execution timed out 2097 ms 384 KB Time limit exceeded
13 Execution timed out 2080 ms 4144 KB Time limit exceeded
14 Execution timed out 2090 ms 712 KB Time limit exceeded
15 Execution timed out 2077 ms 1412 KB Time limit exceeded
16 Correct 30 ms 432 KB Output is correct
17 Execution timed out 2090 ms 384 KB Time limit exceeded
18 Execution timed out 2080 ms 384 KB Time limit exceeded
19 Execution timed out 2076 ms 504 KB Time limit exceeded
20 Execution timed out 2079 ms 680 KB Time limit exceeded
21 Execution timed out 2089 ms 1152 KB Time limit exceeded
22 Execution timed out 2078 ms 1356 KB Time limit exceeded
23 Execution timed out 2081 ms 6008 KB Time limit exceeded
24 Correct 30 ms 384 KB Output is correct
25 Execution timed out 2087 ms 384 KB Time limit exceeded
26 Execution timed out 2091 ms 656 KB Time limit exceeded
27 Execution timed out 2092 ms 1192 KB Time limit exceeded
28 Execution timed out 2085 ms 4376 KB Time limit exceeded
29 Execution timed out 2084 ms 384 KB Time limit exceeded
30 Execution timed out 2090 ms 708 KB Time limit exceeded
31 Execution timed out 2087 ms 1116 KB Time limit exceeded
32 Execution timed out 2090 ms 5792 KB Time limit exceeded
33 Correct 77 ms 384 KB Output is correct
34 Correct 14 ms 384 KB Output is correct
35 Execution timed out 2084 ms 384 KB Time limit exceeded
36 Execution timed out 2085 ms 384 KB Time limit exceeded
37 Execution timed out 2088 ms 936 KB Time limit exceeded
38 Execution timed out 2086 ms 1084 KB Time limit exceeded
39 Correct 61 ms 384 KB Output is correct
40 Execution timed out 2055 ms 512 KB Time limit exceeded
41 Execution timed out 2082 ms 384 KB Time limit exceeded
42 Execution timed out 2084 ms 384 KB Time limit exceeded
43 Execution timed out 2091 ms 680 KB Time limit exceeded
44 Execution timed out 2088 ms 716 KB Time limit exceeded
45 Execution timed out 2085 ms 992 KB Time limit exceeded
46 Execution timed out 2089 ms 1196 KB Time limit exceeded
47 Execution timed out 2078 ms 6620 KB Time limit exceeded