oj.uz

답안 #1104529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1104529 2024-10-24T02:10:14 Z ngano_upat_na Detecting Molecules (IOI16_molecules) C++17
9 / 100
 35 ms 588 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include "bits/stdc++.h"
#include "molecules.h"
using namespace std;
using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w) {
    srand(time(0));

    int n = (int)w.size();
    ll sum = 0;
    for (int i=0; i<n; i++) {
        sum += (ll)w[i];
    }
    if (sum == u) {
        vector<int> res;
        for (int i=0; i<n; i++) {
            res.push_back(i);
        }
        return res;
    }
    if (sum < l) {
        return {};
    }

    for (int i=0; i<5000; i++) {
        set<int> s;
        for (int j=0; j<n; j++) {
            int r = rand()%n;
            s.insert(r);
        }
        sum = 0;
        for (auto &e:s) {
            sum += w[e];
        }
        if (l <= sum && sum <= u) {
            vector<int> res;
            for (auto &e:s) {
                res.push_back(e);
            }
            return res;
        }
    }
    return {};
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB OK (n = 12, answer = YES)
2 Correct 1 ms 336 KB OK (n = 12, answer = YES)
3 Correct 4 ms 336 KB OK (n = 12, answer = NO)
4 Correct 4 ms 336 KB OK (n = 12, answer = NO)
5 Incorrect 4 ms 336 KB Contestant can not find answer, jury can
6 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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