oj.uz

Submission #106462

# Submission time Handle Problem Language Result Execution time Memory
106462 2019-04-18T14:32:51 Z KLPP Toy Train (IOI17_train) C++14
11 / 100
 18 ms 2048 KB 
#include "train.h"
#include<vector>
#include<iostream>
#include<queue>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
vector<int> nei[10000];
vector<int> inv[10000];
bool active[10000];
int owner[10000];
int charge[10000];
int n;
bool S[10000];
int count[10000];
int reference;
void extend(int node){
  if(S[node])return;
  S[node]=true;
  //cout<<node<<endl;
  rep(i,0,inv[node].size()){
    int v=inv[node][i];
    count[v]++;
    if(!S[v]){
      if(reference==owner[v]){
	//cout<<v<<endl;
	
	extend(v);
      }else{
	if(count[v]==nei[v].size()){
	  
	  extend(v);
	}
      }
    }
  }
}
void solve(){
  reference=1;
  rep(i,0,n)count[i]=0;
  rep(i,0,n){
    S[i]=false;
  }
  rep(i,0,n){
    if(charge[i] && active[i])extend(i);
  }
  int cont=0;
  rep(i,0,n){
    if(!S[i] && active[i])S[i]=true;
    else S[i]=false;
    cont+=S[i];
    //cout<<S[i]<<endl;
  }
  if(cont==0)return;
  reference=0;
  rep(i,0,n)count[i]=0;
  rep(i,0,n){
    if(S[i] && active[i]){
      S[i]=false;
      extend(i);
    }
  }
  rep(i,0,n){
    if(active[i] && S[i]){
      active[i]=false;
    }
  }
  
}
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
  n=a.size();
  rep(i,0,n){
    owner[i]=a[i];
    charge[i]=r[i];
  }
  rep(i,0,u.size()){
    nei[u[i]].push_back(v[i]);inv[v[i]].push_back(u[i]);
  }
  rep(i,0,n)active[i]=true;
  solve();
  vector<int> answer;
  rep(i,0,n){
    answer.push_back(active[i]);
  }
  return answer;
}

Compilation message

train.cpp: In function 'void extend(int)':
train.cpp:6:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,a,b) for(int i=a;i<b;i++)
train.cpp:20:7:
   rep(i,0,inv[node].size()){
       ~~~~~~~~~~~~~~~~~~~~       
train.cpp:20:3: note: in expansion of macro 'rep'
   rep(i,0,inv[node].size()){
   ^~~
train.cpp:29:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(count[v]==nei[v].size()){
     ~~~~~~~~^~~~~~~~~~~~~~~
train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:6:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,a,b) for(int i=a;i<b;i++)
train.cpp:75:7:
   rep(i,0,u.size()){
       ~~~~~~~~~~~~               
train.cpp:75:3: note: in expansion of macro 'rep'
   rep(i,0,u.size()){
   ^~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1408 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 896 KB Output is correct
4 Incorrect 3 ms 768 KB 3rd lines differ - on the 3rd token, expected: '1', found: '0'
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1920 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1508 KB Output is correct
2 Correct 10 ms 1664 KB Output is correct
3 Correct 12 ms 1768 KB Output is correct
4 Correct 18 ms 1664 KB Output is correct
5 Correct 13 ms 1664 KB Output is correct
6 Correct 9 ms 1664 KB Output is correct
7 Correct 11 ms 1792 KB Output is correct
8 Correct 10 ms 1664 KB Output is correct
9 Correct 12 ms 1664 KB Output is correct
10 Correct 15 ms 1792 KB Output is correct
11 Correct 13 ms 1792 KB Output is correct
12 Correct 18 ms 1792 KB Output is correct
13 Correct 18 ms 1664 KB Output is correct
14 Correct 14 ms 1664 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1708 KB Output is correct
2 Correct 13 ms 2048 KB Output is correct
3 Correct 11 ms 1920 KB Output is correct
4 Correct 12 ms 1920 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 10 ms 1528 KB Output is correct
7 Correct 11 ms 1536 KB Output is correct
8 Incorrect 9 ms 1536 KB 3rd lines differ - on the 5th token, expected: '0', found: '1'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1408 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -