oj.uz

Submission #678370

# Submission time Handle Problem Language Result Execution time Memory
678370 2023-01-05T16:35:46 Z irmuun Split the Attractions (IOI19_split) C++17
18 / 100
 87 ms 14444 KB 
#include <bits/stdc++.h>
#include "split.h"
using namespace std;
#define ll long long
#define pb push_back
vector<int>dv[100005];
int df[100005];
vector<int>vec;
void dfs(int x){
    df[x]=1;
    vec.pb(x);
    for(auto y:dv[x]){
        if(df[y]==0){
            dfs(y);
        }
    }
}
vector<int> find_split(int n, int a, int b, int c, vector<int>p, vector<int>q){
    int m=p.size();
    for(int i=0;i<m;i++){
        dv[p[i]].pb(q[i]);
        dv[q[i]].pb(p[i]);
    }
    int start=0;
    for(int i=0;i<n;i++){
        if(dv[i].size()==1){
            start=i;
            break;
        }
    }
    vector<int>ans(n);
    dfs(start);
    for(int i=0;i<a;i++){
        ans[vec[i]]=1;
    }
    for(int i=a;i<a+b;i++){
        ans[vec[i]]=2;
    }
    for(int i=a+b;i<n;i++){
        ans[vec[i]]=3;
    }
    return ans;
};

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB ok, correct split
2 Correct 2 ms 2644 KB ok, correct split
3 Correct 2 ms 2644 KB ok, correct split
4 Correct 2 ms 2644 KB ok, correct split
5 Correct 2 ms 2644 KB ok, correct split
6 Correct 2 ms 2644 KB ok, correct split
7 Correct 58 ms 14420 KB ok, correct split
8 Correct 57 ms 14412 KB ok, correct split
9 Correct 64 ms 14428 KB ok, correct split
10 Correct 58 ms 14436 KB ok, correct split
11 Correct 56 ms 14444 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB ok, correct split
2 Correct 2 ms 2644 KB ok, correct split
3 Correct 3 ms 2644 KB ok, correct split
4 Correct 77 ms 13736 KB ok, correct split
5 Correct 49 ms 10024 KB ok, correct split
6 Correct 55 ms 14424 KB ok, correct split
7 Correct 58 ms 14432 KB ok, correct split
8 Correct 87 ms 13356 KB ok, correct split
9 Correct 53 ms 9964 KB ok, correct split
10 Correct 41 ms 10052 KB ok, correct split
11 Correct 43 ms 10036 KB ok, correct split
12 Correct 47 ms 10444 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB ok, correct split
2 Incorrect 50 ms 9940 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB 2 components are not connected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB ok, correct split
2 Correct 2 ms 2644 KB ok, correct split
3 Correct 2 ms 2644 KB ok, correct split
4 Correct 2 ms 2644 KB ok, correct split
5 Correct 2 ms 2644 KB ok, correct split
6 Correct 2 ms 2644 KB ok, correct split
7 Correct 58 ms 14420 KB ok, correct split
8 Correct 57 ms 14412 KB ok, correct split
9 Correct 64 ms 14428 KB ok, correct split
10 Correct 58 ms 14436 KB ok, correct split
11 Correct 56 ms 14444 KB ok, correct split
12 Correct 1 ms 2644 KB ok, correct split
13 Correct 2 ms 2644 KB ok, correct split
14 Correct 3 ms 2644 KB ok, correct split
15 Correct 77 ms 13736 KB ok, correct split
16 Correct 49 ms 10024 KB ok, correct split
17 Correct 55 ms 14424 KB ok, correct split
18 Correct 58 ms 14432 KB ok, correct split
19 Correct 87 ms 13356 KB ok, correct split
20 Correct 53 ms 9964 KB ok, correct split
21 Correct 41 ms 10052 KB ok, correct split
22 Correct 43 ms 10036 KB ok, correct split
23 Correct 47 ms 10444 KB ok, correct split
24 Correct 2 ms 2644 KB ok, correct split
25 Incorrect 50 ms 9940 KB 2 components are not connected
26 Halted 0 ms 0 KB -