oj.uz

Submission #994642

# Submission time Handle Problem Language Result Execution time Memory
994642 2024-06-08T03:03:50 Z jonathanirvings Portal (BOI24_portal) C++17
100 / 100
 31 ms 3576 KB 
//start of jonathanirvings' template v3.0.3 (BETA)

#include <bits/stdc++.h>
using namespace std;

// typedef long long LL;
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s);
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s);
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

using big = __int128;
using pbb = pair<big,big>;

big abs(big x)
{
  if (x < 0) return -x;
  return x;
}

big gcd(big a,big b)
{
  if (b == 0) return a;
  return gcd(b,a%b);
}

int n;
// pll awal;
// pll dat[100005];
pbb awal;
pbb dat[100005];

// void normalize(pll &a, pll &b)
void normalize(pbb &a, pbb &b)
{
  if (a.fi < 0) 
  {
    a.fi *= -1;
    a.se *= -1;
  }
  if (b.fi < 0)
  {
    b.fi *= -1;
    b.se *= -1;
  }
  if (b.fi == 0) return;
  // LL mul = a.fi / b.fi;
  big mul = a.fi / b.fi;
  a.fi -= b.fi * mul;
  a.se -= b.se * mul;
  normalize(b,a);
}

int main()
{
  scanf("%d",&n);
  --n;
  {
    pll tmp;
    scanf("%lld %lld",&tmp.fi,&tmp.se);
    awal = mp(tmp.fi,tmp.se);
  }
  // scanf("%lld %lld",&awal.fi,&awal.se);
  REP(i,n)
  {
    {
      pll tmp;
      scanf("%lld %lld",&tmp.fi,&tmp.se);
      dat[i] = mp(tmp.fi,tmp.se);
    }
    // scanf("%lld %lld",&dat[i].fi,&dat[i].se);
    dat[i].fi -= awal.fi;
    dat[i].se -= awal.se;
  }
  FOR(i,1,n)
  {
    if (dat[i].fi == 0) continue;
    if (dat[0].fi == 0) swap(dat[0],dat[i]);
    else
    {
      normalize(dat[0],dat[i]);
      if (dat[i].fi != 0) swap(dat[0],dat[i]);
    }
  }
  // LL g = 0;
  big g = 0;
  FOR(i,1,n)
  {
    assert(dat[i].fi == 0);
    if (g != 0 || dat[i].se != 0) g = gcd(g,abs(dat[i].se));
  }
  if (g == 0) puts("-1");
  else if (dat[0].fi == 0) puts("-1");
  else printf("%lld\n",(LL)abs(g * dat[0].fi));
}

Compilation message

Main.cpp: In function 'std::string uppercase(std::string)':
Main.cpp:34:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   34 | #define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
      |                             ^
Main.cpp:40:18: note: in expansion of macro 'FOR'
   40 | #define REP(i,n) FOR(i,0,n)
      |                  ^~~
Main.cpp:80:3: note: in expansion of macro 'REP'
   80 |   REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
      |   ^~~
Main.cpp: In function 'std::string lowercase(std::string)':
Main.cpp:34:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   34 | #define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
      |                             ^
Main.cpp:40:18: note: in expansion of macro 'FOR'
   40 | #define REP(i,n) FOR(i,0,n)
      |                  ^~~
Main.cpp:86:3: note: in expansion of macro 'REP'
   86 |   REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
      |   ^~~
Main.cpp: In function 'int main()':
Main.cpp:34:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   34 | #define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
      |                             ^
Main.cpp:40:18: note: in expansion of macro 'FOR'
   40 | #define REP(i,n) FOR(i,0,n)
      |                  ^~~
Main.cpp:151:3: note: in expansion of macro 'REP'
  151 |   REP(i,n)
      |   ^~~
Main.cpp:34:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   34 | #define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
      |                             ^
Main.cpp:162:3: note: in expansion of macro 'FOR'
  162 |   FOR(i,1,n)
      |   ^~~
Main.cpp:34:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   34 | #define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
      |                             ^
Main.cpp:174:3: note: in expansion of macro 'FOR'
  174 |   FOR(i,1,n)
      |   ^~~
Main.cpp:143:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  143 |   scanf("%d",&n);
      |   ~~~~~^~~~~~~~~
Main.cpp:147:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  147 |     scanf("%lld %lld",&tmp.fi,&tmp.se);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:155:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  155 |       scanf("%lld %lld",&tmp.fi,&tmp.se);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 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 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 0 ms 352 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 0 ms 360 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 0 ms 356 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 356 KB Output is correct
35 Correct 0 ms 356 KB Output is correct
36 Correct 0 ms 352 KB Output is correct
37 Correct 0 ms 360 KB Output is correct
38 Correct 0 ms 360 KB Output is correct
39 Correct 0 ms 360 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 372 KB Output is correct
2 Correct 20 ms 3456 KB Output is correct
3 Correct 22 ms 3448 KB Output is correct
4 Correct 19 ms 3432 KB Output is correct
5 Correct 23 ms 3556 KB Output is correct
6 Correct 18 ms 3444 KB Output is correct
7 Correct 20 ms 3432 KB Output is correct
8 Correct 18 ms 3440 KB Output is correct
9 Correct 17 ms 3576 KB Output is correct
10 Correct 23 ms 3432 KB Output is correct
11 Correct 17 ms 3416 KB Output is correct
12 Correct 20 ms 3432 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 18 ms 3440 KB Output is correct
15 Correct 17 ms 3420 KB Output is correct
16 Correct 21 ms 3416 KB Output is correct
17 Correct 25 ms 3440 KB Output is correct
18 Correct 20 ms 3420 KB Output is correct
19 Correct 17 ms 3544 KB Output is correct
20 Correct 18 ms 3572 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 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 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 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 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 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 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 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 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 0 ms 352 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 0 ms 360 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 0 ms 356 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 356 KB Output is correct
35 Correct 0 ms 356 KB Output is correct
36 Correct 0 ms 352 KB Output is correct
37 Correct 0 ms 360 KB Output is correct
38 Correct 0 ms 360 KB Output is correct
39 Correct 0 ms 360 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 1 ms 348 KB Output is correct
81 Correct 1 ms 348 KB Output is correct
82 Correct 1 ms 388 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 1 ms 348 KB Output is correct
86 Correct 1 ms 348 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 1 ms 348 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 1 ms 348 KB Output is correct
92 Correct 1 ms 348 KB Output is correct
93 Correct 1 ms 348 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 1 ms 348 KB Output is correct
98 Correct 1 ms 344 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 0 ms 348 KB Output is correct
104 Correct 1 ms 348 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 1 ms 348 KB Output is correct
108 Correct 1 ms 344 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 1 ms 348 KB Output is correct
111 Correct 0 ms 348 KB Output is correct
112 Correct 0 ms 348 KB Output is correct
113 Correct 1 ms 600 KB Output is correct
114 Correct 1 ms 348 KB Output is correct
115 Correct 1 ms 408 KB Output is correct
116 Correct 1 ms 348 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 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 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 0 ms 352 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 0 ms 360 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 0 ms 356 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 356 KB Output is correct
35 Correct 0 ms 356 KB Output is correct
36 Correct 0 ms 352 KB Output is correct
37 Correct 0 ms 360 KB Output is correct
38 Correct 0 ms 360 KB Output is correct
39 Correct 0 ms 360 KB Output is correct
40 Correct 0 ms 372 KB Output is correct
41 Correct 20 ms 3456 KB Output is correct
42 Correct 22 ms 3448 KB Output is correct
43 Correct 19 ms 3432 KB Output is correct
44 Correct 23 ms 3556 KB Output is correct
45 Correct 18 ms 3444 KB Output is correct
46 Correct 20 ms 3432 KB Output is correct
47 Correct 18 ms 3440 KB Output is correct
48 Correct 17 ms 3576 KB Output is correct
49 Correct 23 ms 3432 KB Output is correct
50 Correct 17 ms 3416 KB Output is correct
51 Correct 20 ms 3432 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 18 ms 3440 KB Output is correct
54 Correct 17 ms 3420 KB Output is correct
55 Correct 21 ms 3416 KB Output is correct
56 Correct 25 ms 3440 KB Output is correct
57 Correct 20 ms 3420 KB Output is correct
58 Correct 17 ms 3544 KB Output is correct
59 Correct 18 ms 3572 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 1 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 0 ms 348 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 344 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 0 ms 348 KB Output is correct
98 Correct 1 ms 348 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 1 ms 388 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 1 ms 348 KB Output is correct
108 Correct 0 ms 348 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 1 ms 348 KB Output is correct
112 Correct 1 ms 348 KB Output is correct
113 Correct 1 ms 348 KB Output is correct
114 Correct 1 ms 344 KB Output is correct
115 Correct 1 ms 348 KB Output is correct
116 Correct 1 ms 348 KB Output is correct
117 Correct 1 ms 348 KB Output is correct
118 Correct 1 ms 344 KB Output is correct
119 Correct 1 ms 348 KB Output is correct
120 Correct 1 ms 348 KB Output is correct
121 Correct 1 ms 348 KB Output is correct
122 Correct 1 ms 348 KB Output is correct
123 Correct 0 ms 348 KB Output is correct
124 Correct 1 ms 348 KB Output is correct
125 Correct 1 ms 348 KB Output is correct
126 Correct 0 ms 348 KB Output is correct
127 Correct 1 ms 348 KB Output is correct
128 Correct 1 ms 344 KB Output is correct
129 Correct 1 ms 348 KB Output is correct
130 Correct 1 ms 348 KB Output is correct
131 Correct 0 ms 348 KB Output is correct
132 Correct 0 ms 348 KB Output is correct
133 Correct 1 ms 600 KB Output is correct
134 Correct 1 ms 348 KB Output is correct
135 Correct 1 ms 408 KB Output is correct
136 Correct 1 ms 348 KB Output is correct
137 Correct 25 ms 3420 KB Output is correct
138 Correct 22 ms 3416 KB Output is correct
139 Correct 17 ms 3420 KB Output is correct
140 Correct 17 ms 3420 KB Output is correct
141 Correct 18 ms 3444 KB Output is correct
142 Correct 2 ms 2652 KB Output is correct
143 Correct 2 ms 2652 KB Output is correct
144 Correct 2 ms 2672 KB Output is correct
145 Correct 3 ms 2652 KB Output is correct
146 Correct 4 ms 2652 KB Output is correct
147 Correct 2 ms 2648 KB Output is correct
148 Correct 0 ms 348 KB Output is correct
149 Correct 17 ms 3420 KB Output is correct
150 Correct 19 ms 3420 KB Output is correct
151 Correct 18 ms 3420 KB Output is correct
152 Correct 31 ms 3436 KB Output is correct
153 Correct 18 ms 3436 KB Output is correct
154 Correct 18 ms 3436 KB Output is correct
155 Correct 18 ms 3420 KB Output is correct
156 Correct 16 ms 3164 KB Output is correct
157 Correct 16 ms 3288 KB Output is correct
158 Correct 16 ms 3160 KB Output is correct
159 Correct 15 ms 3164 KB Output is correct
160 Correct 16 ms 3216 KB Output is correct
161 Correct 16 ms 3160 KB Output is correct
162 Correct 16 ms 3164 KB Output is correct
163 Correct 15 ms 3180 KB Output is correct
164 Correct 15 ms 3164 KB Output is correct
165 Correct 14 ms 2924 KB Output is correct
166 Correct 14 ms 2908 KB Output is correct
167 Correct 16 ms 3188 KB Output is correct
168 Correct 14 ms 2908 KB Output is correct
169 Correct 13 ms 2928 KB Output is correct
170 Correct 14 ms 2908 KB Output is correct
171 Correct 0 ms 348 KB Output is correct
172 Correct 0 ms 348 KB Output is correct
173 Correct 0 ms 348 KB Output is correct