oj.uz

답안 #472953

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472953 2021-09-14T15:48:02 Z nadorb Detecting Molecules (IOI16_molecules) C++14
19 / 100
 1 ms 240 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<pair<ll, int>> v(w.size());
    ll sum = 0, n = v.size();
    for(int  i = 0; i < n; i++){
        v[i].first = w[i];
        v[i].second = i;
    }
    sort(v.begin(), v.end());
    int db = 0;
    for(int i = 0; i < n; i++){
        if(sum + v[i].first <= u){
            sum += v[i].first;
            db++;
        }
    }
    vector<int> ki;
    int akt = 0;
    vector<int> mik;
    for(int i = 0; i < db; i++){
        mik.push_back(i);
    }
    while(sum < l && akt < db){
        sum += v[n - akt - 1].first - v[akt].first;
        mik[akt] = n - akt - 1;
        if(sum >= l){
            for(int i : mik){
                ki.push_back(v[i].second);
            }
            return ki;
        }
        akt++;
    }
    if(sum >= l){
        for(int i : mik){
            ki.push_back(v[i].second);
        }
        return ki;
    }
    return vector<int>(0);
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 208 KB OK (n = 100, answer = NO)
33 Correct 0 ms 208 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 208 KB OK (n = 100, answer = YES)
37 Correct 1 ms 216 KB OK (n = 28, answer = YES)
38 Correct 1 ms 208 KB OK (n = 27, answer = YES)
39 Correct 0 ms 240 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 208 KB OK (n = 100, answer = YES)
42 Correct 0 ms 216 KB OK (n = 10, answer = YES)
43 Correct 1 ms 216 KB OK (n = 100, answer = YES)
44 Correct 1 ms 216 KB OK (n = 100, answer = YES)
45 Correct 1 ms 216 KB OK (n = 100, answer = YES)
46 Correct 1 ms 216 KB OK (n = 100, answer = YES)
47 Incorrect 0 ms 216 KB item #59 is taken twice
48 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 208 KB OK (n = 100, answer = NO)
33 Correct 0 ms 208 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 208 KB OK (n = 100, answer = YES)
37 Correct 1 ms 216 KB OK (n = 28, answer = YES)
38 Correct 1 ms 208 KB OK (n = 27, answer = YES)
39 Correct 0 ms 240 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 208 KB OK (n = 100, answer = YES)
42 Correct 0 ms 216 KB OK (n = 10, answer = YES)
43 Correct 1 ms 216 KB OK (n = 100, answer = YES)
44 Correct 1 ms 216 KB OK (n = 100, answer = YES)
45 Correct 1 ms 216 KB OK (n = 100, answer = YES)
46 Correct 1 ms 216 KB OK (n = 100, answer = YES)
47 Incorrect 0 ms 216 KB item #59 is taken twice
48 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 208 KB OK (n = 100, answer = NO)
33 Correct 0 ms 208 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 208 KB OK (n = 100, answer = YES)
37 Correct 1 ms 216 KB OK (n = 28, answer = YES)
38 Correct 1 ms 208 KB OK (n = 27, answer = YES)
39 Correct 0 ms 240 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 208 KB OK (n = 100, answer = YES)
42 Correct 0 ms 216 KB OK (n = 10, answer = YES)
43 Correct 1 ms 216 KB OK (n = 100, answer = YES)
44 Correct 1 ms 216 KB OK (n = 100, answer = YES)
45 Correct 1 ms 216 KB OK (n = 100, answer = YES)
46 Correct 1 ms 216 KB OK (n = 100, answer = YES)
47 Incorrect 0 ms 216 KB item #59 is taken twice
48 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 208 KB OK (n = 100, answer = NO)
33 Correct 0 ms 208 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 208 KB OK (n = 100, answer = YES)
37 Correct 1 ms 216 KB OK (n = 28, answer = YES)
38 Correct 1 ms 208 KB OK (n = 27, answer = YES)
39 Correct 0 ms 240 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 208 KB OK (n = 100, answer = YES)
42 Correct 0 ms 216 KB OK (n = 10, answer = YES)
43 Correct 1 ms 216 KB OK (n = 100, answer = YES)
44 Correct 1 ms 216 KB OK (n = 100, answer = YES)
45 Correct 1 ms 216 KB OK (n = 100, answer = YES)
46 Correct 1 ms 216 KB OK (n = 100, answer = YES)
47 Incorrect 0 ms 216 KB item #59 is taken twice
48 Halted 0 ms 0 KB -