oj.uz

Submission #203221

# Submission time Handle Problem Language Result Execution time Memory
203221 2020-02-19T20:26:32 Z Jatana Collecting Stamps 3 (JOI20_ho_t3) C++17
100 / 100
 250 ms 131448 KB 
/*
                                                                                                     
                                             `-:://:::-                                             
                                           `//:-------:/:`                                          
                                          .+:--.......--:+`                                         
                                         `+:--..`````..--//`                                        
                                         .o:--..`` ``..--:o`                                        
                                         .o:--...```..---+/`                                        
                                       `/y+o/---....---:+o.                                         
                                   `...````-os+/:---:/+o/--.`                                       
              `-/+++++/:.      `...`       :h+d+oooo+/+-`   ...                                     
            `/++//:::://++-`....`         -.`//````````:`     `..`                                  
           `o+/::------://o/`           `-` -.          -`       `..`                               
 `---.-o/:./o/::-..``..-ЗАПУСКАЕМ      ..  ..            -`        `...       ``..``                
  `....o+:-++/:--.```..-://s.        `-`  .-              -`          `-o: .-//::::/:-`             
          `:s+/:--....-::/+s-`      .-   `-                -`           -///:--------:/:`           
           ./s+//:::::://oo-``..НЕЙРОННУЮ: СЕТЬ:::::::-`РАБОТЯГИ        `+:--........--:/`          
            .:ooo+++++osso-`    `.:-...`/` ./::-------:/:`   -`         :+--..``````.--:+:...-+:-`  
             `.-/+++++/+-.-`    -.   ``:so:/:--.......--:+`  `-```````o+/+--..`````..--:o/-..:s+:.  
                 ```````:``.. `-`     -` `+:--..`````..--/+-.../.`````..-o:--.......---/o.    `     
                        `:  `:-      -.  .o:--..`` ``..--:o`   `-`      `:o+:--------:+o-`          
                         `-`-...    ..   .o/--...```..--:+/`    `-`     `oy/so/////++o/.`           
                          -/`  `-` `- ``+s/o/:---...---:++.      `-`   .-../d://///:-.`             
                `.---..``-..-    .-/..`````-oo+/:::::/+o+-        `-``-`  `-.  ````                 
             `:++++/+++++-  ..``.-/:`      /y-:/++o++/:.`..`       ./.   `-                         
            -++/::::::://+/..:-``:` ..   `-.`  ```.```    `..`   `..`-` `-                          
       ``  -o//:--....-::/++` -.-`   `-`.-`                 `..`..`  `-.-                           
  -----ss+:++/:--.```..-://s.  /.     `::                    `-:.     ./`                           
  `````/:..+o/::-..``.--:/+s. ..-`   `-``-`                 ..` `-`  `-`-`                          
          `-s+/::-----::/+oo---``-` ..    .:-    ```      .-`     .-.-  `-`                         
           `:oo+//::://+os/..:`..-/:`      :y.-:::::::.`.-`        ./-`  `-`                        
            `./+oooooooo+/.`-    .-:...`.. .//:-------://`        `- `..` `:.                       
              ``.-::::-.``-/`  `-` `-  `oo:+:--.......--:/`      `-    `.:--h.``..```               
                          -.-`.-    .-   `+:--..`````..--//`    `-       /s-//::::::::.             
                         -` `/-      ..  .o:--..`` ``..--:o.```.-        `//:--------://`           
                        -` .-`.-`     -.`-o/--...```..--:+/.``-:....``:-.+:--....`...--:+`          
                       ..`-.   `-.   ``:os:o/:---...---:++.  `-     ``///+:-..``````.--:+-````-.`   
              `.:///////.-`      .:-..` -``-+o+/:::::/+o/.  `-         `:+:-..`````..--:o/:--/ys+-  
            `-++///////+o/. ``....`-.    :` `.:++++++/:.`  .-           -o/---......---/o.   `.`    
           `++//:-----::/+o:..`     .-`   :    ```````    .-           `+so+:--------:++-`          
  `````:-``:o/::-..`..--:/+o`         -.  `-             .-          `../../+o+////+o+:.`           
  -----syo/o+/:--.```..-://s.          .-` `-           .-        `...     ``-:////:-``             
       .` `/s//:--....-::/+s.            -. `-`        .-       `..`                                
           .+o+/:::--:://+s/-..`          .::+y  ```  .-     `..`                                   
            ./oo++////+oso-`   `....       :y-+:::::::/`   ...                                      
             `.:+oooooo/-`         `....-. .//:-------:/:-.`                                        
                ``...``                 /+:+:--.......--:+`                                         
                                         `+:--..`````..--//`                                        
                                         .o:--..`` ``..--:o`                                        
                                         .+/--...```..--:+/`                                        
                                         `-o/:---...---:++.                                         
                                          `-+o+/:---:/+o/.                                          
                                            `.:+oooo+/-.`                                           
                                               ``````                                               
*/

#ifdef aimbot
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif

#define hur(f, g) template<class c> int f(c a) {if (sizeof(c) == 8) return g##ll(a); else return g(a);}
hur(popc, __builtin_popcount) hur(ctz, __builtin_ctz) hur(clz, __builtin_clz)

/*
	- place bitset modifications here
*/

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <ostream>
#include <istream>
#include <typeinfo>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <limits>
#include <fstream>
#include <array>
#include <list>
#include <bitset>
#include <functional>
#include <random>
#include <cstring>
#include <chrono>

#define random escape__from__random__aetuhoetnuhshe
#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define le(v) ((int)v.size())
#define f(i, n) for (int i = 0; i < (n); i++)
#define rof(i, n) for (int i = ((n) - 1); i >= 0; i--)
#define apply(v, act) for (auto &x : v) { act; }
#define log(args...) {string s = #args;deque<string> deq;\
string buf = "";int bal = 0;for (char c : s) {\
if (c == '(' || c == '[' || c == '{') {bal++;\
} else if (c == ')' || c == ']' || c == '}') {\
bal--;} else {if (bal == 0) {if (c == ',') {\
deq.pb(buf);buf = "";} else {if (c != ' ') {\
buf += c;}}}}}if (!buf.empty()) {deq.pb(buf);}\
smart_io::precall_print();smart_io::_print(deq, args);}

inline int min(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^x; }
inline int max(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^y; }
inline long long min(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^x; }
inline long long max(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^y; }

#define print    \
smart_io::precall_print(); \
cout,

#define scan cin,

#ifdef fast_allocator
const int MAXMEM = 200 * 1000 * 1024;
char _memory[MAXMEM];
size_t _ptr = 0;
void* operator new(size_t _x) { _ptr += _x; assert(_ptr < MAXMEM); return _memory + _ptr - _x; }
void operator delete (void*) noexcept {}
#endif

using namespace std;

char string_in_buffer[(int)260];


void fast_scan(int &x) { scanf("%d", &x); }
void fast_scan(long long &x) { scanf("%lld", &x); }
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
void fast_scan(double &x) { scanf("%lf", &x); }
void fast_scan(long double &x) { scanf("%Lf", &x); }
void fast_scan(char &x) {
	scanf("%c", &x);
	if (x == '\n') {
		fast_scan(x);
	}
}
void fast_scan(string &x) {
	scanf("%s", string_in_buffer);
	x = string(string_in_buffer);
}

template<class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
	fast_scan(p.first);
	fast_scan(p.second);
}

template <class T>
void fast_scan(vector<T> &v) {
	for (auto &x : v) fast_scan(x);
}

void fast_print(const int &x) { printf("%d", x); }
void fast_print(const unsigned int &x) { printf("%u", x); }
void fast_print(const long long &x) { printf("%lld", x); }
void fast_print(const unsigned long long &x) { printf("%llu", x); }
void fast_print(const char &x) { printf("%c", x); };
// void fast_print(__int128 x) {
// 	if (x == 0) { fast_print('0'); return; }
// 	if (x < 0) {
// 		fast_print('-');
// 		x = -x;
// 	}
// 	__int128 p = 1;
// 	while (x / (p * 10)) p *= 10;
// 	while (p) {
// 		__int128 symb = x / p;
// 		fast_print((int)symb);
// 		x -= p * symb;
// 		p /= 10;
// 	}
// };
void fast_print(const double &x) { printf("%.15lf", x); }
void fast_print(const long double &x) { printf("%.15Lf", x); }
void fast_print(const string &x) { printf("%s", x.c_str());}
void fast_print(const char v[]) { fast_print((string)v); }

template<class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
	fast_print(p.first);
	fast_print(' ');
	fast_print(p.second);
}

template <class T>
void fast_print(const vector<T> &v) {
	if (v.empty()) return;
	fast_print(v[0]);
	for (int i = 1; i < v.size(); i++) {
		fast_print(' ');
		fast_print(v[i]);
	}
}

template <class T>
void fast_print(const vector<vector<T>> &v) {
	if (v.empty()) return;
	fast_print(v[0]);
	for (int i = 1; i < v.size(); i++) {
		fast_print('\n');
		fast_print(v[i]);
	}
}

template <class T>
void fast_print(const T &v) {
	for (const auto &x : v) {
		fast_print(x);
		fast_print(' ');
	}
}


using namespace std;


namespace smart_io {
	string print_start = "";
	string sep = " ";
	bool first_print = false;
	
	void precall_print() {
		fast_print(print_start);
		print_start = "\n";
		first_print = true;
	}
	
	void _print(deque<string>) {}
	template<class T, class... Args>
	void _print(deque<string> names, T elem, Args... args) {
		if (!first_print) {
			fast_print("\n");
		} else {
			first_print = false;
		}
		fast_print(names.front());
		fast_print(" = ");
		fast_print(elem);
		names.pop_front();
		_print(names, args...);
	}
} //namespace smart_io


template <class T>
ostream &operator,(ostream &os, const T &object) {
	if (!smart_io::first_print) {
		fast_print(smart_io::sep);
	} else {
		smart_io::first_print = false;
	}
	fast_print(object);
	return os;
}

template <class T>
istream &operator,(istream &is, T &object) {
	fast_scan(object);
	return is;
}

namespace random {
	using namespace std::chrono;
	mt19937 rng(duration_cast< milliseconds >(
											  system_clock::now().time_since_epoch()
											  ).count());
	uniform_real_distribution<> prob_dist(0.0, 1.0);
};
#define int long long
namespace typedefs {
	typedef long long ll;
	typedef unsigned long long ull;
	typedef pair<int, int> pii;
	typedef long double ld;
}

namespace numbers_operation {
	template<class T>
	inline T floor_mod(T a, const T &b) {
		a %= b;	
		if (a < 0) a += b;
		return a;
	}
}

using namespace numbers_operation;
using namespace typedefs;
using namespace random;

const int N = 203;

int dp[N][N][N][2]; // dp[L][R][k][2]
// min time to fill

int n, L;
vector<int> X, T;

int get_dist(int i, int j) {
	int d = abs(X[i] - X[j]);
	return min(d, L - d);
}

void chkmin(int &x, int y) {
	x = min(x, y);
}

signed main(signed argc, char *argv[]) {
	scan n, L;
	X.resize(n);
	scan X;
	T.resize(n);
	scan T;
	X.insert(X.begin(), 0);
	T.insert(T.begin(), -10);
	n++;
	for (int i = 0; i < N; i++)
		for (int j = 0; j < N; j++)
			for (int k = 0; k < N; k++)
				dp[i][j][k][0] = dp[i][j][k][1] = 1e18;
	dp[0][n - 1][0][0] = 0;
	for (int d = -(n - 1); d < n; d++) {
		for (int i = 0; i < n; i++) {
			int j = -d + i;
			if (i < j && j < n) {
				for (int k = 0; k <= n; k++) {
					for (int t = 0; t < 2; t++) {
						if (t == 0) {
							chkmin(dp[i + 1][j]
								[k + (dp[i][j][k][t] + get_dist(i, i + 1) <= T[i + 1])][0],
								dp[i][j][k][t] + get_dist(i, i + 1)
							);
							chkmin(dp[i + 1][j]
								[k + (dp[i][j][k][t] + get_dist(i, j) <= T[j])][1],
								dp[i][j][k][t] + get_dist(i, j)
							);
						} else {
							chkmin(dp[i][j - 1]
								[k + (dp[i][j][k][t] + get_dist(j, j - 1) <= T[j - 1])][1],
								dp[i][j][k][t] + get_dist(j, j - 1)
							);
							chkmin(dp[i][j - 1]
								[k + (dp[i][j][k][t] + get_dist(i, j) <= T[i])][0],
								dp[i][j][k][t] + get_dist(i, j)
							);
						}
					}
				}
			}
		}
	}
	int rez = 0;
	for (int i = 0; i < n; i++) {
		for (int j = i; j < n; j++) {
			for (int k = 0; k <= n; k++) {
				for (int t = 0; t < 2; t++) {
					if (dp[i][j][k][t] < 1e17) {
						rez = max(rez, k);
					}
				}
			}
		}
	}
	print rez;
}

Compilation message

ho_t3.cpp: In function 'void fast_scan(int&)':
ho_t3.cpp:141:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(int &x) { scanf("%d", &x); }
                          ~~~~~^~~~~~~~~~
ho_t3.cpp: In function 'void fast_scan(long long int&)':
ho_t3.cpp:142:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(long long &x) { scanf("%lld", &x); }
                                ~~~~~^~~~~~~~~~~~
ho_t3.cpp: In function 'void fast_scan(long long unsigned int&)':
ho_t3.cpp:143:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
                                         ~~~~~^~~~~~~~~~~~
ho_t3.cpp: In function 'void fast_scan(double&)':
ho_t3.cpp:144:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(double &x) { scanf("%lf", &x); }
                             ~~~~~^~~~~~~~~~~
ho_t3.cpp: In function 'void fast_scan(long double&)':
ho_t3.cpp:145:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(long double &x) { scanf("%Lf", &x); }
                                  ~~~~~^~~~~~~~~~~
ho_t3.cpp: In function 'void fast_scan(char&)':
ho_t3.cpp:147:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%c", &x);
  ~~~~~^~~~~~~~~~
ho_t3.cpp: In function 'void fast_scan(std::__cxx11::string&)':
ho_t3.cpp:153:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", string_in_buffer);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 131324 KB Output is correct
2 Correct 75 ms 131320 KB Output is correct
3 Correct 74 ms 131324 KB Output is correct
4 Correct 75 ms 131320 KB Output is correct
5 Correct 74 ms 131320 KB Output is correct
6 Correct 75 ms 131324 KB Output is correct
7 Correct 78 ms 131320 KB Output is correct
8 Correct 76 ms 131320 KB Output is correct
9 Correct 74 ms 131320 KB Output is correct
10 Correct 80 ms 131308 KB Output is correct
11 Correct 75 ms 131320 KB Output is correct
12 Correct 75 ms 131280 KB Output is correct
13 Correct 76 ms 131320 KB Output is correct
14 Correct 72 ms 131324 KB Output is correct
15 Correct 75 ms 131320 KB Output is correct
16 Correct 76 ms 131320 KB Output is correct
17 Correct 73 ms 131320 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 131324 KB Output is correct
2 Correct 75 ms 131320 KB Output is correct
3 Correct 74 ms 131324 KB Output is correct
4 Correct 75 ms 131320 KB Output is correct
5 Correct 74 ms 131320 KB Output is correct
6 Correct 75 ms 131324 KB Output is correct
7 Correct 78 ms 131320 KB Output is correct
8 Correct 76 ms 131320 KB Output is correct
9 Correct 74 ms 131320 KB Output is correct
10 Correct 80 ms 131308 KB Output is correct
11 Correct 75 ms 131320 KB Output is correct
12 Correct 75 ms 131280 KB Output is correct
13 Correct 76 ms 131320 KB Output is correct
14 Correct 72 ms 131324 KB Output is correct
15 Correct 75 ms 131320 KB Output is correct
16 Correct 76 ms 131320 KB Output is correct
17 Correct 73 ms 131320 KB Output is correct
18 Correct 78 ms 131320 KB Output is correct
19 Correct 73 ms 131324 KB Output is correct
20 Correct 72 ms 131320 KB Output is correct
21 Correct 76 ms 131324 KB Output is correct
22 Correct 74 ms 131320 KB Output is correct
23 Correct 74 ms 131320 KB Output is correct
24 Correct 77 ms 131296 KB Output is correct
25 Correct 75 ms 131448 KB Output is correct
26 Correct 75 ms 131320 KB Output is correct
27 Correct 74 ms 131276 KB Output is correct
28 Correct 74 ms 131320 KB Output is correct
29 Correct 75 ms 131320 KB Output is correct
30 Correct 81 ms 131320 KB Output is correct
31 Correct 76 ms 131320 KB Output is correct
32 Correct 75 ms 131320 KB Output is correct
33 Correct 75 ms 131324 KB Output is correct
34 Correct 76 ms 131348 KB Output is correct
35 Correct 74 ms 131320 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 131324 KB Output is correct
2 Correct 75 ms 131320 KB Output is correct
3 Correct 74 ms 131324 KB Output is correct
4 Correct 75 ms 131320 KB Output is correct
5 Correct 74 ms 131320 KB Output is correct
6 Correct 75 ms 131324 KB Output is correct
7 Correct 78 ms 131320 KB Output is correct
8 Correct 76 ms 131320 KB Output is correct
9 Correct 74 ms 131320 KB Output is correct
10 Correct 80 ms 131308 KB Output is correct
11 Correct 75 ms 131320 KB Output is correct
12 Correct 75 ms 131280 KB Output is correct
13 Correct 76 ms 131320 KB Output is correct
14 Correct 72 ms 131324 KB Output is correct
15 Correct 75 ms 131320 KB Output is correct
16 Correct 76 ms 131320 KB Output is correct
17 Correct 73 ms 131320 KB Output is correct
18 Correct 194 ms 131320 KB Output is correct
19 Correct 130 ms 131324 KB Output is correct
20 Correct 98 ms 131320 KB Output is correct
21 Correct 129 ms 131320 KB Output is correct
22 Correct 153 ms 131320 KB Output is correct
23 Correct 90 ms 131324 KB Output is correct
24 Correct 87 ms 131320 KB Output is correct
25 Correct 94 ms 131320 KB Output is correct
26 Correct 80 ms 131344 KB Output is correct
27 Correct 92 ms 131320 KB Output is correct
28 Correct 87 ms 131320 KB Output is correct
29 Correct 95 ms 131320 KB Output is correct
30 Correct 89 ms 131296 KB Output is correct
31 Correct 93 ms 131320 KB Output is correct
32 Correct 82 ms 131320 KB Output is correct
33 Correct 92 ms 131320 KB Output is correct
34 Correct 82 ms 131320 KB Output is correct
35 Correct 94 ms 131448 KB Output is correct
36 Correct 79 ms 131320 KB Output is correct
37 Correct 90 ms 131320 KB Output is correct
38 Correct 83 ms 131320 KB Output is correct
39 Correct 95 ms 131320 KB Output is correct
40 Correct 86 ms 131320 KB Output is correct
41 Correct 234 ms 131320 KB Output is correct
42 Correct 164 ms 131320 KB Output is correct
43 Correct 238 ms 131448 KB Output is correct
44 Correct 161 ms 131320 KB Output is correct
45 Correct 236 ms 131320 KB Output is correct
46 Correct 164 ms 131320 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 131324 KB Output is correct
2 Correct 75 ms 131320 KB Output is correct
3 Correct 74 ms 131324 KB Output is correct
4 Correct 75 ms 131320 KB Output is correct
5 Correct 74 ms 131320 KB Output is correct
6 Correct 75 ms 131324 KB Output is correct
7 Correct 78 ms 131320 KB Output is correct
8 Correct 76 ms 131320 KB Output is correct
9 Correct 74 ms 131320 KB Output is correct
10 Correct 80 ms 131308 KB Output is correct
11 Correct 75 ms 131320 KB Output is correct
12 Correct 75 ms 131280 KB Output is correct
13 Correct 76 ms 131320 KB Output is correct
14 Correct 72 ms 131324 KB Output is correct
15 Correct 75 ms 131320 KB Output is correct
16 Correct 76 ms 131320 KB Output is correct
17 Correct 73 ms 131320 KB Output is correct
18 Correct 78 ms 131320 KB Output is correct
19 Correct 73 ms 131324 KB Output is correct
20 Correct 72 ms 131320 KB Output is correct
21 Correct 76 ms 131324 KB Output is correct
22 Correct 74 ms 131320 KB Output is correct
23 Correct 74 ms 131320 KB Output is correct
24 Correct 77 ms 131296 KB Output is correct
25 Correct 75 ms 131448 KB Output is correct
26 Correct 75 ms 131320 KB Output is correct
27 Correct 74 ms 131276 KB Output is correct
28 Correct 74 ms 131320 KB Output is correct
29 Correct 75 ms 131320 KB Output is correct
30 Correct 81 ms 131320 KB Output is correct
31 Correct 76 ms 131320 KB Output is correct
32 Correct 75 ms 131320 KB Output is correct
33 Correct 75 ms 131324 KB Output is correct
34 Correct 76 ms 131348 KB Output is correct
35 Correct 74 ms 131320 KB Output is correct
36 Correct 194 ms 131320 KB Output is correct
37 Correct 130 ms 131324 KB Output is correct
38 Correct 98 ms 131320 KB Output is correct
39 Correct 129 ms 131320 KB Output is correct
40 Correct 153 ms 131320 KB Output is correct
41 Correct 90 ms 131324 KB Output is correct
42 Correct 87 ms 131320 KB Output is correct
43 Correct 94 ms 131320 KB Output is correct
44 Correct 80 ms 131344 KB Output is correct
45 Correct 92 ms 131320 KB Output is correct
46 Correct 87 ms 131320 KB Output is correct
47 Correct 95 ms 131320 KB Output is correct
48 Correct 89 ms 131296 KB Output is correct
49 Correct 93 ms 131320 KB Output is correct
50 Correct 82 ms 131320 KB Output is correct
51 Correct 92 ms 131320 KB Output is correct
52 Correct 82 ms 131320 KB Output is correct
53 Correct 94 ms 131448 KB Output is correct
54 Correct 79 ms 131320 KB Output is correct
55 Correct 90 ms 131320 KB Output is correct
56 Correct 83 ms 131320 KB Output is correct
57 Correct 95 ms 131320 KB Output is correct
58 Correct 86 ms 131320 KB Output is correct
59 Correct 234 ms 131320 KB Output is correct
60 Correct 164 ms 131320 KB Output is correct
61 Correct 238 ms 131448 KB Output is correct
62 Correct 161 ms 131320 KB Output is correct
63 Correct 236 ms 131320 KB Output is correct
64 Correct 164 ms 131320 KB Output is correct
65 Correct 213 ms 131320 KB Output is correct
66 Correct 196 ms 131320 KB Output is correct
67 Correct 189 ms 131448 KB Output is correct
68 Correct 173 ms 131320 KB Output is correct
69 Correct 200 ms 131320 KB Output is correct
70 Correct 201 ms 131448 KB Output is correct
71 Correct 208 ms 131320 KB Output is correct
72 Correct 190 ms 131320 KB Output is correct
73 Correct 196 ms 131320 KB Output is correct
74 Correct 185 ms 131320 KB Output is correct
75 Correct 197 ms 131320 KB Output is correct
76 Correct 221 ms 131320 KB Output is correct
77 Correct 229 ms 131296 KB Output is correct
78 Correct 186 ms 131320 KB Output is correct
79 Correct 191 ms 131332 KB Output is correct
80 Correct 219 ms 131296 KB Output is correct
81 Correct 199 ms 131296 KB Output is correct
82 Correct 211 ms 131320 KB Output is correct
83 Correct 247 ms 131320 KB Output is correct
84 Correct 234 ms 131320 KB Output is correct
85 Correct 223 ms 131320 KB Output is correct
86 Correct 212 ms 131320 KB Output is correct
87 Correct 203 ms 131320 KB Output is correct
88 Correct 232 ms 131320 KB Output is correct
89 Correct 248 ms 131320 KB Output is correct
90 Correct 203 ms 131320 KB Output is correct
91 Correct 250 ms 131448 KB Output is correct
92 Correct 240 ms 131320 KB Output is correct
93 Correct 227 ms 131320 KB Output is correct