oj.uz

답안 #41241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41241 2018-02-15T05:08:28 Z Talant Detecting Molecules (IOI16_molecules) C++14
9 / 100
 2 ms 692 KB 
#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
        int sum = (int)w.size() * w[0];
        int cnt = (int)w.size();

        while (sum > u) {
                sum -= w[0];
                cnt --;
        }
        vector <int> vec;

        if (sum < l)
                return vec;

        for (int i = 0; i < cnt; i ++)
                vec.push_back(i);
        return vec;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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