oj.uz

Submission #160585

# Submission time Handle Problem Language Result Execution time Memory
160585 2019-10-28T15:45:17 Z DanerZein Split the Attractions (IOI19_split) C++14
7 / 100
 121 ms 13116 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
vector<vi>G;
vi r;
int vis[100010];
void dfs(int u){
  vis[u]=1;
  r.push_back(u);
  for(int i=0;i<G[u].size();i++){
    if(vis[G[u][i]]==0){
      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);
  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]);
  }
  dfs(0);
  vi res;
  res.resize(n);
  int at=1;
  for(int i=0;i<r.size();i++){
    // cout<<r[i]<<" ";
    res[r[i]]=at;
    if(at==1) a--;
    if(at==2) b--;
    if(at==3) c--;
    if(a==0) {at=2;
      a=-1;
    }
    if(b==0) at=3;
  }
  //cout<<endl;
  return res;
}

Compilation message

split.cpp: In function 'void dfs(int)':
split.cpp:11: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:20:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<p.size();i++){
               ~^~~~~~~~~
split.cpp:28:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<r.size();i++){
               ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB ok, correct split
2 Correct 2 ms 256 KB ok, correct split
3 Correct 2 ms 256 KB ok, correct split
4 Correct 2 ms 400 KB ok, correct split
5 Correct 2 ms 400 KB ok, correct split
6 Correct 2 ms 256 KB ok, correct split
7 Correct 96 ms 12856 KB ok, correct split
8 Correct 94 ms 11988 KB ok, correct split
9 Correct 98 ms 11636 KB ok, correct split
10 Correct 88 ms 12924 KB ok, correct split
11 Correct 90 ms 13116 KB ok, correct split

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 444 KB ok, correct split
2 Correct 2 ms 256 KB ok, correct split
3 Correct 2 ms 256 KB ok, correct split
4 Correct 121 ms 13000 KB ok, correct split
5 Incorrect 92 ms 9944 KB 2 components are not connected
6 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB ok, correct split
2 Incorrect 91 ms 9936 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 2 ms 256 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 2 ms 256 KB ok, correct split
2 Correct 2 ms 256 KB ok, correct split
3 Correct 2 ms 256 KB ok, correct split
4 Correct 2 ms 400 KB ok, correct split
5 Correct 2 ms 400 KB ok, correct split
6 Correct 2 ms 256 KB ok, correct split
7 Correct 96 ms 12856 KB ok, correct split
8 Correct 94 ms 11988 KB ok, correct split
9 Correct 98 ms 11636 KB ok, correct split
10 Correct 88 ms 12924 KB ok, correct split
11 Correct 90 ms 13116 KB ok, correct split
12 Correct 2 ms 444 KB ok, correct split
13 Correct 2 ms 256 KB ok, correct split
14 Correct 2 ms 256 KB ok, correct split
15 Correct 121 ms 13000 KB ok, correct split
16 Incorrect 92 ms 9944 KB 2 components are not connected
17 Halted 0 ms 0 KB -