oj.uz

Submission #432620

# Submission time Handle Problem Language Result Execution time Memory
432620 2021-06-18T11:40:14 Z LouayFarah Split the Attractions (IOI19_split) C++14
18 / 100
 122 ms 17220 KB 
#include "bits/stdc++.h"
#include "split.h"
using namespace std;

#define ll long long
#define pb push_back

void dfs(vector<int> adj[], vector<bool> &visited, int u, vector<int> &res)
{
    res.pb(u);
    visited[u] = true;

    for(auto v: adj[u])
    {
        if(!visited[v])
        {
            dfs(adj, visited, v, res);
        }
    }
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int>q)
{
    vector<int> adj[n];
    int m = (int)p.size();

    for(int i = 0; i<m; i++)
    {
        adj[p[i]].pb(q[i]);
        adj[q[i]].pb(p[i]);
    }

    vector<int> res;
    vector<bool> visited(n, false);

    int beg = 0;
    for(int i = 0; i<n; i++)
    {
        if((int)adj[i].size()==1)
        {
            beg = i;
            break;
        }
    }
    dfs(adj, visited, beg, res);

    vector<int> r(n, 0);

    int i = 0;
    int counter = 0;
    while(counter<a)
    {
        r[res[i]] = 1;
        i++, counter++;
    }
    counter = 0;
    while(counter<b)
    {
        r[res[i]] = 2;
        i++, counter++;
    }
    counter = 0;
    while(counter<c)
    {
        r[res[i]] = 3;
        i++, counter++;
    }

    return r;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Correct 1 ms 204 KB ok, correct split
3 Correct 1 ms 204 KB ok, correct split
4 Correct 1 ms 204 KB ok, correct split
5 Correct 1 ms 204 KB ok, correct split
6 Correct 1 ms 204 KB ok, correct split
7 Correct 118 ms 17176 KB ok, correct split
8 Correct 112 ms 17180 KB ok, correct split
9 Correct 80 ms 17184 KB ok, correct split
10 Correct 103 ms 17188 KB ok, correct split
11 Correct 106 ms 17220 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 1 ms 204 KB ok, correct split
4 Correct 114 ms 14628 KB ok, correct split
5 Correct 94 ms 9516 KB ok, correct split
6 Correct 111 ms 17112 KB ok, correct split
7 Correct 91 ms 17220 KB ok, correct split
8 Correct 122 ms 12760 KB ok, correct split
9 Correct 89 ms 9428 KB ok, correct split
10 Correct 55 ms 9384 KB ok, correct split
11 Correct 68 ms 9416 KB ok, correct split
12 Correct 82 ms 9792 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Incorrect 76 ms 9408 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 1 ms 204 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 204 KB ok, correct split
2 Correct 1 ms 204 KB ok, correct split
3 Correct 1 ms 204 KB ok, correct split
4 Correct 1 ms 204 KB ok, correct split
5 Correct 1 ms 204 KB ok, correct split
6 Correct 1 ms 204 KB ok, correct split
7 Correct 118 ms 17176 KB ok, correct split
8 Correct 112 ms 17180 KB ok, correct split
9 Correct 80 ms 17184 KB ok, correct split
10 Correct 103 ms 17188 KB ok, correct split
11 Correct 106 ms 17220 KB ok, correct split
12 Correct 1 ms 204 KB ok, correct split
13 Correct 0 ms 204 KB ok, correct split
14 Correct 1 ms 204 KB ok, correct split
15 Correct 114 ms 14628 KB ok, correct split
16 Correct 94 ms 9516 KB ok, correct split
17 Correct 111 ms 17112 KB ok, correct split
18 Correct 91 ms 17220 KB ok, correct split
19 Correct 122 ms 12760 KB ok, correct split
20 Correct 89 ms 9428 KB ok, correct split
21 Correct 55 ms 9384 KB ok, correct split
22 Correct 68 ms 9416 KB ok, correct split
23 Correct 82 ms 9792 KB ok, correct split
24 Correct 1 ms 204 KB ok, correct split
25 Incorrect 76 ms 9408 KB 2 components are not connected
26 Halted 0 ms 0 KB -