oj.uz

Submission #160595

# Submission time Handle Problem Language Result Execution time Memory
160595 2019-10-28T16:28:24 Z DanerZein Split the Attractions (IOI19_split) C++14
11 / 100
 133 ms 13304 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
vector<vi>G;
vi r,res;
int vis[100010];
int ba,na;
void dfs(int u){
  if(ba==0) return;
  ba--;
  vis[u]=1;
  res[u]=2;
  r.push_back(u);
  for(int i=0;i<G[u].size();i++){
    if(vis[G[u][i]]==0){
      if(ba==0) na=G[u][i];
      dfs(G[u][i]);
    }
    
  }
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
  // r.resize(n);
  ba=b;
  G.resize(n);
  for(int i=0;i<p.size();i++){
    G[p[i]].push_back(q[i]);
    G[q[i]].push_back(p[i]);
  }
  res.resize(n);
  dfs(0);
  bool sw=0;
  for(int i=0;i<r.size();i++){
    res[r[i]]=2;
  }
  res[na]=1;
  for(int i=0;i<n;i++){
    // cout<<res[i]<<" ";
    if(res[i]==0) res[i]=3;
  }
  // cout<<endl;
  return res;
}

Compilation message

split.cpp: In function 'void dfs(int)':
split.cpp:15:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<G[u].size();i++){
               ~^~~~~~~~~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<p.size();i++){
               ~^~~~~~~~~
split.cpp:34:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<r.size();i++){
               ~^~~~~~~~~
split.cpp:33:8: warning: unused variable 'sw' [-Wunused-variable]
   bool sw=0;
        ^~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB ok, correct split
2 Correct 2 ms 312 KB ok, correct split
3 Correct 2 ms 256 KB ok, correct split
4 Incorrect 2 ms 348 KB invalid split: #1=1, #2=1, #3=2
5 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB ok, correct split
2 Correct 2 ms 376 KB ok, correct split
3 Correct 2 ms 376 KB ok, correct split
4 Correct 96 ms 9256 KB ok, correct split
5 Correct 119 ms 9084 KB ok, correct split
6 Correct 75 ms 9336 KB ok, correct split
7 Correct 87 ms 11564 KB ok, correct split
8 Correct 133 ms 13304 KB ok, correct split
9 Correct 76 ms 9976 KB ok, correct split
10 Correct 59 ms 10224 KB ok, correct split
11 Correct 61 ms 10228 KB ok, correct split
12 Correct 66 ms 10608 KB ok, correct split

Subtask #3
0 / 22.0

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

Subtask #4
0 / 24.0

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

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB ok, correct split
2 Correct 2 ms 312 KB ok, correct split
3 Correct 2 ms 256 KB ok, correct split
4 Incorrect 2 ms 348 KB invalid split: #1=1, #2=1, #3=2
5 Halted 0 ms 0 KB -