oj.uz

답안 #711543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711543 2023-03-17T08:05:46 Z penguinman 장난감 기차 (IOI17_train) C++17
0 / 100
 253 ms 1216 KB 
#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

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()){
      |           ~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 139 ms 724 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 146 ms 1204 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 50 ms 1040 KB 3rd lines differ - on the 696th token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 253 ms 1208 KB Output is correct
2 Correct 244 ms 1216 KB Output is correct
3 Correct 244 ms 1212 KB Output is correct
4 Correct 245 ms 1124 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 145 ms 820 KB 3rd lines differ - on the 3730th token, expected: '0', found: '1'
7 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 139 ms 724 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -