oj.uz

Submission #710321

# Submission time Handle Problem Language Result Execution time Memory
710321 2023-03-15T07:16:02 Z hpesoj Stray Cat (JOI20_stray) C++17
0 / 100
 13 ms 2188 KB 
#include <bits/stdc++.h>
#include "Anthony.h"
#define pb push_back
#define pi pair <int, int>
#define fi first
#define se second
using namespace std;
vector <pi> adj[20005];
vector <int> ans;
int mark = 0;
queue <int> q;
bool visited[20005];
void bfs(int x){
	q.push(x);
	while(!q.empty()){
		int sz = q.size();
		while(sz--){
			int curr = q.front();
			q.pop();
			visited[curr] = 1;
			for(pi i : adj[curr]) if(!visited[i.fi]) ans[i.se] = mark, q.push(i.fi);
		}
		mark = !mark;
	}
}
std::vector <int> Mark(int n, int m, int a, int b, std::vector <int> u, std::vector <int> v){
	ans.reserve(m);
	for(int i = 0; i < m; i++) adj[u[i]].pb({v[i], i}), adj[v[i]].pb({u[i], i});
	bfs(0);
	return ans;
}

#include <bits/stdc++.h>
#include "Catherine.h"
#define pb push_back
#define pi pair <int, int>
#define fi first
#define se second
using namespace std;

void Init(int a, int b){
	;
}
int Move(std::vector <int> y){
	for(int i = 0; i < 2; i++) if(y[i] == 1) return i;
	return -1;
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

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