oj.uz

Submission #253720

# Submission time Handle Problem Language Result Execution time Memory
253720 2020-07-28T15:05:26 Z Erkhemkhuu Split the Attractions (IOI19_split) C++17
18 / 100
 128 ms 13924 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
const ll N = 100005;
vector <int> path;
bool vis[N];
vector <vector <int> > adj(N);
void dfs(ll v) {
    vis[v] = true;
    for(auto &u: adj[v]) {
        if(vis[u]) continue;
        dfs(u);
    }
    path.pb(v);
    return;
}
vector <int> find_split(int n, int a, int b, int c, vector <int> p, vector <int> q) {
    int m = p.size(), i;
    for(i = 0; i < m; i++) {
        adj[p[i]].pb(q[i]);
        adj[q[i]].pb(p[i]);
    }
    dfs(0);
    vector <int> ans(n, 0);
    for(i = 0; i < a; i++)
        ans[path[i]] = 1;
    for(i = a; i < a + b; i++)
        ans[path[i]] = 2;
    for(i = a + b; i < n; i++)
        ans[path[i]] = 3;
    return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2688 KB ok, correct split
2 Correct 2 ms 2688 KB ok, correct split
3 Correct 3 ms 2688 KB ok, correct split
4 Correct 2 ms 2688 KB ok, correct split
5 Correct 2 ms 2688 KB ok, correct split
6 Correct 3 ms 2688 KB ok, correct split
7 Correct 82 ms 13684 KB ok, correct split
8 Correct 86 ms 12280 KB ok, correct split
9 Correct 95 ms 11896 KB ok, correct split
10 Correct 112 ms 13816 KB ok, correct split
11 Correct 78 ms 13812 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB ok, correct split
2 Correct 3 ms 2688 KB ok, correct split
3 Correct 2 ms 2688 KB ok, correct split
4 Correct 126 ms 12456 KB ok, correct split
5 Correct 89 ms 9204 KB ok, correct split
6 Correct 89 ms 13924 KB ok, correct split
7 Correct 93 ms 12276 KB ok, correct split
8 Correct 128 ms 11840 KB ok, correct split
9 Correct 77 ms 9332 KB ok, correct split
10 Correct 60 ms 9584 KB ok, correct split
11 Correct 58 ms 9584 KB ok, correct split
12 Correct 55 ms 9712 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB ok, correct split
2 Incorrect 91 ms 9208 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 2 ms 2688 KB ok, correct split
2 Incorrect 2 ms 2688 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 3 ms 2688 KB ok, correct split
2 Correct 2 ms 2688 KB ok, correct split
3 Correct 3 ms 2688 KB ok, correct split
4 Correct 2 ms 2688 KB ok, correct split
5 Correct 2 ms 2688 KB ok, correct split
6 Correct 3 ms 2688 KB ok, correct split
7 Correct 82 ms 13684 KB ok, correct split
8 Correct 86 ms 12280 KB ok, correct split
9 Correct 95 ms 11896 KB ok, correct split
10 Correct 112 ms 13816 KB ok, correct split
11 Correct 78 ms 13812 KB ok, correct split
12 Correct 2 ms 2688 KB ok, correct split
13 Correct 3 ms 2688 KB ok, correct split
14 Correct 2 ms 2688 KB ok, correct split
15 Correct 126 ms 12456 KB ok, correct split
16 Correct 89 ms 9204 KB ok, correct split
17 Correct 89 ms 13924 KB ok, correct split
18 Correct 93 ms 12276 KB ok, correct split
19 Correct 128 ms 11840 KB ok, correct split
20 Correct 77 ms 9332 KB ok, correct split
21 Correct 60 ms 9584 KB ok, correct split
22 Correct 58 ms 9584 KB ok, correct split
23 Correct 55 ms 9712 KB ok, correct split
24 Correct 2 ms 2688 KB ok, correct split
25 Incorrect 91 ms 9208 KB 2 components are not connected
26 Halted 0 ms 0 KB -