oj.uz

Submission #51706

# Submission time Handle Problem Language Result Execution time Memory
51706 2018-06-20T07:12:17 Z tincamatei Detecting Molecules (IOI16_molecules) C++14
9 / 100
 3 ms 744 KB 
#include<bits/stdc++.h>
#ifdef EVAL
#include "molecules.h"
#endif

using namespace std;

const int MAX_N = 200000;
long long _sp[1+MAX_N], *sp = _sp + 1;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n, lx, rx;
    vector<int> result;
    n = w.size();
    lx = 2, rx = 1;
    
    sort(w.begin(), w.end());
    
    for(int i = 0; i < n; ++i) {
        int st = -1, dr = i;
        sp[i] = sp[i - 1] + w[i];
        while(dr - st > 1) {
        	int mid = (st + dr) / 2;
            if(sp[i] - sp[mid] >= l)
                st = mid;
            else
                dr = mid;
        }
        if(l <= sp[i] - sp[st] && sp[i] - sp[st] <= u)
            lx = st, rx = i;
    }
    
    for(lx = lx + 1; lx <= rx; ++lx)
        result.push_back(lx);
    return result;
}

#ifndef EVAL
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]);
}
#endif

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 744 KB OK (n = 12, answer = YES)
2 Correct 2 ms 744 KB OK (n = 12, answer = YES)
3 Correct 2 ms 744 KB OK (n = 12, answer = NO)
4 Correct 2 ms 744 KB OK (n = 12, answer = NO)
5 Correct 2 ms 744 KB OK (n = 12, answer = YES)
6 Correct 2 ms 744 KB OK (n = 12, answer = YES)
7 Correct 2 ms 744 KB OK (n = 12, answer = YES)
8 Correct 2 ms 744 KB OK (n = 12, answer = YES)
9 Correct 2 ms 744 KB OK (n = 6, answer = YES)
10 Correct 2 ms 744 KB OK (n = 12, answer = YES)
11 Correct 2 ms 744 KB OK (n = 100, answer = NO)
12 Incorrect 2 ms 744 KB sum of weights should be in [50..51] but it is 35
13 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB OK (n = 1, answer = NO)
2 Correct 2 ms 380 KB OK (n = 1, answer = NO)
3 Correct 2 ms 380 KB OK (n = 1, answer = YES)
4 Correct 2 ms 428 KB OK (n = 2, answer = YES)
5 Correct 2 ms 480 KB OK (n = 2, answer = YES)
6 Correct 2 ms 488 KB OK (n = 3, answer = YES)
7 Correct 2 ms 744 KB OK (n = 3, answer = YES)
8 Correct 2 ms 744 KB OK (n = 3, answer = YES)
9 Correct 2 ms 744 KB OK (n = 3, answer = YES)
10 Correct 2 ms 744 KB OK (n = 3, answer = YES)
11 Correct 2 ms 744 KB OK (n = 3, answer = YES)
12 Correct 3 ms 744 KB OK (n = 3, answer = YES)
13 Correct 2 ms 744 KB OK (n = 3, answer = NO)
14 Correct 2 ms 744 KB OK (n = 3, answer = YES)
15 Correct 2 ms 744 KB OK (n = 3, answer = YES)
16 Correct 2 ms 744 KB OK (n = 3, answer = NO)
17 Correct 2 ms 744 KB OK (n = 3, answer = NO)
18 Correct 2 ms 744 KB OK (n = 100, answer = NO)
19 Correct 2 ms 744 KB OK (n = 100, answer = YES)
20 Correct 2 ms 744 KB OK (n = 12, answer = YES)
21 Correct 2 ms 744 KB OK (n = 12, answer = YES)
22 Correct 2 ms 744 KB OK (n = 12, answer = NO)
23 Correct 2 ms 744 KB OK (n = 12, answer = NO)
24 Correct 2 ms 744 KB OK (n = 12, answer = YES)
25 Correct 2 ms 744 KB OK (n = 12, answer = YES)
26 Correct 2 ms 744 KB OK (n = 12, answer = YES)
27 Correct 2 ms 744 KB OK (n = 12, answer = YES)
28 Correct 2 ms 744 KB OK (n = 6, answer = YES)
29 Correct 2 ms 744 KB OK (n = 12, answer = YES)
30 Correct 2 ms 744 KB OK (n = 100, answer = NO)
31 Incorrect 2 ms 744 KB sum of weights should be in [50..51] but it is 35
32 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB OK (n = 1, answer = NO)
2 Correct 2 ms 380 KB OK (n = 1, answer = NO)
3 Correct 2 ms 380 KB OK (n = 1, answer = YES)
4 Correct 2 ms 428 KB OK (n = 2, answer = YES)
5 Correct 2 ms 480 KB OK (n = 2, answer = YES)
6 Correct 2 ms 488 KB OK (n = 3, answer = YES)
7 Correct 2 ms 744 KB OK (n = 3, answer = YES)
8 Correct 2 ms 744 KB OK (n = 3, answer = YES)
9 Correct 2 ms 744 KB OK (n = 3, answer = YES)
10 Correct 2 ms 744 KB OK (n = 3, answer = YES)
11 Correct 2 ms 744 KB OK (n = 3, answer = YES)
12 Correct 3 ms 744 KB OK (n = 3, answer = YES)
13 Correct 2 ms 744 KB OK (n = 3, answer = NO)
14 Correct 2 ms 744 KB OK (n = 3, answer = YES)
15 Correct 2 ms 744 KB OK (n = 3, answer = YES)
16 Correct 2 ms 744 KB OK (n = 3, answer = NO)
17 Correct 2 ms 744 KB OK (n = 3, answer = NO)
18 Correct 2 ms 744 KB OK (n = 100, answer = NO)
19 Correct 2 ms 744 KB OK (n = 100, answer = YES)
20 Correct 2 ms 744 KB OK (n = 12, answer = YES)
21 Correct 2 ms 744 KB OK (n = 12, answer = YES)
22 Correct 2 ms 744 KB OK (n = 12, answer = NO)
23 Correct 2 ms 744 KB OK (n = 12, answer = NO)
24 Correct 2 ms 744 KB OK (n = 12, answer = YES)
25 Correct 2 ms 744 KB OK (n = 12, answer = YES)
26 Correct 2 ms 744 KB OK (n = 12, answer = YES)
27 Correct 2 ms 744 KB OK (n = 12, answer = YES)
28 Correct 2 ms 744 KB OK (n = 6, answer = YES)
29 Correct 2 ms 744 KB OK (n = 12, answer = YES)
30 Correct 2 ms 744 KB OK (n = 100, answer = NO)
31 Incorrect 2 ms 744 KB sum of weights should be in [50..51] but it is 35
32 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB OK (n = 1, answer = NO)
2 Correct 2 ms 380 KB OK (n = 1, answer = NO)
3 Correct 2 ms 380 KB OK (n = 1, answer = YES)
4 Correct 2 ms 428 KB OK (n = 2, answer = YES)
5 Correct 2 ms 480 KB OK (n = 2, answer = YES)
6 Correct 2 ms 488 KB OK (n = 3, answer = YES)
7 Correct 2 ms 744 KB OK (n = 3, answer = YES)
8 Correct 2 ms 744 KB OK (n = 3, answer = YES)
9 Correct 2 ms 744 KB OK (n = 3, answer = YES)
10 Correct 2 ms 744 KB OK (n = 3, answer = YES)
11 Correct 2 ms 744 KB OK (n = 3, answer = YES)
12 Correct 3 ms 744 KB OK (n = 3, answer = YES)
13 Correct 2 ms 744 KB OK (n = 3, answer = NO)
14 Correct 2 ms 744 KB OK (n = 3, answer = YES)
15 Correct 2 ms 744 KB OK (n = 3, answer = YES)
16 Correct 2 ms 744 KB OK (n = 3, answer = NO)
17 Correct 2 ms 744 KB OK (n = 3, answer = NO)
18 Correct 2 ms 744 KB OK (n = 100, answer = NO)
19 Correct 2 ms 744 KB OK (n = 100, answer = YES)
20 Correct 2 ms 744 KB OK (n = 12, answer = YES)
21 Correct 2 ms 744 KB OK (n = 12, answer = YES)
22 Correct 2 ms 744 KB OK (n = 12, answer = NO)
23 Correct 2 ms 744 KB OK (n = 12, answer = NO)
24 Correct 2 ms 744 KB OK (n = 12, answer = YES)
25 Correct 2 ms 744 KB OK (n = 12, answer = YES)
26 Correct 2 ms 744 KB OK (n = 12, answer = YES)
27 Correct 2 ms 744 KB OK (n = 12, answer = YES)
28 Correct 2 ms 744 KB OK (n = 6, answer = YES)
29 Correct 2 ms 744 KB OK (n = 12, answer = YES)
30 Correct 2 ms 744 KB OK (n = 100, answer = NO)
31 Incorrect 2 ms 744 KB sum of weights should be in [50..51] but it is 35
32 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB OK (n = 1, answer = NO)
2 Correct 2 ms 380 KB OK (n = 1, answer = NO)
3 Correct 2 ms 380 KB OK (n = 1, answer = YES)
4 Correct 2 ms 428 KB OK (n = 2, answer = YES)
5 Correct 2 ms 480 KB OK (n = 2, answer = YES)
6 Correct 2 ms 488 KB OK (n = 3, answer = YES)
7 Correct 2 ms 744 KB OK (n = 3, answer = YES)
8 Correct 2 ms 744 KB OK (n = 3, answer = YES)
9 Correct 2 ms 744 KB OK (n = 3, answer = YES)
10 Correct 2 ms 744 KB OK (n = 3, answer = YES)
11 Correct 2 ms 744 KB OK (n = 3, answer = YES)
12 Correct 3 ms 744 KB OK (n = 3, answer = YES)
13 Correct 2 ms 744 KB OK (n = 3, answer = NO)
14 Correct 2 ms 744 KB OK (n = 3, answer = YES)
15 Correct 2 ms 744 KB OK (n = 3, answer = YES)
16 Correct 2 ms 744 KB OK (n = 3, answer = NO)
17 Correct 2 ms 744 KB OK (n = 3, answer = NO)
18 Correct 2 ms 744 KB OK (n = 100, answer = NO)
19 Correct 2 ms 744 KB OK (n = 100, answer = YES)
20 Correct 2 ms 744 KB OK (n = 12, answer = YES)
21 Correct 2 ms 744 KB OK (n = 12, answer = YES)
22 Correct 2 ms 744 KB OK (n = 12, answer = NO)
23 Correct 2 ms 744 KB OK (n = 12, answer = NO)
24 Correct 2 ms 744 KB OK (n = 12, answer = YES)
25 Correct 2 ms 744 KB OK (n = 12, answer = YES)
26 Correct 2 ms 744 KB OK (n = 12, answer = YES)
27 Correct 2 ms 744 KB OK (n = 12, answer = YES)
28 Correct 2 ms 744 KB OK (n = 6, answer = YES)
29 Correct 2 ms 744 KB OK (n = 12, answer = YES)
30 Correct 2 ms 744 KB OK (n = 100, answer = NO)
31 Incorrect 2 ms 744 KB sum of weights should be in [50..51] but it is 35
32 Halted 0 ms 0 KB -