oj.uz

답안 #571073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571073 2022-06-01T08:09:50 Z web Detecting Molecules (IOI16_molecules) C++17
100 / 100
 89 ms 14924 KB 
#include <set>
#include <iostream>
#include "molecules.h"
#include <algorithm>
using namespace std;

vector<vector<int>> dp; 
void knapsack(vector<int>& weights, int u)
{
    for(int i = 0; i<weights.size(); ++i)
    {
        for(int  weight = 0; weight <= u; ++weight)
        {
            if(weight < weights[i])
            {
                dp[i+1][weight] = dp[i][weight];
            }
            else
            {
                if(dp[i][weight] >= dp[i][weight - weights[i]]+ weights[i])
                {
                    dp[i+1][weight] = dp[i][weight];
                }
                else
                {
                    dp[i+1][weight] = dp[i][weight-weights[i]] + weights[i];
                }
            }
        }
    }
    
}


std::vector<int> find_subset(int l, int u, std::vector<int> w) 
{
    vector<pair<int,int>> wP(w.size());
    for(int i = 0; i<w.size(); ++i)
    {
        wP[i] = {w[i], i};
    }
    sort(wP.begin(), wP.end());
    //construct prefix
    long long currSum = 0;
    int bad_index = 0;
    int n = wP.size();
    for(bad_index = 0; bad_index <n; ++bad_index)
    {
        currSum += wP[bad_index].first;
        if(currSum > u)
            break;
    }
    if(bad_index == 0)
        return vector<int>(0);
    
    set<pair<int,int>> molsWanted, molsRemaining;
    long long sumWanted = 0;
    for(int i = 0; i< bad_index; ++i)
     {   
        molsWanted.insert(wP[i]);
        sumWanted += wP[i].first;
     }
    for(int i = bad_index; i<n; ++i)
        molsRemaining.insert(wP[i]);
    
    while(sumWanted < l && !molsRemaining.empty())
    {
        if(molsWanted.begin() -> first == molsRemaining.rbegin() -> first)
            break;
        sumWanted += molsRemaining.rbegin() -> first - molsWanted.begin() -> first;
        auto deleteEL = *molsWanted.begin();
        auto insEl = *molsRemaining.rbegin();
        molsRemaining.erase(insEl);
        molsWanted.erase(deleteEL);
        molsWanted.insert(insEl);
    }

    if(sumWanted < l)
    {
        return vector<int>(0);        
    }
    vector<int> retVal;
    for(auto elemenet: molsWanted)
        retVal.push_back(elemenet.second);
    return retVal;
    



}

Compilation message

molecules.cpp: In function 'void knapsack(std::vector<int>&, int)':
molecules.cpp:10:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i = 0; i<weights.size(); ++i)
      |                    ~^~~~~~~~~~~~~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:38:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i = 0; i<w.size(); ++i)
      |                    ~^~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 300 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 300 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 6 ms 852 KB OK (n = 10000, answer = YES)
56 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
57 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 852 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
67 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
69 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
71 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 340 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 300 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 6 ms 852 KB OK (n = 10000, answer = YES)
56 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
57 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 852 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
67 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
69 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
71 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 340 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)
74 Correct 3 ms 724 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 852 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 852 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 852 KB OK (n = 10000, answer = NO)
78 Correct 4 ms 852 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 980 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 852 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
82 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 852 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 980 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
88 Correct 4 ms 812 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 852 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 300 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 6 ms 852 KB OK (n = 10000, answer = YES)
56 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
57 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 852 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
67 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
69 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
71 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 340 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)
74 Correct 3 ms 724 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 852 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 852 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 852 KB OK (n = 10000, answer = NO)
78 Correct 4 ms 852 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 980 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 852 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
82 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 852 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 980 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 852 KB OK (n = 10000, answer = YES)
88 Correct 4 ms 812 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 852 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 212 KB OK (n = 1, answer = YES)
95 Correct 0 ms 212 KB OK (n = 3, answer = YES)
96 Correct 1 ms 212 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 58 ms 10384 KB OK (n = 150000, answer = NO)
99 Correct 84 ms 14336 KB OK (n = 200000, answer = YES)
100 Correct 89 ms 14924 KB OK (n = 200000, answer = NO)
101 Correct 85 ms 14380 KB OK (n = 200000, answer = YES)
102 Correct 88 ms 14752 KB OK (n = 200000, answer = YES)
103 Correct 86 ms 14332 KB OK (n = 200000, answer = YES)
104 Correct 80 ms 14172 KB OK (n = 200000, answer = YES)
105 Correct 83 ms 13484 KB OK (n = 200000, answer = NO)
106 Correct 88 ms 14292 KB OK (n = 200000, answer = YES)
107 Correct 47 ms 5532 KB OK (n = 200000, answer = NO)
108 Correct 78 ms 13556 KB OK (n = 200000, answer = NO)
109 Correct 76 ms 13480 KB OK (n = 200000, answer = NO)
110 Correct 73 ms 13728 KB OK (n = 200000, answer = YES)
111 Correct 72 ms 13868 KB OK (n = 200000, answer = YES)
112 Correct 62 ms 13872 KB OK (n = 200000, answer = YES)
113 Correct 64 ms 14004 KB OK (n = 200000, answer = YES)
114 Correct 72 ms 13984 KB OK (n = 200000, answer = YES)
115 Correct 69 ms 13948 KB OK (n = 200000, answer = YES)
116 Correct 77 ms 13724 KB OK (n = 200000, answer = YES)
117 Correct 84 ms 13744 KB OK (n = 200000, answer = YES)