oj.uz

답안 #1025798

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025798 2024-07-17T10:14:21 Z parsadox2 장난감 기차 (IOI17_train) C++17
5 / 100
 14 ms 860 KB 
#include "train.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 5e3 + 10;
bool charge[N] , self[N] , ty[N] , nex[N];
int n , m;

bool Solve(int v)
{
	for(int i = v ; i < n ; i++)
	{
		if(!nex[i])
			return charge[i];
		if(!self[i])
			continue;
		if(!charge[i] && !ty[i])
			return 0;
		if(charge[i] && ty[i])
			return 1;
	}
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	n = a.size() ; m = u.size();
	vector<int> res(a.size());
	for(int i = 0 ; i < n ; i++)
		ty[i] = a[i];
	for(int i = 0 ; i < n ; i++)
		charge[i] = r[i];
	for(int i = 0 ; i < m ; i++)  
	{
		if(u[i] == v[i])
			self[u[i]] = true;
		else
			nex[u[i]] = true;
	}
	for(int i = 0 ; i < n ; i++)
		res[i] = Solve(i);
	return res;
}

Compilation message

train.cpp: In function 'bool Solve(int)':
train.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 860 KB Output is correct
2 Correct 11 ms 636 KB Output is correct
3 Correct 8 ms 856 KB Output is correct
4 Incorrect 14 ms 856 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Incorrect 0 ms 344 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
13 Halted 0 ms 0 KB -