oj.uz

Submission #153724

# Submission time Handle Problem Language Result Execution time Memory
153724 2019-09-15T13:28:41 Z reda Split the Attractions (IOI19_split) C++14
18 / 100
 129 ms 12904 KB 
#include<bits/stdc++.h>
using namespace std ;
vector<int> s;
vector<int> g[100001];
bool visited[100001];
void topo (int a)
{
    if(visited[a])return ;
    visited[a]=1;
    for(int i=0;i<g[a].size();i++)
    {
        topo(g[a][i]);
    }
    s.push_back(a);
}
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++ )
    {
         g[p[i]].push_back(q[i]);
         g[q[i]].push_back(p[i]);
    }
    topo(0);
    vector<int> ans(n,0);
    for(int i = 0 ;i<a;i++)
    {
        ans[s[i]]=1;
    }
    for(int i = a;i<a+b;i++)
    {
        ans[s[i]]=2;
    }
    for(int i = a+b;i<n;i++)
    {
        ans[s[i]]=3;
    }
    return ans;

}

Compilation message

split.cpp: In function 'void topo(int)':
split.cpp:10:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<g[a].size();i++)
                 ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2680 KB ok, correct split
2 Correct 4 ms 2680 KB ok, correct split
3 Correct 4 ms 2684 KB ok, correct split
4 Correct 4 ms 2680 KB ok, correct split
5 Correct 4 ms 2680 KB ok, correct split
6 Correct 4 ms 2680 KB ok, correct split
7 Correct 88 ms 12532 KB ok, correct split
8 Correct 89 ms 11632 KB ok, correct split
9 Correct 86 ms 11252 KB ok, correct split
10 Correct 85 ms 12660 KB ok, correct split
11 Correct 96 ms 12600 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 4 ms 2680 KB ok, correct split
3 Correct 4 ms 2680 KB ok, correct split
4 Correct 111 ms 12752 KB ok, correct split
5 Correct 78 ms 9632 KB ok, correct split
6 Correct 90 ms 12816 KB ok, correct split
7 Correct 87 ms 11508 KB ok, correct split
8 Correct 129 ms 12904 KB ok, correct split
9 Correct 111 ms 9588 KB ok, correct split
10 Correct 65 ms 9532 KB ok, correct split
11 Correct 63 ms 9588 KB ok, correct split
12 Correct 65 ms 9964 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Incorrect 81 ms 9696 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 4 ms 2808 KB ok, correct split
2 Incorrect 5 ms 2684 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 5 ms 2680 KB ok, correct split
2 Correct 4 ms 2680 KB ok, correct split
3 Correct 4 ms 2684 KB ok, correct split
4 Correct 4 ms 2680 KB ok, correct split
5 Correct 4 ms 2680 KB ok, correct split
6 Correct 4 ms 2680 KB ok, correct split
7 Correct 88 ms 12532 KB ok, correct split
8 Correct 89 ms 11632 KB ok, correct split
9 Correct 86 ms 11252 KB ok, correct split
10 Correct 85 ms 12660 KB ok, correct split
11 Correct 96 ms 12600 KB ok, correct split
12 Correct 4 ms 2680 KB ok, correct split
13 Correct 4 ms 2680 KB ok, correct split
14 Correct 4 ms 2680 KB ok, correct split
15 Correct 111 ms 12752 KB ok, correct split
16 Correct 78 ms 9632 KB ok, correct split
17 Correct 90 ms 12816 KB ok, correct split
18 Correct 87 ms 11508 KB ok, correct split
19 Correct 129 ms 12904 KB ok, correct split
20 Correct 111 ms 9588 KB ok, correct split
21 Correct 65 ms 9532 KB ok, correct split
22 Correct 63 ms 9588 KB ok, correct split
23 Correct 65 ms 9964 KB ok, correct split
24 Correct 4 ms 2680 KB ok, correct split
25 Incorrect 81 ms 9696 KB 2 components are not connected
26 Halted 0 ms 0 KB -