답안 #289185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
289185	2020-09-02T12:48:41 Z	NicolaAbusaad2014	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	1 ms	256 KB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> find_subset(int l,int r,vector<int>w)
{
    vector<pair<int,int> >x,v;
    for(long i=0;i<w.size();i++){
    x.push_back(make_pair(w[i],i));
    }
    sort(w.begin(),w.end());
    vector<int>ans;
    long long sum=0,now=0;
    bool ok=false;
    for(long i=0;i<w.size();i++){
    if(sum<l){
    sum+=x[i].first;
    v.push_back(make_pair(x[i].first,x[i].second));
    }
    if(sum>r){
    sum-=v[now].first;
    now++;
    }
    if(sum>=l&&sum<=r){
    ok=true;
    break;
    }
    }
    if(ok){
    for(long i=now;i<v.size();i++){
    ans.push_back(v[i].second);
    }
    }
    return ans;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:19: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(long i=0;i<w.size();i++){
      |                  ~^~~~~~~~~
molecules.cpp:16:19: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(long i=0;i<w.size();i++){
      |                  ~^~~~~~~~~
molecules.cpp:31:21: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(long i=now;i<v.size();i++){
      |                    ~^~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	0 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	0 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	256 KB	OK (n = 12, answer = NO)
24	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	0 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
34	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
35	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
36	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
37	Correct	0 ms	256 KB	OK (n = 28, answer = YES)
38	Correct	0 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	0 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
42	Correct	0 ms	256 KB	OK (n = 10, answer = YES)
43	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
45	Incorrect	0 ms	256 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	0 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	0 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	256 KB	OK (n = 12, answer = NO)
24	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	0 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
34	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
35	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
36	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
37	Correct	0 ms	256 KB	OK (n = 28, answer = YES)
38	Correct	0 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	0 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
42	Correct	0 ms	256 KB	OK (n = 10, answer = YES)
43	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
45	Incorrect	0 ms	256 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	0 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	0 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	256 KB	OK (n = 12, answer = NO)
24	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	0 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
34	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
35	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
36	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
37	Correct	0 ms	256 KB	OK (n = 28, answer = YES)
38	Correct	0 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	0 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
42	Correct	0 ms	256 KB	OK (n = 10, answer = YES)
43	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
45	Incorrect	0 ms	256 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	0 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	0 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	256 KB	OK (n = 12, answer = NO)
24	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	0 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	0 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	0 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
34	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
35	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
36	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
37	Correct	0 ms	256 KB	OK (n = 28, answer = YES)
38	Correct	0 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	0 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
42	Correct	0 ms	256 KB	OK (n = 10, answer = YES)
43	Correct	0 ms	256 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	256 KB	OK (n = 100, answer = YES)
45	Incorrect	0 ms	256 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

답안 #289185

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 12.0

Subtask #4 0 / 15.0

Subtask #5 0 / 23.0

Subtask #6 0 / 31.0

Subtask #1
9.0 / 9.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0