oj.uz

답안 #271742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
271742 2020-08-18T07:24:48 Z 반딧불(#5113) Archery (IOI09_archery) C++17
18 / 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);
    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:37:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |     for(int i=2; i<=2*n; i++) scanf("%d", &arr[i]);
      |                               ~~~~~^~~~~~~~~~~~~~~

Subtask #1
4.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Execution timed out 2070 ms 384 KB Time limit exceeded
3 Correct 6 ms 256 KB Output is correct
4 Execution timed out 2040 ms 384 KB Time limit exceeded
5 Correct 1 ms 256 KB Output is correct
6 Correct 28 ms 256 KB Output is correct

Subtask #2
14.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Correct 30 ms 256 KB Output is correct
3 Execution timed out 2013 ms 384 KB Time limit exceeded
4 Execution timed out 2045 ms 608 KB Time limit exceeded
5 Execution timed out 2077 ms 2936 KB Time limit exceeded
6 Correct 29 ms 256 KB Output is correct
7 Execution timed out 2032 ms 256 KB Time limit exceeded
8 Execution timed out 2086 ms 600 KB Time limit exceeded
9 Execution timed out 2004 ms 676 KB Time limit exceeded
10 Execution timed out 2048 ms 384 KB Time limit exceeded
11 Execution timed out 2068 ms 668 KB Time limit exceeded
12 Execution timed out 2092 ms 384 KB Time limit exceeded
13 Execution timed out 2083 ms 2296 KB Time limit exceeded
14 Execution timed out 2044 ms 384 KB Time limit exceeded
15 Execution timed out 2036 ms 808 KB Time limit exceeded
16 Correct 35 ms 368 KB Output is correct
17 Execution timed out 2073 ms 384 KB Time limit exceeded
18 Execution timed out 2048 ms 384 KB Time limit exceeded
19 Execution timed out 2090 ms 384 KB Time limit exceeded
20 Execution timed out 2073 ms 384 KB Time limit exceeded
21 Execution timed out 2065 ms 676 KB Time limit exceeded
22 Execution timed out 2079 ms 768 KB Time limit exceeded
23 Execution timed out 2068 ms 3192 KB Time limit exceeded
24 Correct 30 ms 384 KB Output is correct
25 Execution timed out 2081 ms 256 KB Time limit exceeded
26 Execution timed out 2071 ms 384 KB Time limit exceeded
27 Execution timed out 2087 ms 752 KB Time limit exceeded
28 Execution timed out 2057 ms 2304 KB Time limit exceeded
29 Execution timed out 2029 ms 384 KB Time limit exceeded
30 Execution timed out 2085 ms 384 KB Time limit exceeded
31 Execution timed out 2083 ms 740 KB Time limit exceeded
32 Execution timed out 2045 ms 3064 KB Time limit exceeded
33 Correct 31 ms 256 KB Output is correct
34 Correct 38 ms 256 KB Output is correct
35 Execution timed out 2021 ms 384 KB Time limit exceeded
36 Execution timed out 2086 ms 384 KB Time limit exceeded
37 Execution timed out 2069 ms 780 KB Time limit exceeded
38 Execution timed out 2071 ms 768 KB Time limit exceeded
39 Correct 26 ms 256 KB Output is correct
40 Execution timed out 2037 ms 256 KB Time limit exceeded
41 Execution timed out 2073 ms 384 KB Time limit exceeded
42 Execution timed out 2089 ms 384 KB Time limit exceeded
43 Execution timed out 2066 ms 384 KB Time limit exceeded
44 Execution timed out 2076 ms 512 KB Time limit exceeded
45 Execution timed out 2084 ms 660 KB Time limit exceeded
46 Execution timed out 2055 ms 692 KB Time limit exceeded
47 Execution timed out 2071 ms 3448 KB Time limit exceeded