oj.uz

Submission #140391

# Submission time Handle Problem Language Result Execution time Memory
140391 2019-08-02T17:09:19 Z MrBrionix Detecting Molecules (IOI16_molecules) C++14
19 / 100
 2 ms 504 KB 
#include <cstdio>
#include <vector>
#include <cassert>
#include<bits/stdc++.h>
using namespace std;
//#include "molecules.h"




vector<int> find_subset(int l, int u, vector<int> w) {
    
    pair<int,int> v[w.size()];
    
    for(int i=0;i<w.size();i++){
        v[i].first=w[i];
        v[i].second=i;    
    }
    
    sort(v,v+w.size());
    
    int sx=0,dx=0,sum=w[0];
    vector<int> sol;
    
    while(dx!=w.size()-1){
    
        while(sum<l && (dx+1)<w.size()){
            dx++;
            sum+=v[dx].first;    
            //cout<<sx<<" "<<dx<<" "<<sum<<endl;
        }
        
        if(sum>=l && sum<=u)break;
        
        
        while(sum>u){
            sum-=v[sx].first;
            sx++;   
            //cout<<sx<<" "<<dx<<" "<<sum<<endl; 
        }
        
        if(sum>=l && sum<=u)break;       
    }
    
    
    if(sum<l || sum>u)
    return std::vector<int>(0);
    
    for(int i=sx;i<=dx;i++){
        sol.push_back(v[i].second);    
    }
    
    return sol;
}
/*
int main() {
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);
    
    
    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}*/

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:15:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<w.size();i++){
                 ~^~~~~~~~~
molecules.cpp:25:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(dx!=w.size()-1){
           ~~^~~~~~~~~~~~
molecules.cpp:27:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(sum<l && (dx+1)<w.size()){
                        ~~~~~~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 256 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 256 KB OK (n = 3, answer = NO)
14 Correct 2 ms 252 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 504 KB OK (n = 100, answer = NO)
19 Correct 2 ms 256 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 12, answer = YES)
2 Correct 2 ms 376 KB OK (n = 12, answer = YES)
3 Correct 2 ms 376 KB OK (n = 12, answer = NO)
4 Correct 2 ms 256 KB OK (n = 12, answer = NO)
5 Correct 2 ms 376 KB OK (n = 12, answer = YES)
6 Correct 2 ms 380 KB OK (n = 12, answer = YES)
7 Correct 2 ms 252 KB OK (n = 12, answer = YES)
8 Correct 2 ms 256 KB OK (n = 12, answer = YES)
9 Correct 2 ms 256 KB OK (n = 6, answer = YES)
10 Correct 2 ms 256 KB OK (n = 12, answer = YES)
11 Correct 2 ms 252 KB OK (n = 100, answer = NO)
12 Correct 2 ms 256 KB OK (n = 100, answer = YES)
13 Correct 2 ms 252 KB OK (n = 100, answer = NO)
14 Correct 2 ms 256 KB OK (n = 100, answer = YES)
15 Correct 2 ms 376 KB OK (n = 100, answer = YES)
16 Correct 2 ms 256 KB OK (n = 100, answer = YES)
17 Correct 2 ms 256 KB OK (n = 100, answer = YES)

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 256 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 256 KB OK (n = 3, answer = NO)
14 Correct 2 ms 252 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 504 KB OK (n = 100, answer = NO)
19 Correct 2 ms 256 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 376 KB OK (n = 12, answer = NO)
23 Correct 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 376 KB OK (n = 12, answer = YES)
25 Correct 2 ms 380 KB OK (n = 12, answer = YES)
26 Correct 2 ms 252 KB OK (n = 12, answer = YES)
27 Correct 2 ms 256 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 2 ms 252 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 2 ms 252 KB OK (n = 100, answer = NO)
33 Correct 2 ms 256 KB OK (n = 100, answer = YES)
34 Correct 2 ms 376 KB OK (n = 100, answer = YES)
35 Correct 2 ms 256 KB OK (n = 100, answer = YES)
36 Correct 2 ms 256 KB OK (n = 100, answer = YES)
37 Correct 2 ms 376 KB OK (n = 28, answer = YES)
38 Correct 2 ms 256 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 376 KB OK (n = 100, answer = YES)
41 Correct 2 ms 376 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 252 KB OK (n = 100, answer = YES)
44 Incorrect 2 ms 376 KB sum of weights should be in [990..1000] but it is 989
45 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 256 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 256 KB OK (n = 3, answer = NO)
14 Correct 2 ms 252 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 504 KB OK (n = 100, answer = NO)
19 Correct 2 ms 256 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 376 KB OK (n = 12, answer = NO)
23 Correct 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 376 KB OK (n = 12, answer = YES)
25 Correct 2 ms 380 KB OK (n = 12, answer = YES)
26 Correct 2 ms 252 KB OK (n = 12, answer = YES)
27 Correct 2 ms 256 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 2 ms 252 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 2 ms 252 KB OK (n = 100, answer = NO)
33 Correct 2 ms 256 KB OK (n = 100, answer = YES)
34 Correct 2 ms 376 KB OK (n = 100, answer = YES)
35 Correct 2 ms 256 KB OK (n = 100, answer = YES)
36 Correct 2 ms 256 KB OK (n = 100, answer = YES)
37 Correct 2 ms 376 KB OK (n = 28, answer = YES)
38 Correct 2 ms 256 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 376 KB OK (n = 100, answer = YES)
41 Correct 2 ms 376 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 252 KB OK (n = 100, answer = YES)
44 Incorrect 2 ms 376 KB sum of weights should be in [990..1000] but it is 989
45 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 256 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 256 KB OK (n = 3, answer = NO)
14 Correct 2 ms 252 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 504 KB OK (n = 100, answer = NO)
19 Correct 2 ms 256 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 376 KB OK (n = 12, answer = NO)
23 Correct 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 376 KB OK (n = 12, answer = YES)
25 Correct 2 ms 380 KB OK (n = 12, answer = YES)
26 Correct 2 ms 252 KB OK (n = 12, answer = YES)
27 Correct 2 ms 256 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 2 ms 252 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 2 ms 252 KB OK (n = 100, answer = NO)
33 Correct 2 ms 256 KB OK (n = 100, answer = YES)
34 Correct 2 ms 376 KB OK (n = 100, answer = YES)
35 Correct 2 ms 256 KB OK (n = 100, answer = YES)
36 Correct 2 ms 256 KB OK (n = 100, answer = YES)
37 Correct 2 ms 376 KB OK (n = 28, answer = YES)
38 Correct 2 ms 256 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 376 KB OK (n = 100, answer = YES)
41 Correct 2 ms 376 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 252 KB OK (n = 100, answer = YES)
44 Incorrect 2 ms 376 KB sum of weights should be in [990..1000] but it is 989
45 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 256 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 256 KB OK (n = 3, answer = NO)
14 Correct 2 ms 252 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 504 KB OK (n = 100, answer = NO)
19 Correct 2 ms 256 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 376 KB OK (n = 12, answer = NO)
23 Correct 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 376 KB OK (n = 12, answer = YES)
25 Correct 2 ms 380 KB OK (n = 12, answer = YES)
26 Correct 2 ms 252 KB OK (n = 12, answer = YES)
27 Correct 2 ms 256 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 2 ms 252 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 KB OK (n = 100, answer = YES)
32 Correct 2 ms 252 KB OK (n = 100, answer = NO)
33 Correct 2 ms 256 KB OK (n = 100, answer = YES)
34 Correct 2 ms 376 KB OK (n = 100, answer = YES)
35 Correct 2 ms 256 KB OK (n = 100, answer = YES)
36 Correct 2 ms 256 KB OK (n = 100, answer = YES)
37 Correct 2 ms 376 KB OK (n = 28, answer = YES)
38 Correct 2 ms 256 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 376 KB OK (n = 100, answer = YES)
41 Correct 2 ms 376 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 252 KB OK (n = 100, answer = YES)
44 Incorrect 2 ms 376 KB sum of weights should be in [990..1000] but it is 989
45 Halted 0 ms 0 KB -