oj.uz

Submission #313732

# Submission time Handle Problem Language Result Execution time Memory
313732 2020-10-16T20:20:08 Z CaroLinda Amusement Park (JOI17_amusement_park) C++14
28 / 100
 41 ms 4580 KB 
#include "Joi.h"
#include <bits/stdc++.h>

#define sz(x) (int)(x.size())
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define ll long long

using namespace std ;

vector<int> ordem ;
vector< vector<int> > adj ;
vector<bool> vis ;

void dfs(int x)
{
	vis[x] = true ;
	ordem.push_back(x) ;

	for(auto e : adj[x])
	{
		
		if(vis[e]) continue ;

		dfs(e) ;
		ordem.push_back(x) ;
	}

}

int isOn(int i, ll x ) { return ((1LL<<i)&x) != 0; }

void Joi(int N, int M, int A[], int B[], long long X, int T) 
{

	adj.resize( N+10 , vector<int>() )	 ;
	vis.resize(N+10,false) ;

	for(int i= 0 ; i < M ; i++ ) 
	{
		adj[ A[i] ].push_back( B[i] ) ;
		adj[ B[i] ].push_back( A[i] ) ;
	}

	for(int i = 0 ; i < N ; i++ ) sort(all(adj[i]));

	dfs(0) ;

	vector<int> freq(60, 0) ;
  	vector<int> val(N+10, -1) ;

  for(int i = 0 ; i < sz(ordem) ; i++ )
  {
  	if( i-120 >= 0 )
  		freq[ val[ordem[i-120]] ]-- ;

  	if(val[ ordem[i] ] == -1)
  	{
  		val[ordem[i]] = 0 ;

  		for(int j = 0 ; j < 60 ; j++ )
  			if(freq[j] == 0) 
  			{
  				val[ ordem[i] ] = j ;
  				break ;
  			}
  	}

  	freq[ val[ ordem[i] ] ]++ ;

  }	

  for(int i = 0 ; i < N ; i++ ) 
  	MessageBoard( i, isOn(val[i] , X) ) ;

}

#include "Ioi.h"
#include <bits/stdc++.h>

#define debug printf
#define sz(x) (int)(x.size())
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define ll long long

using namespace std ;

vector<int> ord , tin , tout ;
vector< vector<int> > graph ;
vector<bool> mark ;

void dfsPrime(int x)
{
	tin[x] = tout[x] = sz(ord);
	mark[x] = true ;

	ord.push_back(x) ;

	for(auto e : graph[x])
	{
		if(mark[e]) continue ;
		
		dfsPrime(e) ;

		tout[x] = sz(ord) ;
		ord.push_back(x) ;
	}

}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) 
{

	graph.resize( N+10 , vector<int>() );
	tin.resize(N+10);
	tout.resize(N+10) ;
	mark.resize(N+10,false) ;

	for(int i= 0 ; i < M ; i++ ) 
	{
		graph[ A[i] ].push_back( B[i] ) ;
		graph[ B[i] ].push_back( A[i] ) ;
	}

	for(int i = 0 ; i < N ; i++ ) sort(all(graph[i]));

	dfsPrime(0) ;

	vector<int> freq(60, 0) ;
  	vector<int> val(N+10, -1) ;

  for(int i = 0 ; i < sz(ord) ; i++ )
  {
  	if( i-120 >= 0 )
  		freq[ val[ord[i-120]] ]-- ;

  	if(val[ ord[i] ] == -1)
  	{
  		val[ord[i]] = 0 ;

  		for(int j = 0 ; j < 60 ; j++ )
  			if(freq[j] == 0) 
  			{
  				val[ ord[i] ] = j ;
  				break ;
  			}
  	}
  	
  	freq[ val[ ord[i] ] ]++ ;

  }	

  int ptrBeg , ptrEn ;

  for(int i = 0 ; i < sz(ord) ; i++ )
  	if(ord[i] == P) { ptrBeg = ptrEn = i ; break ; }

  vector<int> achei(60,0) ;
  achei[ val[P] ] = V ;

  int qtd = (T == 3) ? 200 : 20000 ;

  while(qtd--)
  {
  	//cout << ptrBeg << " " << ptrEn << " " << qtd <<  " " << tin[P]<<" " << tout[P] << " " << P << endl ;

  	if( ptrBeg == tin[P] && ptrEn == tout[P] )
	{
		if(ptrBeg == 0 || ptrEn+1 == sz(ord)) break ;

		P = ord[ptrBeg-1] ;

		achei[ val[P] ] = Move(P) ;
		
		ptrBeg-- ;
		ptrEn++ ;

	}  
	else 
	{
		if( ptrBeg > tin[P]  )
		{
			achei[ val[ ord[ptrBeg-1] ] ] = Move(ord[ptrBeg-1]) ;
			ptrBeg-- ;
		}
		else 
		{
			achei[ val[ord[ptrEn+1]] ] = Move(ord[ptrEn+1]);
			ptrEn++ ;
		}
	}

  }

  ll x = 0LL ;
  for(int i = 0 ; i< 60 ; i++ )
  	x += (1LL<<i) * achei[i] ;

  return x ;

}

Compilation message

Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:94:26: warning: 'ptrEn' may be used uninitialized in this function [-Wmaybe-uninitialized]
   94 |   if(ptrBeg == 0 || ptrEn+1 == sz(ord)) break ;
      |                     ~~~~~^~
Ioi.cpp:108:51: warning: 'ptrBeg' may be used uninitialized in this function [-Wmaybe-uninitialized]
  108 |    achei[ val[ ord[ptrBeg-1] ] ] = Move(ord[ptrBeg-1]) ;
      |                                             ~~~~~~^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1008 KB Output is correct
2 Correct 2 ms 1284 KB Output is correct
3 Correct 2 ms 908 KB Output is correct
4 Correct 1 ms 772 KB Output is correct
5 Correct 1 ms 1016 KB Output is correct
6 Correct 2 ms 1000 KB Output is correct
7 Correct 2 ms 984 KB Output is correct
8 Correct 2 ms 996 KB Output is correct
9 Correct 2 ms 784 KB Output is correct
10 Correct 2 ms 1004 KB Output is correct
11 Correct 5 ms 1124 KB Output is correct
12 Correct 1 ms 1140 KB Output is correct
13 Correct 2 ms 1004 KB Output is correct
14 Correct 2 ms 1040 KB Output is correct
15 Correct 2 ms 996 KB Output is correct
16 Correct 2 ms 784 KB Output is correct
17 Correct 2 ms 996 KB Output is correct
18 Correct 2 ms 1296 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 4580 KB Output is correct
2 Correct 33 ms 4580 KB Output is correct
3 Correct 37 ms 4452 KB Output is correct
4 Correct 22 ms 3276 KB Output is correct
5 Correct 22 ms 3796 KB Output is correct
6 Correct 22 ms 3628 KB Output is correct
7 Correct 20 ms 3624 KB Output is correct
8 Correct 22 ms 3532 KB Output is correct
9 Correct 25 ms 3660 KB Output is correct
10 Correct 20 ms 3352 KB Output is correct
11 Correct 20 ms 3412 KB Output is correct
12 Correct 19 ms 3080 KB Output is correct
13 Correct 19 ms 3036 KB Output is correct
14 Correct 20 ms 3044 KB Output is correct
15 Correct 20 ms 3276 KB Output is correct
16 Correct 20 ms 3376 KB Output is correct
17 Correct 20 ms 3276 KB Output is correct
18 Correct 20 ms 3380 KB Output is correct
19 Correct 20 ms 3148 KB Output is correct
20 Correct 18 ms 3656 KB Output is correct
21 Correct 17 ms 3812 KB Output is correct
22 Correct 20 ms 3672 KB Output is correct
23 Correct 22 ms 3852 KB Output is correct
24 Correct 22 ms 3888 KB Output is correct
25 Correct 22 ms 3864 KB Output is correct
26 Correct 23 ms 3896 KB Output is correct
27 Correct 20 ms 3768 KB Output is correct
28 Correct 22 ms 3856 KB Output is correct
29 Correct 20 ms 3560 KB Output is correct
30 Correct 20 ms 3504 KB Output is correct
31 Correct 2 ms 996 KB Output is correct
32 Correct 2 ms 904 KB Output is correct
33 Correct 2 ms 980 KB Output is correct
34 Correct 2 ms 1160 KB Output is correct
35 Correct 1 ms 1008 KB Output is correct
36 Correct 1 ms 776 KB Output is correct
37 Correct 1 ms 1004 KB Output is correct
38 Correct 1 ms 776 KB Output is correct
39 Correct 2 ms 1012 KB Output is correct
40 Correct 2 ms 1032 KB Output is correct
41 Correct 2 ms 1176 KB Output is correct
42 Correct 2 ms 904 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 900 KB Output is correct
2 Correct 2 ms 1020 KB Output is correct
3 Correct 2 ms 1024 KB Output is correct
4 Correct 3 ms 1564 KB Output is correct
5 Correct 4 ms 1188 KB Output is correct
6 Correct 3 ms 1316 KB Output is correct
7 Correct 4 ms 1444 KB Output is correct
8 Correct 4 ms 1560 KB Output is correct
9 Correct 17 ms 4040 KB Output is correct
10 Correct 18 ms 4212 KB Output is correct
11 Correct 17 ms 4040 KB Output is correct
12 Correct 1 ms 1016 KB Output is correct
13 Correct 0 ms 772 KB Output is correct
14 Correct 2 ms 1024 KB Output is correct
15 Correct 1 ms 900 KB Output is correct

Subtask #4
0.0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 4580 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 4452 KB Output isn't correct
2 Halted 0 ms 0 KB -