oj.uz

답안 #1060042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060042 2024-08-15T10:15:29 Z YassineBenYounes Vision Program (IOI19_vision) C++17
73 / 100
 64 ms 10952 KB 
#include<bits/stdc++.h>
#include<chrono>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
////////////////////Only Clear Code//////////////////////////
 
void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}
 
void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}
const int mx = 3e5+5;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 320;
 
#include "vision.h"
int n, m, k;
/*
int ind = 0;
int last = 0;
int arr[mx];
 
int add_not(int x){
    int y = !arr[x];
    last = y;
    arr[ind] = y;
    return ind++;
}
 
int add_and(vi v){
    int y = 1;
    for(int i : v){
        y &= arr[i];
    }
    last = y;
    arr[ind] = y;
    return ind++;
}
 
int add_or(vi v){
    int y = 0;
    for(int i : v){
        y |= arr[i];
    }
    last = y;
    arr[ind] = y;
    return ind++;
}
 
int add_xor(vi v){
    int y = 0;
    for(int i : v){
        y ^= arr[i];
    }
    last = y;
    arr[ind] = y;
    return ind++;
}*/

void construct_network(int H, int W, int K) {
    n=H,m=W,k=K;
    map<int, vi> dia1;
    map<int, vi> dia2;
    for(int i = 0; i < n;i++){
        for(int j = 0; j < m;j++){
            dia1[i-j].pb(i*m+j);
            dia2[i+j].pb(i*m+j);
        }
    }
    map<int, int> posdia1, posdia2;
    map<int, int> dia1_2, dia2_2;
    for(auto p : dia1){
        posdia1[p.ff] = add_or(p.ss);
        dia1_2[p.ff] = add_xor({add_or(p.ss), add_xor(p.ss)});
    }
    for(auto p : dia2){
        posdia2[p.ff] = add_or(p.ss);
        dia2_2[p.ff] = add_xor({add_or(p.ss), add_xor(p.ss)});
    }
    vi tot1;
    for(int i = 1-m;i <= n-1;i++){
        vi v, v1;
        for(int j = i;j <= min(i+k, n-1);j++){
            v.pb(posdia1[j]);
            v1.pb(dia1_2[j]);
        }
        int l = add_or(v1);
        int a = add_or(v);
        int b = add_xor(v);
        int c = add_xor({a, b});
        tot1.pb(c);
        tot1.pb(l);
    }
    int k1 = add_or(tot1);
    
    vi tot2;
    for(int i = 0;i <= (n-1+m-1);i++){
        vi v, v1;
        for(int j = i;j <= min(i+k, n-1+m-1);j++){
            v.pb(posdia2[j]);
            v1.pb(dia2_2[j]);
        }
        int l = add_or(v1);
        int a = add_or(v);
        int b = add_xor(v);
        int c = add_xor({a, b});
        tot2.pb(c);
        tot2.pb(l);
    }
    int k2 = add_or(tot2);
    tot1.clear();
    for(int i = 1-m;i <= n-1;i++){
        vi v, v1;
        for(int j = i;j <= min(i+k-1, n-1);j++){
            v.pb(posdia1[j]);
            v1.pb(dia1_2[j]);
        }
        int l = add_or(v1);
        int a = add_or(v);
        int b = add_xor(v);
        int c = add_xor({a, b});
        tot1.pb(c);
        tot1.pb(l);
    }
    int k_1 = add_or(tot1);
    tot2.clear();
    for(int i = 0;i <= (n-1+m-1);i++){
        vi v, v1;
        for(int j = i;j <= min(i+k-1, n-1+m-1);j++){
            v.pb(posdia2[j]);
            v1.pb(dia2_2[j]);
        }
        int l = add_or(v1);
        int a = add_or(v);
        int b = add_xor(v);
        int c = add_xor({a, b});
        tot2.pb(c);
        tot2.pb(l);
    }
    int k_2 = add_or(tot2);
    int a = add_and({k1, k2});
    int b = add_and({k_1, k_2});
    int tem = add_not(b);
    int br = add_and({a, tem});






    /*
    int cur = n*m;
    vi ans;
    pbds s;
    for(int i = 0; i < n;i++){
        for(int j = 0;j < m;j++){
            s.insert({i, j});
        }
    }
    int cnt = 0;
    while(cnt <= 9997){
        if(s.empty())break;
        int ind = rng() % s.size();
        pii p = *s.find_by_order(ind);
        int i = p.ff, j = p.ss;
        s.erase({i, j});
        vi v;
        for(int addx = 0;addx <= k;addx++){
            int addy = k-addx;
            int nx = i + addx, ny = j + addy;
            if(nx >= 0 && nx < n && ny >= 0 && ny < m){
                v.pb(nx*m+ny);
            }
            addy = -k+addx;
            nx = i + addx, ny = j + addy;
            if(nx >= 0 && nx < n && ny >= 0 && ny < m){
                v.pb(nx*m+ny);
            }
            int add1x = -addx;
            addy = k-addx;
            nx = i + add1x, ny = j + addy;
            if(nx >= 0 && nx < n && ny >= 0 && ny < m){
                v.pb(nx*m+ny);
            }
            addy = -k+addx;
            nx = i + add1x, ny = j + addy;
            if(nx >= 0 && nx < n && ny >= 0 && ny < m){
                v.pb(nx*m+ny);
            }
        }
        if(!v.empty()){
            int x = add_or(v);
            cnt++;
            int y = add_and({x, i*m+j});
            cnt++;
            ans.pb(y);
        }
    }
    int x = add_or(ans);*/
}
/*
int32_t main(){
    init();
    speed;
    arr[0] = 1;
    arr[5] = 1;
    ind = 3*2;
    construct_network(2, 3, 4);
    cout << endl;
    cout << last << endl;
}*/
 
/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:183:9: warning: unused variable 'br' [-Wunused-variable]
  183 |     int br = add_and({a, tem});
      |         ^~
vision.cpp: In function 'void usaco_problem()':
vision.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp: In function 'void init()':
vision.cpp:43:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:45:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 344 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 600 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 2 ms 680 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 600 KB Output is correct
37 Correct 3 ms 604 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 600 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 2 ms 680 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 600 KB Output is correct
37 Correct 3 ms 604 KB Output is correct
38 Correct 16 ms 2520 KB Output is correct
39 Correct 3 ms 860 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 4 ms 1112 KB Output is correct
42 Correct 11 ms 2140 KB Output is correct
43 Correct 6 ms 1496 KB Output is correct
44 Correct 12 ms 2412 KB Output is correct
45 Correct 16 ms 3032 KB Output is correct
46 Correct 19 ms 3668 KB Output is correct
47 Correct 20 ms 3800 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 12 ms 2180 KB Output is correct
3 Correct 13 ms 2264 KB Output is correct
4 Correct 16 ms 2776 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 10 ms 1876 KB Output is correct
7 Correct 14 ms 2520 KB Output is correct
8 Correct 17 ms 2776 KB Output is correct
9 Correct 2 ms 856 KB Output is correct
10 Correct 8 ms 1496 KB Output is correct
11 Correct 13 ms 2264 KB Output is correct
12 Correct 13 ms 2264 KB Output is correct
13 Correct 16 ms 2516 KB Output is correct
14 Correct 16 ms 2776 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 9 ms 1752 KB Output is correct
17 Correct 17 ms 2260 KB Output is correct
18 Correct 13 ms 2264 KB Output is correct
19 Correct 15 ms 2772 KB Output is correct
20 Correct 17 ms 2776 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 692 KB Output is correct
4 Correct 6 ms 1112 KB Output is correct
5 Correct 7 ms 1368 KB Output is correct
6 Correct 9 ms 1628 KB Output is correct
7 Correct 9 ms 1628 KB Output is correct
8 Correct 4 ms 984 KB Output is correct
9 Correct 9 ms 1704 KB Output is correct
10 Correct 13 ms 2264 KB Output is correct
11 Correct 17 ms 2520 KB Output is correct
12 Correct 16 ms 2772 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 10 ms 1752 KB Output is correct
15 Correct 16 ms 2520 KB Output is correct
16 Correct 17 ms 2776 KB Output is correct
17 Correct 3 ms 856 KB Output is correct
18 Correct 12 ms 2264 KB Output is correct
19 Correct 16 ms 2776 KB Output is correct
20 Correct 11 ms 2260 KB Output is correct
21 Correct 29 ms 5328 KB Output is correct
22 Correct 41 ms 6864 KB Output is correct
23 Correct 43 ms 7628 KB Output is correct
24 Correct 10 ms 2260 KB Output is correct
25 Correct 34 ms 6360 KB Output is correct
26 Correct 48 ms 7512 KB Output is correct
27 Correct 19 ms 3984 KB Output is correct
28 Correct 44 ms 7976 KB Output is correct
29 Correct 64 ms 10952 KB Output is correct
30 Incorrect 13 ms 5336 KB WA in grader: Too many inputs
31 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4052 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 700 KB Output is correct
4 Correct 4 ms 984 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 11 ms 2264 KB Output is correct
8 Correct 10 ms 2264 KB Output is correct
9 Correct 19 ms 4052 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 600 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 2 ms 680 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 600 KB Output is correct
37 Correct 3 ms 604 KB Output is correct
38 Correct 16 ms 2520 KB Output is correct
39 Correct 3 ms 860 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 4 ms 1112 KB Output is correct
42 Correct 11 ms 2140 KB Output is correct
43 Correct 6 ms 1496 KB Output is correct
44 Correct 12 ms 2412 KB Output is correct
45 Correct 16 ms 3032 KB Output is correct
46 Correct 19 ms 3668 KB Output is correct
47 Correct 20 ms 3800 KB Output is correct
48 Correct 2 ms 860 KB Output is correct
49 Correct 12 ms 2180 KB Output is correct
50 Correct 13 ms 2264 KB Output is correct
51 Correct 16 ms 2776 KB Output is correct
52 Correct 2 ms 860 KB Output is correct
53 Correct 10 ms 1876 KB Output is correct
54 Correct 14 ms 2520 KB Output is correct
55 Correct 17 ms 2776 KB Output is correct
56 Correct 2 ms 856 KB Output is correct
57 Correct 8 ms 1496 KB Output is correct
58 Correct 13 ms 2264 KB Output is correct
59 Correct 13 ms 2264 KB Output is correct
60 Correct 16 ms 2516 KB Output is correct
61 Correct 16 ms 2776 KB Output is correct
62 Correct 2 ms 860 KB Output is correct
63 Correct 9 ms 1752 KB Output is correct
64 Correct 17 ms 2260 KB Output is correct
65 Correct 13 ms 2264 KB Output is correct
66 Correct 15 ms 2772 KB Output is correct
67 Correct 17 ms 2776 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 432 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 3 ms 692 KB Output is correct
73 Correct 6 ms 1112 KB Output is correct
74 Correct 7 ms 1368 KB Output is correct
75 Correct 9 ms 1628 KB Output is correct
76 Correct 9 ms 1628 KB Output is correct
77 Correct 4 ms 984 KB Output is correct
78 Correct 9 ms 1704 KB Output is correct
79 Correct 13 ms 2264 KB Output is correct
80 Correct 17 ms 2520 KB Output is correct
81 Correct 16 ms 2772 KB Output is correct
82 Correct 2 ms 860 KB Output is correct
83 Correct 10 ms 1752 KB Output is correct
84 Correct 16 ms 2520 KB Output is correct
85 Correct 17 ms 2776 KB Output is correct
86 Correct 3 ms 856 KB Output is correct
87 Correct 12 ms 2264 KB Output is correct
88 Correct 16 ms 2776 KB Output is correct
89 Correct 11 ms 2260 KB Output is correct
90 Correct 29 ms 5328 KB Output is correct
91 Correct 41 ms 6864 KB Output is correct
92 Correct 43 ms 7628 KB Output is correct
93 Correct 10 ms 2260 KB Output is correct
94 Correct 34 ms 6360 KB Output is correct
95 Correct 48 ms 7512 KB Output is correct
96 Correct 19 ms 3984 KB Output is correct
97 Correct 44 ms 7976 KB Output is correct
98 Correct 64 ms 10952 KB Output is correct
99 Incorrect 13 ms 5336 KB WA in grader: Too many inputs
100 Halted 0 ms 0 KB -