oj.uz

답안 #448731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448731 2021-08-01T07:11:59 Z pdstiago Detecting Molecules (IOI16_molecules) C++14
9 / 100
 1 ms 292 KB 
#include <bits/stdc++.h>
using namespace std;

#define MOD 1000000007
#define mxn 100005
#define mxm 105
#define f first
#define s second
#define pb push_back
#define es " "
#define endl '\n'
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define ll long long
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef pair<int, pii> pip;

vector<int> find_subset(int l, int u, vector<int> w){
    vector<int> resp;
    sort(all(w));
    multiset<pii> sla; 
    int le=0, r=0, n=sz(w);
    ll soma=0;
    while(le<n){
        while(r<n && soma<l){
            soma+=w[r];
            sla.insert({w[r], r});
            r++;
        }
        if(soma>=l && soma<=u){
            for(pii i:sla){
                resp.pb(i.s);
            }
            return resp;
        }
        soma-=w[le];
        sla.erase(sla.find({w[le], le}));
        le++;
    }
    return resp;
}

// int main(){
//     fastio;
    
//     return 0;
// }

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 12, answer = YES)
2 Correct 0 ms 204 KB OK (n = 12, answer = YES)
3 Correct 0 ms 204 KB OK (n = 12, answer = NO)
4 Correct 0 ms 204 KB OK (n = 12, answer = NO)
5 Correct 0 ms 204 KB OK (n = 12, answer = YES)
6 Correct 1 ms 204 KB OK (n = 12, answer = YES)
7 Correct 1 ms 204 KB OK (n = 12, answer = YES)
8 Correct 1 ms 204 KB OK (n = 12, answer = YES)
9 Correct 1 ms 204 KB OK (n = 6, answer = YES)
10 Correct 1 ms 288 KB OK (n = 12, answer = YES)
11 Correct 1 ms 204 KB OK (n = 100, answer = NO)
12 Incorrect 1 ms 204 KB sum of weights should be in [50..51] but it is 73
13 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 292 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 288 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Incorrect 1 ms 204 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 292 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 288 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Incorrect 1 ms 204 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 292 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 288 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Incorrect 1 ms 204 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 292 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 288 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Incorrect 1 ms 204 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -