oj.uz

Submission #425187

# Submission time Handle Problem Language Result Execution time Memory
425187 2021-06-12T14:51:26 Z CSQ31 Monster Game (JOI21_monster) C++17
100 / 100
 126 ms 408 KB 
#include "monster.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
vector<int>ans;
bool cmp(const int &x,const int &y){
	return Query(y,x);
}
vector<int> Solve(int N){
	int n = N;
	ans.pb(0);
	for(int i=1;i<n;i++){
		int p = lb(all(ans),i,cmp)-ans.begin();
		ans.pb(0);
		for(int j=sz(ans)-1;j>p;j--)ans[j] = ans[j-1];
		ans[p] = i;
	}
	vector<int>a;
	for(int i=0;i<min(10,n);i++)a.pb(ans[i]);
	vector<int>cnt(100);
	for(int i=0;i<sz(a);i++){
		for(int j=0;j<sz(a);j++){
			if(i==j)continue;
			if(Query(a[i],a[j]))cnt[i]++;
		}
	}
	vector<int>b;
	for(int i=0;i<sz(a);i++){
		if(cnt[i] == 1)b.pb(i);
	}
	int zero = 0;
	if(Query(ans[b[0]],ans[b[1]]))zero = b[0];
	else zero = b[1];
	reverse(ans.begin(),ans.begin()+zero+1);
	for(int i=zero+1;i<n;){
		int j = i;
		while(j<n && !Query(ans[i-1],ans[j]))j++;
		reverse(ans.begin()+i,ans.begin()+j+1);
		i=j+1;
	}
	vector<int>fin(n);
	for(int i=0;i<n;i++)fin[ans[i]]=  i;
    return fin;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 14 ms 200 KB Output is correct
17 Correct 17 ms 300 KB Output is correct
18 Correct 13 ms 200 KB Output is correct
19 Correct 18 ms 200 KB Output is correct
20 Correct 20 ms 276 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 2 ms 200 KB Output is correct
26 Correct 18 ms 292 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 200 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 12 ms 200 KB Output is correct
33 Correct 76 ms 284 KB Output is correct
34 Correct 115 ms 404 KB Output is correct
35 Correct 85 ms 300 KB Output is correct
36 Correct 106 ms 292 KB Output is correct
37 Correct 124 ms 292 KB Output is correct
38 Correct 86 ms 288 KB Output is correct
39 Correct 93 ms 200 KB Output is correct
40 Correct 101 ms 284 KB Output is correct
41 Correct 74 ms 320 KB Output is correct
42 Correct 95 ms 292 KB Output is correct
43 Correct 80 ms 296 KB Output is correct
44 Correct 114 ms 300 KB Output is correct

Subtask #3
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 284 KB Output is correct
2 Correct 112 ms 280 KB Output is correct
3 Correct 86 ms 404 KB Output is correct
4 Correct 92 ms 280 KB Output is correct
5 Correct 100 ms 280 KB Output is correct
6 Correct 108 ms 292 KB Output is correct
7 Correct 96 ms 292 KB Output is correct
8 Correct 107 ms 292 KB Output is correct
9 Correct 110 ms 408 KB Output is correct
10 Correct 86 ms 296 KB Output is correct
11 Correct 126 ms 200 KB Output is correct
12 Correct 85 ms 200 KB Output is correct
13 Correct 69 ms 280 KB Output is correct
14 Correct 121 ms 296 KB Output is correct
15 Correct 111 ms 320 KB Output is correct
16 Correct 92 ms 292 KB Output is correct
17 Correct 73 ms 288 KB Output is correct
18 Correct 95 ms 292 KB Output is correct