oj.uz

Submission #832656

# Submission time Handle Problem Language Result Execution time Memory
832656 2023-08-21T13:04:35 Z Marco_Escandon Split the Attractions (IOI19_split) C++17
7 / 100
 63 ms 20228 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> cad[200001];
vector<int> sol;
void dfs(int node, int p, int a, int b, int c, int pr)
{
    if(sol[node]!=0)
        return ;
    if(pr<a)
    {
        sol[node]=1;
    }
    else if(pr<b)
    {
        sol[node]=2;
    }
    else
    {
        sol[node]=3;
    }
    for(auto i:cad[node])
    {
        if(i!=p)
        {
            dfs(i,node, a, b, c, pr+1);
        }
    }
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    sol.assign(n,0);
    vector<ll> asd(n,0);
    if(a+b+c!=n) return sol;
    for(int i=0; i<p.size(); i++)
    {
        asd[p[i]]++;
        asd[q[i]]++;
        cad[p[i]].push_back(q[i]);
        cad[q[i]].push_back(p[i]);
    }
    ll pl=0;
    for(int i=0; i<n; i++)
    {
        if(asd[i]==1)
        {
            pl=i;
        }
    }
    dfs(pl,-1,a,b+a,c+a+b,0);
	return sol;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:34:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i=0; i<p.size(); i++)
      |                  ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 2 ms 4948 KB ok, correct split
3 Correct 2 ms 4948 KB ok, correct split
4 Correct 2 ms 4948 KB ok, correct split
5 Correct 2 ms 4984 KB ok, correct split
6 Correct 2 ms 4996 KB ok, correct split
7 Correct 49 ms 20140 KB ok, correct split
8 Correct 54 ms 20200 KB ok, correct split
9 Correct 58 ms 20228 KB ok, correct split
10 Correct 43 ms 20228 KB ok, correct split
11 Correct 63 ms 20172 KB ok, correct split

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4880 KB ok, correct split
2 Correct 2 ms 4996 KB ok, correct split
3 Correct 3 ms 5000 KB ok, correct split
4 Correct 60 ms 19092 KB ok, correct split
5 Incorrect 40 ms 13004 KB invalid split: #1=1, #2=99998, #3=0
6 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB invalid split: #1=2, #2=2, #3=1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 5000 KB invalid split: #1=7, #2=2, #3=0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 2 ms 4948 KB ok, correct split
3 Correct 2 ms 4948 KB ok, correct split
4 Correct 2 ms 4948 KB ok, correct split
5 Correct 2 ms 4984 KB ok, correct split
6 Correct 2 ms 4996 KB ok, correct split
7 Correct 49 ms 20140 KB ok, correct split
8 Correct 54 ms 20200 KB ok, correct split
9 Correct 58 ms 20228 KB ok, correct split
10 Correct 43 ms 20228 KB ok, correct split
11 Correct 63 ms 20172 KB ok, correct split
12 Correct 3 ms 4880 KB ok, correct split
13 Correct 2 ms 4996 KB ok, correct split
14 Correct 3 ms 5000 KB ok, correct split
15 Correct 60 ms 19092 KB ok, correct split
16 Incorrect 40 ms 13004 KB invalid split: #1=1, #2=99998, #3=0
17 Halted 0 ms 0 KB -