| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 151164 |
2019-09-02T00:35:55 Z |
Benq |
Wine Tasting (FXCUP4_wine) |
C++17 |
|
12 ms |
1060 KB |
#include "bartender.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
/*
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
re(first); re(rest...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace input;
namespace output {
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T, size_t SZ> void pr(const array<T,SZ>& x);
template<class T> void pr(const vector<T>& x);
template<class T> void pr(const set<T>& x);
template<class T1, class T2> void pr(const map<T1,T2>& x);
template<class T> void pr(const T& x) { cout << x; }
template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
pr(first); pr(rest...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void prContain(const T& x) {
pr("{");
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
pr("}");
}
template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
template<class T> void pr(const vector<T>& x) { prContain(x); }
template<class T> void pr(const set<T>& x) { prContain(x); }
template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
void ps() { pr("\n"); }
template<class Arg> void ps(const Arg& first) {
pr(first); ps(); // no space at end of line
}
template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
pr(first," "); ps(rest...); // print w/ spaces
}
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
template<class T> T invGeneral(T a, T b) {
a %= b; if (a == 0) return b == 1 ? 0 : -1;
T x = invGeneral(b,a);
return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}
template<class T> struct modular {
T val;
explicit operator T() const { return val; }
modular() { val = 0; }
modular(const ll& v) {
val = (-MOD <= v && v <= MOD) ? v : v % MOD;
if (val < 0) val += MOD;
}
// friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
friend void pr(const modular& a) { pr(a.val); }
friend void re(modular& a) { ll x; re(x); a = modular(x); }
friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
friend bool operator<(const modular& a, const modular& b) { return a.val < b.val; }
modular operator-() const { return modular(-val); }
modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
friend modular pow(modular a, ll p) {
modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
return ans;
}
friend modular inv(const modular& a) {
auto i = invGeneral(a.val,MOD); assert(i != -1);
return i;
} // equivalent to return exp(b,MOD-2) if MOD is prime
modular& operator/=(const modular& m) { return (*this) *= inv(m); }
friend modular operator+(modular a, const modular& b) { return a += b; }
friend modular operator-(modular a, const modular& b) { return a -= b; }
friend modular operator*(modular a, const modular& b) { return a *= b; }
friend modular operator/(modular a, const modular& b) { return a /= b; }
};
typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
*/
ll encode(vi perm) {
ll ret = 0;
F0R(i,sz(perm)) {
ret *= sz(perm)-i;
ret += perm[i];
FOR(j,i+1,sz(perm)) if (perm[j] > perm[i]) perm[j] --;
}
return ret;
}
vi ENCODE(ll x, vi R) {
// cout << "ENCODIDNG " << x << "\n";
vi res;
F0R(i,sz(R)) {
if (R[i] > 12) {
res.pb(4+x%4);
x /= 4;
} else {
res.pb(1+x%3);
x /= 3;
}
}
return res;
}
std::vector<int> BlendWines(int K, std::vector<int> R){
// vi test = {9,0,1,4,8,2,3,7,6,5}; assert(decode(10,encode(test)) == test);
vi v; F0R(i,sz(R)) v.pb(i);
sort(all(v),[&](int a, int b) { return R[a] < R[b]; });
vi perm;
F0R(i,sz(R)) if (R[i] > 12) perm.pb(R[i]-13);
ll x = encode(perm);
vi res = ENCODE(x,R);
// ps("WUT",res);
return res;
}
#include "taster.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
re(first); re(rest...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace input;
namespace output {
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T, size_t SZ> void pr(const array<T,SZ>& x);
template<class T> void pr(const vector<T>& x);
template<class T> void pr(const set<T>& x);
template<class T1, class T2> void pr(const map<T1,T2>& x);
template<class T> void pr(const T& x) { cout << x; }
template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
pr(first); pr(rest...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void prContain(const T& x) {
pr("{");
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
pr("}");
}
template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
template<class T> void pr(const vector<T>& x) { prContain(x); }
template<class T> void pr(const set<T>& x) { prContain(x); }
template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
void ps() { pr("\n"); }
template<class Arg> void ps(const Arg& first) {
pr(first); ps(); // no space at end of line
}
template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
pr(first," "); ps(rest...); // print w/ spaces
}
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
template<class T> T invGeneral(T a, T b) {
a %= b; if (a == 0) return b == 1 ? 0 : -1;
T x = invGeneral(b,a);
return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}
template<class T> struct modular {
T val;
explicit operator T() const { return val; }
modular() { val = 0; }
modular(const ll& v) {
val = (-MOD <= v && v <= MOD) ? v : v % MOD;
if (val < 0) val += MOD;
}
// friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
friend void pr(const modular& a) { pr(a.val); }
friend void re(modular& a) { ll x; re(x); a = modular(x); }
friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
friend bool operator<(const modular& a, const modular& b) { return a.val < b.val; }
modular operator-() const { return modular(-val); }
modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
friend modular pow(modular a, ll p) {
modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
return ans;
}
friend modular inv(const modular& a) {
auto i = invGeneral(a.val,MOD); assert(i != -1);
return i;
} // equivalent to return exp(b,MOD-2) if MOD is prime
modular& operator/=(const modular& m) { return (*this) *= inv(m); }
friend modular operator+(modular a, const modular& b) { return a += b; }
friend modular operator-(modular a, const modular& b) { return a -= b; }
friend modular operator*(modular a, const modular& b) { return a *= b; }
friend modular operator/(modular a, const modular& b) { return a /= b; }
};
typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vi decode(int sz, ll ret) {
vi ans(sz);
F0Rd(i,sz) {
ans[i] = ret%(sz-i); ret /= sz-i;
FOR(j,i+1,sz) if (ans[j] >= ans[i]) ans[j] ++;
}
// ps("??",ans);
return ans;
}
ll DECODE(vi res) {
ll x = 0;
F0Rd(i,sz(res)) {
if (res[i] >= 4) x = 4*x+res[i]-4;
else x = 3*x+res[i]-1;
}
return x;
}
bool les(int a, int b) {
// ps("COMPARE",a,b);
return Compare(a,b) == -1;
}
vi misort(vi v) {
if (sz(v) == 1) return v;
map<int,int> match; vi fst;
for (int i = 0; i+1 < sz(v); i += 2) {
if (!les(v[i],v[i+1])) swap(v[i],v[i+1]);
match[v[i+1]] = v[i]; fst.pb(v[i+1]);
}
// ps("??",v,fst);
fst = misort(fst);
vi res = fst; res.insert(res.begin(),match[fst[0]]);
int mx = sz(fst)-1; if (sz(v)&1) mx ++;
// ps("FIXING",v,fst);
vi label = {0,2,4,10,20};
// 2-1,4-3,10-5,20-11
FOR(i,1,sz(label)) if (label[i-1]+1 <= mx) {
for (int j = min(label[i],mx); j > label[i-1]; j--) {
int t = j == sz(fst) ? v.back() : match[fst[j]];
int lo = 0, hi = j == sz(fst)?sz(res):find(all(res),fst[j])-begin(res);
// int lo = 0, hi = min(i-1,sz(res)); // how many are less
// ps("INSERTING",res,t,i);
while (lo < hi) {
int mid = (lo+hi+1)/2;
if (!les(res[mid-1],t)) hi = mid-1;
else lo = mid;
}
/*if (lo > i-1) {
ps("WUT",i,j,lo); exit(0);
}*/
// ps("AHA",res,lo,t);
res.insert(begin(res)+lo,t);
}
}
// ps(les(0,2),les(1,2));
// ps("RESULT",v,res);
// 2,1,6,5,4,3,14,13,12,11,10,9,8,7
return res;
}
std::vector<int> SortWines(int K, std::vector<int> A) {
ll x = DECODE(A);
// ps("HUH",A,x);
// ps("SORTING");
// cout << "HUH"; exit(0);
// ps("WUT",A);
vi perm = decode(max(sz(A)-12,0),x);
vi lef; int co = 0;
F0R(i,sz(A)) {
if (A[i] >= 4) A[i] = 13+perm[co++];
else lef.pb(i);
}
lef = misort(lef);
F0R(i,sz(lef)) A[lef[i]] = i+1;
// ps("HA",A);
//cout << endl;
return A;
}
Compilation message
taster.cpp: In function 'void io::setIn(std::__cxx11::string)':
taster.cpp:111:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~
taster.cpp: In function 'void io::setOut(std::__cxx11::string)':
taster.cpp:112:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
908 KB |
Correct |
| 2 |
Correct |
10 ms |
772 KB |
Correct |
| 3 |
Correct |
10 ms |
772 KB |
Correct |
| 4 |
Correct |
10 ms |
908 KB |
Correct |
| 5 |
Correct |
9 ms |
644 KB |
Correct |
| 6 |
Correct |
10 ms |
996 KB |
Correct |
| 7 |
Correct |
10 ms |
780 KB |
Correct |
| 8 |
Correct |
10 ms |
924 KB |
Correct |
| 9 |
Correct |
10 ms |
820 KB |
Correct |
| 10 |
Correct |
9 ms |
908 KB |
Correct |
| 11 |
Correct |
9 ms |
644 KB |
Correct |
| 12 |
Correct |
9 ms |
772 KB |
Correct |
| 13 |
Correct |
10 ms |
644 KB |
Correct |
| 14 |
Correct |
10 ms |
908 KB |
Correct |
| 15 |
Correct |
10 ms |
772 KB |
Correct |
| 16 |
Correct |
9 ms |
772 KB |
Correct |
| 17 |
Correct |
10 ms |
732 KB |
Correct |
| 18 |
Correct |
8 ms |
644 KB |
Correct |
| 19 |
Correct |
10 ms |
772 KB |
Correct |
| 20 |
Correct |
10 ms |
908 KB |
Correct |
| 21 |
Correct |
9 ms |
884 KB |
Correct |
| 22 |
Correct |
9 ms |
872 KB |
Correct |
| 23 |
Correct |
10 ms |
772 KB |
Correct |
| 24 |
Correct |
10 ms |
772 KB |
Correct |
| 25 |
Correct |
10 ms |
644 KB |
Correct |
| 26 |
Correct |
10 ms |
644 KB |
Correct |
| 27 |
Correct |
10 ms |
812 KB |
Correct |
| 28 |
Correct |
10 ms |
908 KB |
Correct |
| 29 |
Correct |
10 ms |
884 KB |
Correct |
| 30 |
Correct |
10 ms |
908 KB |
Correct |
| 31 |
Correct |
9 ms |
780 KB |
Correct |
| 32 |
Correct |
10 ms |
908 KB |
Correct |
| 33 |
Correct |
10 ms |
908 KB |
Correct |
| 34 |
Correct |
10 ms |
780 KB |
Correct |
| 35 |
Correct |
10 ms |
772 KB |
Correct |
| 36 |
Correct |
10 ms |
956 KB |
Correct |
| 37 |
Correct |
10 ms |
644 KB |
Correct |
| 38 |
Correct |
10 ms |
772 KB |
Correct |
| 39 |
Correct |
10 ms |
732 KB |
Correct |
| 40 |
Correct |
11 ms |
772 KB |
Correct |
| 41 |
Correct |
9 ms |
772 KB |
Correct |
| 42 |
Correct |
10 ms |
772 KB |
Correct |
| 43 |
Correct |
10 ms |
804 KB |
Correct |
| 44 |
Correct |
9 ms |
908 KB |
Correct |
| 45 |
Correct |
10 ms |
908 KB |
Correct |
| 46 |
Correct |
10 ms |
772 KB |
Correct |
| 47 |
Correct |
10 ms |
884 KB |
Correct |
| 48 |
Correct |
9 ms |
772 KB |
Correct |
| 49 |
Correct |
10 ms |
772 KB |
Correct |
| 50 |
Correct |
9 ms |
772 KB |
Correct |
| 51 |
Correct |
10 ms |
772 KB |
Correct |
| 52 |
Correct |
10 ms |
908 KB |
Correct |
| 53 |
Correct |
10 ms |
888 KB |
Correct |
| 54 |
Correct |
10 ms |
644 KB |
Correct |
| 55 |
Correct |
11 ms |
908 KB |
Correct |
| 56 |
Correct |
9 ms |
772 KB |
Correct |
| 57 |
Correct |
10 ms |
820 KB |
Correct |
| 58 |
Correct |
10 ms |
772 KB |
Correct |
| 59 |
Correct |
10 ms |
908 KB |
Correct |
| 60 |
Correct |
10 ms |
908 KB |
Correct |
| 61 |
Correct |
10 ms |
644 KB |
Correct |
| 62 |
Correct |
9 ms |
780 KB |
Correct |
| 63 |
Correct |
10 ms |
908 KB |
Correct |
| 64 |
Correct |
10 ms |
772 KB |
Correct |
| 65 |
Correct |
10 ms |
780 KB |
Correct |
| 66 |
Correct |
10 ms |
772 KB |
Correct |
| 67 |
Correct |
10 ms |
772 KB |
Correct |
| 68 |
Correct |
10 ms |
772 KB |
Correct |
| 69 |
Correct |
9 ms |
772 KB |
Correct |
| 70 |
Correct |
10 ms |
908 KB |
Correct |
| 71 |
Correct |
10 ms |
1060 KB |
Correct |
| 72 |
Correct |
10 ms |
644 KB |
Correct |
| 73 |
Correct |
9 ms |
644 KB |
Correct |
| 74 |
Correct |
9 ms |
644 KB |
Correct |
| 75 |
Correct |
9 ms |
644 KB |
Correct |
| 76 |
Correct |
10 ms |
908 KB |
Correct |
| 77 |
Correct |
9 ms |
932 KB |
Correct |
| 78 |
Correct |
10 ms |
772 KB |
Correct |
| 79 |
Correct |
10 ms |
772 KB |
Correct |
| 80 |
Correct |
9 ms |
772 KB |
Correct |
| 81 |
Correct |
9 ms |
908 KB |
Correct |
| 82 |
Correct |
9 ms |
772 KB |
Correct |
| 83 |
Correct |
9 ms |
772 KB |
Correct |
| 84 |
Correct |
10 ms |
784 KB |
Correct |
| 85 |
Correct |
10 ms |
924 KB |
Correct |
| 86 |
Correct |
9 ms |
772 KB |
Correct |
| 87 |
Correct |
9 ms |
772 KB |
Correct |
| 88 |
Correct |
10 ms |
780 KB |
Correct |
| 89 |
Correct |
10 ms |
908 KB |
Correct |
| 90 |
Correct |
10 ms |
644 KB |
Correct |
| 91 |
Correct |
9 ms |
772 KB |
Correct |
| 92 |
Correct |
9 ms |
772 KB |
Correct |
| 93 |
Correct |
10 ms |
908 KB |
Correct |
| 94 |
Correct |
10 ms |
644 KB |
Correct |
| 95 |
Correct |
10 ms |
956 KB |
Correct |
| 96 |
Correct |
9 ms |
772 KB |
Correct |
| 97 |
Correct |
11 ms |
772 KB |
Correct |
| 98 |
Correct |
10 ms |
772 KB |
Correct |
| 99 |
Correct |
10 ms |
908 KB |
Correct |
| 100 |
Correct |
12 ms |
872 KB |
Correct |
| 101 |
Correct |
12 ms |
784 KB |
Correct |
| 102 |
Correct |
10 ms |
884 KB |
Correct |
| 103 |
Correct |
9 ms |
644 KB |
Correct |
| 104 |
Correct |
10 ms |
908 KB |
Correct |
| 105 |
Correct |
10 ms |
884 KB |
Correct |
| 106 |
Correct |
10 ms |
884 KB |
Correct |
| 107 |
Correct |
10 ms |
788 KB |
Correct |
| 108 |
Correct |
10 ms |
900 KB |
Correct |
| 109 |
Correct |
8 ms |
780 KB |
Correct |
| 110 |
Correct |
10 ms |
780 KB |
Correct |
| 111 |
Correct |
9 ms |
1016 KB |
Correct |
| 112 |
Correct |
10 ms |
1016 KB |
Correct |
| 113 |
Correct |
10 ms |
772 KB |
Correct |
| 114 |
Correct |
11 ms |
780 KB |
Correct |
| 115 |
Correct |
11 ms |
1016 KB |
Correct |
| 116 |
Correct |
11 ms |
772 KB |
Correct |
| 117 |
Correct |
10 ms |
796 KB |
Correct |
| 118 |
Correct |
11 ms |
644 KB |
Correct |
| 119 |
Correct |
10 ms |
892 KB |
Correct |
| 120 |
Correct |
10 ms |
772 KB |
Correct |
