oj.uz

Submission #271840

# Submission time Handle Problem Language Result Execution time Memory
271840 2020-08-18T07:42:21 Z 반딧불(#5113) Archery (IOI09_archery) C++17
21 / 100
 2000 ms 3448 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;

int n, k, val;
int arr[400005];
int ans, finish = 1e9;

int tryIfAble(){
    vector<int> v(arr+1, arr+2*n+1);
    int cnt = 2*n;
    while(cnt--){
        for(int i=0; i<n; i++){
            if(i==0 && v[i*2] > v[i*2+1]) swap(v[i*2], v[i*2+1]);
            else if(i && v[i*2] < v[i*2+1]) swap(v[i*2], v[i*2+1]);
        }
        int tmp = v[1];
        for(int i=0; i<n-1; i++) v[i*2+1] = v[i*2+3];
        v.back()=tmp;
    }

    int idx = -1;
    for(int i=0; i<2*n; i++) if(v[i] == val) idx = i;
    if(idx%2==0) return idx/2+1;
    idx /= 2, idx += (n-k), idx %= n, idx++;
    return idx;
}

int main(){
    scanf("%d %d %d", &n, &k, &val);
    if(val == 1){
        printf("%d", n);
        return 0;
    }

    k%=n;
    arr[1] = val;
    for(int i=2; i<=2*n; i++) scanf("%d", &arr[i]);

    for(int i=1; i<=2*n; i+=2){
        int tmp = tryIfAble();
        if(finish >= tmp) finish = tmp, ans = (i+1)/2;

        swap(arr[i], arr[i+1]);
        swap(arr[i+1], arr[i+2]);
    }
    printf("%d\n", ans);
}

Compilation message

archery.cpp: In function 'int main()':
archery.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |     scanf("%d %d %d", &n, &k, &val);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
archery.cpp:43:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   43 |     for(int i=2; i<=2*n; i++) scanf("%d", &arr[i]);
      |                               ~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Execution timed out 2087 ms 384 KB Time limit exceeded
5 Correct 0 ms 256 KB Output is correct
6 Correct 28 ms 368 KB Output is correct

Subtask #2
16.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 36 ms 256 KB Output is correct
3 Execution timed out 2057 ms 384 KB Time limit exceeded
4 Execution timed out 2078 ms 512 KB Time limit exceeded
5 Execution timed out 2087 ms 2940 KB Time limit exceeded
6 Correct 30 ms 256 KB Output is correct
7 Execution timed out 2090 ms 384 KB Time limit exceeded
8 Execution timed out 2087 ms 608 KB Time limit exceeded
9 Execution timed out 2088 ms 692 KB Time limit exceeded
10 Execution timed out 2090 ms 384 KB Time limit exceeded
11 Execution timed out 2090 ms 672 KB Time limit exceeded
12 Execution timed out 2076 ms 384 KB Time limit exceeded
13 Execution timed out 2060 ms 2296 KB Time limit exceeded
14 Execution timed out 2086 ms 384 KB Time limit exceeded
15 Execution timed out 2088 ms 896 KB Time limit exceeded
16 Correct 33 ms 256 KB Output is correct
17 Execution timed out 2062 ms 384 KB Time limit exceeded
18 Execution timed out 2068 ms 384 KB Time limit exceeded
19 Execution timed out 2076 ms 384 KB Time limit exceeded
20 Execution timed out 2080 ms 384 KB Time limit exceeded
21 Execution timed out 2059 ms 676 KB Time limit exceeded
22 Execution timed out 2090 ms 836 KB Time limit exceeded
23 Execution timed out 2084 ms 3064 KB Time limit exceeded
24 Correct 34 ms 256 KB Output is correct
25 Execution timed out 2083 ms 384 KB Time limit exceeded
26 Execution timed out 2080 ms 384 KB Time limit exceeded
27 Execution timed out 2092 ms 668 KB Time limit exceeded
28 Execution timed out 2099 ms 2296 KB Time limit exceeded
29 Execution timed out 2039 ms 416 KB Time limit exceeded
30 Execution timed out 2071 ms 384 KB Time limit exceeded
31 Execution timed out 2068 ms 660 KB Time limit exceeded
32 Execution timed out 2069 ms 3064 KB Time limit exceeded
33 Correct 32 ms 256 KB Output is correct
34 Correct 30 ms 256 KB Output is correct
35 Execution timed out 2083 ms 384 KB Time limit exceeded
36 Execution timed out 2063 ms 384 KB Time limit exceeded
37 Execution timed out 2039 ms 640 KB Time limit exceeded
38 Execution timed out 2075 ms 768 KB Time limit exceeded
39 Correct 27 ms 376 KB Output is correct
40 Execution timed out 2085 ms 256 KB Time limit exceeded
41 Execution timed out 2086 ms 384 KB Time limit exceeded
42 Execution timed out 2088 ms 384 KB Time limit exceeded
43 Execution timed out 2074 ms 384 KB Time limit exceeded
44 Execution timed out 2047 ms 512 KB Time limit exceeded
45 Execution timed out 2081 ms 656 KB Time limit exceeded
46 Execution timed out 2088 ms 760 KB Time limit exceeded
47 Execution timed out 2041 ms 3448 KB Time limit exceeded