oj.uz

답안 #241675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241675 2020-06-25T08:31:16 Z godwind Detecting Molecules (IOI16_molecules) C++14
9 / 100
 5 ms 384 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cstring>
#include <cmath>
#include <functional>
#include "molecules.h"

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
	vector<int> answer;
	int cur = 0;
	for (int i = 0; i < (int)w.size(); ++i) {
		if (cur < l) {
			cur += w[i];
			answer.emplace_back(i);
		}
	}
	if (!(l <= cur && cur <= u)) answer.clear();
	return answer;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 5 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 384 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 384 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 384 KB OK (n = 3, answer = YES)
15 Correct 5 ms 384 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 5 ms 384 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Incorrect 5 ms 256 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -