oj.uz

답안 #781033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781033 2023-07-12T16:14:22 Z Sandarach151 Xylophone (JOI18_xylophone) C++17
100 / 100
 101 ms 352 KB 
#include<bits/stdc++.h>
#include "xylophone.h"
using namespace std;
 
 
void solve(int n) {
	// int value = query(1, N);
 
	// for(int i = 1; i <= N; i++) {
	// 	answer(i, i);
	// }
    int arr[n];
    int barr[n];
    int dir[n];
    for(int i=0; i<n-1; i++){
        arr[i]=query(i+1, i+2);
    }
    for(int i=0; i<n-2; i++){
        barr[i]=query(i+1, i+3);
    }
    dir[0]=1;
    for(int i=0; i<n-2; i++){
        if(barr[i]==max(arr[i], arr[i+1])){
            dir[i+1]=-dir[i];
        }
        else{
            dir[i+1]=dir[i];
        }
    }
    int ans[n];
    ans[0]=0;
    for(int i=1; i<n; i++){
        ans[i]=ans[i-1]+arr[i-1]*dir[i-1];
    }
    int minn = 1000000;
    for(int i=0; i<n; i++){
        minn = min(minn, ans[i]);
    }
    for(int i=0; i<n; i++){
        ans[i]+=1-minn;
    }
    bool res = false;
    for(int i=0; i<n; i++){
        if(ans[i]==n){
            res = true;
            break;
        }
        else if(ans[i]==1){
            break;
        }
    }
    if(res==true){
        for(int i=0; i<n; i++){
            ans[i] = n+1-ans[i];
        }
    }
    for(int i=0; i<n; i++){
        answer(i+1, ans[i]);
    }
    return;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 14 ms 288 KB Output is correct
19 Correct 16 ms 288 KB Output is correct
20 Correct 18 ms 292 KB Output is correct
21 Correct 18 ms 292 KB Output is correct
22 Correct 17 ms 288 KB Output is correct
23 Correct 15 ms 292 KB Output is correct
24 Correct 18 ms 300 KB Output is correct
25 Correct 16 ms 208 KB Output is correct
26 Correct 21 ms 208 KB Output is correct
27 Correct 17 ms 208 KB Output is correct
28 Correct 10 ms 308 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 11 ms 208 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 14 ms 288 KB Output is correct
19 Correct 16 ms 288 KB Output is correct
20 Correct 18 ms 292 KB Output is correct
21 Correct 18 ms 292 KB Output is correct
22 Correct 17 ms 288 KB Output is correct
23 Correct 15 ms 292 KB Output is correct
24 Correct 18 ms 300 KB Output is correct
25 Correct 16 ms 208 KB Output is correct
26 Correct 21 ms 208 KB Output is correct
27 Correct 17 ms 208 KB Output is correct
28 Correct 10 ms 308 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 11 ms 208 KB Output is correct
31 Correct 16 ms 304 KB Output is correct
32 Correct 44 ms 312 KB Output is correct
33 Correct 50 ms 340 KB Output is correct
34 Correct 81 ms 336 KB Output is correct
35 Correct 101 ms 340 KB Output is correct
36 Correct 64 ms 348 KB Output is correct
37 Correct 59 ms 340 KB Output is correct
38 Correct 86 ms 336 KB Output is correct
39 Correct 70 ms 336 KB Output is correct
40 Correct 40 ms 348 KB Output is correct
41 Correct 84 ms 344 KB Output is correct
42 Correct 60 ms 336 KB Output is correct
43 Correct 93 ms 336 KB Output is correct
44 Correct 82 ms 336 KB Output is correct
45 Correct 69 ms 348 KB Output is correct
46 Correct 85 ms 340 KB Output is correct
47 Correct 85 ms 336 KB Output is correct
48 Correct 52 ms 336 KB Output is correct
49 Correct 65 ms 344 KB Output is correct
50 Correct 89 ms 340 KB Output is correct
51 Correct 92 ms 352 KB Output is correct
52 Correct 41 ms 336 KB Output is correct
53 Correct 86 ms 336 KB Output is correct
54 Correct 62 ms 336 KB Output is correct
55 Correct 75 ms 336 KB Output is correct
56 Correct 83 ms 336 KB Output is correct
57 Correct 90 ms 352 KB Output is correct
58 Correct 62 ms 348 KB Output is correct
59 Correct 88 ms 336 KB Output is correct
60 Correct 81 ms 336 KB Output is correct