oj.uz

답안 #477915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
477915 2021-10-04T15:26:59 Z Fidisk Detecting Molecules (IOI16_molecules) C++14
100 / 100
 57 ms 7204 KB 
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;

#define oo 1e9
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) (((xxxx)>>(aaaa-1))&1)

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
typedef pair<pair<int,int>,pair<int,int>> piiii;
typedef pair<long long,long long> pll;
typedef pair<pair<long long,long long>,long long> plll;
typedef pair<pair<long long,long long>,pair<long long,long long>> pllll;
typedef pair<pair<long long,long long>,bool> pllb;
typedef pair<long double,long double> pld;
typedef pair<pair<long double,long double>,long double> plld;
typedef pair<long double,long long> pdl;

const ll base=361;
const ll mod=1e9;
const ll mod2=1e9;
const ld eps=1e-3;
const ld eps2=1e-7;
const ll maxn=2e5+9;
const ll maxsize=6e5+29;
const ld pi=acos(-1);
//const ll delta=1e5+7;
const int dx[4]={1,-1,0,0};
const int dy[4]={0,0,1,-1};

const int dxkn[8]={1,1,2,2,-1,-1,-2,-2};
const int dykn[8]={2,-2,1,-1,2,-2,1,-1};
const int dxki[8]={1,1,1,0,0,-1,-1,-1};
const int dyki[8]={1,0,-1,1,-1,1,0,-1};

vector<int> solvesub1(int l,int u,vector<pii> w) {
    vector<int> kq;
    kq.clear();
    int sum=0;
    for (int i=0;i<w.size();i++) {
        sum+=w[i].fi;
        kq.push_back(w[i].se);
        if (l<=sum&&sum<=u) {
            return kq;
        }
        if (sum>u) {
            return {};
        }
    }
    return {};
}

vector<int> solvesub2(int l,int u,vector<pii> w) {
    vector<int> kq;
    kq.clear();
    int sum=0;
    int rsum=0;
    int cnt=0;
    int len=0;
    for (int i=0;i<w.size();i++) {
        if (w[i].fi!=w[0].fi) {
            cnt++;
        }
    }
    for (int i=0;i<w.size();i++) {
        sum+=w[0].fi;
        len++;
        rsum=min(sum+len,sum+cnt);
        int p1,p2;
        p1=max(l,sum);
        p2=min(u,rsum);
        if (p1<=p2) {
            int k1=p1-sum;
            int k2=len-k1;
            //cout<<sum<<' '<<rsum<<' '<<k1<<' '<<k2<<'\n';
            for (int j=0;j<w.size();j++) {
                if (w[j].fi==w[0].fi&&k2>0) {
                    k2--;
                    kq.push_back(w[j].se);
                }
                else if (w[j].fi==w.back().fi&&k1>0) {
                    k1--;
                    kq.push_back(w[j].se);
                }
            }
            return kq;
        }
        if (sum>u) {
            return {};
        }
    }
    return {};
}

vector<int> solve(int l,int u,vector<pii> w) {
    vector<int> kq;
    kq.clear();
    ll lcap=0;
    ll rcap=0;
    for (int i=0;i<w.size();i++) {
        lcap+=w[i].fi;
        rcap+=w[w.size()-1-i].fi;
        ll p1=max(ll(l),lcap);
        ll p2=min(ll(u),rcap);
        if (p1<=p2) {
            if (lcap>=l&&lcap<=u) {
                for (int j=0;j<=i;j++) {
                    kq.push_back(w[j].se);
                }
                return kq;
            }
            for (int j=i+1;j<w.size();j++) {
                lcap+=w[j].fi;
                lcap-=w[j-i-1].fi;
                if (lcap>=l&&lcap<=u) {
                    for (int h=j-i;h<=j;h++) {
                        kq.push_back(w[h].se);
                    }
                    return kq;
                }
            }
        }
        if (lcap>=ll(u)) {
            return {};
        }
    }
    return {};
}

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<int> kq;
    kq.clear();
    vector<pii> new_w;
    new_w.clear();
    for (int i=0;i<w.size();i++) {
        new_w.push_back({w[i],i});
    }
    sort(new_w.begin(),new_w.end());
    if (new_w[0].fi==new_w.back().fi) {
        return solvesub1(l,u,new_w);
    }
    else if (new_w.back().fi-new_w[0].fi==1) {
        return solvesub2(l,u,new_w);
    }
    else {
        return solve(l,u,new_w);
    }
    return kq;
}

Compilation message

molecules.cpp: In function 'std::vector<int> solvesub1(int, int, std::vector<std::pair<int, int> >)':
molecules.cpp:49:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for (int i=0;i<w.size();i++) {
      |                  ~^~~~~~~~~
molecules.cpp: In function 'std::vector<int> solvesub2(int, int, std::vector<std::pair<int, int> >)':
molecules.cpp:69:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for (int i=0;i<w.size();i++) {
      |                  ~^~~~~~~~~
molecules.cpp:74:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for (int i=0;i<w.size();i++) {
      |                  ~^~~~~~~~~
molecules.cpp:85:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |             for (int j=0;j<w.size();j++) {
      |                          ~^~~~~~~~~
molecules.cpp: In function 'std::vector<int> solve(int, int, std::vector<std::pair<int, int> >)':
molecules.cpp:109:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |     for (int i=0;i<w.size();i++) {
      |                  ~^~~~~~~~~
molecules.cpp:121:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |             for (int j=i+1;j<w.size();j++) {
      |                            ~^~~~~~~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:144:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |     for (int i=0;i<w.size();i++) {
      |                  ~^~~~~~~~~

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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 204 KB OK (n = 12, answer = YES)
7 Correct 0 ms 204 KB OK (n = 12, answer = YES)
8 Correct 0 ms 204 KB OK (n = 12, answer = YES)
9 Correct 0 ms 204 KB OK (n = 6, answer = YES)
10 Correct 0 ms 204 KB OK (n = 12, answer = YES)
11 Correct 0 ms 204 KB OK (n = 100, answer = NO)
12 Correct 1 ms 204 KB OK (n = 100, answer = YES)
13 Correct 0 ms 204 KB OK (n = 100, answer = NO)
14 Correct 0 ms 204 KB OK (n = 100, answer = YES)
15 Correct 1 ms 204 KB OK (n = 100, answer = YES)
16 Correct 0 ms 204 KB OK (n = 100, answer = YES)
17 Correct 1 ms 204 KB OK (n = 100, answer = YES)

Subtask #3
12.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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 1 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 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 0 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 0 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)

Subtask #4
15.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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 1 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 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 0 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 0 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 508 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 508 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)

Subtask #5
23.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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 1 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 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 0 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 0 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 508 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 508 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 2 ms 460 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 508 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 508 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 508 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 508 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 588 KB OK (n = 10000, answer = YES)

Subtask #6
31.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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 1 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 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 0 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 0 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 508 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 508 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 2 ms 460 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 508 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 508 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 460 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 508 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 508 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 204 KB OK (n = 1, answer = YES)
95 Correct 0 ms 204 KB OK (n = 3, answer = YES)
96 Correct 0 ms 204 KB OK (n = 3, answer = NO)
97 Correct 0 ms 204 KB OK (n = 3, answer = YES)
98 Correct 33 ms 3892 KB OK (n = 150000, answer = NO)
99 Correct 48 ms 5024 KB OK (n = 200000, answer = YES)
100 Correct 57 ms 7184 KB OK (n = 200000, answer = NO)
101 Correct 52 ms 6464 KB OK (n = 200000, answer = YES)
102 Correct 50 ms 7076 KB OK (n = 200000, answer = YES)
103 Correct 49 ms 6596 KB OK (n = 200000, answer = YES)
104 Correct 52 ms 6444 KB OK (n = 200000, answer = YES)
105 Correct 47 ms 5828 KB OK (n = 200000, answer = NO)
106 Correct 49 ms 6340 KB OK (n = 200000, answer = YES)
107 Correct 48 ms 7204 KB OK (n = 200000, answer = NO)
108 Correct 44 ms 5828 KB OK (n = 200000, answer = NO)
109 Correct 47 ms 5820 KB OK (n = 200000, answer = NO)
110 Correct 41 ms 6044 KB OK (n = 200000, answer = YES)
111 Correct 40 ms 6200 KB OK (n = 200000, answer = YES)
112 Correct 29 ms 6172 KB OK (n = 200000, answer = YES)
113 Correct 31 ms 6168 KB OK (n = 200000, answer = YES)
114 Correct 34 ms 6168 KB OK (n = 200000, answer = YES)
115 Correct 34 ms 6168 KB OK (n = 200000, answer = YES)
116 Correct 38 ms 6088 KB OK (n = 200000, answer = YES)
117 Correct 47 ms 6044 KB OK (n = 200000, answer = YES)