oj.uz

답안 #432140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
432140 2021-06-17T21:39:57 Z Monchito Detecting Molecules (IOI16_molecules) C++14
19 / 100
 1 ms 296 KB 
#include "molecules.h"
#include <iostream>
#include <algorithm>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<int> ret;
    bool can=false;
    int n = (int)w.size();

    vector<pair<int,int>> W(n);

    for(int i=0; i<n; i++) W[i] = make_pair(w[i], i);

    sort(W.begin(), W.end());
    
    pair<int,int> w1 = make_pair(W[0].first, 1);
    pair<int,int> w2 = make_pair(-1, 0);

    for(int i=1; i<n; i++) {
        if(w2 == make_pair(-1, 0)) {
            if(W[i].first == W[i-1].first) w1.second++;
            else w2 = make_pair(W[i].first, 1);
        }
        else w2.second++;
    }

    pair<int,int> p;

    for(int i=0; i<=w1.second; i++) {
        for(int j=0; j<=w2.second; j++) {
            int v = w1.first * i + w2.first * j; 
            if(v >= l && v <= u) {
                can = true;
                p = make_pair(i, j);
                break;
            }
        }

        if(can) break;
    }

    if(can) {
        for(int i=0; i<n; i++) {
            if(p.first == -1 && p.second == 0) break;

            if(p.first == -1) {
                p.second--;
                ret.push_back(W[i].second);
                continue;
            }
            
            if(p.first > 0) { p.first--; ret.push_back(W[i].second); }
            if(p.first == 0 && i<n-1 && W[i+1].first != W[i].first) p.first--;
        }
    }

    return (can)? ret : vector<int>(0);
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 292 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 292 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 0 ms 288 KB OK (n = 12, answer = YES)
2 Correct 1 ms 288 KB OK (n = 12, answer = YES)
3 Correct 1 ms 284 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 1 ms 204 KB OK (n = 12, answer = YES)
8 Correct 1 ms 204 KB OK (n = 12, answer = YES)
9 Correct 0 ms 204 KB OK (n = 6, answer = YES)
10 Correct 1 ms 204 KB OK (n = 12, answer = YES)
11 Correct 1 ms 204 KB OK (n = 100, answer = NO)
12 Correct 1 ms 204 KB OK (n = 100, answer = YES)
13 Correct 1 ms 204 KB OK (n = 100, answer = NO)
14 Correct 1 ms 204 KB OK (n = 100, answer = YES)
15 Correct 1 ms 204 KB OK (n = 100, answer = YES)
16 Correct 1 ms 204 KB OK (n = 100, answer = YES)
17 Correct 1 ms 204 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 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 292 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 292 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 288 KB OK (n = 12, answer = YES)
21 Correct 1 ms 288 KB OK (n = 12, answer = YES)
22 Correct 1 ms 284 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 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Incorrect 1 ms 204 KB Contestant can not find answer, jury can
39 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 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 292 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 292 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 288 KB OK (n = 12, answer = YES)
21 Correct 1 ms 288 KB OK (n = 12, answer = YES)
22 Correct 1 ms 284 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 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Incorrect 1 ms 204 KB Contestant can not find answer, jury can
39 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 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 292 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 292 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 288 KB OK (n = 12, answer = YES)
21 Correct 1 ms 288 KB OK (n = 12, answer = YES)
22 Correct 1 ms 284 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 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Incorrect 1 ms 204 KB Contestant can not find answer, jury can
39 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 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 292 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 296 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 292 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 288 KB OK (n = 12, answer = YES)
21 Correct 1 ms 288 KB OK (n = 12, answer = YES)
22 Correct 1 ms 284 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 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Incorrect 1 ms 204 KB Contestant can not find answer, jury can
39 Halted 0 ms 0 KB -