oj.uz

Submission #306200

# Submission time Handle Problem Language Result Execution time Memory
306200 2020-09-24T20:42:25 Z CaroLinda Stray Cat (JOI20_stray) C++14
89 / 100
 73 ms 16760 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 = 2e4+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(x == 14851 ) debug("%d\n", dist ) ;
 
	
	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 ) ;
				 
	}
 
}
  
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 )
	{
 
		//Constroi a arvore da bfs
 
		vector<int> fila ;
		vector<int> dist(N, -1) ;
 
		dist[0] = 0 ;
 
		int ini = 0 ;
		fila.push_back(0) ;
 
		while(ini < sz(fila) )
		{
			int x = fila[ini++] ;
 
			for(auto e : adj[x] ) 
			{
				if(dist[e.ff] != -1 )
				{
					marcas[e.ss] = max(dist[e.ff] , dist[x] ) % 3 ;
					continue ;
				}
 
				fila.push_back(e.ff) ;
				dist[e.ff] = dist[x] + 1 ;
 
				marcas[e.ss] = dist[x] % 3 ;
 
			}
 
		}
 
 
	}
	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 ;
bool is3 ;
 
void Init(int A, int B) 
{
	string seq = "010011" ;
 
	if(A >= 3 ) is3 = true ;
 
	//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) 
{
	if(is3)
	{
		int qtdNeigh = y[0] + y[1] + y[2] ;
 
		if(qtdNeigh == 1 ) 
		{
			for(int i = 0 ; i < 3 ; i++ )
				if(y[i] ) return i ;
		}
 
 
		if(	y[0] && y[1] ) return 0 ;
		if(y[1] && y[2] ) return 1 ;
		if(y[2] && y[0] ) return 2 ;
 
	}
 
	
	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] != 1 ) 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 'void dfs(int, int, int, int)':
Anthony.cpp:23:24: warning: left operand of comma operator has no effect [-Wunused-value]
   23 |  if(x == 14851 ) debug("%d\n", dist ) ;
      |                        ^~~~~~
Anthony.cpp: In function 'std::vector<int> Mark(int, int, int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:97:38: warning: left operand of comma operator has no effect [-Wunused-value]
   97 |  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:63:8: warning: left operand of comma operator has no effect [-Wunused-value]
   63 |  debug("meu vetor ta %d %d e justGo eh %d\n", y[0] , y[1] , justGo) ;
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 15700 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 44 ms 15068 KB Output is correct
4 Correct 72 ms 16760 KB Output is correct
5 Correct 69 ms 16596 KB Output is correct
6 Correct 53 ms 15432 KB Output is correct
7 Correct 54 ms 15444 KB Output is correct
8 Correct 65 ms 16304 KB Output is correct
9 Correct 61 ms 16308 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 15700 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 44 ms 15068 KB Output is correct
4 Correct 72 ms 16760 KB Output is correct
5 Correct 69 ms 16596 KB Output is correct
6 Correct 53 ms 15432 KB Output is correct
7 Correct 54 ms 15444 KB Output is correct
8 Correct 65 ms 16304 KB Output is correct
9 Correct 61 ms 16308 KB Output is correct
10 Incorrect 46 ms 13664 KB Wrong Answer [6]
11 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 13260 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 44 ms 12900 KB Output is correct
4 Correct 68 ms 14684 KB Output is correct
5 Correct 66 ms 14548 KB Output is correct
6 Correct 51 ms 13412 KB Output is correct
7 Correct 52 ms 13148 KB Output is correct
8 Correct 62 ms 14016 KB Output is correct
9 Correct 66 ms 13908 KB Output is correct
10 Correct 56 ms 13744 KB Output is correct
11 Correct 54 ms 13868 KB Output is correct
12 Correct 55 ms 13780 KB Output is correct
13 Correct 59 ms 13784 KB Output is correct
14 Correct 60 ms 14124 KB Output is correct
15 Correct 62 ms 14036 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 13260 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 44 ms 12900 KB Output is correct
4 Correct 68 ms 14684 KB Output is correct
5 Correct 66 ms 14548 KB Output is correct
6 Correct 51 ms 13412 KB Output is correct
7 Correct 52 ms 13148 KB Output is correct
8 Correct 62 ms 14016 KB Output is correct
9 Correct 66 ms 13908 KB Output is correct
10 Correct 56 ms 13744 KB Output is correct
11 Correct 54 ms 13868 KB Output is correct
12 Correct 55 ms 13780 KB Output is correct
13 Correct 59 ms 13784 KB Output is correct
14 Correct 60 ms 14124 KB Output is correct
15 Correct 62 ms 14036 KB Output is correct
16 Incorrect 43 ms 11504 KB Wrong Answer [6]
17 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 11500 KB Output is correct
2 Correct 56 ms 12620 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 40 ms 11328 KB Output is correct
5 Correct 70 ms 14196 KB Output is correct
6 Correct 68 ms 14080 KB Output is correct
7 Correct 51 ms 13180 KB Output is correct
8 Correct 54 ms 13152 KB Output is correct
9 Correct 73 ms 14068 KB Output is correct
10 Correct 61 ms 14072 KB Output is correct
11 Correct 63 ms 14076 KB Output is correct
12 Correct 62 ms 14288 KB Output is correct
13 Correct 67 ms 14132 KB Output is correct
14 Correct 66 ms 14188 KB Output is correct
15 Correct 66 ms 14116 KB Output is correct
16 Correct 62 ms 14068 KB Output is correct
17 Correct 69 ms 13920 KB Output is correct
18 Correct 60 ms 13912 KB Output is correct
19 Correct 60 ms 13800 KB Output is correct
20 Correct 57 ms 13796 KB Output is correct
21 Correct 73 ms 13908 KB Output is correct
22 Correct 57 ms 13696 KB Output is correct
23 Correct 44 ms 11516 KB Output is correct
24 Correct 46 ms 11388 KB Output is correct
25 Correct 48 ms 11980 KB Output is correct
26 Correct 52 ms 11900 KB Output is correct
27 Correct 53 ms 12696 KB Output is correct
28 Correct 68 ms 12788 KB Output is correct
29 Correct 60 ms 12920 KB Output is correct
30 Correct 55 ms 12916 KB Output is correct
31 Correct 46 ms 11680 KB Output is correct
32 Correct 45 ms 11644 KB Output is correct
33 Correct 46 ms 11900 KB Output is correct
34 Correct 47 ms 11964 KB Output is correct
35 Correct 56 ms 12532 KB Output is correct
36 Correct 52 ms 12888 KB Output is correct
37 Correct 53 ms 12712 KB Output is correct
38 Correct 61 ms 12660 KB Output is correct
39 Correct 55 ms 12744 KB Output is correct
40 Correct 56 ms 12660 KB Output is correct
41 Correct 57 ms 13300 KB Output is correct
42 Correct 57 ms 13308 KB Output is correct
43 Correct 61 ms 13300 KB Output is correct
44 Correct 59 ms 13436 KB Output is correct
45 Correct 65 ms 13424 KB Output is correct
46 Correct 60 ms 13420 KB Output is correct
47 Correct 53 ms 12412 KB Output is correct
48 Correct 50 ms 12444 KB Output is correct
49 Correct 52 ms 12404 KB Output is correct
50 Correct 52 ms 12568 KB Output is correct
51 Correct 54 ms 11704 KB Output is correct
52 Correct 53 ms 11692 KB Output is correct
53 Correct 67 ms 11500 KB Output is correct
54 Correct 68 ms 11508 KB Output is correct
55 Correct 49 ms 11700 KB Output is correct
56 Correct 45 ms 11700 KB Output is correct
57 Correct 46 ms 11720 KB Output is correct
58 Correct 44 ms 11644 KB Output is correct
59 Correct 46 ms 11768 KB Output is correct
60 Correct 44 ms 11644 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 11388 KB Output is correct
2 Correct 49 ms 12472 KB Output is correct
3 Correct 2 ms 1536 KB Output is correct
4 Correct 38 ms 11320 KB Output is correct
5 Correct 62 ms 14148 KB Output is correct
6 Correct 59 ms 14308 KB Output is correct
7 Correct 47 ms 13392 KB Output is correct
8 Correct 48 ms 13388 KB Output is correct
9 Correct 59 ms 14300 KB Output is correct
10 Correct 58 ms 14172 KB Output is correct
11 Correct 61 ms 14136 KB Output is correct
12 Correct 58 ms 14068 KB Output is correct
13 Correct 59 ms 14160 KB Output is correct
14 Correct 59 ms 14076 KB Output is correct
15 Correct 63 ms 14196 KB Output is correct
16 Correct 60 ms 14176 KB Output is correct
17 Correct 55 ms 13912 KB Output is correct
18 Correct 57 ms 13684 KB Output is correct
19 Correct 55 ms 13820 KB Output is correct
20 Correct 68 ms 13912 KB Output is correct
21 Correct 56 ms 13868 KB Output is correct
22 Correct 56 ms 13900 KB Output is correct
23 Correct 44 ms 11616 KB Output is correct
24 Correct 45 ms 11516 KB Output is correct
25 Correct 47 ms 11964 KB Output is correct
26 Correct 55 ms 11764 KB Output is correct
27 Correct 55 ms 12808 KB Output is correct
28 Correct 56 ms 12792 KB Output is correct
29 Correct 53 ms 13036 KB Output is correct
30 Correct 51 ms 13052 KB Output is correct
31 Correct 44 ms 11516 KB Output is correct
32 Correct 44 ms 11624 KB Output is correct
33 Correct 47 ms 11980 KB Output is correct
34 Correct 45 ms 11772 KB Output is correct
35 Correct 53 ms 12876 KB Output is correct
36 Correct 50 ms 12948 KB Output is correct
37 Correct 50 ms 12760 KB Output is correct
38 Correct 51 ms 12760 KB Output is correct
39 Correct 51 ms 12744 KB Output is correct
40 Correct 51 ms 12756 KB Output is correct
41 Correct 55 ms 13440 KB Output is correct
42 Correct 57 ms 13392 KB Output is correct
43 Correct 54 ms 13496 KB Output is correct
44 Correct 54 ms 13804 KB Output is correct
45 Correct 54 ms 13560 KB Output is correct
46 Correct 58 ms 13412 KB Output is correct
47 Correct 53 ms 12508 KB Output is correct
48 Correct 51 ms 12412 KB Output is correct
49 Correct 48 ms 12404 KB Output is correct
50 Correct 53 ms 12540 KB Output is correct
51 Correct 45 ms 11708 KB Output is correct
52 Correct 47 ms 11656 KB Output is correct
53 Correct 44 ms 11644 KB Output is correct
54 Correct 44 ms 11692 KB Output is correct
55 Correct 45 ms 11700 KB Output is correct
56 Correct 45 ms 11704 KB Output is correct
57 Correct 47 ms 11740 KB Output is correct
58 Correct 45 ms 11868 KB Output is correct
59 Correct 49 ms 11804 KB Output is correct
60 Correct 48 ms 11732 KB Output is correct