oj.uz

Submission #1012813

# Submission time Handle Problem Language Result Execution time Memory
1012813 2024-07-02T16:06:08 Z Ivo_12 Stray Cat (JOI20_stray) C++17
4 / 100
 3000 ms 366164 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pii pair < int, int >
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

using namespace std;

namespace {

const int N = 2e4+10, M = 2e4+10, A = 4;

vector < pii > edges[N];
vector < int > oznake;
int dis[N];
queue < int > q;

vector < int > mark( int n, int m, int a, int b, vector < int > t1, vector < int > t2 ) {
	for(int i = 0; i < m; i++) {
		edges[t1[i]].pb(mp(t2[i], i));
		edges[t2[i]].pb(mp(t1[i], i));
		oznake.pb(0);
	}
	dis[0] = 1;
	q.push(0);
	int cur;
	int sus;
	while(!q.empty()) {
		cur = q.front();
		q.pop();
		for(int i = 0; i < (int) edges[cur].size(); i++) {
			sus = edges[cur][i].F;
			if(dis[sus] == 0) {
				q.push(sus);
				dis[sus] = dis[cur]+1;
			}
		}
	}
	if(a>=3) {
		q.push(0);
		while(!q.empty()) {
			cur = q.front();
			q.pop();
			for(int i = 0; i < (int) edges[cur].size(); i++) {
				sus = edges[cur][i].F;
				if(dis[sus] >= dis[cur]) {
					if(dis[sus] > dis[cur]) q.push(sus);
					oznake[edges[cur][i].S] = (dis[cur] - 1) % 3;
				}
			}
		}
	}
	else {
		
	}
	
	return oznake;
}

}  // namespace

std::vector<int> Mark(int N, int M, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
  std::vector<int> X(M);
  return ::mark(N, M, A, B, U, V);
}
#include "Catherine.h"
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pii pair < int, int >
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

using namespace std;

namespace {

int ga, gb;

void init( int a, int b ) {
	ga = a;
	gb = b;
}

int move( vector < int > v ) {
	
	if(::ga>=3) {
		if(v[0] && v[1]) return 0;
		if(v[2] && v[0]) return 2;
		if(v[1] && v[2]) return 1;
		if(!(v[0] || v[1])) return 2;
		if(!(v[2] || v[0])) return 1;
		if(!(v[1] || v[2])) return 0;
	}
	
	return -1;
	
}

}  // namespace

void Init(int A, int B) {
	::init(A, B);
}

int Move(std::vector<int> y) {
	return ::move(y);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15956 KB Output is correct
2 Correct 0 ms 1296 KB Output is correct
3 Correct 24 ms 15492 KB Output is correct
4 Correct 31 ms 17040 KB Output is correct
5 Correct 38 ms 16948 KB Output is correct
6 Correct 25 ms 15760 KB Output is correct
7 Correct 27 ms 15736 KB Output is correct
8 Correct 28 ms 16520 KB Output is correct
9 Correct 34 ms 16548 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15956 KB Output is correct
2 Correct 0 ms 1296 KB Output is correct
3 Correct 24 ms 15492 KB Output is correct
4 Correct 31 ms 17040 KB Output is correct
5 Correct 38 ms 16948 KB Output is correct
6 Correct 25 ms 15760 KB Output is correct
7 Correct 27 ms 15736 KB Output is correct
8 Correct 28 ms 16520 KB Output is correct
9 Correct 34 ms 16548 KB Output is correct
10 Correct 32 ms 14188 KB Output is correct
11 Correct 24 ms 14456 KB Output is correct
12 Execution timed out 3082 ms 200596 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 13456 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 19 ms 13196 KB Output is correct
4 Correct 29 ms 14784 KB Output is correct
5 Correct 34 ms 15100 KB Output is correct
6 Correct 23 ms 13444 KB Output is correct
7 Correct 23 ms 13440 KB Output is correct
8 Correct 31 ms 14208 KB Output is correct
9 Correct 27 ms 14204 KB Output is correct
10 Correct 30 ms 13960 KB Output is correct
11 Correct 29 ms 13960 KB Output is correct
12 Correct 23 ms 13960 KB Output is correct
13 Correct 23 ms 13916 KB Output is correct
14 Correct 27 ms 14176 KB Output is correct
15 Correct 33 ms 14216 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 13456 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 19 ms 13196 KB Output is correct
4 Correct 29 ms 14784 KB Output is correct
5 Correct 34 ms 15100 KB Output is correct
6 Correct 23 ms 13444 KB Output is correct
7 Correct 23 ms 13440 KB Output is correct
8 Correct 31 ms 14208 KB Output is correct
9 Correct 27 ms 14204 KB Output is correct
10 Correct 30 ms 13960 KB Output is correct
11 Correct 29 ms 13960 KB Output is correct
12 Correct 23 ms 13960 KB Output is correct
13 Correct 23 ms 13916 KB Output is correct
14 Correct 27 ms 14176 KB Output is correct
15 Correct 33 ms 14216 KB Output is correct
16 Correct 23 ms 12268 KB Output is correct
17 Correct 21 ms 12376 KB Output is correct
18 Execution timed out 3056 ms 366164 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1564 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 11144 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 11268 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -