oj.uz

답안 #996227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996227 2024-06-10T08:58:49 Z reginox Xylophone (JOI18_xylophone) C++17
100 / 100
 171 ms 952 KB 
#include<bits/stdc++.h>
#include "xylophone.h"
#define ll long long
#define all(v) begin(v), end(v)
#define pi pair<int, int>
#define vi vector<int>
using namespace std;
int a[5005], n;
int p1[5005], p2[5005];
 
bool thu(int u, int v){
    if(v < 1 || v > n) return false;
    a[1] = u, a[2] = v;
    for(int i = 3; i <= n; i++){
        int d1 = p1[i], d2 = p2[i], d3 = abs(a[i-2] - a[i-1]);
        if(a[i-2] > a[i-1]){
            if(d1 == d2 || d2 == d3){
                a[i] = a[i-1] + d1;
            }
            else{
               a[i] = a[i-1] - d1; 
            }
        }
        else{
            if(d1 == d2 || d2 == d3){
                a[i] = a[i-1] - d1;
            }
            else{
               a[i] = a[i-1] + d1; 
            }
        }
    }
    vector<bool> ch(n, false);
    for(int i = 1; i <= n; i++){
        if(a[i] < 1 || a[i] > n) return false;
        if(ch[a[i]-1]) return false;
        if(a[i] == n && !ch[0]) return false;
        ch[a[i]-1] = true;
    }
    return true;
}
 
void solve(int m){
    n = m;
    int d = query(1, 2);
    for(int i = 3; i <= n; i++){
        p1[i] = query(i-1, i), p2[i] = query(i-2, i);
    }
    for(int v1 = 1; v1 <= n; v1++){
        for(int z = -d; z <= d; z+=2*d){
            if(thu(v1, v1+z)){
                for(int i = 1; i <= n; i++) answer(i, a[i]);
                return ;
            }
        }
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 440 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 356 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 8 ms 444 KB Output is correct
19 Correct 14 ms 344 KB Output is correct
20 Correct 10 ms 344 KB Output is correct
21 Correct 14 ms 344 KB Output is correct
22 Correct 14 ms 344 KB Output is correct
23 Correct 11 ms 600 KB Output is correct
24 Correct 10 ms 444 KB Output is correct
25 Correct 6 ms 448 KB Output is correct
26 Correct 12 ms 464 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 13 ms 452 KB Output is correct
30 Correct 12 ms 344 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 440 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 356 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 8 ms 444 KB Output is correct
19 Correct 14 ms 344 KB Output is correct
20 Correct 10 ms 344 KB Output is correct
21 Correct 14 ms 344 KB Output is correct
22 Correct 14 ms 344 KB Output is correct
23 Correct 11 ms 600 KB Output is correct
24 Correct 10 ms 444 KB Output is correct
25 Correct 6 ms 448 KB Output is correct
26 Correct 12 ms 464 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 13 ms 452 KB Output is correct
30 Correct 12 ms 344 KB Output is correct
31 Correct 15 ms 344 KB Output is correct
32 Correct 66 ms 436 KB Output is correct
33 Correct 56 ms 344 KB Output is correct
34 Correct 107 ms 600 KB Output is correct
35 Correct 86 ms 344 KB Output is correct
36 Correct 54 ms 688 KB Output is correct
37 Correct 138 ms 696 KB Output is correct
38 Correct 54 ms 448 KB Output is correct
39 Correct 67 ms 952 KB Output is correct
40 Correct 92 ms 448 KB Output is correct
41 Correct 93 ms 712 KB Output is correct
42 Correct 56 ms 688 KB Output is correct
43 Correct 121 ms 440 KB Output is correct
44 Correct 61 ms 600 KB Output is correct
45 Correct 81 ms 436 KB Output is correct
46 Correct 152 ms 592 KB Output is correct
47 Correct 171 ms 436 KB Output is correct
48 Correct 47 ms 440 KB Output is correct
49 Correct 138 ms 440 KB Output is correct
50 Correct 146 ms 708 KB Output is correct
51 Correct 71 ms 700 KB Output is correct
52 Correct 54 ms 456 KB Output is correct
53 Correct 125 ms 592 KB Output is correct
54 Correct 91 ms 716 KB Output is correct
55 Correct 117 ms 848 KB Output is correct
56 Correct 69 ms 592 KB Output is correct
57 Correct 109 ms 712 KB Output is correct
58 Correct 69 ms 344 KB Output is correct
59 Correct 99 ms 448 KB Output is correct
60 Correct 79 ms 684 KB Output is correct