oj.uz

Submission #228757

# Submission time Handle Problem Language Result Execution time Memory
228757 2020-05-02T13:22:11 Z osaaateiasavtnl Archery (IOI09_archery) C++14
27 / 100
 2000 ms 8156 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
void print(vector <int> a) {
    cout << "cur:" << endl;
    for (int i = 0; i < a.size(); i += 2)
        cout << a[i] << ' ';
    cout << endl;
    for (int i = 1; i < a.size(); i += 2)
        cout << a[i] << ' ';
    cout << endl;
}   
int get(vector <int> a, int x, int R) {
    //cout << "GET:"<< endl;
 
    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]);
        }   
 
        //print(a);
 
        if (a[0] == 0) {
            bool all2 = 1;
            for (int i = 1; i < 2 * n; i += 2)
                all2 &= a[i] == 2;
            if (all2) {
                //cerr << "all2" << endl;

                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;
                    }
            }            
        }   
 
        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;
    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);
 
    for (int i = 0; i < 2 * n; ++i) {
        vector <int> t = p;
        t.insert(t.begin() + i, my);
        nd[i] = get(t, my, R);
    }       
    for (int i = 0; i < 2 * n; ++i) {
        if (nd[i] <= ans) {
            ans = nd[i];
            start = i / 2;
        }   
    }   
 
    /*    
    for (int i = 0; i < 2 * n; ++i)
        cout << nd[i] << ' ';
    cout << endl;
    */
 
    #ifdef HOME
    cout << "ans : " << ans << endl;
    #endif
 
    cout << start + 1 << endl;
}

Compilation message

archery.cpp: In function 'void print(std::vector<int>)':
archery.cpp:14:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); i += 2)
                     ~~^~~~~~~~~~
archery.cpp:17:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < a.size(); i += 2)
                     ~~^~~~~~~~~~
archery.cpp: In function 'int get(std::vector<int>, int, int)':
archery.cpp:30:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < a.size(); i += 2) {
                         ~~^~~~~~~~~~
archery.cpp:45:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int i = 0; i < a.size(); ++i)
                                 ~~^~~~~~~~~~
archery.cpp:56: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
5.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Execution timed out 2078 ms 384 KB Time limit exceeded
3 Correct 23 ms 384 KB Output is correct
4 Correct 1069 ms 504 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 111 ms 384 KB Output is correct

Subtask #2
22.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 1771 ms 444 KB Output is correct
4 Execution timed out 2081 ms 1160 KB Time limit exceeded
5 Execution timed out 2089 ms 6980 KB Time limit exceeded
6 Correct 47 ms 384 KB Output is correct
7 Correct 1181 ms 504 KB Output is correct
8 Execution timed out 2082 ms 1512 KB Time limit exceeded
9 Execution timed out 2074 ms 1292 KB Time limit exceeded
10 Correct 985 ms 384 KB Output is correct
11 Execution timed out 2071 ms 1588 KB Time limit exceeded
12 Execution timed out 2078 ms 384 KB Time limit exceeded
13 Execution timed out 2073 ms 5168 KB Time limit exceeded
14 Execution timed out 2086 ms 736 KB Time limit exceeded
15 Execution timed out 2072 ms 1696 KB Time limit exceeded
16 Correct 26 ms 384 KB Output is correct
17 Execution timed out 2085 ms 384 KB Time limit exceeded
18 Execution timed out 2081 ms 384 KB Time limit exceeded
19 Execution timed out 2088 ms 512 KB Time limit exceeded
20 Execution timed out 2076 ms 856 KB Time limit exceeded
21 Execution timed out 2086 ms 1240 KB Time limit exceeded
22 Execution timed out 2076 ms 1736 KB Time limit exceeded
23 Execution timed out 2079 ms 7416 KB Time limit exceeded
24 Correct 128 ms 384 KB Output is correct
25 Execution timed out 2080 ms 384 KB Time limit exceeded
26 Execution timed out 2089 ms 688 KB Time limit exceeded
27 Execution timed out 2088 ms 1112 KB Time limit exceeded
28 Execution timed out 2086 ms 5268 KB Time limit exceeded
29 Execution timed out 2086 ms 384 KB Time limit exceeded
30 Execution timed out 2089 ms 892 KB Time limit exceeded
31 Execution timed out 2077 ms 1120 KB Time limit exceeded
32 Execution timed out 2088 ms 7200 KB Time limit exceeded
33 Correct 136 ms 384 KB Output is correct
34 Correct 118 ms 384 KB Output is correct
35 Execution timed out 2071 ms 504 KB Time limit exceeded
36 Execution timed out 2083 ms 512 KB Time limit exceeded
37 Execution timed out 2073 ms 1016 KB Time limit exceeded
38 Execution timed out 2067 ms 1340 KB Time limit exceeded
39 Correct 122 ms 384 KB Output is correct
40 Execution timed out 2072 ms 384 KB Time limit exceeded
41 Execution timed out 2083 ms 384 KB Time limit exceeded
42 Execution timed out 2077 ms 504 KB Time limit exceeded
43 Execution timed out 2080 ms 764 KB Time limit exceeded
44 Execution timed out 2083 ms 872 KB Time limit exceeded
45 Execution timed out 2082 ms 1120 KB Time limit exceeded
46 Execution timed out 2085 ms 1236 KB Time limit exceeded
47 Execution timed out 2083 ms 8156 KB Time limit exceeded