oj.uz

Submission #101045

# Submission time Handle Problem Language Result Execution time Memory
101045 2019-03-16T06:58:35 Z autumn_eel Amusement Park (JOI17_amusement_park) C++14
66 / 100
 62 ms 6228 KB 
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
 
#include "Joi.h"
 
vector<int>E[20000];
vector<int>vs;
bool used[20000];
 
void dfs(int v,int p){
	used[v]=true;
	vs.push_back(v);
	for(int u:E[v]){
		if(used[u])continue;
		dfs(u,v);
		vs.push_back(v);
	}
}
 
void Joi(int N, int M, int A[], int B[], long long X, int T) {
	rep(i,M){
		E[A[i]].push_back(B[i]);
		E[B[i]].push_back(A[i]);
	}
	dfs(0,-1);
	set<int>se1,se2;
	mt19937 mt(123456789);
	vector<int>V;
	rep(i,60)V.push_back(i);
	int MP[60]{};
	for(int v:vs){
		if(!se1.count(v)){
			se2.insert(v);
		}
		if(se2.size()==60){
			int cnt=0;
			shuffle(V.begin(),V.end(),mt);
			for(int i:se2){
				MP[V[cnt]]++;
				MessageBoard(i,X>>V[cnt]&1);
				cnt++;
			}
			for(int i:se2){
				se1.insert(i);
			}
			se2.clear();
		}
	}
	shuffle(V.begin(),V.end(),mt);
	int cnt=0;
	for(int i:se2){
		MP[V[cnt]]++;
		MessageBoard(i,X>>V[cnt]&1);
		cnt++;
	}
}

#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
 
#include "Ioi.h"
 
static vector<int>E[20000];
static vector<int>vs;
static int vid[20000];
static bool used[20000];
 
static void dfs(int v,int p){
	used[v]=true;
	vid[v]=vs.size();
	vs.push_back(v);
	for(int u:E[v]){
		if(used[u])continue;
		dfs(u,v);
		vs.push_back(v);
	}
}
 
long long Ioi(int N, int M, int A[], int B[], int Pos, int V, int T) {
	rep(i,M){
		E[A[i]].push_back(B[i]);
		E[B[i]].push_back(A[i]);
	}
	dfs(0,-1);
	set<int>se1,se2;
	map<int,int>id;
	mt19937 mt(123456789);
	vector<int>R;
	rep(i,60)R.push_back(i);
	for(int v:vs){
		if(!se1.count(v)){
			se2.insert(v);
		}
		if(se2.size()==60){
			shuffle(R.begin(),R.end(),mt);
			int cnt=0;
			for(int i:se2){
				id[i]=R[cnt];
				cnt++;
			}
			for(int i:se2){
				se1.insert(i);
			}
			se2.clear();
		}
	}
	int cnt=0;
	shuffle(R.begin(),R.end(),mt);
	for(int i:se2){
		id[i]=R[cnt];
		cnt++;
	}
	int x=vid[Pos];
	
	set<int>se;
	int r;
	for(r=x;r<vs.size();r++){
		se.insert(id[vs[r]]);
		if(se.size()==60)break;
	}
	if(r==vs.size())r=vs.size()-1;
	int l;
	for(l=x;l>=0;l--){
		se.insert(id[vs[l]]);
		if(se.size()==60)break;
	}
	if(l==-1)l=0;
	
	ll ans=0;
	ans|=ll(V)<<id[Pos];
	if(abs(x-l)<abs(x-r)){
		//left
		for(int i=x-1;i>=l;i--){
			ans|=ll(Move(vs[i]))<<id[vs[i]];
		}
		for(int i=l+1;i<=r;i++){
			ans|=ll(Move(vs[i]))<<id[vs[i]];
		}
	}
	else{
		//right
		for(int i=x+1;i<=r;i++){
			ans|=ll(Move(vs[i]))<<id[vs[i]];
		}
		for(int i=r-1;i>=l;i--){
			ans|=ll(Move(vs[i]))<<id[vs[i]];
		}
	}
	return ans;
	
}

Compilation message

Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:63:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(r=x;r<vs.size();r++){
          ~^~~~~~~~~~
Ioi.cpp:67:6: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(r==vs.size())r=vs.size()-1;
     ~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1688 KB Output is correct
2 Correct 6 ms 1684 KB Output is correct
3 Correct 6 ms 1924 KB Output is correct
4 Correct 6 ms 1908 KB Output is correct
5 Correct 5 ms 1792 KB Output is correct
6 Correct 7 ms 1900 KB Output is correct
7 Correct 7 ms 1924 KB Output is correct
8 Correct 8 ms 2060 KB Output is correct
9 Correct 6 ms 1796 KB Output is correct
10 Correct 5 ms 1664 KB Output is correct
11 Correct 8 ms 2104 KB Output is correct
12 Correct 6 ms 1800 KB Output is correct
13 Correct 6 ms 1924 KB Output is correct
14 Correct 7 ms 1924 KB Output is correct
15 Correct 6 ms 1924 KB Output is correct
16 Correct 6 ms 1804 KB Output is correct
17 Correct 7 ms 1888 KB Output is correct
18 Correct 8 ms 1932 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 6008 KB Output is correct
2 Correct 56 ms 6196 KB Output is correct
3 Correct 52 ms 5964 KB Output is correct
4 Correct 38 ms 4808 KB Output is correct
5 Correct 48 ms 5320 KB Output is correct
6 Correct 38 ms 5192 KB Output is correct
7 Correct 43 ms 5060 KB Output is correct
8 Correct 37 ms 5056 KB Output is correct
9 Correct 48 ms 5236 KB Output is correct
10 Correct 34 ms 5024 KB Output is correct
11 Correct 41 ms 4896 KB Output is correct
12 Correct 36 ms 4640 KB Output is correct
13 Correct 44 ms 4392 KB Output is correct
14 Correct 39 ms 4756 KB Output is correct
15 Correct 38 ms 4672 KB Output is correct
16 Correct 38 ms 4672 KB Output is correct
17 Correct 39 ms 4800 KB Output is correct
18 Correct 43 ms 4808 KB Output is correct
19 Correct 41 ms 4800 KB Output is correct
20 Correct 28 ms 5184 KB Output is correct
21 Correct 26 ms 5184 KB Output is correct
22 Correct 39 ms 5024 KB Output is correct
23 Correct 44 ms 5168 KB Output is correct
24 Correct 41 ms 5144 KB Output is correct
25 Correct 42 ms 5148 KB Output is correct
26 Correct 37 ms 5184 KB Output is correct
27 Correct 44 ms 5212 KB Output is correct
28 Correct 40 ms 5076 KB Output is correct
29 Correct 35 ms 4792 KB Output is correct
30 Correct 36 ms 4920 KB Output is correct
31 Correct 5 ms 1664 KB Output is correct
32 Correct 6 ms 1664 KB Output is correct
33 Correct 5 ms 1932 KB Output is correct
34 Correct 5 ms 1688 KB Output is correct
35 Correct 4 ms 1800 KB Output is correct
36 Correct 6 ms 1664 KB Output is correct
37 Correct 5 ms 1664 KB Output is correct
38 Correct 6 ms 1920 KB Output is correct
39 Correct 6 ms 1800 KB Output is correct
40 Correct 8 ms 1912 KB Output is correct
41 Correct 6 ms 1908 KB Output is correct
42 Correct 6 ms 1664 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1928 KB Output is correct
2 Correct 5 ms 1928 KB Output is correct
3 Correct 6 ms 1664 KB Output is correct
4 Correct 9 ms 2468 KB Output is correct
5 Correct 10 ms 2344 KB Output is correct
6 Correct 9 ms 2460 KB Output is correct
7 Correct 9 ms 2616 KB Output is correct
8 Correct 10 ms 2468 KB Output is correct
9 Correct 26 ms 5696 KB Output is correct
10 Correct 32 ms 5724 KB Output is correct
11 Correct 37 ms 5708 KB Output is correct
12 Correct 4 ms 1664 KB Output is correct
13 Correct 6 ms 1800 KB Output is correct
14 Correct 6 ms 1800 KB Output is correct
15 Correct 5 ms 1664 KB Output is correct

Subtask #4
38.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 6228 KB Output is correct
2 Partially correct 48 ms 6228 KB Partially correct
3 Partially correct 48 ms 6092 KB Partially correct
4 Partially correct 33 ms 4808 KB Partially correct
5 Partially correct 40 ms 5528 KB Partially correct
6 Partially correct 41 ms 5216 KB Partially correct
7 Correct 38 ms 5184 KB Output is correct
8 Correct 52 ms 4992 KB Output is correct
9 Correct 36 ms 5052 KB Output is correct
10 Partially correct 39 ms 4936 KB Partially correct
11 Partially correct 41 ms 5056 KB Partially correct
12 Partially correct 41 ms 4536 KB Partially correct
13 Partially correct 44 ms 4444 KB Partially correct
14 Partially correct 42 ms 4656 KB Partially correct
15 Partially correct 43 ms 4640 KB Partially correct
16 Partially correct 39 ms 4852 KB Partially correct
17 Partially correct 44 ms 4800 KB Partially correct
18 Correct 41 ms 4800 KB Output is correct
19 Partially correct 50 ms 4664 KB Partially correct
20 Partially correct 27 ms 5188 KB Partially correct
21 Partially correct 33 ms 5184 KB Partially correct
22 Correct 48 ms 5088 KB Output is correct
23 Correct 37 ms 5232 KB Output is correct
24 Partially correct 40 ms 5176 KB Partially correct
25 Partially correct 38 ms 5256 KB Partially correct
26 Partially correct 43 ms 5192 KB Partially correct
27 Partially correct 45 ms 5192 KB Partially correct
28 Correct 41 ms 4936 KB Output is correct
29 Partially correct 40 ms 4656 KB Partially correct
30 Partially correct 46 ms 4880 KB Partially correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 6188 KB Output is correct
2 Correct 60 ms 6056 KB Output is correct
3 Incorrect 57 ms 6064 KB Output isn't correct
4 Halted 0 ms 0 KB -