oj.uz

답안 #433945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433945 2021-06-20T12:32:25 Z alishahali1382 Minerals (JOI19_minerals) C++14
90 / 100
 120 ms 4104 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){
	mark[x]^=1;
	return ans=Query(x);
}
/*
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 ;
	}
	if (rng()%2) swap(X, Y);
	int sz=SZ(X), mid=sz/2;
	shuffle(all(Y), rng);
	sort(all(X), [](int i, int j){
		return mark[i]>mark[j];
	});
	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 (!mark[x]) Ask(x);
	for (int x:X2) if (mark[x]) Ask(x);
	for (int y:Y) if (mark[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, P(2*n);
	iota(all(P), 1);
	shuffle(all(P), rng);
	for (int i:P){
		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 (mark[x]) Ask(x);
      |           ^

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2 ms 328 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Correct 7 ms 584 KB Output is correct
4 Correct 13 ms 968 KB Output is correct
5 Correct 27 ms 1564 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 7 ms 584 KB Output is correct
8 Correct 13 ms 968 KB Output is correct
9 Correct 27 ms 1564 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 23 ms 1224 KB Output is correct
12 Correct 38 ms 1568 KB Output is correct
13 Correct 32 ms 1608 KB Output is correct
14 Correct 27 ms 1480 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 7 ms 584 KB Output is correct
8 Correct 13 ms 968 KB Output is correct
9 Correct 27 ms 1564 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 23 ms 1224 KB Output is correct
12 Correct 38 ms 1568 KB Output is correct
13 Correct 32 ms 1608 KB Output is correct
14 Correct 27 ms 1480 KB Output is correct
15 Correct 102 ms 3808 KB Output is correct
16 Correct 84 ms 3724 KB Output is correct
17 Correct 78 ms 3716 KB Output is correct
18 Correct 87 ms 3788 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 7 ms 584 KB Output is correct
8 Correct 13 ms 968 KB Output is correct
9 Correct 27 ms 1564 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 23 ms 1224 KB Output is correct
12 Correct 38 ms 1568 KB Output is correct
13 Correct 32 ms 1608 KB Output is correct
14 Correct 27 ms 1480 KB Output is correct
15 Correct 102 ms 3808 KB Output is correct
16 Correct 84 ms 3724 KB Output is correct
17 Correct 78 ms 3716 KB Output is correct
18 Correct 87 ms 3788 KB Output is correct
19 Correct 88 ms 3876 KB Output is correct
20 Correct 91 ms 3888 KB Output is correct
21 Correct 92 ms 3876 KB Output is correct
22 Correct 117 ms 3640 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 7 ms 584 KB Output is correct
8 Correct 13 ms 968 KB Output is correct
9 Correct 27 ms 1564 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 23 ms 1224 KB Output is correct
12 Correct 38 ms 1568 KB Output is correct
13 Correct 32 ms 1608 KB Output is correct
14 Correct 27 ms 1480 KB Output is correct
15 Correct 102 ms 3808 KB Output is correct
16 Correct 84 ms 3724 KB Output is correct
17 Correct 78 ms 3716 KB Output is correct
18 Correct 87 ms 3788 KB Output is correct
19 Correct 88 ms 3876 KB Output is correct
20 Correct 91 ms 3888 KB Output is correct
21 Correct 92 ms 3876 KB Output is correct
22 Correct 117 ms 3640 KB Output is correct
23 Correct 92 ms 3940 KB Output is correct
24 Correct 88 ms 3888 KB Output is correct
25 Correct 101 ms 3912 KB Output is correct
26 Correct 93 ms 3800 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 7 ms 584 KB Output is correct
8 Correct 13 ms 968 KB Output is correct
9 Correct 27 ms 1564 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 23 ms 1224 KB Output is correct
12 Correct 38 ms 1568 KB Output is correct
13 Correct 32 ms 1608 KB Output is correct
14 Correct 27 ms 1480 KB Output is correct
15 Correct 102 ms 3808 KB Output is correct
16 Correct 84 ms 3724 KB Output is correct
17 Correct 78 ms 3716 KB Output is correct
18 Correct 87 ms 3788 KB Output is correct
19 Correct 88 ms 3876 KB Output is correct
20 Correct 91 ms 3888 KB Output is correct
21 Correct 92 ms 3876 KB Output is correct
22 Correct 117 ms 3640 KB Output is correct
23 Correct 92 ms 3940 KB Output is correct
24 Correct 88 ms 3888 KB Output is correct
25 Correct 101 ms 3912 KB Output is correct
26 Correct 93 ms 3800 KB Output is correct
27 Correct 90 ms 4060 KB Output is correct
28 Correct 93 ms 3980 KB Output is correct
29 Correct 85 ms 3904 KB Output is correct
30 Correct 95 ms 3728 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 7 ms 584 KB Output is correct
8 Correct 13 ms 968 KB Output is correct
9 Correct 27 ms 1564 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 23 ms 1224 KB Output is correct
12 Correct 38 ms 1568 KB Output is correct
13 Correct 32 ms 1608 KB Output is correct
14 Correct 27 ms 1480 KB Output is correct
15 Correct 102 ms 3808 KB Output is correct
16 Correct 84 ms 3724 KB Output is correct
17 Correct 78 ms 3716 KB Output is correct
18 Correct 87 ms 3788 KB Output is correct
19 Correct 88 ms 3876 KB Output is correct
20 Correct 91 ms 3888 KB Output is correct
21 Correct 92 ms 3876 KB Output is correct
22 Correct 117 ms 3640 KB Output is correct
23 Correct 92 ms 3940 KB Output is correct
24 Correct 88 ms 3888 KB Output is correct
25 Correct 101 ms 3912 KB Output is correct
26 Correct 93 ms 3800 KB Output is correct
27 Correct 90 ms 4060 KB Output is correct
28 Correct 93 ms 3980 KB Output is correct
29 Correct 85 ms 3904 KB Output is correct
30 Correct 95 ms 3728 KB Output is correct
31 Correct 94 ms 4080 KB Output is correct
32 Correct 106 ms 4060 KB Output is correct
33 Correct 100 ms 4080 KB Output is correct
34 Correct 100 ms 3892 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 7 ms 584 KB Output is correct
8 Correct 13 ms 968 KB Output is correct
9 Correct 27 ms 1564 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 23 ms 1224 KB Output is correct
12 Correct 38 ms 1568 KB Output is correct
13 Correct 32 ms 1608 KB Output is correct
14 Correct 27 ms 1480 KB Output is correct
15 Correct 102 ms 3808 KB Output is correct
16 Correct 84 ms 3724 KB Output is correct
17 Correct 78 ms 3716 KB Output is correct
18 Correct 87 ms 3788 KB Output is correct
19 Correct 88 ms 3876 KB Output is correct
20 Correct 91 ms 3888 KB Output is correct
21 Correct 92 ms 3876 KB Output is correct
22 Correct 117 ms 3640 KB Output is correct
23 Correct 92 ms 3940 KB Output is correct
24 Correct 88 ms 3888 KB Output is correct
25 Correct 101 ms 3912 KB Output is correct
26 Correct 93 ms 3800 KB Output is correct
27 Correct 90 ms 4060 KB Output is correct
28 Correct 93 ms 3980 KB Output is correct
29 Correct 85 ms 3904 KB Output is correct
30 Correct 95 ms 3728 KB Output is correct
31 Correct 94 ms 4080 KB Output is correct
32 Correct 106 ms 4060 KB Output is correct
33 Correct 100 ms 4080 KB Output is correct
34 Correct 100 ms 3892 KB Output is correct
35 Incorrect 120 ms 4104 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -