oj.uz

답안 #228730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228730 2020-05-02T12:28:23 Z osaaateiasavtnl Archery (IOI09_archery) C++14
18 / 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 %= 60 * 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;
        }   
    }       
    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]
 }   
 ^

Subtask #1
4.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Execution timed out 2075 ms 512 KB Time limit exceeded
3 Correct 287 ms 504 KB Output is correct
4 Execution timed out 2079 ms 672 KB Time limit exceeded
5 Correct 6 ms 384 KB Output is correct
6 Correct 1488 ms 396 KB Output is correct

Subtask #2
14.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 1053 ms 480 KB Output is correct
3 Execution timed out 2086 ms 384 KB Time limit exceeded
4 Execution timed out 2080 ms 1532 KB Time limit exceeded
5 Execution timed out 2087 ms 11024 KB Time limit exceeded
6 Correct 1016 ms 504 KB Output is correct
7 Execution timed out 2077 ms 384 KB Time limit exceeded
8 Execution timed out 2084 ms 1296 KB Time limit exceeded
9 Execution timed out 2085 ms 1592 KB Time limit exceeded
10 Execution timed out 2070 ms 504 KB Time limit exceeded
11 Execution timed out 2094 ms 1712 KB Time limit exceeded
12 Execution timed out 2086 ms 852 KB Time limit exceeded
13 Execution timed out 2078 ms 8044 KB Time limit exceeded
14 Execution timed out 2087 ms 860 KB Time limit exceeded
15 Execution timed out 2083 ms 2312 KB Time limit exceeded
16 Correct 213 ms 384 KB Output is correct
17 Execution timed out 2089 ms 384 KB Time limit exceeded
18 Execution timed out 2092 ms 852 KB Time limit exceeded
19 Execution timed out 2089 ms 832 KB Time limit exceeded
20 Execution timed out 2091 ms 640 KB Time limit exceeded
21 Execution timed out 2093 ms 1716 KB Time limit exceeded
22 Execution timed out 2089 ms 2212 KB Time limit exceeded
23 Execution timed out 2080 ms 11640 KB Time limit exceeded
24 Correct 123 ms 360 KB Output is correct
25 Execution timed out 2088 ms 384 KB Time limit exceeded
26 Execution timed out 2088 ms 740 KB Time limit exceeded
27 Execution timed out 2088 ms 1716 KB Time limit exceeded
28 Execution timed out 2064 ms 8244 KB Time limit exceeded
29 Execution timed out 2098 ms 508 KB Time limit exceeded
30 Execution timed out 2096 ms 732 KB Time limit exceeded
31 Execution timed out 2094 ms 1604 KB Time limit exceeded
32 Execution timed out 2090 ms 11336 KB Time limit exceeded
33 Correct 181 ms 384 KB Output is correct
34 Execution timed out 2092 ms 384 KB Time limit exceeded
35 Execution timed out 2095 ms 744 KB Time limit exceeded
36 Execution timed out 2093 ms 732 KB Time limit exceeded
37 Execution timed out 2083 ms 1396 KB Time limit exceeded
38 Execution timed out 2091 ms 1912 KB Time limit exceeded
39 Correct 67 ms 384 KB Output is correct
40 Execution timed out 2088 ms 384 KB Time limit exceeded
41 Execution timed out 2094 ms 580 KB Time limit exceeded
42 Execution timed out 2082 ms 700 KB Time limit exceeded
43 Execution timed out 2084 ms 868 KB Time limit exceeded
44 Execution timed out 2080 ms 992 KB Time limit exceeded
45 Execution timed out 2090 ms 1604 KB Time limit exceeded
46 Execution timed out 2099 ms 1704 KB Time limit exceeded
47 Execution timed out 2096 ms 12864 KB Time limit exceeded