oj.uz

Submission #1115239

# Submission time Handle Problem Language Result Execution time Memory
1115239 2024-11-20T09:16:57 Z Zflop Detecting Molecules (IOI16_molecules) C++14
9 / 100
 1 ms 336 KB 
#pragma once
#include <bits/stdc++.h>
#include <vector>
using namespace std;
const int NMAX = (int)1e3 * 2;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<pair<int,int>>p;
    for (int i = 0; i < w.size();++i)
        p.push_back({w[i],i});
    sort(p.begin(),p.end());
    vector<int>v;
    int s = 0;
    for (int i = w.size() - 1; i >= 0;--i) {
        if (s >= l && s <= u) return v;
        if (s + p[i].first <= u) {
            v.push_back(p[i].second);
            s += p[i].first;
        }
    }
    if (s < l) return {};
    return v;
}

Compilation message

molecules.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for (int i = 0; i < w.size();++i)
      |                     ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory 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 336 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 336 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 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Contestant can not find answer, jury can
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory 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 336 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 336 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 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Incorrect 1 ms 336 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory 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 336 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 336 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 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Incorrect 1 ms 336 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory 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 336 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 336 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 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Incorrect 1 ms 336 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory 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 336 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 336 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 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Incorrect 1 ms 336 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -