oj.uz

답안 #142573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
142573 2019-08-09T18:34:05 Z andreiomd Detecting Molecules (IOI16_molecules) C++11
19 / 100
 5 ms 504 KB 
#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

const int NMAX = 2e5 + 5;

int N, A[NMAX];

long long dp[NMAX];

static long long Sum (int Left, int Right)
{
    if(Left > Right)
        return 0LL;

    return dp[Right] - dp[Left - 1];
}

vector < int > find_subset (int l, int u, vector < int > w)
{
    int N = (int)w.size();

    for(int i = 0; i < N; ++i)
        A[i + 1] = w[i];

    for(int i = 1; i <= N; ++i)
        dp[i] = dp[i - 1] + 1LL * A[i];

    bool Ok = false;

    int Left = 1, Right = 0;

    for(Left = 1, Right = 0; Left <= N; ++Left)
    {
        while(Sum(Left, Right) < l)
            ++Right;

        if(Sum(Left, Right) >= l && Sum(Left, Right) <= u)
        {
            Ok = true;

            break;
        }

        while(Sum(Left, Right) > u)
            ++Left;

        if(Sum(Left, Right) >= l && Sum(Left, Right) <= u)
        {
            Ok = true;

            break;
        }
    }

    vector < int > Sol;

    if(Ok)
    {
        for(int i = Left; i <= Right; ++i)
            Sol.push_back(i - 1);
    }

    return Sol;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB OK (n = 1, answer = NO)
2 Correct 2 ms 248 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 3 ms 376 KB OK (n = 2, answer = YES)
6 Correct 3 ms 376 KB OK (n = 3, answer = YES)
7 Correct 1 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 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 3 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 3 ms 376 KB OK (n = 3, answer = NO)
18 Correct 3 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 376 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 3 ms 376 KB OK (n = 12, answer = NO)
4 Correct 5 ms 376 KB OK (n = 12, answer = NO)
5 Correct 2 ms 252 KB OK (n = 12, answer = YES)
6 Correct 2 ms 376 KB OK (n = 12, answer = YES)
7 Correct 2 ms 252 KB OK (n = 12, answer = YES)
8 Correct 2 ms 380 KB OK (n = 12, answer = YES)
9 Correct 2 ms 376 KB OK (n = 6, answer = YES)
10 Correct 2 ms 252 KB OK (n = 12, answer = YES)
11 Correct 3 ms 376 KB OK (n = 100, answer = NO)
12 Correct 2 ms 376 KB OK (n = 100, answer = YES)
13 Correct 3 ms 376 KB OK (n = 100, answer = NO)
14 Correct 3 ms 376 KB OK (n = 100, answer = YES)
15 Correct 2 ms 376 KB OK (n = 100, answer = YES)
16 Correct 2 ms 376 KB OK (n = 100, answer = YES)
17 Correct 2 ms 380 KB OK (n = 100, answer = YES)

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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