oj.uz

Submission #783356

# Submission time Handle Problem Language Result Execution time Memory
783356 2023-07-14T21:31:34 Z vh50 Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 376 KB 
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
const int MAXN = 2e3;
int n, m, marc[MAXN][MAXN];
vector <int> g[MAXN];
void dfs(int a, int r)
{
	marc[a][r] = 1;
	for(auto v : g[a])
	{
		if(marc[v][r])	continue;
		dfs(v, r);
	}
}
main()
{
	cin >> n >> m;
	for(int i = 0; i < m; i++)	
	{
		int a, b;
		cin >> a >> b;
		a--, b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	if(m == n - 1)
	{
		cout << "YES" << endl;
		cout << 2 * n << endl; 
		for(int i = 0; i < n; i++) 	cout << i + 1 << " " << i + 1 << " ";
		cout << endl;
	}
	else cout << "NO" << endl;
}

Compilation message

newspapers.cpp:17:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   17 | main()
      | ^~~~

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
2 Partially correct 1 ms 356 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 352 KB Provide a successful but not optimal strategy.
6 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
7 Correct 1 ms 340 KB Output is correct
8 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
9 Incorrect 1 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
2 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
3 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
4 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 352 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
7 Partially correct 1 ms 352 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 356 KB Failed to provide a successful strategy.
9 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 376 KB Failed to provide a successful strategy.
15 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 356 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 360 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 340 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
2 Partially correct 1 ms 356 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 352 KB Provide a successful but not optimal strategy.
6 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
7 Correct 1 ms 340 KB Output is correct
8 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
9 Incorrect 1 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -