oj.uz

Submission #228787

# Submission time Handle Problem Language Result Execution time Memory
228787 2020-05-02T14:49:21 Z osaaateiasavtnl Archery (IOI09_archery) C++14
36 / 100
 2000 ms 8200 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; 
    int n = a.size() / 2;             
    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]);
        }   
        if (a[0] == 0) {
            bool all2 = 1;
            for (int i = 1; i < 2 * n; i += 2) {
                if (a[i] != 2) {
                    all2 = 0;
                    break;
                }   
            }   
            if (all2) {
                int r = R - t;
                for (int i = 0; i < a.size(); ++i)
                    if (a[i] == x) {
                        int ans = i / 2;
                        ans -= r;
                        return (ans % n + n) % n;
                    }
            }            
            if (a[1] == 0 && a[0] != x && a[1] != x) {
                bool all0 = 1;
                for (int i = 0; i < 2 * n; i += 2) {
                    if (a[i]) {
                        all0 = 0;
                        break;
                    }   
                }   
                if (all0) {
                    for (int i = 0; i < a.size(); ++i) {
                        if (a[i] == x) {
                            return i / 2;
                        }   
                    }   
                }                
            }                 
        }    
        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 %= n;
    R += 2 * n;
 
    int my;
    cin >> my;

    if (my == 1) {
        cout << n << endl;
        exit(0);
    }   

    vector <int> p(2 * n - 1);
    for (int i = 0; i < 2 * n - 1; ++i) {
        cin >> p[i];
        if (p[i] < my)
            p[i] = 0;
        else
            p[i] = 2;
    }            
    my = 1;

    int ans = 1e9;
    int start = -1;
 
    vector <int> nd(2 * n, -1);
    for (int i = 0; i < 2 * n; i += 2) {
        if (nd[i] == -1) {
            vector <int> t = p;
            t.insert(t.begin() + i, my);
            nd[i] = get(t, my, R);
        }   
        if (i && nd[i] > nd[i - 2])
            break;
        if (nd[i] < ans || (nd[i] == ans && i / 2 > start)) {
            ans = nd[i];
            start = i / 2;
        }   
    }   
    for (int i = 2 * n - 1; i >= 0; i -= 2) {
        if (nd[i] == -1) {
            vector <int> t = p;
            t.insert(t.begin() + i, my);
            nd[i] = get(t, my, R);
        }   
        if (i + 2 < 2 * n && nd[i] > nd[i + 2])
            break;
        if (nd[i] < ans || (nd[i] == ans && i / 2 > start)) {
            ans = nd[i];
            start = i / 2;
        }   
    }   
    cout << start + 1 << endl;
}

Compilation message

archery.cpp: In function 'int get(std::vector<int>, int, 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:31:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int i = 0; i < a.size(); ++i)
                                 ~~^~~~~~~~~~
archery.cpp:47:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for (int i = 0; i < a.size(); ++i) {
                                     ~~^~~~~~~~~~
archery.cpp:57:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 4; i < a.size(); i += 2) {
                         ~~^~~~~~~~~~
archery.cpp:63:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); ++i)
                     ~~^~~~~~~~~~
archery.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
 }   
 ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 368 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 212 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct

Subtask #2
30.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 320 ms 384 KB Output is correct
4 Execution timed out 2089 ms 1016 KB Time limit exceeded
5 Execution timed out 2081 ms 6980 KB Time limit exceeded
6 Correct 15 ms 384 KB Output is correct
7 Correct 712 ms 424 KB Output is correct
8 Execution timed out 2074 ms 1276 KB Time limit exceeded
9 Execution timed out 2070 ms 1240 KB Time limit exceeded
10 Correct 637 ms 384 KB Output is correct
11 Execution timed out 2082 ms 1372 KB Time limit exceeded
12 Execution timed out 2087 ms 384 KB Time limit exceeded
13 Execution timed out 2090 ms 5168 KB Time limit exceeded
14 Correct 318 ms 644 KB Output is correct
15 Execution timed out 2086 ms 1660 KB Time limit exceeded
16 Correct 18 ms 384 KB Output is correct
17 Correct 673 ms 436 KB Output is correct
18 Execution timed out 2090 ms 384 KB Time limit exceeded
19 Execution timed out 2065 ms 512 KB Time limit exceeded
20 Execution timed out 2088 ms 800 KB Time limit exceeded
21 Execution timed out 2086 ms 1360 KB Time limit exceeded
22 Execution timed out 2074 ms 1728 KB Time limit exceeded
23 Execution timed out 2083 ms 7416 KB Time limit exceeded
24 Correct 22 ms 384 KB Output is correct
25 Correct 1955 ms 424 KB Output is correct
26 Execution timed out 2085 ms 820 KB Time limit exceeded
27 Execution timed out 2096 ms 1360 KB Time limit exceeded
28 Execution timed out 2086 ms 5268 KB Time limit exceeded
29 Execution timed out 2082 ms 384 KB Time limit exceeded
30 Execution timed out 2094 ms 612 KB Time limit exceeded
31 Execution timed out 2083 ms 1136 KB Time limit exceeded
32 Execution timed out 2085 ms 7200 KB Time limit exceeded
33 Correct 19 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Execution timed out 2088 ms 384 KB Time limit exceeded
36 Execution timed out 2083 ms 512 KB Time limit exceeded
37 Execution timed out 2088 ms 1384 KB Time limit exceeded
38 Execution timed out 2081 ms 1460 KB Time limit exceeded
39 Correct 22 ms 384 KB Output is correct
40 Correct 1977 ms 428 KB Output is correct
41 Execution timed out 2080 ms 384 KB Time limit exceeded
42 Execution timed out 2083 ms 512 KB Time limit exceeded
43 Execution timed out 2083 ms 800 KB Time limit exceeded
44 Execution timed out 2085 ms 1060 KB Time limit exceeded
45 Execution timed out 2062 ms 1292 KB Time limit exceeded
46 Execution timed out 2076 ms 1396 KB Time limit exceeded
47 Execution timed out 2085 ms 8200 KB Time limit exceeded