oj.uz

답안 #273038

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
273038 2020-08-19T02:27:51 Z ggooroo Detecting Molecules (IOI16_molecules) C++14
9 / 100
 1 ms 384 KB 
#include "molecules.h"

#include <cstdio>
#include <iostream>
#include <algorithm>
#define F first
#define S second
#define N 200005
using namespace std;

typedef long long ll;
vector<int> ans;

ll n, v[N];
pair<ll, ll> a[N];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	ll i, j, s, en, r = u;
	n = w.size();
	for (i =0; i <n; i++) {
		a[i].F = w[i];
		a[i].S = i;
	}
	sort(a, a + n);
	s = 0;
	for (i =0; i< n; i++) {
		if (s + a[i].F <= r) {s += a[i].F; v[a[i].S] = 1;}
		else break;
	}
	en = i;
	for (i = 0, j = en; i < en && j < n && s < l; i++, j++) {
		s -= a[i].F;
		s += a[j].F;
		v[a[i].S] = 0;
		v[a[j].S] = 1;
	}
	if (s < l) return ans;
	for (i =0; i < n; i++) if (v[i]) ans.push_back(i);
	return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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