oj.uz

Submission #100995

# Submission time Handle Problem Language Result Execution time Memory
100995 2019-03-16T01:56:11 Z autumn_eel Amusement Park (JOI17_amusement_park) C++14
28 / 100
 73 ms 6524 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;
	for(int v:vs){
		if(!se1.count(v)){
			se2.insert(v);
		}
		if(se2.size()==60){
			int cnt=0;
			for(int i:se2){
				MessageBoard(i,X>>cnt&1);
				cnt++;
			}
			for(int i:se2){
				se1.insert(i);
			}
			se2.clear();
		}
	}
	int cnt=0;
	for(int i:se2){
		MessageBoard(i,X>>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;
	for(int v:vs){
		if(!se1.count(v)){
			se2.insert(v);
		}
		if(se2.size()==60){
			int cnt=0;
			for(int i:se2){
				id[i]=cnt;
				cnt++;
			}
			for(int i:se2){
				se1.insert(i);
			}
			se2.clear();
		}
	}
	int cnt=0;
	for(int i:se2){
		id[i]=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:57:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(r=x;r<vs.size();r++){
          ~^~~~~~~~~~
Ioi.cpp:61: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 1796 KB Output is correct
2 Correct 6 ms 1800 KB Output is correct
3 Correct 11 ms 1884 KB Output is correct
4 Correct 6 ms 1904 KB Output is correct
5 Correct 6 ms 1928 KB Output is correct
6 Correct 5 ms 1800 KB Output is correct
7 Correct 5 ms 1888 KB Output is correct
8 Correct 5 ms 1924 KB Output is correct
9 Correct 7 ms 1804 KB Output is correct
10 Correct 6 ms 1904 KB Output is correct
11 Correct 8 ms 2096 KB Output is correct
12 Correct 5 ms 1800 KB Output is correct
13 Correct 6 ms 1804 KB Output is correct
14 Correct 6 ms 1904 KB Output is correct
15 Correct 7 ms 1924 KB Output is correct
16 Correct 7 ms 1888 KB Output is correct
17 Correct 6 ms 1924 KB Output is correct
18 Correct 6 ms 1884 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 6228 KB Output is correct
2 Correct 66 ms 6432 KB Output is correct
3 Correct 52 ms 6524 KB Output is correct
4 Correct 38 ms 5000 KB Output is correct
5 Correct 40 ms 5508 KB Output is correct
6 Correct 40 ms 5104 KB Output is correct
7 Correct 36 ms 5128 KB Output is correct
8 Correct 67 ms 5240 KB Output is correct
9 Correct 35 ms 5352 KB Output is correct
10 Correct 32 ms 5012 KB Output is correct
11 Correct 31 ms 5012 KB Output is correct
12 Correct 31 ms 4584 KB Output is correct
13 Correct 32 ms 4656 KB Output is correct
14 Correct 40 ms 4684 KB Output is correct
15 Correct 32 ms 4868 KB Output is correct
16 Correct 37 ms 5044 KB Output is correct
17 Correct 37 ms 5008 KB Output is correct
18 Correct 44 ms 5008 KB Output is correct
19 Correct 41 ms 5076 KB Output is correct
20 Correct 26 ms 5400 KB Output is correct
21 Correct 24 ms 5272 KB Output is correct
22 Correct 35 ms 5128 KB Output is correct
23 Correct 38 ms 5256 KB Output is correct
24 Correct 38 ms 5320 KB Output is correct
25 Correct 37 ms 5292 KB Output is correct
26 Correct 41 ms 5264 KB Output is correct
27 Correct 44 ms 5256 KB Output is correct
28 Correct 43 ms 5704 KB Output is correct
29 Correct 41 ms 4856 KB Output is correct
30 Correct 39 ms 4988 KB Output is correct
31 Correct 5 ms 1664 KB Output is correct
32 Correct 6 ms 1800 KB Output is correct
33 Correct 6 ms 1924 KB Output is correct
34 Correct 6 ms 1916 KB Output is correct
35 Correct 4 ms 1688 KB Output is correct
36 Correct 5 ms 1696 KB Output is correct
37 Correct 5 ms 1800 KB Output is correct
38 Correct 6 ms 1800 KB Output is correct
39 Correct 6 ms 1928 KB Output is correct
40 Correct 5 ms 1664 KB Output is correct
41 Correct 4 ms 1912 KB Output is correct
42 Correct 6 ms 1672 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1792 KB Output is correct
2 Correct 7 ms 2060 KB Output is correct
3 Correct 6 ms 1800 KB Output is correct
4 Correct 9 ms 2468 KB Output is correct
5 Correct 9 ms 2448 KB Output is correct
6 Correct 8 ms 2204 KB Output is correct
7 Correct 8 ms 2448 KB Output is correct
8 Correct 8 ms 2332 KB Output is correct
9 Correct 31 ms 5696 KB Output is correct
10 Correct 28 ms 5704 KB Output is correct
11 Correct 30 ms 5696 KB Output is correct
12 Correct 4 ms 1664 KB Output is correct
13 Correct 6 ms 1664 KB Output is correct
14 Correct 5 ms 1924 KB Output is correct
15 Correct 6 ms 1664 KB Output is correct

Subtask #4
0.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 6228 KB Output is correct
2 Partially correct 51 ms 6396 KB Partially correct
3 Partially correct 52 ms 6508 KB Partially correct
4 Partially correct 40 ms 5048 KB Partially correct
5 Partially correct 44 ms 5496 KB Partially correct
6 Partially correct 38 ms 5348 KB Partially correct
7 Correct 43 ms 5268 KB Output is correct
8 Correct 36 ms 5248 KB Output is correct
9 Correct 36 ms 5120 KB Output is correct
10 Partially correct 37 ms 4996 KB Partially correct
11 Partially correct 39 ms 5004 KB Partially correct
12 Partially correct 39 ms 4592 KB Partially correct
13 Partially correct 33 ms 4592 KB Partially correct
14 Partially correct 41 ms 4868 KB Partially correct
15 Partially correct 39 ms 4940 KB Partially correct
16 Partially correct 38 ms 4880 KB Partially correct
17 Partially correct 41 ms 4872 KB Partially correct
18 Correct 38 ms 4852 KB Output is correct
19 Partially correct 45 ms 5100 KB Partially correct
20 Incorrect 26 ms 5384 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 6116 KB Output is correct
2 Correct 49 ms 6360 KB Output is correct
3 Incorrect 46 ms 6468 KB Output isn't correct
4 Halted 0 ms 0 KB -