oj.uz

Submission #964931

# Submission time Handle Problem Language Result Execution time Memory
964931 2024-04-17T18:02:53 Z MinaRagy06 Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N = 1005;
vector<int> adj[N];
int col[N];
bool dfs(int i, int c) {
	if (~col[i]) {
		return col[i] == c;
	}
	col[i] = c;
	bool ok = 1;
	for (auto nxt : adj[i]) {
		ok &= dfs(nxt, c ^ 1);
	}
	return ok;
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	memset(col, -1, sizeof col);
	int n, m;
	cin >> n >> m;
	for (int i = 0, u, v; i < m; i++) {
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	cout << (dfs(1, 0)? "YES\n1\n1\n" : "NO\n1\n1\n");
	return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
3 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 480 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 348 KB Extra information in the output file
8 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
3 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
10 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 516 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 356 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 600 KB Failed to provide a successful strategy.
15 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
19 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 344 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
3 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 480 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 348 KB Extra information in the output file
8 Halted 0 ms 0 KB -