oj.uz

Submission #306187

# Submission time Handle Problem Language Result Execution time Memory
306187 2020-09-24T19:57:10 Z CaroLinda Stray Cat (JOI20_stray) C++14
14 / 100
 75 ms 20220 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 ) //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 ) ;
				 
	}
 
}
 
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\n", y[0] , y[1] ) ;
	
	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[0] || !y[1] ) return -1 ;

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

		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:74:38: warning: left operand of comma operator has no effect [-Wunused-value]
   74 |  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\n", y[0] , y[1] ) ;
      |        ^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

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

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 20220 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 18036 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 18036 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 5 ms 9984 KB Output is correct
4 Correct 5 ms 10240 KB Output is correct
5 Correct 5 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 5 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 9984 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 9984 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 6 ms 9984 KB Output is correct
27 Correct 5 ms 10240 KB Output is correct
28 Correct 5 ms 9984 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 15676 KB Output is correct
2 Correct 53 ms 16800 KB Output is correct
3 Correct 4 ms 9984 KB Output is correct
4 Correct 41 ms 15472 KB Output is correct
5 Correct 60 ms 18072 KB Output is correct
6 Correct 61 ms 18064 KB Output is correct
7 Correct 49 ms 17164 KB Output is correct
8 Correct 50 ms 17164 KB Output is correct
9 Correct 61 ms 17908 KB Output is correct
10 Correct 63 ms 17908 KB Output is correct
11 Correct 62 ms 18048 KB Output is correct
12 Correct 62 ms 17936 KB Output is correct
13 Correct 62 ms 17932 KB Output is correct
14 Correct 75 ms 17932 KB Output is correct
15 Correct 62 ms 17908 KB Output is correct
16 Correct 63 ms 17928 KB Output is correct
17 Correct 59 ms 17532 KB Output is correct
18 Correct 57 ms 17564 KB Output is correct
19 Correct 59 ms 17532 KB Output is correct
20 Correct 62 ms 17664 KB Output is correct
21 Correct 55 ms 17984 KB Output is correct
22 Correct 57 ms 17532 KB Output is correct
23 Correct 50 ms 15836 KB Output is correct
24 Correct 46 ms 15804 KB Output is correct
25 Correct 51 ms 16252 KB Output is correct
26 Correct 53 ms 16024 KB Output is correct
27 Correct 53 ms 16924 KB Output is correct
28 Correct 60 ms 17320 KB Output is correct
29 Correct 68 ms 16984 KB Output is correct
30 Correct 56 ms 17220 KB Output is correct
31 Correct 47 ms 15848 KB Output is correct
32 Correct 46 ms 15844 KB Output is correct
33 Correct 47 ms 16244 KB Output is correct
34 Correct 50 ms 16136 KB Output is correct
35 Correct 56 ms 16628 KB Output is correct
36 Correct 55 ms 16884 KB Output is correct
37 Correct 55 ms 16764 KB Output is correct
38 Correct 55 ms 16764 KB Output is correct
39 Correct 63 ms 16972 KB Output is correct
40 Correct 57 ms 16852 KB Output is correct
41 Correct 57 ms 17344 KB Output is correct
42 Correct 61 ms 17468 KB Output is correct
43 Correct 57 ms 17140 KB Output is correct
44 Correct 62 ms 17356 KB Output is correct
45 Correct 60 ms 17344 KB Output is correct
46 Correct 57 ms 17268 KB Output is correct
47 Correct 53 ms 16548 KB Output is correct
48 Correct 53 ms 16600 KB Output is correct
49 Correct 50 ms 16500 KB Output is correct
50 Correct 52 ms 16924 KB Output is correct
51 Correct 49 ms 15920 KB Output is correct
52 Correct 48 ms 15740 KB Output is correct
53 Correct 49 ms 15916 KB Output is correct
54 Correct 53 ms 16112 KB Output is correct
55 Correct 48 ms 15920 KB Output is correct
56 Correct 48 ms 15912 KB Output is correct
57 Incorrect 45 ms 15740 KB Wrong Answer [6]
58 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 15612 KB Output is correct
2 Correct 51 ms 16544 KB Output is correct
3 Correct 4 ms 9984 KB Output is correct
4 Correct 43 ms 15352 KB Output is correct
5 Correct 62 ms 17924 KB Output is correct
6 Correct 62 ms 18028 KB Output is correct
7 Correct 49 ms 17020 KB Output is correct
8 Correct 50 ms 17164 KB Output is correct
9 Correct 63 ms 17908 KB Output is correct
10 Correct 62 ms 17920 KB Output is correct
11 Correct 63 ms 18052 KB Output is correct
12 Correct 63 ms 18056 KB Output is correct
13 Correct 63 ms 17900 KB Output is correct
14 Correct 65 ms 18060 KB Output is correct
15 Correct 62 ms 17912 KB Output is correct
16 Correct 62 ms 17940 KB Output is correct
17 Correct 59 ms 17684 KB Output is correct
18 Correct 56 ms 17800 KB Output is correct
19 Correct 57 ms 17528 KB Output is correct
20 Correct 57 ms 17676 KB Output is correct
21 Correct 59 ms 17676 KB Output is correct
22 Correct 61 ms 17836 KB Output is correct
23 Correct 49 ms 15612 KB Output is correct
24 Correct 46 ms 15852 KB Output is correct
25 Correct 50 ms 15988 KB Output is correct
26 Correct 48 ms 16020 KB Output is correct
27 Correct 56 ms 17064 KB Output is correct
28 Correct 55 ms 16928 KB Output is correct
29 Correct 56 ms 16904 KB Output is correct
30 Correct 55 ms 16756 KB Output is correct
31 Correct 47 ms 15732 KB Output is correct
32 Correct 47 ms 15968 KB Output is correct
33 Correct 48 ms 16028 KB Output is correct
34 Correct 48 ms 16136 KB Output is correct
35 Correct 54 ms 16972 KB Output is correct
36 Correct 55 ms 16764 KB Output is correct
37 Correct 54 ms 16636 KB Output is correct
38 Correct 55 ms 16916 KB Output is correct
39 Correct 53 ms 16764 KB Output is correct
40 Correct 55 ms 16852 KB Output is correct
41 Correct 59 ms 17140 KB Output is correct
42 Correct 56 ms 17148 KB Output is correct
43 Correct 57 ms 17344 KB Output is correct
44 Correct 57 ms 17360 KB Output is correct
45 Correct 57 ms 17356 KB Output is correct
46 Correct 57 ms 17276 KB Output is correct
47 Correct 52 ms 16556 KB Output is correct
48 Correct 51 ms 16528 KB Output is correct
49 Correct 51 ms 16532 KB Output is correct
50 Correct 54 ms 16624 KB Output is correct
51 Correct 48 ms 15920 KB Output is correct
52 Correct 48 ms 16052 KB Output is correct
53 Correct 48 ms 15740 KB Output is correct
54 Correct 50 ms 15996 KB Output is correct
55 Correct 49 ms 15916 KB Output is correct
56 Correct 47 ms 16048 KB Output is correct
57 Correct 48 ms 15944 KB Output is correct
58 Correct 48 ms 15740 KB Output is correct
59 Correct 48 ms 15972 KB Output is correct
60 Correct 49 ms 15984 KB Output is correct