oj.uz

Submission #522906

# Submission time Handle Problem Language Result Execution time Memory
522906 2022-02-06T12:04:40 Z CPSC Xylophone (JOI18_xylophone) C++14
100 / 100
 78 ms 576 KB 
#include "xylophone.h"
# include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
const int NN = 5005;
int le,ri,mid,ans,a[NN],val[NN],vl1,n,fix[NN];
int check(int val) {
	if (val <= 0 || val > n) return 0; else {
	   if (fix[val]) return 0;
 	   else
		  return 1;
	}
}
void solve(int N) {
	n = N;
    le = 2;
    ri = n;
    while (le <= ri) {
        mid = (le + ri) / 2;
        if (query(1,mid) == n - 1) {
            ri = mid - 1;
            ans = mid;
        } else le = mid + 1;
    }
    a[ans] = n;
    for (int i = ans + 1; i <= n; i++) {
        if (i == ans + 1) {
            val[i - 1] = query(i-1,i);
            a[i] = a[ans] - val[i - 1];
            fix[a[i]] = 1;
            continue;
        }
        val[i - 1] = query(i - 1, i);
        if (!check(a[i - 1] + val[i - 1])) {
        	a[i] = a[i - 1] - val[i - 1];
        	fix[a[i]] = 1;
        	continue;
		}
		if (!check(a[i - 1] + val[i - 1])) {
			a[i] = a[i - 1] + val[i - 1];
			fix[a[i]] = 1;
			continue;
		}
        vl1 = query(i - 2, i);
        if (val[i - 2] + val[i - 1] == vl1) {
            a[i] = (a[i - 2] > a[i - 1] ? (a[i - 1] - val[i - 1]) : (a[i - 1] + val[i - 1]));
        } else 
        a[i] = (a[i - 2] > a[i - 1] ? (a[i - 1] + val[i - 1]) : (a[i - 1] - val[i - 1]));
        fix[a[i]] = 1;
    }
    for (int i = ans - 1; i >= 1; i--) {
        if (i == ans - 1) {
            val[i] = query(i, i + 1);
            a[i] = a[ans] - val[i];
            fix[a[i]] = 1;
            continue;
        }
        val[i] = query(i, i + 1);
        if (!check(a[i + 1] - val[i])) {
        	a[i] = a[i + 1] + val[i];
        	fix[a[i]] = 1;
        	continue;
		}
		if (!check(a[i + 1] + val[i])) {
			a[i] = a[i + 1] - val[i];
			fix[a[i]] = 1;
			continue;
		}
        vl1 = query(i, i + 2);
        if (vl1 == val[i] + val[i + 1]) {
            a[i] = (a[i + 2] > a[i + 1] ? (a[i + 1] - val[i]) : (a[i + 1] + val[i]));
        } else a[i] = (a[i + 2] > a[i + 1] ? (a[i + 1] + val[i]) : (a[i + 1] - val[i]));
        fix[a[i]] = 1;
    }
    for (int i = 1; i <= n; i++) {
        answer(i,a[i]);
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 4 ms 200 KB Output is correct
17 Correct 8 ms 200 KB Output is correct
18 Correct 9 ms 312 KB Output is correct
19 Correct 11 ms 200 KB Output is correct
20 Correct 13 ms 200 KB Output is correct
21 Correct 13 ms 312 KB Output is correct
22 Correct 12 ms 296 KB Output is correct
23 Correct 9 ms 200 KB Output is correct
24 Correct 10 ms 316 KB Output is correct
25 Correct 14 ms 200 KB Output is correct
26 Correct 12 ms 200 KB Output is correct
27 Correct 8 ms 200 KB Output is correct
28 Correct 13 ms 308 KB Output is correct
29 Correct 13 ms 200 KB Output is correct
30 Correct 14 ms 200 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 4 ms 200 KB Output is correct
17 Correct 8 ms 200 KB Output is correct
18 Correct 9 ms 312 KB Output is correct
19 Correct 11 ms 200 KB Output is correct
20 Correct 13 ms 200 KB Output is correct
21 Correct 13 ms 312 KB Output is correct
22 Correct 12 ms 296 KB Output is correct
23 Correct 9 ms 200 KB Output is correct
24 Correct 10 ms 316 KB Output is correct
25 Correct 14 ms 200 KB Output is correct
26 Correct 12 ms 200 KB Output is correct
27 Correct 8 ms 200 KB Output is correct
28 Correct 13 ms 308 KB Output is correct
29 Correct 13 ms 200 KB Output is correct
30 Correct 14 ms 200 KB Output is correct
31 Correct 26 ms 312 KB Output is correct
32 Correct 32 ms 320 KB Output is correct
33 Correct 39 ms 328 KB Output is correct
34 Correct 50 ms 328 KB Output is correct
35 Correct 44 ms 288 KB Output is correct
36 Correct 47 ms 304 KB Output is correct
37 Correct 30 ms 304 KB Output is correct
38 Correct 59 ms 320 KB Output is correct
39 Correct 51 ms 300 KB Output is correct
40 Correct 36 ms 332 KB Output is correct
41 Correct 50 ms 320 KB Output is correct
42 Correct 49 ms 432 KB Output is correct
43 Correct 43 ms 312 KB Output is correct
44 Correct 42 ms 468 KB Output is correct
45 Correct 78 ms 320 KB Output is correct
46 Correct 66 ms 324 KB Output is correct
47 Correct 77 ms 316 KB Output is correct
48 Correct 75 ms 576 KB Output is correct
49 Correct 66 ms 320 KB Output is correct
50 Correct 56 ms 328 KB Output is correct
51 Correct 63 ms 328 KB Output is correct
52 Correct 62 ms 448 KB Output is correct
53 Correct 53 ms 316 KB Output is correct
54 Correct 69 ms 328 KB Output is correct
55 Correct 44 ms 328 KB Output is correct
56 Correct 53 ms 456 KB Output is correct
57 Correct 74 ms 316 KB Output is correct
58 Correct 65 ms 320 KB Output is correct
59 Correct 74 ms 328 KB Output is correct
60 Correct 66 ms 440 KB Output is correct