oj.uz

답안 #955430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955430 2024-03-30T12:21:58 Z vjudge1 IOI 바이러스 (JOI21_fever) C++17
25 / 100
 5000 ms 77336 KB 
#include <bits/stdc++.h>
 
#pragma optimize("Ofast")
#pragma target("avx2")
 
using namespace std;
 
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll
 
const int MAX=1e6+15;
const int B=300;
const int N=104;
const int block=400;
const int maxB=MAX/B+10;
const ll inf=1e18;  
const int mod=998244353;
const int mod1=1e9+9;
const ld eps=1e-9;
 
// int dx[8]={1,0,-1,0,1,-1,-1,1};
// int dy[8]={0,1,0,-1,1,-1,1,-1};
 
int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}
 
int n;
pii a[MAX];
int b[MAX];
int d[MAX];
int dx[MAX],dy[MAX];
vector<int> vx[MAX],vy[MAX];
int ans;

void calc(int start,int nap){
  b[start]=nap;
  set<pii> st;
  for(int i=1;i<=n;i++)d[i]=inf;
  d[start]=0;
  st.in({0,start});
  while(!st.empty()){
    int v=st.begin()->S;
    st.erase(st.begin());
    for(auto to:vx[dx[v]]){
      if(d[to]>abs(a[v].F-a[to].F)&&d[v]<abs(a[v].F-a[to].F)){
        if(b[v]==1){
          if(a[to].F<a[v].F){
            b[to]=2;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});
          }
        }
        if(b[v]==2){
          if(a[to].F>a[v].F){
            b[to]=1;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});
          }
        }
        if(b[v]==3){
          if(a[to].F>a[v].F){
            b[to]=4;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});
          }
        }
        if(b[v]==4){
          if(a[to].F<a[v].F){
            b[to]=3;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});            
          }
        }
      }
    }
    for(auto to:vy[dy[v]]){
      if(d[to]>abs(a[v].F-a[to].F)&&d[v]<abs(a[v].F-a[to].F)){
        if(b[v]==1){
          if(a[to].F>a[v].F){
            b[to]=4;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});            
          }
        }
        if(b[v]==2){
          if(a[to].F>a[v].F){
            b[to]=3;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});            
          }
        }
        if(b[v]==3){
          if(a[to].F<a[v].F){
            b[to]=2;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});    
          }
        }
        if(b[v]==4){
          if(a[to].F<a[v].F){
            b[to]=1;
            st.erase({d[to],to});
            d[to]=abs(a[v].F-a[to].F);
            st.in({d[to],to});     
          }
        }
      }    
    }
  }
  int cur=0;
  for(int i=1;i<=n;i++){
    cur+=(d[i]!=inf);
  }
  ans=max(ans,cur);
}

void solve(){
  cin>>n;
  set<int> d;
  map<int,int> mp;
  int cur=0;
  for(int i=1;i<=n;i++){
    cin>>a[i].F>>a[i].S;
    d.in(a[i].F+a[i].S);
  }
  for(int x:d)mp[x]=++cur;
  for(int i=1;i<=n;i++){
    dx[i]=mp[a[i].F+a[i].S];
    vx[mp[a[i].F+a[i].S]].pb(i);
  }

  cur=0;
  mp.clear();
  d.clear();

  for(int i=1;i<=n;i++){
    d.in(a[i].F-a[i].S);
  }
  for(int x:d)mp[x]=++cur;
  for(int i=1;i<=n;i++){
    dy[i]=mp[a[i].F-a[i].S];
    vy[mp[a[i].F-a[i].S]].pb(i);
  }

  for(int i=1;i<=4;i++){
    calc(1,i);
  }
  cout<<ans;
}
 
signed main(){
  //  freopen("help.in","r",stdin);
  //  freopen("help.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;  
  while(t--)solve();
}

Compilation message

fever.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
fever.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 55900 KB Output is correct
2 Correct 13 ms 55900 KB Output is correct
3 Correct 12 ms 55900 KB Output is correct
4 Correct 13 ms 55896 KB Output is correct
5 Correct 12 ms 55956 KB Output is correct
6 Correct 12 ms 55900 KB Output is correct
7 Correct 12 ms 55960 KB Output is correct
8 Correct 14 ms 55948 KB Output is correct
9 Correct 14 ms 55900 KB Output is correct
10 Correct 12 ms 55900 KB Output is correct
11 Correct 12 ms 55900 KB Output is correct
12 Correct 13 ms 56016 KB Output is correct
13 Correct 13 ms 55896 KB Output is correct
14 Correct 12 ms 55900 KB Output is correct
15 Correct 12 ms 55900 KB Output is correct
16 Correct 12 ms 55900 KB Output is correct
17 Correct 12 ms 55896 KB Output is correct
18 Correct 12 ms 55900 KB Output is correct
19 Correct 12 ms 55900 KB Output is correct
20 Correct 12 ms 55896 KB Output is correct
21 Correct 12 ms 56028 KB Output is correct
22 Correct 13 ms 55896 KB Output is correct
23 Correct 12 ms 55900 KB Output is correct
24 Correct 13 ms 56020 KB Output is correct
25 Correct 12 ms 55900 KB Output is correct
26 Correct 13 ms 56028 KB Output is correct
27 Correct 12 ms 55896 KB Output is correct
28 Correct 12 ms 56036 KB Output is correct
29 Correct 12 ms 55900 KB Output is correct
30 Correct 12 ms 55976 KB Output is correct
31 Correct 12 ms 55900 KB Output is correct
32 Correct 12 ms 55896 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 55900 KB Output is correct
2 Correct 13 ms 55900 KB Output is correct
3 Correct 12 ms 55900 KB Output is correct
4 Correct 13 ms 55896 KB Output is correct
5 Correct 12 ms 55956 KB Output is correct
6 Correct 12 ms 55900 KB Output is correct
7 Correct 12 ms 55960 KB Output is correct
8 Correct 14 ms 55948 KB Output is correct
9 Correct 14 ms 55900 KB Output is correct
10 Correct 12 ms 55900 KB Output is correct
11 Correct 12 ms 55900 KB Output is correct
12 Correct 13 ms 56016 KB Output is correct
13 Correct 13 ms 55896 KB Output is correct
14 Correct 12 ms 55900 KB Output is correct
15 Correct 12 ms 55900 KB Output is correct
16 Correct 12 ms 55900 KB Output is correct
17 Correct 12 ms 55896 KB Output is correct
18 Correct 12 ms 55900 KB Output is correct
19 Correct 12 ms 55900 KB Output is correct
20 Correct 12 ms 55896 KB Output is correct
21 Correct 12 ms 56028 KB Output is correct
22 Correct 13 ms 55896 KB Output is correct
23 Correct 12 ms 55900 KB Output is correct
24 Correct 13 ms 56020 KB Output is correct
25 Correct 12 ms 55900 KB Output is correct
26 Correct 13 ms 56028 KB Output is correct
27 Correct 12 ms 55896 KB Output is correct
28 Correct 12 ms 56036 KB Output is correct
29 Correct 12 ms 55900 KB Output is correct
30 Correct 12 ms 55976 KB Output is correct
31 Correct 12 ms 55900 KB Output is correct
32 Correct 12 ms 55896 KB Output is correct
33 Correct 13 ms 55900 KB Output is correct
34 Correct 13 ms 55900 KB Output is correct
35 Correct 12 ms 55900 KB Output is correct
36 Correct 12 ms 55900 KB Output is correct
37 Correct 12 ms 55900 KB Output is correct
38 Correct 12 ms 55900 KB Output is correct
39 Correct 13 ms 55968 KB Output is correct
40 Correct 12 ms 55896 KB Output is correct
41 Correct 12 ms 55992 KB Output is correct
42 Correct 12 ms 55900 KB Output is correct
43 Correct 12 ms 55900 KB Output is correct
44 Correct 12 ms 55900 KB Output is correct
45 Correct 14 ms 56028 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 55900 KB Output is correct
2 Correct 12 ms 55900 KB Output is correct
3 Correct 13 ms 55900 KB Output is correct
4 Correct 13 ms 56044 KB Output is correct
5 Correct 12 ms 55900 KB Output is correct
6 Correct 12 ms 56044 KB Output is correct
7 Correct 12 ms 55900 KB Output is correct
8 Correct 13 ms 55984 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 55900 KB Output is correct
2 Correct 13 ms 55900 KB Output is correct
3 Correct 12 ms 55900 KB Output is correct
4 Correct 13 ms 55896 KB Output is correct
5 Correct 12 ms 55956 KB Output is correct
6 Correct 12 ms 55900 KB Output is correct
7 Correct 12 ms 55960 KB Output is correct
8 Correct 14 ms 55948 KB Output is correct
9 Correct 14 ms 55900 KB Output is correct
10 Correct 12 ms 55900 KB Output is correct
11 Correct 12 ms 55900 KB Output is correct
12 Correct 13 ms 56016 KB Output is correct
13 Correct 13 ms 55896 KB Output is correct
14 Correct 12 ms 55900 KB Output is correct
15 Correct 12 ms 55900 KB Output is correct
16 Correct 12 ms 55900 KB Output is correct
17 Correct 12 ms 55896 KB Output is correct
18 Correct 12 ms 55900 KB Output is correct
19 Correct 12 ms 55900 KB Output is correct
20 Correct 12 ms 55896 KB Output is correct
21 Correct 12 ms 56028 KB Output is correct
22 Correct 13 ms 55896 KB Output is correct
23 Correct 12 ms 55900 KB Output is correct
24 Correct 13 ms 56020 KB Output is correct
25 Correct 12 ms 55900 KB Output is correct
26 Correct 13 ms 56028 KB Output is correct
27 Correct 12 ms 55896 KB Output is correct
28 Correct 12 ms 56036 KB Output is correct
29 Correct 12 ms 55900 KB Output is correct
30 Correct 12 ms 55976 KB Output is correct
31 Correct 12 ms 55900 KB Output is correct
32 Correct 12 ms 55896 KB Output is correct
33 Correct 13 ms 55900 KB Output is correct
34 Correct 13 ms 55900 KB Output is correct
35 Correct 12 ms 55900 KB Output is correct
36 Correct 12 ms 55900 KB Output is correct
37 Correct 12 ms 55900 KB Output is correct
38 Correct 12 ms 55900 KB Output is correct
39 Correct 13 ms 55968 KB Output is correct
40 Correct 12 ms 55896 KB Output is correct
41 Correct 12 ms 55992 KB Output is correct
42 Correct 12 ms 55900 KB Output is correct
43 Correct 12 ms 55900 KB Output is correct
44 Correct 12 ms 55900 KB Output is correct
45 Correct 14 ms 56028 KB Output is correct
46 Correct 13 ms 55900 KB Output is correct
47 Correct 12 ms 55900 KB Output is correct
48 Correct 13 ms 55900 KB Output is correct
49 Correct 13 ms 56044 KB Output is correct
50 Correct 12 ms 55900 KB Output is correct
51 Correct 12 ms 56044 KB Output is correct
52 Correct 12 ms 55900 KB Output is correct
53 Correct 13 ms 55984 KB Output is correct
54 Correct 14 ms 56040 KB Output is correct
55 Correct 12 ms 55900 KB Output is correct
56 Correct 12 ms 56036 KB Output is correct
57 Correct 12 ms 55900 KB Output is correct
58 Correct 12 ms 55948 KB Output is correct
59 Correct 12 ms 55900 KB Output is correct
60 Correct 13 ms 55992 KB Output is correct
61 Correct 12 ms 55900 KB Output is correct
62 Correct 17 ms 55900 KB Output is correct
63 Correct 12 ms 55900 KB Output is correct
64 Correct 12 ms 55896 KB Output is correct
65 Correct 12 ms 55900 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 55900 KB Output is correct
2 Correct 13 ms 55900 KB Output is correct
3 Correct 12 ms 55900 KB Output is correct
4 Correct 13 ms 55896 KB Output is correct
5 Correct 12 ms 55956 KB Output is correct
6 Correct 12 ms 55900 KB Output is correct
7 Correct 12 ms 55960 KB Output is correct
8 Correct 14 ms 55948 KB Output is correct
9 Correct 14 ms 55900 KB Output is correct
10 Correct 12 ms 55900 KB Output is correct
11 Correct 12 ms 55900 KB Output is correct
12 Correct 13 ms 56016 KB Output is correct
13 Correct 13 ms 55896 KB Output is correct
14 Correct 12 ms 55900 KB Output is correct
15 Correct 12 ms 55900 KB Output is correct
16 Correct 12 ms 55900 KB Output is correct
17 Correct 12 ms 55896 KB Output is correct
18 Correct 12 ms 55900 KB Output is correct
19 Correct 12 ms 55900 KB Output is correct
20 Correct 12 ms 55896 KB Output is correct
21 Correct 12 ms 56028 KB Output is correct
22 Correct 13 ms 55896 KB Output is correct
23 Correct 12 ms 55900 KB Output is correct
24 Correct 13 ms 56020 KB Output is correct
25 Correct 12 ms 55900 KB Output is correct
26 Correct 13 ms 56028 KB Output is correct
27 Correct 12 ms 55896 KB Output is correct
28 Correct 12 ms 56036 KB Output is correct
29 Correct 12 ms 55900 KB Output is correct
30 Correct 12 ms 55976 KB Output is correct
31 Correct 12 ms 55900 KB Output is correct
32 Correct 12 ms 55896 KB Output is correct
33 Correct 13 ms 55900 KB Output is correct
34 Correct 13 ms 55900 KB Output is correct
35 Correct 12 ms 55900 KB Output is correct
36 Correct 12 ms 55900 KB Output is correct
37 Correct 12 ms 55900 KB Output is correct
38 Correct 12 ms 55900 KB Output is correct
39 Correct 13 ms 55968 KB Output is correct
40 Correct 12 ms 55896 KB Output is correct
41 Correct 12 ms 55992 KB Output is correct
42 Correct 12 ms 55900 KB Output is correct
43 Correct 12 ms 55900 KB Output is correct
44 Correct 12 ms 55900 KB Output is correct
45 Correct 14 ms 56028 KB Output is correct
46 Correct 13 ms 55900 KB Output is correct
47 Correct 12 ms 55900 KB Output is correct
48 Correct 13 ms 55900 KB Output is correct
49 Correct 13 ms 56044 KB Output is correct
50 Correct 12 ms 55900 KB Output is correct
51 Correct 12 ms 56044 KB Output is correct
52 Correct 12 ms 55900 KB Output is correct
53 Correct 13 ms 55984 KB Output is correct
54 Correct 14 ms 56040 KB Output is correct
55 Correct 12 ms 55900 KB Output is correct
56 Correct 12 ms 56036 KB Output is correct
57 Correct 12 ms 55900 KB Output is correct
58 Correct 12 ms 55948 KB Output is correct
59 Correct 12 ms 55900 KB Output is correct
60 Correct 13 ms 55992 KB Output is correct
61 Correct 12 ms 55900 KB Output is correct
62 Correct 17 ms 55900 KB Output is correct
63 Correct 12 ms 55900 KB Output is correct
64 Correct 12 ms 55896 KB Output is correct
65 Correct 12 ms 55900 KB Output is correct
66 Correct 14 ms 56412 KB Output is correct
67 Correct 14 ms 56412 KB Output is correct
68 Correct 15 ms 56412 KB Output is correct
69 Incorrect 17 ms 56156 KB Output isn't correct
70 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 55900 KB Output is correct
2 Correct 13 ms 55900 KB Output is correct
3 Correct 12 ms 55900 KB Output is correct
4 Correct 13 ms 55896 KB Output is correct
5 Correct 12 ms 55956 KB Output is correct
6 Correct 12 ms 55900 KB Output is correct
7 Correct 12 ms 55960 KB Output is correct
8 Correct 14 ms 55948 KB Output is correct
9 Correct 14 ms 55900 KB Output is correct
10 Correct 12 ms 55900 KB Output is correct
11 Correct 12 ms 55900 KB Output is correct
12 Correct 13 ms 56016 KB Output is correct
13 Correct 13 ms 55896 KB Output is correct
14 Correct 12 ms 55900 KB Output is correct
15 Correct 12 ms 55900 KB Output is correct
16 Correct 12 ms 55900 KB Output is correct
17 Correct 12 ms 55896 KB Output is correct
18 Correct 12 ms 55900 KB Output is correct
19 Correct 12 ms 55900 KB Output is correct
20 Correct 12 ms 55896 KB Output is correct
21 Correct 12 ms 56028 KB Output is correct
22 Correct 13 ms 55896 KB Output is correct
23 Correct 12 ms 55900 KB Output is correct
24 Correct 13 ms 56020 KB Output is correct
25 Correct 12 ms 55900 KB Output is correct
26 Correct 13 ms 56028 KB Output is correct
27 Correct 12 ms 55896 KB Output is correct
28 Correct 12 ms 56036 KB Output is correct
29 Correct 12 ms 55900 KB Output is correct
30 Correct 12 ms 55976 KB Output is correct
31 Correct 12 ms 55900 KB Output is correct
32 Correct 12 ms 55896 KB Output is correct
33 Correct 13 ms 55900 KB Output is correct
34 Correct 13 ms 55900 KB Output is correct
35 Correct 12 ms 55900 KB Output is correct
36 Correct 12 ms 55900 KB Output is correct
37 Correct 12 ms 55900 KB Output is correct
38 Correct 12 ms 55900 KB Output is correct
39 Correct 13 ms 55968 KB Output is correct
40 Correct 12 ms 55896 KB Output is correct
41 Correct 12 ms 55992 KB Output is correct
42 Correct 12 ms 55900 KB Output is correct
43 Correct 12 ms 55900 KB Output is correct
44 Correct 12 ms 55900 KB Output is correct
45 Correct 14 ms 56028 KB Output is correct
46 Correct 13 ms 55900 KB Output is correct
47 Correct 12 ms 55900 KB Output is correct
48 Correct 13 ms 55900 KB Output is correct
49 Correct 13 ms 56044 KB Output is correct
50 Correct 12 ms 55900 KB Output is correct
51 Correct 12 ms 56044 KB Output is correct
52 Correct 12 ms 55900 KB Output is correct
53 Correct 13 ms 55984 KB Output is correct
54 Correct 14 ms 56040 KB Output is correct
55 Correct 12 ms 55900 KB Output is correct
56 Correct 12 ms 56036 KB Output is correct
57 Correct 12 ms 55900 KB Output is correct
58 Correct 12 ms 55948 KB Output is correct
59 Correct 12 ms 55900 KB Output is correct
60 Correct 13 ms 55992 KB Output is correct
61 Correct 12 ms 55900 KB Output is correct
62 Correct 17 ms 55900 KB Output is correct
63 Correct 12 ms 55900 KB Output is correct
64 Correct 12 ms 55896 KB Output is correct
65 Correct 12 ms 55900 KB Output is correct
66 Correct 136 ms 68176 KB Output is correct
67 Correct 167 ms 72884 KB Output is correct
68 Correct 192 ms 77336 KB Output is correct
69 Execution timed out 5055 ms 74124 KB Time limit exceeded
70 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 55900 KB Output is correct
2 Correct 13 ms 55900 KB Output is correct
3 Correct 12 ms 55900 KB Output is correct
4 Correct 13 ms 55896 KB Output is correct
5 Correct 12 ms 55956 KB Output is correct
6 Correct 12 ms 55900 KB Output is correct
7 Correct 12 ms 55960 KB Output is correct
8 Correct 14 ms 55948 KB Output is correct
9 Correct 14 ms 55900 KB Output is correct
10 Correct 12 ms 55900 KB Output is correct
11 Correct 12 ms 55900 KB Output is correct
12 Correct 13 ms 56016 KB Output is correct
13 Correct 13 ms 55896 KB Output is correct
14 Correct 12 ms 55900 KB Output is correct
15 Correct 12 ms 55900 KB Output is correct
16 Correct 12 ms 55900 KB Output is correct
17 Correct 12 ms 55896 KB Output is correct
18 Correct 12 ms 55900 KB Output is correct
19 Correct 12 ms 55900 KB Output is correct
20 Correct 12 ms 55896 KB Output is correct
21 Correct 12 ms 56028 KB Output is correct
22 Correct 13 ms 55896 KB Output is correct
23 Correct 12 ms 55900 KB Output is correct
24 Correct 13 ms 56020 KB Output is correct
25 Correct 12 ms 55900 KB Output is correct
26 Correct 13 ms 56028 KB Output is correct
27 Correct 12 ms 55896 KB Output is correct
28 Correct 12 ms 56036 KB Output is correct
29 Correct 12 ms 55900 KB Output is correct
30 Correct 12 ms 55976 KB Output is correct
31 Correct 12 ms 55900 KB Output is correct
32 Correct 12 ms 55896 KB Output is correct
33 Correct 13 ms 55900 KB Output is correct
34 Correct 13 ms 55900 KB Output is correct
35 Correct 12 ms 55900 KB Output is correct
36 Correct 12 ms 55900 KB Output is correct
37 Correct 12 ms 55900 KB Output is correct
38 Correct 12 ms 55900 KB Output is correct
39 Correct 13 ms 55968 KB Output is correct
40 Correct 12 ms 55896 KB Output is correct
41 Correct 12 ms 55992 KB Output is correct
42 Correct 12 ms 55900 KB Output is correct
43 Correct 12 ms 55900 KB Output is correct
44 Correct 12 ms 55900 KB Output is correct
45 Correct 14 ms 56028 KB Output is correct
46 Correct 13 ms 55900 KB Output is correct
47 Correct 12 ms 55900 KB Output is correct
48 Correct 13 ms 55900 KB Output is correct
49 Correct 13 ms 56044 KB Output is correct
50 Correct 12 ms 55900 KB Output is correct
51 Correct 12 ms 56044 KB Output is correct
52 Correct 12 ms 55900 KB Output is correct
53 Correct 13 ms 55984 KB Output is correct
54 Correct 14 ms 56040 KB Output is correct
55 Correct 12 ms 55900 KB Output is correct
56 Correct 12 ms 56036 KB Output is correct
57 Correct 12 ms 55900 KB Output is correct
58 Correct 12 ms 55948 KB Output is correct
59 Correct 12 ms 55900 KB Output is correct
60 Correct 13 ms 55992 KB Output is correct
61 Correct 12 ms 55900 KB Output is correct
62 Correct 17 ms 55900 KB Output is correct
63 Correct 12 ms 55900 KB Output is correct
64 Correct 12 ms 55896 KB Output is correct
65 Correct 12 ms 55900 KB Output is correct
66 Correct 14 ms 56412 KB Output is correct
67 Correct 14 ms 56412 KB Output is correct
68 Correct 15 ms 56412 KB Output is correct
69 Incorrect 17 ms 56156 KB Output isn't correct
70 Halted 0 ms 0 KB -