oj.uz

답안 #433921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433921 2021-06-20T12:15:02 Z alishahali1382 Minerals (JOI19_minerals) C++14
90 / 100
 319 ms 6900 KB 
#include "minerals.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef vector<int> vi;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define SZ(x) ((int)x.size())

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=100010, LOG=20;

int n, m, k, u, v, x, y, a, b, t, ans;
int mark[MAXN], shit;
set<int> On;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int Ask(int x){
	// cerr<<"Ask "<<x<<"\n";
	auto it=On.find(x);
	if (it==On.end()) On.insert(x);
	else On.erase(it);
	return ans=Query(x);
}
bool IsOn(int x){ return On.find(x)!=On.end();}
/*
void Set(vi vec){
	shit++;
	for (int x:vec){
		mark[x]=shit;
		if (!IsOn(x)) Ask(x);
	}
	vi rem;
	for (int x:On) if (mark[x]!=shit) rem.pb(x);
	for (int x:rem) Ask(x);
}*/

void divide(vi X, vi Y){
	assert(SZ(X)==SZ(Y));
	if (SZ(X)==1){
		Answer(X[0], Y[0]);
		return ;
	}
	int sz=SZ(X), mid=sz/2;
	// shuffle(all(X), rng);
	vi X1, X2, Y1, Y2;
	for (int i=0; i<sz; i++){
		if (i<mid) X1.pb(X[i]);
		else X2.pb(X[i]);
	}
	// Set(X1);
	for (int x:X1) if (!IsOn(x)) Ask(x);
	for (int x:X2) if (IsOn(x)) Ask(x);
	for (int y:Y) if (IsOn(x)) Ask(x);

	for (int y:Y){
		if (SZ(Y1)==mid) Y2.pb(y);
		else if (SZ(Y2)==sz-mid) Y1.pb(y);
		else{
			int last=ans;
			if (Ask(y)==last) Y1.pb(y);
			else Y2.pb(y);
		}
	}
	divide(X1, Y1);
	divide(X2, Y2);
}

void Solve(int _n){
	n=_n;
	vi X, Y;
	for (int i=1; i<=2*n; i++){
		int last=ans;
		if (SZ(X)==n || Ask(i)==last) Y.pb(i);
		else X.pb(i);
	}
	divide(X, Y);
}

Compilation message

minerals.cpp: In function 'void divide(vi, vi)':
minerals.cpp:67:11: warning: unused variable 'y' [-Wunused-variable]
   67 |  for (int y:Y) if (IsOn(x)) Ask(x);
      |           ^

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 444 KB Output is correct
2 Correct 8 ms 576 KB Output is correct
3 Correct 18 ms 808 KB Output is correct
4 Correct 39 ms 1324 KB Output is correct
5 Correct 83 ms 2192 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 4 ms 444 KB Output is correct
6 Correct 8 ms 576 KB Output is correct
7 Correct 18 ms 808 KB Output is correct
8 Correct 39 ms 1324 KB Output is correct
9 Correct 83 ms 2192 KB Output is correct
10 Correct 4 ms 452 KB Output is correct
11 Correct 66 ms 1760 KB Output is correct
12 Correct 103 ms 2392 KB Output is correct
13 Correct 66 ms 2544 KB Output is correct
14 Correct 70 ms 2020 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 4 ms 444 KB Output is correct
6 Correct 8 ms 576 KB Output is correct
7 Correct 18 ms 808 KB Output is correct
8 Correct 39 ms 1324 KB Output is correct
9 Correct 83 ms 2192 KB Output is correct
10 Correct 4 ms 452 KB Output is correct
11 Correct 66 ms 1760 KB Output is correct
12 Correct 103 ms 2392 KB Output is correct
13 Correct 66 ms 2544 KB Output is correct
14 Correct 70 ms 2020 KB Output is correct
15 Correct 288 ms 5940 KB Output is correct
16 Correct 274 ms 5928 KB Output is correct
17 Correct 200 ms 6232 KB Output is correct
18 Correct 184 ms 5124 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 4 ms 444 KB Output is correct
6 Correct 8 ms 576 KB Output is correct
7 Correct 18 ms 808 KB Output is correct
8 Correct 39 ms 1324 KB Output is correct
9 Correct 83 ms 2192 KB Output is correct
10 Correct 4 ms 452 KB Output is correct
11 Correct 66 ms 1760 KB Output is correct
12 Correct 103 ms 2392 KB Output is correct
13 Correct 66 ms 2544 KB Output is correct
14 Correct 70 ms 2020 KB Output is correct
15 Correct 288 ms 5940 KB Output is correct
16 Correct 274 ms 5928 KB Output is correct
17 Correct 200 ms 6232 KB Output is correct
18 Correct 184 ms 5124 KB Output is correct
19 Correct 275 ms 6160 KB Output is correct
20 Correct 283 ms 6084 KB Output is correct
21 Correct 223 ms 6428 KB Output is correct
22 Correct 205 ms 5056 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 4 ms 444 KB Output is correct
6 Correct 8 ms 576 KB Output is correct
7 Correct 18 ms 808 KB Output is correct
8 Correct 39 ms 1324 KB Output is correct
9 Correct 83 ms 2192 KB Output is correct
10 Correct 4 ms 452 KB Output is correct
11 Correct 66 ms 1760 KB Output is correct
12 Correct 103 ms 2392 KB Output is correct
13 Correct 66 ms 2544 KB Output is correct
14 Correct 70 ms 2020 KB Output is correct
15 Correct 288 ms 5940 KB Output is correct
16 Correct 274 ms 5928 KB Output is correct
17 Correct 200 ms 6232 KB Output is correct
18 Correct 184 ms 5124 KB Output is correct
19 Correct 275 ms 6160 KB Output is correct
20 Correct 283 ms 6084 KB Output is correct
21 Correct 223 ms 6428 KB Output is correct
22 Correct 205 ms 5056 KB Output is correct
23 Correct 294 ms 6180 KB Output is correct
24 Correct 318 ms 6236 KB Output is correct
25 Correct 203 ms 6536 KB Output is correct
26 Correct 186 ms 5224 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 4 ms 444 KB Output is correct
6 Correct 8 ms 576 KB Output is correct
7 Correct 18 ms 808 KB Output is correct
8 Correct 39 ms 1324 KB Output is correct
9 Correct 83 ms 2192 KB Output is correct
10 Correct 4 ms 452 KB Output is correct
11 Correct 66 ms 1760 KB Output is correct
12 Correct 103 ms 2392 KB Output is correct
13 Correct 66 ms 2544 KB Output is correct
14 Correct 70 ms 2020 KB Output is correct
15 Correct 288 ms 5940 KB Output is correct
16 Correct 274 ms 5928 KB Output is correct
17 Correct 200 ms 6232 KB Output is correct
18 Correct 184 ms 5124 KB Output is correct
19 Correct 275 ms 6160 KB Output is correct
20 Correct 283 ms 6084 KB Output is correct
21 Correct 223 ms 6428 KB Output is correct
22 Correct 205 ms 5056 KB Output is correct
23 Correct 294 ms 6180 KB Output is correct
24 Correct 318 ms 6236 KB Output is correct
25 Correct 203 ms 6536 KB Output is correct
26 Correct 186 ms 5224 KB Output is correct
27 Correct 302 ms 6372 KB Output is correct
28 Correct 290 ms 6384 KB Output is correct
29 Correct 225 ms 6864 KB Output is correct
30 Correct 216 ms 5332 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 4 ms 444 KB Output is correct
6 Correct 8 ms 576 KB Output is correct
7 Correct 18 ms 808 KB Output is correct
8 Correct 39 ms 1324 KB Output is correct
9 Correct 83 ms 2192 KB Output is correct
10 Correct 4 ms 452 KB Output is correct
11 Correct 66 ms 1760 KB Output is correct
12 Correct 103 ms 2392 KB Output is correct
13 Correct 66 ms 2544 KB Output is correct
14 Correct 70 ms 2020 KB Output is correct
15 Correct 288 ms 5940 KB Output is correct
16 Correct 274 ms 5928 KB Output is correct
17 Correct 200 ms 6232 KB Output is correct
18 Correct 184 ms 5124 KB Output is correct
19 Correct 275 ms 6160 KB Output is correct
20 Correct 283 ms 6084 KB Output is correct
21 Correct 223 ms 6428 KB Output is correct
22 Correct 205 ms 5056 KB Output is correct
23 Correct 294 ms 6180 KB Output is correct
24 Correct 318 ms 6236 KB Output is correct
25 Correct 203 ms 6536 KB Output is correct
26 Correct 186 ms 5224 KB Output is correct
27 Correct 302 ms 6372 KB Output is correct
28 Correct 290 ms 6384 KB Output is correct
29 Correct 225 ms 6864 KB Output is correct
30 Correct 216 ms 5332 KB Output is correct
31 Correct 299 ms 6464 KB Output is correct
32 Correct 308 ms 6504 KB Output is correct
33 Correct 213 ms 6900 KB Output is correct
34 Correct 215 ms 5560 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 4 ms 444 KB Output is correct
6 Correct 8 ms 576 KB Output is correct
7 Correct 18 ms 808 KB Output is correct
8 Correct 39 ms 1324 KB Output is correct
9 Correct 83 ms 2192 KB Output is correct
10 Correct 4 ms 452 KB Output is correct
11 Correct 66 ms 1760 KB Output is correct
12 Correct 103 ms 2392 KB Output is correct
13 Correct 66 ms 2544 KB Output is correct
14 Correct 70 ms 2020 KB Output is correct
15 Correct 288 ms 5940 KB Output is correct
16 Correct 274 ms 5928 KB Output is correct
17 Correct 200 ms 6232 KB Output is correct
18 Correct 184 ms 5124 KB Output is correct
19 Correct 275 ms 6160 KB Output is correct
20 Correct 283 ms 6084 KB Output is correct
21 Correct 223 ms 6428 KB Output is correct
22 Correct 205 ms 5056 KB Output is correct
23 Correct 294 ms 6180 KB Output is correct
24 Correct 318 ms 6236 KB Output is correct
25 Correct 203 ms 6536 KB Output is correct
26 Correct 186 ms 5224 KB Output is correct
27 Correct 302 ms 6372 KB Output is correct
28 Correct 290 ms 6384 KB Output is correct
29 Correct 225 ms 6864 KB Output is correct
30 Correct 216 ms 5332 KB Output is correct
31 Correct 299 ms 6464 KB Output is correct
32 Correct 308 ms 6504 KB Output is correct
33 Correct 213 ms 6900 KB Output is correct
34 Correct 215 ms 5560 KB Output is correct
35 Incorrect 319 ms 6636 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -