oj.uz

답안 #219750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219750 2020-04-06T09:01:15 Z VEGAnn Split the Attractions (IOI19_split) C++14
0 / 100
 56 ms 4856 KB 
#include <bits/stdc++.h>
#include "split.h"
#define all(x) x.begin(),x.end()
using namespace std;

using namespace std;

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> res;
	res.resize(n);
	fill(all(res), 0);

	for (int i = 0; i < a; i++)
        res[i] = 1;

	for (int i = 0; i < b; i++)
        res[a + i] = 2;

	for (int i = 0; i < c; i++)
        res[a + b + i] = 3;

	return res;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB ok, correct split
2 Correct 4 ms 256 KB ok, correct split
3 Correct 4 ms 256 KB ok, correct split
4 Correct 5 ms 384 KB ok, correct split
5 Correct 5 ms 256 KB ok, correct split
6 Incorrect 5 ms 256 KB 3 components are not connected
7 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB ok, correct split
2 Correct 5 ms 256 KB ok, correct split
3 Correct 4 ms 256 KB ok, correct split
4 Correct 56 ms 4856 KB ok, correct split
5 Incorrect 42 ms 3448 KB 2 components are not connected
6 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB 2 components are not connected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB ok, correct split
2 Incorrect 4 ms 256 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB ok, correct split
2 Correct 4 ms 256 KB ok, correct split
3 Correct 4 ms 256 KB ok, correct split
4 Correct 5 ms 384 KB ok, correct split
5 Correct 5 ms 256 KB ok, correct split
6 Incorrect 5 ms 256 KB 3 components are not connected
7 Halted 0 ms 0 KB -