oj.uz

Submission #306192

# Submission time Handle Problem Language Result Execution time Memory
306192 2020-09-24T20:19:45 Z CaroLinda Stray Cat (JOI20_stray) C++14
5 / 100
 71 ms 20252 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
 
#define debug //printf
#define pii pair<int,int>
#define ff first
#define ss second
#define mk make_pair
#define sz(x) (int)(x.size() )
#define ll long long
#define all(x) x.begin(),x.end()
 
const int MAXN = 2e5+10 ;
 
using namespace std ;
 
vector<pii> adj[MAXN] ;
vector<int> marcas ;
int seq[6] = {0,1,0,0,1,1} ;
 
void dfs(int x, int father , int curIdx , int dist = 1 ) //curIdx eh o que eu tenho que colocar nas minhas proximas arestas
{

	
	if( sz(adj[x]) != 2 ) curIdx = !seq[curIdx] ;
	else curIdx = (curIdx == 5) ? 0 : (curIdx+1) ;

	for(auto e : adj[x] ) 
	{
		if(e.ff == father )  continue ;
 
		marcas[e.ss] = seq[curIdx] ;
 
      dfs(e.ff, x, curIdx , dist+1 ) ;
				 
	}
 
}
 
void dfs3(int x, int father, int toFill )
{
 
	for(auto e : adj[x] )
	{
		if(e.ff == father) continue ;
 
		marcas[e.ss] = toFill ;
 
		dfs3(e.ff, x,  (toFill == 2 ) ? 0 : (toFill+1) ) ;
 
	}
}
 
vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) 
{
 
	for(int i = 0 ; i < M ; i++ )
	{
		adj[ U[i] ].push_back(mk(V[i] , i ) ) ;
		adj[ V[i] ].push_back( mk(U[i],i) )  ;
	}
 
	marcas.resize(M, 0) ;
 
	if(A >= 3 ) dfs3(0,-1, 0) ;
	else
	{
		for(auto neigh : adj[0] )
		{
			marcas[neigh.ss] = 0 ;
			dfs(neigh.ff, 0, 0 ) ;
		}
	}	
 
	for(int i = 0 ; i < M ; i++ ) debug("Pintei %d %d de %d\n", U[i] , V[i] , marcas[i] ) ;
 
	return marcas ;
}
#include "Catherine.h"
#include <bits/stdc++.h>

#define debug //printf
#define sz(x) (int)(x.size())
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define pii pair<int,int>

using namespace std ;

set< string > reversedOrder ;

void Init(int A, int B) 
{
	string seq = "010011" ;

	//Creating reversedOrder
	for(int i = 0 ,ant = 5 ; i < 6 ; i++ , ant++ )
	{

		if(ant == 6 ) ant = 0 ;

		string str ;
		for(int j = i; j != ant ; j = (j == 5 ) ? 0 : (j+1) )
			str.push_back(seq[j] ) ;

		reversedOrder.insert(str) ;
	}
	                          
}

bool justGo , isFirst = true ;
int wentBefore ;
string str ;

int Move(vector<int> y) 
{
	
	debug("meu vetor ta %d %d e justGo eh %d\n", y[0] , y[1] , justGo) ;
	
	int qtdNeigh = y[0] + y[1] ;
	
	if(qtdNeigh == 0)
	{
		justGo = true ;
		return -1 ;
	}

	if(isFirst)
	{
		isFirst = false ;

		if(qtdNeigh == 1 )
		{
			
			wentBefore = (y[0] == 1 ) ? 0 : 1 ;
			justGo = true ;
			return wentBefore ;
		}
		if(qtdNeigh == 2 )
		{

			if( y[0] && y[1] )
			{
				str.push_back('0') ;
				str.push_back('1') ;
				wentBefore = 1 ;
				return 1 ;
			}
			int idx = (y[0] > y[1] ) ? 0 : 1 ;

			str.push_back('0' + idx ) ;
			str.push_back('0' + idx ) ;
			wentBefore = idx ;
			return idx ;

		}

	   wentBefore = (y[0] < y[1] ) ? 0 : 1 ;
	   justGo = true ;

		return wentBefore ;
	}

	if(justGo)
	{
		if( qtdNeigh == 1 )
		{

			wentBefore = (y[0] > y[1] ) ? 0 : 1 ;
			return wentBefore ;
		}

		wentBefore = !wentBefore ;
		return wentBefore ;
	}

	if(qtdNeigh > 1 )
	{
		justGo = true ;
		
		if(y[!wentBefore] != 0 ) return -1 ;

		wentBefore = !wentBefore;
		return wentBefore;

	}

	//Ainda estou presa na corrente
	str.push_back( '0' + ( (y[0] == 1) ? 0 : 1 ) ) ;

	if(sz(str) == 5 )
	{


		justGo = true ;

		if( reversedOrder.find(str) != reversedOrder.end() ) return -1 ;
		else 
		{
			wentBefore = (y[0] == 1 ) ? 0 : 1 ;
			return wentBefore ;
		}
	}

	wentBefore = (y[0] == 1 ) ? 0 : 1 ;

	return wentBefore ;

}

Compilation message

Anthony.cpp: In function 'std::vector<int> Mark(int, int, int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:75:38: warning: left operand of comma operator has no effect [-Wunused-value]
   75 |  for(int i = 0 ; i < M ; i++ ) debug("Pintei %d %d de %d\n", U[i] , V[i] , marcas[i] ) ;
      |                                      ^~~~~~~~~~~~~~~~~~~~~~

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:43:8: warning: left operand of comma operator has no effect [-Wunused-value]
   43 |  debug("meu vetor ta %d %d e justGo eh %d\n", y[0] , y[1] , justGo) ;
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 20252 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 20252 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 18072 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 18072 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 15824 KB Output is correct
2 Correct 56 ms 16756 KB Output is correct
3 Correct 5 ms 9984 KB Output is correct
4 Correct 41 ms 15472 KB Output is correct
5 Correct 61 ms 18284 KB Output is correct
6 Correct 61 ms 18388 KB Output is correct
7 Correct 54 ms 17612 KB Output is correct
8 Correct 53 ms 17404 KB Output is correct
9 Correct 62 ms 18292 KB Output is correct
10 Correct 61 ms 18404 KB Output is correct
11 Correct 63 ms 18380 KB Output is correct
12 Correct 64 ms 18392 KB Output is correct
13 Correct 71 ms 18292 KB Output is correct
14 Correct 67 ms 18508 KB Output is correct
15 Correct 64 ms 18292 KB Output is correct
16 Correct 63 ms 18408 KB Output is correct
17 Correct 63 ms 18260 KB Output is correct
18 Correct 61 ms 18268 KB Output is correct
19 Correct 57 ms 18136 KB Output is correct
20 Correct 60 ms 18128 KB Output is correct
21 Correct 61 ms 18060 KB Output is correct
22 Correct 60 ms 18020 KB Output is correct
23 Correct 48 ms 15752 KB Output is correct
24 Correct 47 ms 15828 KB Output is correct
25 Correct 49 ms 16124 KB Output is correct
26 Correct 49 ms 16124 KB Output is correct
27 Correct 55 ms 17028 KB Output is correct
28 Correct 55 ms 17156 KB Output is correct
29 Correct 56 ms 17376 KB Output is correct
30 Correct 55 ms 17268 KB Output is correct
31 Correct 47 ms 15848 KB Output is correct
32 Correct 49 ms 15972 KB Output is correct
33 Correct 49 ms 15996 KB Output is correct
34 Correct 54 ms 16172 KB Output is correct
35 Correct 58 ms 16976 KB Output is correct
36 Incorrect 52 ms 17100 KB Wrong Answer [6]
37 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 15612 KB Output is correct
2 Incorrect 51 ms 16648 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -