oj.uz

Submission #722963

# Submission time Handle Problem Language Result Execution time Memory
722963 2023-04-13T06:31:05 Z Darren0724 Split the Attractions (IOI19_split) C++17
18 / 100
 101 ms 13736 KB 
#include "split.h"
#include<bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
const int N=100005;
vector<int> adj[N],res,v;
int vis[N];
void dfs(int k){
    vis[k]=1;
    v.push_back(k);
    for(int j:adj[k]){
        if(vis[j]){
            continue;
        }
        dfs(j);
    }
}

vector<int> find_split(int n1, int a, int b, int c, vector<int> x, vector<int> y) {
    int n=n1;
	res.resize(n);
    int m=x.size();
    for(int i=0;i<m;i++){
        adj[x[i]].push_back(y[i]);
        adj[y[i]].push_back(x[i]);
    }
    int root=0;
    for(int i=0;i<n;i++){
        if(adj[i].size()==1){
            root=i;
        }
    }
    dfs(root);
    for(int i=0;i<a;i++){
        res[v[i]]=1;
    }
    for(int i=a;i<a+b;i++){
        res[v[i]]=2;
    }
    for(int i=a+b;i<a+b+c;i++){
        res[v[i]]=3;
    }

	return res;
}
/*
7 6 4 2 1
0 1
0 2
1 3
1 4
2 5
2 6
*/
/*
10 10 2 7 1
0 1
1 2
2 3
3 4
4 5
5 6
6 7
7 9
8 9
8 0
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1 ms 2644 KB ok, correct split
6 Correct 2 ms 2644 KB ok, correct split
7 Correct 60 ms 13664 KB ok, correct split
8 Correct 59 ms 13644 KB ok, correct split
9 Correct 79 ms 13712 KB ok, correct split
10 Correct 59 ms 13708 KB ok, correct split
11 Correct 57 ms 13736 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 1 ms 2644 KB ok, correct split
3 Correct 1 ms 2644 KB ok, correct split
4 Correct 101 ms 12280 KB ok, correct split
5 Correct 51 ms 9032 KB ok, correct split
6 Correct 65 ms 13644 KB ok, correct split
7 Correct 77 ms 13680 KB ok, correct split
8 Correct 91 ms 11324 KB ok, correct split
9 Correct 71 ms 9044 KB ok, correct split
10 Correct 64 ms 9328 KB ok, correct split
11 Correct 43 ms 9388 KB ok, correct split
12 Correct 46 ms 9372 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 52 ms 9032 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

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

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1 ms 2644 KB ok, correct split
6 Correct 2 ms 2644 KB ok, correct split
7 Correct 60 ms 13664 KB ok, correct split
8 Correct 59 ms 13644 KB ok, correct split
9 Correct 79 ms 13712 KB ok, correct split
10 Correct 59 ms 13708 KB ok, correct split
11 Correct 57 ms 13736 KB ok, correct split
12 Correct 1 ms 2644 KB ok, correct split
13 Correct 1 ms 2644 KB ok, correct split
14 Correct 1 ms 2644 KB ok, correct split
15 Correct 101 ms 12280 KB ok, correct split
16 Correct 51 ms 9032 KB ok, correct split
17 Correct 65 ms 13644 KB ok, correct split
18 Correct 77 ms 13680 KB ok, correct split
19 Correct 91 ms 11324 KB ok, correct split
20 Correct 71 ms 9044 KB ok, correct split
21 Correct 64 ms 9328 KB ok, correct split
22 Correct 43 ms 9388 KB ok, correct split
23 Correct 46 ms 9372 KB ok, correct split
24 Correct 2 ms 2644 KB ok, correct split
25 Incorrect 52 ms 9032 KB 2 components are not connected
26 Halted 0 ms 0 KB -