oj.uz

답안 #1018895

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018895 2024-07-10T10:42:20 Z AlgorithmWarrior Detecting Molecules (IOI16_molecules) C++14
100 / 100
 42 ms 5692 KB 
#include <cstdio>
#include <vector>
#include <cassert>
#include <algorithm>

#include "molecules.h"

using namespace std;

struct str
{
    int val;
    int ind;
};

bool crt(str a,str b)
{
    return a.val<b.val;
}

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<str>date(w.size());
    int i;
    for(i=0;i<date.size();++i)
         date[i]={w[i],i};
    sort(date.begin(),date.end(),crt);
    vector<int>res;
    unsigned total=0;
    for(i=date.size()-1;i>=0;--i)
    {
        total+=date[i].val;
        res.push_back(date[i].ind);
        if(l<=total && total<=u)
            return res;
        if(total>u)
            break;
    }
    if(i==-1)
        return vector<int>(0);
    int care;
    for(care=0;i<date.size();++i,++care)
    {
        total-=date[i].val;
        total+=date[care].val;
        res[res.size()-1-care]=date[care].ind;
        if(l<=total && total<=u)
            return res;
    }
    return vector<int>(0);
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:24:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<str>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(i=0;i<date.size();++i)
      |             ~^~~~~~~~~~~~
molecules.cpp:33:13: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   33 |         if(l<=total && total<=u)
      |            ~^~~~~~~
molecules.cpp:33:29: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   33 |         if(l<=total && total<=u)
      |                        ~~~~~^~~
molecules.cpp:35:17: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   35 |         if(total>u)
      |            ~~~~~^~
molecules.cpp:41:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<str>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(care=0;i<date.size();++i,++care)
      |                ~^~~~~~~~~~~~
molecules.cpp:46:13: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   46 |         if(l<=total && total<=u)
      |            ~^~~~~~~
molecules.cpp:46:29: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   46 |         if(l<=total && total<=u)
      |                        ~~~~~^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 424 KB OK (n = 1, answer = YES)
4 Correct 0 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 604 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 ms 344 KB OK (n = 3, answer = YES)
10 Correct 0 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 348 KB OK (n = 3, answer = YES)
12 Correct 0 ms 388 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 428 KB OK (n = 3, answer = YES)
16 Correct 0 ms 348 KB OK (n = 3, answer = NO)
17 Correct 0 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Correct 0 ms 344 KB OK (n = 12, answer = YES)
21 Correct 0 ms 344 KB OK (n = 12, answer = YES)
22 Correct 0 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 348 KB OK (n = 12, answer = NO)
24 Correct 0 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 348 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 0 ms 348 KB OK (n = 6, answer = YES)
29 Correct 0 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 348 KB OK (n = 100, answer = NO)
31 Correct 0 ms 344 KB OK (n = 100, answer = YES)
32 Correct 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 348 KB OK (n = 100, answer = YES)
34 Correct 0 ms 348 KB OK (n = 100, answer = YES)
35 Correct 0 ms 344 KB OK (n = 100, answer = YES)
36 Correct 0 ms 348 KB OK (n = 100, answer = YES)
37 Correct 0 ms 344 KB OK (n = 28, answer = YES)
38 Correct 0 ms 604 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 0 ms 424 KB OK (n = 100, answer = YES)
42 Correct 0 ms 348 KB OK (n = 10, answer = YES)
43 Correct 0 ms 604 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 0 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 0 ms 348 KB OK (n = 100, answer = NO)
48 Correct 0 ms 348 KB OK (n = 100, answer = NO)
49 Correct 0 ms 348 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 0 ms 348 KB OK (n = 100, answer = YES)
52 Correct 0 ms 348 KB OK (n = 100, answer = YES)
53 Correct 0 ms 348 KB OK (n = 100, answer = YES)
54 Correct 0 ms 344 KB OK (n = 100, answer = YES)
55 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
56 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
57 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
58 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
60 Correct 1 ms 436 KB OK (n = 10000, answer = YES)
61 Correct 1 ms 600 KB OK (n = 10000, answer = NO)
62 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
64 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
65 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
66 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 348 KB OK (n = 865, answer = YES)
73 Correct 1 ms 348 KB OK (n = 820, answer = YES)
74 Correct 1 ms 604 KB OK (n = 7500, answer = NO)
75 Correct 1 ms 492 KB OK (n = 10000, answer = NO)
76 Correct 1 ms 604 KB OK (n = 10000, answer = NO)
77 Correct 1 ms 604 KB OK (n = 10000, answer = NO)
78 Correct 1 ms 604 KB OK (n = 10000, answer = NO)
79 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
80 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
81 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
82 Correct 1 ms 532 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 600 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 604 KB OK (n = 10000, answer = NO)
86 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 432 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 600 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 604 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 348 KB OK (n = 1, answer = YES)
95 Correct 0 ms 348 KB OK (n = 3, answer = YES)
96 Correct 0 ms 348 KB OK (n = 3, answer = NO)
97 Correct 0 ms 348 KB OK (n = 3, answer = YES)
98 Correct 16 ms 4564 KB OK (n = 150000, answer = NO)
99 Correct 27 ms 4956 KB OK (n = 200000, answer = YES)
100 Correct 29 ms 5468 KB OK (n = 200000, answer = NO)
101 Correct 28 ms 4936 KB OK (n = 200000, answer = YES)
102 Correct 35 ms 5468 KB OK (n = 200000, answer = YES)
103 Correct 23 ms 4952 KB OK (n = 200000, answer = YES)
104 Correct 22 ms 4956 KB OK (n = 200000, answer = YES)
105 Correct 26 ms 5324 KB OK (n = 200000, answer = NO)
106 Correct 34 ms 4820 KB OK (n = 200000, answer = YES)
107 Correct 42 ms 5692 KB OK (n = 200000, answer = NO)
108 Correct 22 ms 5320 KB OK (n = 200000, answer = NO)
109 Correct 24 ms 5324 KB OK (n = 200000, answer = NO)
110 Correct 35 ms 4436 KB OK (n = 200000, answer = YES)
111 Correct 18 ms 4696 KB OK (n = 200000, answer = YES)
112 Correct 34 ms 4440 KB OK (n = 200000, answer = YES)
113 Correct 19 ms 4696 KB OK (n = 200000, answer = YES)
114 Correct 19 ms 4696 KB OK (n = 200000, answer = YES)
115 Correct 20 ms 4700 KB OK (n = 200000, answer = YES)
116 Correct 26 ms 4476 KB OK (n = 200000, answer = YES)
117 Correct 17 ms 4444 KB OK (n = 200000, answer = YES)