oj.uz

Submission #419641

# Submission time Handle Problem Language Result Execution time Memory
419641 2021-06-07T10:48:00 Z alishahali1382 Monster Game (JOI21_monster) C++17
93 / 100
 135 ms 4540 KB 
#include "monster.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<" "<<p.second<<"}\n";}
#define debugv(abcd) {cerr<<#abcd<<": ";for (auto dcba:abcd) cerr<<dcba<<" ";cerr<<"\n";}
#define pb push_back
#define all(x) x.begin(), x.end()
#define kill(x) return cout<<x<<"\n", 0;
#define SZ(x) ((int)x.size())

const int inf=1000010000;
const int mod=1000000007;
const int MAXN=1010;

int n, m, q, k, u, v, x, y, t, l, r, ans;
int A[MAXN][MAXN];
int P[MAXN], deg[MAXN];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

bool Ask(int u, int v){
	if (u==v) return 0; // wtf
	if (u>v) return !Ask(v, u);
	if (A[u][v]==-1) A[u][v]=!Query(u, v);
	return A[u][v];
}
vi FUCK(vi A){
	vi B(n, 0);
	for (int i=0; i<n; i++) B[A[i]]=i;
	return B;
}

void MergeSort(int *l, int *r){
	if (r-l<=1) return ;
	int *mid=(r-l)/2+l;
	MergeSort(l, mid);
	MergeSort(mid, r);
	vector<int> vec(r-l, 0);
	merge(l, mid, mid, r, vec.begin(), Ask);
	for (int i=0; i<r-l; i++) (*(l+i))=vec[i];
}

vi Solve(int _n){
	n=_n;
	memset(A, -1, sizeof(A));
	vi out;
	iota(P, P+n, 0);
	shuffle(P, P+n, rng);
	MergeSort(P, P+n);
	// cerr<<"P: ";for (int i=0; i<n; i++) cerr<<P[i]<<" \n"[i==n-1];

	int t=0, y=P[n-1];
	for (int i=0; i<n; i++) if (i!=y) t+=Ask(y, i);
	if (t==n-2){
		if (Ask(P[2], P[0])){
			for (int i=n-1; ~i; i--) out.pb(P[i]);
		}
		else{
			out.pb(P[0]);
			for (int i=n-1; i; i--) out.pb(P[i]);
		}
		// debugv(out)
		// debug("shit")
		return FUCK(out);
	}
	int j=0, pos=n-1;
	for (int i=0; i<n-1; i++) if (Ask(y, P[i])){
		x=P[i];
		j=i;
		break ;
	}
	if (t==1){
		int tx=0;
		for (int i=n-1; ~i && tx<=1; i--) if (P[i]!=x) tx+=Ask(x, P[i]);
		if (tx==1){
			out.pb(P[pos--]);
		}
		else{
			out.pb(P[pos--]);
			out.pb(P[pos--]);
		}
	}
	else{
		out.pb(P[pos--]);
		out.pb(P[pos--]);
		while (~pos && P[pos]!=x && Ask(y, P[pos])) out.pb(P[pos--]);
	}
	reverse(all(out));
	// debugv(out)

	int last=P[n-1];
	while (~pos){
		int nw=P[pos];
		vi shit;
		while (1){
			int v=P[pos--];
			shit.pb(v);
			if (Ask(last, v)) break ;
		}
		reverse(all(shit));
		for (int x:shit) out.pb(x);
		last=nw;
	}
	reverse(all(out));
	return FUCK(out);
}

Compilation message

monster.cpp: In function 'vi Solve(int)':
monster.cpp:74:6: warning: variable 'j' set but not used [-Wunused-but-set-variable]
   74 |  int j=0, pos=n-1;
      |      ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4296 KB Output is correct
2 Correct 2 ms 4296 KB Output is correct
3 Correct 2 ms 4296 KB Output is correct
4 Correct 2 ms 4168 KB Output is correct
5 Correct 2 ms 4296 KB Output is correct
6 Correct 2 ms 4168 KB Output is correct
7 Correct 3 ms 4296 KB Output is correct
8 Correct 2 ms 4168 KB Output is correct
9 Correct 2 ms 4296 KB Output is correct
10 Correct 3 ms 4296 KB Output is correct
11 Correct 3 ms 4168 KB Output is correct
12 Correct 2 ms 4168 KB Output is correct
13 Correct 3 ms 4352 KB Output is correct
14 Correct 3 ms 4296 KB Output is correct
15 Correct 3 ms 4296 KB Output is correct
16 Correct 21 ms 4276 KB Output is correct
17 Correct 14 ms 4168 KB Output is correct
18 Correct 17 ms 4296 KB Output is correct
19 Correct 20 ms 4296 KB Output is correct
20 Correct 16 ms 4288 KB Output is correct
21 Correct 2 ms 4296 KB Output is correct
22 Correct 3 ms 4296 KB Output is correct
23 Correct 3 ms 4296 KB Output is correct
24 Correct 3 ms 4296 KB Output is correct
25 Correct 3 ms 4296 KB Output is correct
26 Correct 27 ms 4296 KB Output is correct
27 Correct 3 ms 4296 KB Output is correct
28 Correct 2 ms 4168 KB Output is correct
29 Correct 2 ms 4296 KB Output is correct
30 Correct 3 ms 4296 KB Output is correct
31 Correct 3 ms 4392 KB Output is correct
32 Correct 21 ms 4296 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4296 KB Output is correct
2 Correct 2 ms 4296 KB Output is correct
3 Correct 2 ms 4296 KB Output is correct
4 Correct 2 ms 4168 KB Output is correct
5 Correct 2 ms 4296 KB Output is correct
6 Correct 2 ms 4168 KB Output is correct
7 Correct 3 ms 4296 KB Output is correct
8 Correct 2 ms 4168 KB Output is correct
9 Correct 2 ms 4296 KB Output is correct
10 Correct 3 ms 4296 KB Output is correct
11 Correct 3 ms 4168 KB Output is correct
12 Correct 2 ms 4168 KB Output is correct
13 Correct 3 ms 4352 KB Output is correct
14 Correct 3 ms 4296 KB Output is correct
15 Correct 3 ms 4296 KB Output is correct
16 Correct 21 ms 4276 KB Output is correct
17 Correct 14 ms 4168 KB Output is correct
18 Correct 17 ms 4296 KB Output is correct
19 Correct 20 ms 4296 KB Output is correct
20 Correct 16 ms 4288 KB Output is correct
21 Correct 2 ms 4296 KB Output is correct
22 Correct 3 ms 4296 KB Output is correct
23 Correct 3 ms 4296 KB Output is correct
24 Correct 3 ms 4296 KB Output is correct
25 Correct 3 ms 4296 KB Output is correct
26 Correct 27 ms 4296 KB Output is correct
27 Correct 3 ms 4296 KB Output is correct
28 Correct 2 ms 4168 KB Output is correct
29 Correct 2 ms 4296 KB Output is correct
30 Correct 3 ms 4296 KB Output is correct
31 Correct 3 ms 4392 KB Output is correct
32 Correct 21 ms 4296 KB Output is correct
33 Correct 96 ms 4296 KB Output is correct
34 Correct 95 ms 4296 KB Output is correct
35 Correct 116 ms 4352 KB Output is correct
36 Correct 112 ms 4300 KB Output is correct
37 Correct 121 ms 4296 KB Output is correct
38 Correct 90 ms 4416 KB Output is correct
39 Correct 119 ms 4288 KB Output is correct
40 Correct 119 ms 4296 KB Output is correct
41 Correct 107 ms 4296 KB Output is correct
42 Correct 108 ms 4292 KB Output is correct
43 Correct 134 ms 4296 KB Output is correct
44 Correct 105 ms 4292 KB Output is correct

Subtask #3
68.0 / 75.0

# Verdict Execution time Memory Grader output
1 Partially correct 94 ms 4296 KB Partially correct
2 Partially correct 135 ms 4296 KB Partially correct
3 Partially correct 111 ms 4540 KB Partially correct
4 Partially correct 100 ms 4412 KB Partially correct
5 Partially correct 109 ms 4288 KB Partially correct
6 Correct 105 ms 4296 KB Output is correct
7 Correct 108 ms 4304 KB Output is correct
8 Partially correct 109 ms 4296 KB Partially correct
9 Partially correct 100 ms 4280 KB Partially correct
10 Partially correct 93 ms 4296 KB Partially correct
11 Partially correct 106 ms 4296 KB Partially correct
12 Partially correct 116 ms 4412 KB Partially correct
13 Correct 113 ms 4296 KB Output is correct
14 Correct 98 ms 4296 KB Output is correct
15 Correct 85 ms 4280 KB Output is correct
16 Correct 66 ms 4288 KB Output is correct
17 Correct 111 ms 4276 KB Output is correct
18 Correct 60 ms 4296 KB Output is correct