oj.uz

답안 #212348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212348 2020-03-22T18:06:34 Z b00n0rp Collecting Stamps 3 (JOI20_ho_t3) C++17
100 / 100
 368 ms 157052 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)\
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")\
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
 
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
	cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
 
// -----------------------</Consts>-----------------------
 
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
	fact[0] = 1;
	FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
	ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
	REPD(i,FACSZ-1){
		ifact[i] = mul(i+1,ifact[i+1],c);
	}
}
 
int ncr(int n,int r,int c = MOD){
	return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
	// (UNCOMMENT FOR CIN/COUT) \
	FAST_IO
	PRECISION(10)
 
	int t = 1;
	// (UNCOMMENT FOR MULTIPLE TEST CASES) \
	sfl(t);
	FOR(testcase,1,t+1){
		// (UNCOMMENT FOR CODEJAM) \
		printf("Case #%lld: ",testcase); 
		solvethetestcase();
	}
}   
 
int n,per;
int x[205],t[205];

const int MKC = 1LL*2e7+5;

int dp[MKC];

int conv(int l,int r,int flag,int cnt){
	// trace(l,r,flag,cnt,(l+r*205+cnt*205*205)*2+flag);
	return (l+r*205+cnt*205*205)*2+flag;
}

int solve(int l,int r,int flag,int cnt){
	if(cnt < 0) cnt = 0;
	if(l == 0 and r == n+1){
		if(cnt == 0) return 0;
		else return INF;
	}
	int bak = conv(l,r,flag,cnt);
	if(dp[bak] != -1) return dp[bak];
	int res = INF;
	if(l == 0){
		if(flag == 0) return INF;
		int sam = solve(l,r+1,1,cnt)+abs(x[r+1]-x[r]),nsam = solve(l,r+1,1,cnt-1)+abs(x[r+1]-x[r]);
		remin(res,sam);
		if(nsam <= t[r]) remin(res,nsam);
	}
	else if(r == n+1){
		if(flag == 1) return  INF;
		int sam = solve(l-1,r,0,cnt)+abs(x[l]-x[l-1]),nsam = solve(l-1,r,0,cnt-1)+abs(x[l]-x[l-1]);
		remin(res,sam);
		if(nsam <= t[l]) remin(res,nsam);
	}
	else{
		if(flag == 0){
			int sam = min(solve(l-1,r,0,cnt)+abs(x[l-1]-x[l]),solve(l-1,r,1,cnt)+per-x[r]+x[l]);
			int nsam = min(solve(l-1,r,0,cnt-1)+abs(x[l-1]-x[l]),solve(l-1,r,1,cnt-1)+per-x[r]+x[l]);
			remin(res,sam);
			if(nsam <= t[l]) remin(res,nsam);
		}
		else{
			int sam = min(solve(l,r+1,1,cnt)+abs(x[r+1]-x[r]),solve(l,r+1,0,cnt)+per-x[r]+x[l]);
			int nsam = min(solve(l,r+1,1,cnt-1)+abs(x[r+1]-x[r]),solve(l,r+1,0,cnt-1)+per-x[r]+x[l]);
			remin(res,sam);
			if(nsam <= t[r]) remin(res,nsam);
		}
	}
	return dp[bak] = res;
}
 
void solvethetestcase(){
	REP(i,MKC) dp[i] = -1;
	sfl2(n,per)
	REP(i,n) sfl(x[i+1])
	REP(i,n) sfl(t[i+1])
	x[0] = 0;
	x[n+1] = per;
	int ans = 0;
	REP(i,n+1){
		REP(j,n+1){
			if(solve(i,i+1,0,j) < INF or solve(i,i+1,1,j) < INF) remax(ans,j);
		}
	}
	// REP(i,n+1){
	// 	FOR(j,i+1,n+2){
	// 		REP(k,n+1){
	// 			trace(i,j,k,solve(i,j,0,k));
	// 			trace(i,j,k,solve(i,j,1,k));
	// 		}
	// 	}
	// }
	pfl(ans)
}

Compilation message

ho_t3.cpp:4:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
 ^
ho_t3.cpp:6:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN NEEDED)\
 ^
ho_t3.cpp:56:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
ho_t3.cpp:212:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR CIN/COUT) \
  ^
ho_t3.cpp:217:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR MULTIPLE TEST CASES) \
  ^
ho_t3.cpp:220:3: warning: multi-line comment [-Wcomment]
   // (UNCOMMENT FOR CODEJAM) \
   ^
ho_t3.cpp: In function 'void solvethetestcase()':
ho_t3.cpp:96:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
ho_t3.cpp:278:2: note: in expansion of macro 'sfl2'
  sfl2(n,per)
  ^~~~
ho_t3.cpp:95:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl(x) scanf("%lld",&x);
                ~~~~~^~~~~~~~~~~
ho_t3.cpp:279:11: note: in expansion of macro 'sfl'
  REP(i,n) sfl(x[i+1])
           ^~~
ho_t3.cpp:95:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl(x) scanf("%lld",&x);
                ~~~~~^~~~~~~~~~~
ho_t3.cpp:280:11: note: in expansion of macro 'sfl'
  REP(i,n) sfl(t[i+1])
           ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 156920 KB Output is correct
2 Correct 77 ms 156920 KB Output is correct
3 Correct 81 ms 156920 KB Output is correct
4 Correct 79 ms 156920 KB Output is correct
5 Correct 79 ms 156920 KB Output is correct
6 Correct 77 ms 156920 KB Output is correct
7 Correct 80 ms 156920 KB Output is correct
8 Correct 80 ms 156920 KB Output is correct
9 Correct 78 ms 156920 KB Output is correct
10 Correct 78 ms 156924 KB Output is correct
11 Correct 83 ms 156920 KB Output is correct
12 Correct 81 ms 156920 KB Output is correct
13 Correct 79 ms 156896 KB Output is correct
14 Correct 80 ms 156920 KB Output is correct
15 Correct 82 ms 157048 KB Output is correct
16 Correct 81 ms 156920 KB Output is correct
17 Correct 78 ms 156920 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 156920 KB Output is correct
2 Correct 77 ms 156920 KB Output is correct
3 Correct 81 ms 156920 KB Output is correct
4 Correct 79 ms 156920 KB Output is correct
5 Correct 79 ms 156920 KB Output is correct
6 Correct 77 ms 156920 KB Output is correct
7 Correct 80 ms 156920 KB Output is correct
8 Correct 80 ms 156920 KB Output is correct
9 Correct 78 ms 156920 KB Output is correct
10 Correct 78 ms 156924 KB Output is correct
11 Correct 83 ms 156920 KB Output is correct
12 Correct 81 ms 156920 KB Output is correct
13 Correct 79 ms 156896 KB Output is correct
14 Correct 80 ms 156920 KB Output is correct
15 Correct 82 ms 157048 KB Output is correct
16 Correct 81 ms 156920 KB Output is correct
17 Correct 78 ms 156920 KB Output is correct
18 Correct 80 ms 156920 KB Output is correct
19 Correct 79 ms 156920 KB Output is correct
20 Correct 81 ms 156924 KB Output is correct
21 Correct 78 ms 156920 KB Output is correct
22 Correct 82 ms 156920 KB Output is correct
23 Correct 78 ms 156920 KB Output is correct
24 Correct 80 ms 156920 KB Output is correct
25 Correct 80 ms 156920 KB Output is correct
26 Correct 81 ms 156920 KB Output is correct
27 Correct 80 ms 156920 KB Output is correct
28 Correct 83 ms 156920 KB Output is correct
29 Correct 80 ms 156924 KB Output is correct
30 Correct 80 ms 156920 KB Output is correct
31 Correct 78 ms 156896 KB Output is correct
32 Correct 81 ms 156924 KB Output is correct
33 Correct 78 ms 156920 KB Output is correct
34 Correct 79 ms 156920 KB Output is correct
35 Correct 79 ms 156920 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 156920 KB Output is correct
2 Correct 77 ms 156920 KB Output is correct
3 Correct 81 ms 156920 KB Output is correct
4 Correct 79 ms 156920 KB Output is correct
5 Correct 79 ms 156920 KB Output is correct
6 Correct 77 ms 156920 KB Output is correct
7 Correct 80 ms 156920 KB Output is correct
8 Correct 80 ms 156920 KB Output is correct
9 Correct 78 ms 156920 KB Output is correct
10 Correct 78 ms 156924 KB Output is correct
11 Correct 83 ms 156920 KB Output is correct
12 Correct 81 ms 156920 KB Output is correct
13 Correct 79 ms 156896 KB Output is correct
14 Correct 80 ms 156920 KB Output is correct
15 Correct 82 ms 157048 KB Output is correct
16 Correct 81 ms 156920 KB Output is correct
17 Correct 78 ms 156920 KB Output is correct
18 Correct 254 ms 157048 KB Output is correct
19 Correct 153 ms 156920 KB Output is correct
20 Correct 108 ms 156920 KB Output is correct
21 Correct 153 ms 156920 KB Output is correct
22 Correct 199 ms 157048 KB Output is correct
23 Correct 107 ms 156920 KB Output is correct
24 Correct 95 ms 156920 KB Output is correct
25 Correct 107 ms 156920 KB Output is correct
26 Correct 90 ms 156920 KB Output is correct
27 Correct 107 ms 156848 KB Output is correct
28 Correct 91 ms 156920 KB Output is correct
29 Correct 104 ms 156920 KB Output is correct
30 Correct 98 ms 156920 KB Output is correct
31 Correct 101 ms 156920 KB Output is correct
32 Correct 91 ms 156920 KB Output is correct
33 Correct 99 ms 156920 KB Output is correct
34 Correct 84 ms 156920 KB Output is correct
35 Correct 100 ms 156980 KB Output is correct
36 Correct 89 ms 156920 KB Output is correct
37 Correct 100 ms 156920 KB Output is correct
38 Correct 88 ms 156920 KB Output is correct
39 Correct 105 ms 156920 KB Output is correct
40 Correct 91 ms 156920 KB Output is correct
41 Correct 310 ms 156920 KB Output is correct
42 Correct 183 ms 156920 KB Output is correct
43 Correct 349 ms 156972 KB Output is correct
44 Correct 186 ms 157048 KB Output is correct
45 Correct 327 ms 157048 KB Output is correct
46 Correct 190 ms 157048 KB Output is correct

Subtask #4
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 156920 KB Output is correct
2 Correct 77 ms 156920 KB Output is correct
3 Correct 81 ms 156920 KB Output is correct
4 Correct 79 ms 156920 KB Output is correct
5 Correct 79 ms 156920 KB Output is correct
6 Correct 77 ms 156920 KB Output is correct
7 Correct 80 ms 156920 KB Output is correct
8 Correct 80 ms 156920 KB Output is correct
9 Correct 78 ms 156920 KB Output is correct
10 Correct 78 ms 156924 KB Output is correct
11 Correct 83 ms 156920 KB Output is correct
12 Correct 81 ms 156920 KB Output is correct
13 Correct 79 ms 156896 KB Output is correct
14 Correct 80 ms 156920 KB Output is correct
15 Correct 82 ms 157048 KB Output is correct
16 Correct 81 ms 156920 KB Output is correct
17 Correct 78 ms 156920 KB Output is correct
18 Correct 80 ms 156920 KB Output is correct
19 Correct 79 ms 156920 KB Output is correct
20 Correct 81 ms 156924 KB Output is correct
21 Correct 78 ms 156920 KB Output is correct
22 Correct 82 ms 156920 KB Output is correct
23 Correct 78 ms 156920 KB Output is correct
24 Correct 80 ms 156920 KB Output is correct
25 Correct 80 ms 156920 KB Output is correct
26 Correct 81 ms 156920 KB Output is correct
27 Correct 80 ms 156920 KB Output is correct
28 Correct 83 ms 156920 KB Output is correct
29 Correct 80 ms 156924 KB Output is correct
30 Correct 80 ms 156920 KB Output is correct
31 Correct 78 ms 156896 KB Output is correct
32 Correct 81 ms 156924 KB Output is correct
33 Correct 78 ms 156920 KB Output is correct
34 Correct 79 ms 156920 KB Output is correct
35 Correct 79 ms 156920 KB Output is correct
36 Correct 254 ms 157048 KB Output is correct
37 Correct 153 ms 156920 KB Output is correct
38 Correct 108 ms 156920 KB Output is correct
39 Correct 153 ms 156920 KB Output is correct
40 Correct 199 ms 157048 KB Output is correct
41 Correct 107 ms 156920 KB Output is correct
42 Correct 95 ms 156920 KB Output is correct
43 Correct 107 ms 156920 KB Output is correct
44 Correct 90 ms 156920 KB Output is correct
45 Correct 107 ms 156848 KB Output is correct
46 Correct 91 ms 156920 KB Output is correct
47 Correct 104 ms 156920 KB Output is correct
48 Correct 98 ms 156920 KB Output is correct
49 Correct 101 ms 156920 KB Output is correct
50 Correct 91 ms 156920 KB Output is correct
51 Correct 99 ms 156920 KB Output is correct
52 Correct 84 ms 156920 KB Output is correct
53 Correct 100 ms 156980 KB Output is correct
54 Correct 89 ms 156920 KB Output is correct
55 Correct 100 ms 156920 KB Output is correct
56 Correct 88 ms 156920 KB Output is correct
57 Correct 105 ms 156920 KB Output is correct
58 Correct 91 ms 156920 KB Output is correct
59 Correct 310 ms 156920 KB Output is correct
60 Correct 183 ms 156920 KB Output is correct
61 Correct 349 ms 156972 KB Output is correct
62 Correct 186 ms 157048 KB Output is correct
63 Correct 327 ms 157048 KB Output is correct
64 Correct 190 ms 157048 KB Output is correct
65 Correct 273 ms 156920 KB Output is correct
66 Correct 254 ms 156920 KB Output is correct
67 Correct 280 ms 156920 KB Output is correct
68 Correct 216 ms 156920 KB Output is correct
69 Correct 284 ms 157048 KB Output is correct
70 Correct 276 ms 157000 KB Output is correct
71 Correct 258 ms 157048 KB Output is correct
72 Correct 332 ms 157048 KB Output is correct
73 Correct 234 ms 156920 KB Output is correct
74 Correct 232 ms 157052 KB Output is correct
75 Correct 249 ms 156920 KB Output is correct
76 Correct 295 ms 157052 KB Output is correct
77 Correct 325 ms 156972 KB Output is correct
78 Correct 226 ms 156920 KB Output is correct
79 Correct 245 ms 157048 KB Output is correct
80 Correct 300 ms 156920 KB Output is correct
81 Correct 228 ms 156920 KB Output is correct
82 Correct 240 ms 157048 KB Output is correct
83 Correct 336 ms 156920 KB Output is correct
84 Correct 248 ms 157052 KB Output is correct
85 Correct 271 ms 156920 KB Output is correct
86 Correct 270 ms 156920 KB Output is correct
87 Correct 256 ms 156920 KB Output is correct
88 Correct 368 ms 156920 KB Output is correct
89 Correct 341 ms 156920 KB Output is correct
90 Correct 237 ms 157048 KB Output is correct
91 Correct 331 ms 157048 KB Output is correct
92 Correct 331 ms 157008 KB Output is correct
93 Correct 284 ms 156924 KB Output is correct