oj.uz

Submission #59578

# Submission time Handle Problem Language Result Execution time Memory
59578 2018-07-22T12:06:43 Z WA_TLE Game (IOI14_game) C++14
42 / 100
 1000 ms 66808 KB 
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20)
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=998244353;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
#include"game.h"
int n;
int hen[1500][1500]={0};//直接の辺 -1->No 0->未定 1->想定解 2->Yes
vector<bitset<1500>>kno;//可能性のある辺
mt19937 engine(13333);
vector<int>rng;
//O(n^2logn?) 自信がない
//まずランダムな想定解を作る
//想定解にかかってないなら無条件にNoを返していい
//想定解にかかったなら想定解を変える
vector<vector<int>>ki;
bitset<1500>full;
void initialize(int in){
	full.flip();
	n=in;
	//uとvをランダムに置き換える
	rng.res(n);
	int i,j;
	for(i=0;i<n;i++){rng[i]=i;}
	shuffle(rng.begin(),rng.end(),engine);
	//想定解を作る
	vector<bool>use(n);
	use[0]=true;
	int gen=0,oto=1;
	ki.res(n);
	while(oto<n){
		int ne=engine()%n;
		if(use[ne]){gen=ne;}
		else{ki[gen].pub(ne);ki[ne].pub(gen);hen[gen][ne]=1;hen[ne][gen]=1;gen=ne;use[ne]=1;oto++;}
	}
	//cerr<<"de";
	kno.res(n);
	for(i=0;i<n;i++){kno[i]=full;kno[i][i]=0;}
}
int hasEdge(int u,int v){
	int i,j;
	u=rng[u];
	v=rng[v];
	if(hen[u][v]==0){kno[u][v]=0;kno[v][u]=0;hen[u][v]=-1;hen[v][u]=-1;return 0;}
	bitset<1500>ubis;
	ubis[u]=1;
	queue<int>que;que.push(u);
	while(que.size()>0){
		int t=que.front();que.pop();
		for(auto it:ki[t]){
			if(ubis[it]){continue;}
			if(it==v){continue;}
			ubis[it]=1;
			que.push(it);
		}
	}
	int cou=ubis.count();
	if(cou*2<n){cou=n-cou;swap(u,v);ubis.flip();}
	vector<int>zyu;
	zyu.reserve(n-cou);
	for(i=0;i<n;i++){if(!ubis[i]){zyu.pub(i);}}
	shuffle(zyu.begin(),zyu.end(),engine);
	//for(auto it:zyu){cerr<<it;}cerr<<endl;
	int au=-1,av=-1;
	for(i=0;i<zyu.size();i++){
		int t=zyu[i];//v側
		if(t==v){ubis[u]=0;}else{ubis[u]=1;}
		if(!((kno[t]&ubis).none())){
			auto bi=kno[t]&ubis;
			av=t;
			for(j=0;j<n;j++){
				if(bi[j]){
					au=j;
					//cerr<<"u,v,au,av"<<u<<','<<v<<','<<au<<','<<av<<','<<endl;
					hen[u][v]=-1;hen[v][u]=-1;
					hen[au][av]=1;hen[av][au]=1;
					kno[u][v]=0;kno[v][u]=0;
					for(i=0;i<ki[u].size();i++){
						if(ki[u][i]==v){ki[u][i]=ki[u].back();ki[u].pob();}
					}
					for(i=0;i<ki[v].size();i++){
						if(ki[v][i]==u){ki[v][i]=ki[v].back();ki[v].pob();}
					}
					ki[au].pub(av);
					ki[av].pub(au);
					return 0;
				}
			}
		}
	}
	hen[u][v]=2;hen[v][u]=2;return 1;
	
}

Compilation message

game.cpp: In function 'void initialize(int)':
game.cpp:69:8: warning: unused variable 'j' [-Wunused-variable]
  int i,j;
        ^
game.cpp: In function 'int hasEdge(int, int)':
game.cpp:111:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<zyu.size();i++){
          ~^~~~~~~~~~~
game.cpp:124:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(i=0;i<ki[u].size();i++){
              ~^~~~~~~~~~~~~
game.cpp:127:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(i=0;i<ki[v].size();i++){
              ~^~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 536 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 3 ms 536 KB Output is correct
6 Correct 4 ms 536 KB Output is correct
7 Correct 2 ms 580 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 624 KB Output is correct
11 Correct 3 ms 628 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 2 ms 636 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 0 ms 644 KB Output is correct
16 Correct 2 ms 652 KB Output is correct
17 Correct 3 ms 652 KB Output is correct
18 Correct 3 ms 656 KB Output is correct
19 Correct 2 ms 660 KB Output is correct
20 Correct 3 ms 664 KB Output is correct
21 Correct 4 ms 664 KB Output is correct
22 Correct 4 ms 664 KB Output is correct
23 Correct 4 ms 676 KB Output is correct
24 Correct 3 ms 676 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 684 KB Output is correct
2 Correct 3 ms 812 KB Output is correct
3 Correct 3 ms 812 KB Output is correct
4 Correct 3 ms 812 KB Output is correct
5 Correct 3 ms 812 KB Output is correct
6 Correct 3 ms 812 KB Output is correct
7 Correct 3 ms 812 KB Output is correct
8 Correct 3 ms 812 KB Output is correct
9 Correct 3 ms 812 KB Output is correct
10 Correct 2 ms 812 KB Output is correct
11 Correct 3 ms 812 KB Output is correct
12 Correct 3 ms 848 KB Output is correct
13 Correct 3 ms 852 KB Output is correct
14 Correct 4 ms 852 KB Output is correct
15 Correct 3 ms 852 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 3 ms 852 KB Output is correct
18 Correct 3 ms 852 KB Output is correct
19 Correct 2 ms 872 KB Output is correct
20 Correct 3 ms 876 KB Output is correct
21 Correct 3 ms 876 KB Output is correct
22 Correct 3 ms 876 KB Output is correct
23 Correct 3 ms 876 KB Output is correct
24 Correct 2 ms 876 KB Output is correct
25 Correct 3 ms 1060 KB Output is correct
26 Correct 3 ms 1060 KB Output is correct
27 Correct 4 ms 1060 KB Output is correct
28 Correct 5 ms 1060 KB Output is correct
29 Correct 4 ms 1060 KB Output is correct
30 Correct 3 ms 1060 KB Output is correct
31 Correct 4 ms 1060 KB Output is correct
32 Correct 4 ms 1060 KB Output is correct
33 Correct 3 ms 1076 KB Output is correct
34 Correct 5 ms 1244 KB Output is correct
35 Correct 4 ms 1272 KB Output is correct
36 Correct 5 ms 1296 KB Output is correct
37 Correct 5 ms 1324 KB Output is correct
38 Correct 7 ms 1356 KB Output is correct
39 Correct 6 ms 1388 KB Output is correct
40 Correct 6 ms 1408 KB Output is correct
41 Correct 6 ms 1444 KB Output is correct
42 Correct 4 ms 1464 KB Output is correct
43 Correct 5 ms 1464 KB Output is correct
44 Correct 7 ms 1464 KB Output is correct
45 Correct 6 ms 1524 KB Output is correct
46 Correct 6 ms 1544 KB Output is correct
47 Correct 6 ms 1564 KB Output is correct
48 Correct 5 ms 1584 KB Output is correct
49 Correct 6 ms 1604 KB Output is correct
50 Correct 8 ms 1624 KB Output is correct
51 Correct 5 ms 1644 KB Output is correct
52 Correct 6 ms 1668 KB Output is correct
53 Correct 6 ms 1684 KB Output is correct
54 Correct 7 ms 1704 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1704 KB Output is correct
2 Correct 3 ms 1704 KB Output is correct
3 Correct 2 ms 1704 KB Output is correct
4 Correct 3 ms 1704 KB Output is correct
5 Correct 3 ms 1704 KB Output is correct
6 Correct 3 ms 1704 KB Output is correct
7 Correct 2 ms 1704 KB Output is correct
8 Correct 2 ms 1704 KB Output is correct
9 Correct 2 ms 1704 KB Output is correct
10 Correct 2 ms 1704 KB Output is correct
11 Correct 3 ms 1704 KB Output is correct
12 Correct 3 ms 1704 KB Output is correct
13 Correct 3 ms 1704 KB Output is correct
14 Correct 4 ms 1704 KB Output is correct
15 Correct 4 ms 1704 KB Output is correct
16 Correct 3 ms 1704 KB Output is correct
17 Correct 3 ms 1704 KB Output is correct
18 Correct 2 ms 1704 KB Output is correct
19 Correct 3 ms 1704 KB Output is correct
20 Correct 2 ms 1704 KB Output is correct
21 Correct 3 ms 1704 KB Output is correct
22 Correct 2 ms 1704 KB Output is correct
23 Correct 2 ms 1704 KB Output is correct
24 Correct 2 ms 1704 KB Output is correct
25 Correct 5 ms 1704 KB Output is correct
26 Correct 4 ms 1704 KB Output is correct
27 Correct 3 ms 1704 KB Output is correct
28 Correct 3 ms 1704 KB Output is correct
29 Correct 3 ms 1704 KB Output is correct
30 Correct 3 ms 1704 KB Output is correct
31 Correct 3 ms 1704 KB Output is correct
32 Correct 3 ms 1704 KB Output is correct
33 Correct 3 ms 1704 KB Output is correct
34 Correct 6 ms 1820 KB Output is correct
35 Correct 7 ms 1820 KB Output is correct
36 Correct 6 ms 1892 KB Output is correct
37 Correct 5 ms 1912 KB Output is correct
38 Correct 4 ms 1932 KB Output is correct
39 Correct 6 ms 1952 KB Output is correct
40 Correct 5 ms 1972 KB Output is correct
41 Correct 5 ms 1992 KB Output is correct
42 Correct 5 ms 2012 KB Output is correct
43 Correct 4 ms 2032 KB Output is correct
44 Correct 4 ms 2056 KB Output is correct
45 Correct 6 ms 2180 KB Output is correct
46 Correct 7 ms 2180 KB Output is correct
47 Correct 5 ms 2180 KB Output is correct
48 Correct 7 ms 2180 KB Output is correct
49 Correct 5 ms 2180 KB Output is correct
50 Correct 6 ms 2180 KB Output is correct
51 Correct 8 ms 2192 KB Output is correct
52 Correct 6 ms 2216 KB Output is correct
53 Correct 6 ms 2232 KB Output is correct
54 Correct 6 ms 2252 KB Output is correct
55 Correct 143 ms 6752 KB Output is correct
56 Correct 118 ms 7760 KB Output is correct
57 Correct 108 ms 8740 KB Output is correct
58 Correct 136 ms 9632 KB Output is correct
59 Correct 127 ms 10656 KB Output is correct
60 Correct 127 ms 11764 KB Output is correct
61 Correct 129 ms 12700 KB Output is correct
62 Correct 120 ms 13548 KB Output is correct
63 Correct 93 ms 14560 KB Output is correct
64 Correct 73 ms 15536 KB Output is correct
65 Correct 81 ms 16276 KB Output is correct
66 Correct 120 ms 16276 KB Output is correct
67 Correct 129 ms 16400 KB Output is correct
68 Correct 126 ms 16432 KB Output is correct
69 Correct 122 ms 16432 KB Output is correct
70 Correct 124 ms 16432 KB Output is correct
71 Correct 123 ms 16432 KB Output is correct
72 Correct 126 ms 16432 KB Output is correct
73 Correct 120 ms 16432 KB Output is correct
74 Correct 93 ms 16432 KB Output is correct
75 Correct 99 ms 16432 KB Output is correct
76 Correct 298 ms 18908 KB Output is correct
77 Correct 269 ms 18908 KB Output is correct
78 Correct 283 ms 18908 KB Output is correct
79 Correct 246 ms 18908 KB Output is correct
80 Correct 246 ms 18932 KB Output is correct
81 Correct 324 ms 18948 KB Output is correct
82 Correct 266 ms 18984 KB Output is correct
83 Correct 265 ms 19056 KB Output is correct
84 Correct 311 ms 19056 KB Output is correct
85 Correct 536 ms 21896 KB Output is correct
86 Correct 484 ms 23024 KB Output is correct
87 Correct 580 ms 26828 KB Output is correct
88 Correct 528 ms 30832 KB Output is correct
89 Correct 452 ms 34972 KB Output is correct
90 Correct 447 ms 38980 KB Output is correct
91 Correct 556 ms 43068 KB Output is correct
92 Correct 470 ms 46896 KB Output is correct
93 Correct 427 ms 50836 KB Output is correct
94 Execution timed out 1084 ms 66808 KB Time limit exceeded
95 Halted 0 ms 0 KB -