Submission #297876

#	Time	Username	Problem	Language	Result	Execution time	Memory
297876		juggernaut	Split the Attractions (IOI19_split)	C++14	11 / 100	146 ms	12924 KiB

split

#include<bits/stdc++.h>
#include"split.h"
using namespace std;
vector<int>g[100005];
int ans[100005],b;
void dfs(int v){
    if(!b)return;
    b--;
    ans[v]=2;
    for(int to:g[v])if(!ans[to])dfs(to);
}
vector<int>find_split(int n,int a,int B,int c,vector<int>p1,vector<int>p2){
    b=B;
    for(int i=0;i<p1.size();i++){
        g[p1[i]].push_back(p2[i]);
        g[p2[i]].push_back(p1[i]);
    }
    dfs(0);
    vector<int>res;
    for(int i=0;i<n;i++){
        if(!ans[i]){
            if(a){
                a--;
                ans[i]=1;
            }else ans[i]=3;
        }
        res.push_back(ans[i]);
    }
    return res;
}

Compilation message (stderr)

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

• Subtask 1: 0 / 7
• Subtask 2: 11 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36