Submission #228732

# Submission time Handle Problem Language Result Execution time Memory
228732 2020-05-02T12:31:07 Z osaaateiasavtnl Archery (IOI09_archery) C++14
19 / 100
2000 ms 12864 KB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#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 = 1e10;
    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 'long long int get(std::vector<long long int>, long long int, long long int)':
archery.cpp:17:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < a.size(); i += 2) {
                         ~~^~~~~~~~~~
archery.cpp:23:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 4; i < a.size(); i += 2) {
                         ~~^~~~~~~~~~
archery.cpp:30:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); ++i)
                     ~~^~~~~~~~~~
archery.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
 }   
 ^
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Execution timed out 2082 ms 512 KB Time limit exceeded
3 Correct 16 ms 384 KB Output is correct
4 Execution timed out 2084 ms 776 KB Time limit exceeded
5 Correct 5 ms 384 KB Output is correct
6 Correct 26 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 42 ms 384 KB Output is correct
3 Execution timed out 2069 ms 512 KB Time limit exceeded
4 Execution timed out 2073 ms 1668 KB Time limit exceeded
5 Execution timed out 2085 ms 11024 KB Time limit exceeded
6 Incorrect 9 ms 384 KB Output isn't correct
7 Incorrect 128 ms 384 KB Output isn't correct
8 Execution timed out 2098 ms 1600 KB Time limit exceeded
9 Execution timed out 2069 ms 1720 KB Time limit exceeded
10 Correct 1379 ms 504 KB Output is correct
11 Execution timed out 2090 ms 1712 KB Time limit exceeded
12 Execution timed out 2086 ms 672 KB Time limit exceeded
13 Execution timed out 2094 ms 8044 KB Time limit exceeded
14 Execution timed out 2082 ms 948 KB Time limit exceeded
15 Execution timed out 2088 ms 2312 KB Time limit exceeded
16 Correct 35 ms 384 KB Output is correct
17 Execution timed out 2084 ms 384 KB Time limit exceeded
18 Execution timed out 2064 ms 752 KB Time limit exceeded
19 Execution timed out 2091 ms 980 KB Time limit exceeded
20 Execution timed out 2076 ms 904 KB Time limit exceeded
21 Execution timed out 2077 ms 2128 KB Time limit exceeded
22 Execution timed out 2092 ms 2668 KB Time limit exceeded
23 Execution timed out 2068 ms 11768 KB Time limit exceeded
24 Correct 35 ms 384 KB Output is correct
25 Execution timed out 2085 ms 384 KB Time limit exceeded
26 Execution timed out 2074 ms 836 KB Time limit exceeded
27 Execution timed out 2095 ms 2056 KB Time limit exceeded
28 Execution timed out 2085 ms 8244 KB Time limit exceeded
29 Execution timed out 2089 ms 512 KB Time limit exceeded
30 Execution timed out 2092 ms 816 KB Time limit exceeded
31 Execution timed out 2086 ms 1604 KB Time limit exceeded
32 Execution timed out 2091 ms 11336 KB Time limit exceeded
33 Correct 119 ms 428 KB Output is correct
34 Correct 29 ms 384 KB Output is correct
35 Execution timed out 2090 ms 756 KB Time limit exceeded
36 Execution timed out 2097 ms 612 KB Time limit exceeded
37 Execution timed out 2077 ms 1396 KB Time limit exceeded
38 Execution timed out 2075 ms 1912 KB Time limit exceeded
39 Correct 70 ms 384 KB Output is correct
40 Execution timed out 2088 ms 384 KB Time limit exceeded
41 Execution timed out 2079 ms 940 KB Time limit exceeded
42 Execution timed out 2087 ms 676 KB Time limit exceeded
43 Execution timed out 2086 ms 968 KB Time limit exceeded
44 Execution timed out 2083 ms 1228 KB Time limit exceeded
45 Execution timed out 2086 ms 1604 KB Time limit exceeded
46 Execution timed out 2090 ms 2128 KB Time limit exceeded
47 Execution timed out 2090 ms 12864 KB Time limit exceeded