oj.uz

Submission #777839

# Submission time Handle Problem Language Result Execution time Memory
777839 2023-07-09T18:22:52 Z OrazB Xylophone (JOI18_xylophone) C++17
47 / 100
 85 ms 348 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

int F(int n){
	int l = 1, r = n-1, pos;
	while(l <= r){
		int md = (l+r)>>1;
		int x = query(md, n);
		if (x != n-1) r = md - 1;
		else{
			pos = md;
			l = md + 1;
		}
	}
	return pos;
}

void solve(int n){
	int pos = F(n);
	vector<int> a(n+1), vis(n+2, 0);
	vis[1] = 1;
	a[pos] = 1;
	a[pos+1] = 1+query(pos, pos+1);
	vis[a[pos+1]] = 1;
	if (pos > 1){
		a[pos-1] = 1+query(pos-1, pos);
		vis[a[pos-1]] = 1;
	}
	for (int i = pos-2; i >= 1; i--){
		a[i] = a[i+1];
		int x = query(i, i+1), y = query(i, i+2);
		if (a[i]+x > n or vis[a[i]+x]){a[i] -= x; vis[a[i]] = 1; continue;}
		if (a[i]-x <= 0 or vis[a[i]-x]){a[i] += x; vis[a[i]] = 1; continue;} 
		if (x == y){
			if (a[i+1] > a[i+2]) a[i] -= x;
			else a[i] += x;
		}else{
			if (abs(a[i+1]-a[i+2]) != y){
				if (a[i+1] > a[i+2]) a[i] += x;
				else a[i] -= x;
			}else{
				if (a[i+1] > a[i+2]) a[i] -= x;
				else a[i] += x;
			}
		}
		vis[a[i]] = 1;
	}
	for (int i = pos+2; i <= n; i++){
		a[i] = a[i-1];
		int x = query(i-1, i), y = query(i-2, i);
		if (a[i]+x > n or vis[a[i]+x]){a[i] -= x;continue;}
		if (a[i]-x <= 0 or vis[a[i]-x]){a[i] += x;continue;}
		if (x == y){
			if (a[i-1] > a[i-2]) a[i] -= x;
			else a[i] += x;
		}else{
			if (abs(a[i-1]-a[i-2]) != y){
				if (a[i-1] > a[i-2]) a[i] += x;
				else a[i] -= x;
			}else{
				if (a[i-1] > a[i-2]) a[i] -= x;
				else a[i] += x;
			}
		}
		vis[a[i]] = 1;
	}
	for (int i = 1; i <= n; i++) answer(i, a[i]);
}

Compilation message

xylophone.cpp: In function 'int F(int)':
xylophone.cpp:23:9: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   23 |  return pos;
      |         ^~~
xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:34:21: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   34 |   a[pos-1] = 1+query(pos-1, pos);
      |                ~~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 2 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 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 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

# Verdict Execution time Memory 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 2 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 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 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 5 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 15 ms 208 KB Output is correct
19 Correct 16 ms 300 KB Output is correct
20 Correct 18 ms 208 KB Output is correct
21 Correct 17 ms 208 KB Output is correct
22 Correct 8 ms 300 KB Output is correct
23 Correct 15 ms 208 KB Output is correct
24 Correct 18 ms 208 KB Output is correct
25 Correct 17 ms 284 KB Output is correct
26 Correct 16 ms 208 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 7 ms 348 KB Output is correct
30 Correct 16 ms 208 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory 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 2 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 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 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 5 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 15 ms 208 KB Output is correct
19 Correct 16 ms 300 KB Output is correct
20 Correct 18 ms 208 KB Output is correct
21 Correct 17 ms 208 KB Output is correct
22 Correct 8 ms 300 KB Output is correct
23 Correct 15 ms 208 KB Output is correct
24 Correct 18 ms 208 KB Output is correct
25 Correct 17 ms 284 KB Output is correct
26 Correct 16 ms 208 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 7 ms 348 KB Output is correct
30 Correct 16 ms 208 KB Output is correct
31 Correct 23 ms 296 KB Output is correct
32 Correct 54 ms 304 KB Output is correct
33 Correct 79 ms 312 KB Output is correct
34 Incorrect 85 ms 336 KB Wrong Answer [2]
35 Halted 0 ms 0 KB -