oj.uz

Submission #745518

# Submission time Handle Problem Language Result Execution time Memory
745518 2023-05-20T09:29:24 Z Sarpa Newspapers (CEOI21_newspapers) C++14
4 / 100
 4 ms 5076 KB 
// Be nam KHODA
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define all(x) (x).begin(), (x).end()
#define F first
#define S second

const int N = 2e5 + 10, mod = 1e9 + 7, inf = INT_MAX;

int n, m;
vector<int> adj[N];
bool mark[N], cy;

void dfs(int u, int p =-1){
  mark[u] = true;
  for(auto & v : adj[u]){
    if(mark[v] and v != p)
      cy = true;
    if(!mark[v])
      dfs(v, u);
    }
}

int main(){
    cin.tie(0), ios::sync_with_stdio(0);
    cin >> n >> m;
    for(int i = 0; i < m; i++){
      int u, v;
      cin >> u >> v;
      u--, --v;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    for(int i = 0; i < n; i++)
      if(!mark[i])
        dfs(i);
    if(cy)
      cout << "NO" << endl;
    else
      cout << "YES\n1\n1" << endl;
    return 0;   
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Partially correct 3 ms 5020 KB Failed to provide a successful strategy.
3 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
4 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
5 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
6 Partially correct 3 ms 5024 KB Failed to provide a successful strategy.
7 Correct 3 ms 4948 KB Output is correct
8 Partially correct 4 ms 5028 KB Failed to provide a successful strategy.
9 Incorrect 4 ms 5028 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
3 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
4 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
5 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
6 Partially correct 3 ms 4932 KB Failed to provide a successful strategy.
7 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
8 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
9 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
10 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
11 Partially correct 3 ms 5024 KB Failed to provide a successful strategy.
12 Partially correct 4 ms 4948 KB Failed to provide a successful strategy.
13 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
14 Partially correct 3 ms 5076 KB Failed to provide a successful strategy.
15 Partially correct 3 ms 5076 KB Failed to provide a successful strategy.
16 Partially correct 3 ms 5076 KB Failed to provide a successful strategy.
17 Partially correct 3 ms 5076 KB Failed to provide a successful strategy.
18 Partially correct 3 ms 5024 KB Failed to provide a successful strategy.
19 Partially correct 3 ms 5028 KB Failed to provide a successful strategy.
20 Partially correct 3 ms 5076 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Partially correct 3 ms 5020 KB Failed to provide a successful strategy.
3 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
4 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
5 Partially correct 3 ms 4948 KB Failed to provide a successful strategy.
6 Partially correct 3 ms 5024 KB Failed to provide a successful strategy.
7 Correct 3 ms 4948 KB Output is correct
8 Partially correct 4 ms 5028 KB Failed to provide a successful strategy.
9 Incorrect 4 ms 5028 KB Output isn't correct
10 Halted 0 ms 0 KB -