oj.uz

답안 #763058

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
763058 2023-06-22T02:53:37 Z huutuan Xylophone (JOI18_xylophone) C++14
100 / 100
 104 ms 440 KB 
#include<bits/stdc++.h>
#include "xylophone.h"

using namespace std;

int a[5001], b[5001], ans1[5001], ans2[5001];

void sus(int N, int last, int* ans){
    if (last) ans[1]=1, ans[2]=1-a[1];
    else ans[1]=1, ans[2]=1+a[1];
    for (int i=1; i+2<=N; ++i){
        int v1=a[i], v2=a[i+1], v3=b[i];
        if (v1==v3){
            if (ans[i]<ans[i+1]) ans[i+2]=ans[i+1]-v2;
            else ans[i+2]=ans[i+1]+v2;
        }else{
            if (ans[i]<ans[i+1]){
                if (v2==v3) ans[i+2]=ans[i+1]-v2;
                else ans[i+2]=ans[i+1]+v2;
            }else{
                if (v2==v3) ans[i+2]=ans[i+1]+v2;
                else ans[i+2]=ans[i+1]-v2;
            }
        }
    }
    int m=*min_element(ans+1, ans+N+1);
    for (int i=1; i<=N; ++i) ans[i]-=m-1;
}

int pos[5001];

bool check(int N, int* ans){
    memset(pos, 0, sizeof pos);
    for (int i=1; i<=N; ++i){
        if (ans[i]<1 || ans[i]>N) return 0;
        pos[ans[i]]=i;
    }
    if (*min_element(pos+1, pos+N+1)==0) return 0;
    return pos[1]<pos[N];
}

void lmao(int N, int* ans){
    for (int i=1; i<=N; ++i) answer(i, ans[i]);
}

void solve(int N){
    for (int i=1; i<N; ++i) a[i]=query(i, i+1);
    for (int i=1; i<N-1; ++i) b[i]=query(i, i+2);
    sus(N, 0, ans1);
    sus(N, 1, ans2);
    if (check(N, ans1)) lmao(N, ans1);
    else{
        assert(check(N, ans2));
        lmao(N, ans2);
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 ms 312 KB Output is correct
12 Correct 3 ms 320 KB Output is correct
13 Correct 2 ms 312 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 2 ms 336 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 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 ms 312 KB Output is correct
12 Correct 3 ms 320 KB Output is correct
13 Correct 2 ms 312 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 4 ms 320 KB Output is correct
17 Correct 9 ms 316 KB Output is correct
18 Correct 14 ms 308 KB Output is correct
19 Correct 16 ms 328 KB Output is correct
20 Correct 15 ms 300 KB Output is correct
21 Correct 16 ms 316 KB Output is correct
22 Correct 14 ms 316 KB Output is correct
23 Correct 17 ms 312 KB Output is correct
24 Correct 18 ms 308 KB Output is correct
25 Correct 13 ms 320 KB Output is correct
26 Correct 18 ms 316 KB Output is correct
27 Correct 21 ms 308 KB Output is correct
28 Correct 10 ms 312 KB Output is correct
29 Correct 12 ms 316 KB Output is correct
30 Correct 12 ms 316 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 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 ms 312 KB Output is correct
12 Correct 3 ms 320 KB Output is correct
13 Correct 2 ms 312 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 4 ms 320 KB Output is correct
17 Correct 9 ms 316 KB Output is correct
18 Correct 14 ms 308 KB Output is correct
19 Correct 16 ms 328 KB Output is correct
20 Correct 15 ms 300 KB Output is correct
21 Correct 16 ms 316 KB Output is correct
22 Correct 14 ms 316 KB Output is correct
23 Correct 17 ms 312 KB Output is correct
24 Correct 18 ms 308 KB Output is correct
25 Correct 13 ms 320 KB Output is correct
26 Correct 18 ms 316 KB Output is correct
27 Correct 21 ms 308 KB Output is correct
28 Correct 10 ms 312 KB Output is correct
29 Correct 12 ms 316 KB Output is correct
30 Correct 12 ms 316 KB Output is correct
31 Correct 35 ms 312 KB Output is correct
32 Correct 48 ms 320 KB Output is correct
33 Correct 78 ms 324 KB Output is correct
34 Correct 66 ms 312 KB Output is correct
35 Correct 75 ms 304 KB Output is correct
36 Correct 77 ms 336 KB Output is correct
37 Correct 87 ms 304 KB Output is correct
38 Correct 77 ms 320 KB Output is correct
39 Correct 59 ms 312 KB Output is correct
40 Correct 80 ms 316 KB Output is correct
41 Correct 87 ms 440 KB Output is correct
42 Correct 95 ms 312 KB Output is correct
43 Correct 75 ms 304 KB Output is correct
44 Correct 81 ms 436 KB Output is correct
45 Correct 75 ms 320 KB Output is correct
46 Correct 68 ms 324 KB Output is correct
47 Correct 59 ms 316 KB Output is correct
48 Correct 75 ms 308 KB Output is correct
49 Correct 104 ms 308 KB Output is correct
50 Correct 56 ms 316 KB Output is correct
51 Correct 82 ms 316 KB Output is correct
52 Correct 43 ms 328 KB Output is correct
53 Correct 68 ms 316 KB Output is correct
54 Correct 64 ms 316 KB Output is correct
55 Correct 91 ms 324 KB Output is correct
56 Correct 83 ms 308 KB Output is correct
57 Correct 88 ms 432 KB Output is correct
58 Correct 86 ms 324 KB Output is correct
59 Correct 57 ms 440 KB Output is correct
60 Correct 87 ms 312 KB Output is correct