Submission #711543

#TimeUsernameProblemLanguageResultExecution timeMemory
711543penguinmanToy Train (IOI17_train)C++17
0 / 100
253 ms1216 KiB
#include "train.h" #include <bits/stdc++.h> using std::cin; using std::cout; using std::vector; using ll = int; using vi = vector<ll>; using vii = vector<vi>; using std::string; using pii = std::pair<ll,ll>; #define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++) #define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++) #define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--) #define ln "\n" #define all(a) a.begin(), a.end() #define mp std::make_pair #define pb emplace_back std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) { ll N = a.size(); vii edge(N); rep(i,0,u.size()) edge[u[i]].pb(v[i]); REP(t,0,N+10){ rep(i,0,N){ if(a[i] == 1){ for(auto next: edge[i]){ r[i] |= r[next]; } } else{ int idx = 0; while(idx < edge[i].size()){ int next = edge[i][idx]; if(r[next]){ int length = edge[i].size(); std::swap(edge[i][idx], edge[i][length-1]); edge[i].pop_back(); } else idx++; } if(edge[i].empty()) r[i] = 1; } } } return r; }

Compilation message (stderr)

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:34:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     while(idx < edge[i].size()){
      |           ~~~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...