oj.uz

Submission #997465

# Submission time Handle Problem Language Result Execution time Memory
997465 2024-06-12T11:09:04 Z MarwenElarbi Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 4 ms 5212 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
const int nax=2e5+5;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> adj[nax];
int main(){
    int n,k;
    cin>>n>>k;
    bool test=false;
    for (int i = 0; i < n; ++i)
    {
      int s;
      cin>>s;
      if(s>0) test=true;
      for (int j = 0; j < s; ++j)
      {
        int x;
        cin>>x;
        adj[x].pb(i);
        adj[i].pb(x);
      }
    }
    if(test) cout <<2<<endl;
    else cout <<1<<endl;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5140 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 4 ms 5212 KB Output is correct
4 Correct 4 ms 5212 KB Output is correct
5 Correct 3 ms 5212 KB Output is correct
6 Correct 4 ms 5212 KB Output is correct
7 Correct 4 ms 5212 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4952 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5140 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 4 ms 5212 KB Output is correct
4 Correct 4 ms 5212 KB Output is correct
5 Correct 3 ms 5212 KB Output is correct
6 Correct 4 ms 5212 KB Output is correct
7 Correct 4 ms 5212 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4952 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 5212 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 4 ms 5212 KB Output is correct
15 Incorrect 1 ms 4956 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Incorrect 2 ms 4956 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5140 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 4 ms 5212 KB Output is correct
4 Correct 4 ms 5212 KB Output is correct
5 Correct 3 ms 5212 KB Output is correct
6 Correct 4 ms 5212 KB Output is correct
7 Correct 4 ms 5212 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4952 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 5212 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 4 ms 5212 KB Output is correct
15 Incorrect 1 ms 4956 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5140 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 4 ms 5212 KB Output is correct
4 Correct 4 ms 5212 KB Output is correct
5 Correct 3 ms 5212 KB Output is correct
6 Correct 4 ms 5212 KB Output is correct
7 Correct 4 ms 5212 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4952 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 5212 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 4 ms 5212 KB Output is correct
15 Incorrect 1 ms 4956 KB Output isn't correct
16 Halted 0 ms 0 KB -