Submission #83449
Source Code Expand
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(__typeof((X).begin()) it=(X).begin();it!=(X).end();it++)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define sec second
#define sz(x) ((int)(x).size())
using namespace std;
struct timer{
time_t start;
timer(){start=clock();}
~timer(){cerr<<1.*(clock()-start)/CLOCKS_PER_SEC<<" secs"<<endl;}
};
typedef istringstream iss;
typedef long long ll;
typedef pair<int,int> pi;
typedef stringstream sst;
typedef vector<int> vi;
#define PI 3.14159265358979323846
#define curr(P, i) P[(i) % P.size()]
#define next(P, i) P[(i+1) % P.size()]
#define prev(P, i) P[(i+P.size()-1) % P.size()]
#define diff(P, i) (next(P,i) - curr(P,i))
#define EQ(x,y) (fabs((x)-(y))<EPS)
#define GE(x,y) ((x)+EPS>(y))
#define LE(x,y) ((x)<(y)+EPS)
enum { OUT, ON, IN };
typedef complex<double> P;
typedef vector<P> G;
namespace std{
bool operator < (const P& a, const P& b) {
return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
}
}
double cross(const P& a, const P& b) {
return imag(conj(a)*b);
}
double dot(const P& a, const P& b) {
return real(conj(a)*b);
}
struct L : public vector<P> {
L(){}
L(const P &a, const P &b) {
push_back(a); push_back(b);
}
};
struct C {
P p; double r;
C(const P &p, double r) : p(p), r(r) { }
};
int ccw(P a, P b, P c) {
b -= a; c -= a;
if (cross(b, c) > EPS) return +1; // counter clockwise
if (cross(b, c) < -EPS) return -1; // clockwise
if (dot(b, c) < -EPS) return +2; // c--a--b on line
if (norm(b) < norm(c)+EPS) return -2; // a--b--c on line
return 0;
}
bool intersectLL(const L &l, const L &m) {
return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel
abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line
}
bool intersectLS(const L &l, const L &s) {
return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l
cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l
}
bool intersectLP(const L &l, const P &p) {
return abs(cross(l[1]-p, l[0]-p)) < EPS;
}
bool intersectSS(const L &s, const L &t) {
return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&
ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;
}
bool intersectSP(const L &s, const P &p) {
return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality
}
P projection(const L &l, const P &p) {
double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);
return l[0] + t*(l[0]-l[1]);
}
P reflection(const L &l, const P &p) {
return p + 2.0 * (projection(l, p) - p);
}
double distanceLP(const L &l, const P &p) {
return abs(p - projection(l, p));
}
double distanceLL(const L &l, const L &m) {
return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);
}
double distanceLS(const L &l, const L &s) {
if (intersectLS(l, s)) return 0;
return min(distanceLP(l, s[0]), distanceLP(l, s[1]));
}
double distanceSP(const L &s, const P &p) {
const P r = projection(s, p);
if (intersectSP(s, r)) return abs(r - p);
return min(abs(s[0] - p), abs(s[1] - p));
}
double distanceSS(const L &s, const L &t) {
if (intersectSS(s, t)) return 0;
return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),
min(distanceSP(t, s[0]), distanceSP(t, s[1])));
}
P crosspoint(const L &l, const L &m) {
double A = cross(l[1] - l[0], m[1] - m[0]);
double B = cross(l[1] - l[0], l[1] - m[0]);
if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line
if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!
return m[0] + B / A * (m[1] - m[0]);
}
vector<P> crosspointLC(const L &l, const C &c){
vector<P> res;
P p = projection(l, c.p);
double d1 = abs(p - c.p);
if(EQ(d1, c.r)){
res.pb(p);
return res;
}
if(d1 > c.r){
return res;
}
double d2 = sqrt(c.r*c.r - d1*d1);
P v = d2/abs(l[1] - l[0]) * (l[1] - l[0]);
res.pb(p + v);
res.pb(p - v);
return res;
}
#define sq(x) ((x)*(x))
vector<P> crosspointCC(const C &c1, const C &c2){
vector<P> res;
P v = c2.p - c1.p;
double d = abs(v);
if(d < EPS){
if(EQ(c1.r, c2.r)){ // coincide
res.pb(c1.p + P(c1.r, 0));
}
return res;
}
vector<double> thetas;
if(EQ(d, c1.r + c2.r)){
thetas.pb(0);
}else if(EQ(d, c1.r - c2.r)){
thetas.pb(0);
}else if(EQ(d, c2.r - c1.r)){
thetas.pb(PI);
}else if(d > c1.r + c2.r || d < abs(c1.r - c2.r)){
return res;
}else{
double t = acos((sq(c1.r) + sq(d) - sq(c2.r))
/ (2.0 * c1.r * d));
thetas.pb(t);
thetas.pb(-t);
}
rep(i, sz(thetas)){
res.pb(c1.p + c1.r/d * v
* P(cos(thetas[i]), sin(thetas[i])));
}
return res;
}
vector<L> tangentPC(const P& p, const C& c){
vector<L> res;
P v = c.p - p;
double d1 = abs(v), d2;
if(EQ(d1, c.r)){
d2 = sqrt(sq(d1) - sq(c.r));
P q = p + v * P(cos(PI/2.0), sin(PI/2.0));
res.pb(L(q, p));
return res;
}else if(d1 < c.r){
return res;
}else{
d2 = sqrt(sq(d1) - sq(c.r));
double t = atan2(c.r, d2);
P q = p + d2/d1 * v * P(cos(t), sin(t));
res.pb(L(p, q));
q = p + d2/d1 * v * P(cos(-t), sin(-t));
res.pb(L(p, q));
return res;
}
}
vector<L> commontangentCC(const C& c1, const C& c2){
vector<L> res;
P v = c2.p - c1.p;
double d = abs(v);
if(d < EPS){
if(EQ(c1.r, c2.r)){ // coinside
P q1 = c1.p + P(c1.r, 0);
P q2 = q1 + P(0, c1.r);
res.pb(L(q1, q2));
}
return res;
}
if(d + EPS <= abs(c1.r - c2.r)){
return res;
}else if(EQ(d, c1.r - c2.r)){
P q1 = c1.r/d * v;
P q2 = q1 + v * P(cos(PI/2.0), sin(PI/2.0));
res.pb(L(q1, q2));
return res;
}else if(EQ(d, c2.r - c1.r)){
P q1 = c2.r/d * -v;
P q2 = q1 + v * P(cos(PI/2.0), sin(PI/2.0));
res.pb(L(q1, q2));
return res;
}else{
double t1 = asin((c2.r - c1.r)/d) + PI/2.0;
P q1 = c1.p + c1.r/d * v * P(cos(t1), sin(t1));
P q2 = c2.p + c2.r/d * v * P(cos(t1), sin(t1));
res.pb(L(q1, q2));
q1 = c1.p + c1.r/d * v * P(cos(-t1), sin(-t1));
q2 = c2.p + c2.r/d * v * P(cos(-t1), sin(-t1));
res.pb(L(q1, q2));
if(d + EPS <= c1.r + c2.r){
return res;
}else if(EQ(d, c1.r + c2.r)){
P q3 = c1.p + c1.r/d * v;
P q4 = q3 + v * P(cos(PI/2.0), sin(PI/2.0));
res.pb(L(q3, q4));
}else{
double t2 = acos((c1.r + c2.r)/d);
P q3 = c1.p + c1.r/d * v * P(cos(t2), sin(t2));
P q4 = c2.p - c2.r/d * v * P(cos(t2), sin(t2));
res.pb(L(q3, q4));
q3 = c1.p + c1.r/d * v * P(cos(-t2), sin(-t2));
q4 = c2.p - c2.r/d * v * P(cos(-t2), sin(-t2));
res.pb(L(q3, q4));
}
}
return res;
}
vector<C> tangentcircleLL(const L& l, const L& m, const double& r){
vector<C> res;
if(abs(cross(l[1]-l[0], m[1]-m[0])) < EPS){ // parallel
double d = distanceLL(l, m);
if(EQ(d, r*2.0)){
P p = P(l[0] + r/abs(l[1]-l[0]) * (l[1]-l[0])
* P(cos(PI/2), sin(PI/2)));
res.pb(C(p, r));
}
return res;
}
P p = crosspoint(l, m);
double t1 = (arg(m[1]-m[0]) - arg(l[1]-l[0])) / 2.0;
P v1 = abs(r/sin(t1)) / abs(l[1]-l[0]) * (l[1]-l[0])
* P(cos(t1), sin(t1));
double t2 = PI/2 - t1;
P v2 = abs(r/sin(t2)) / abs(m[1]-m[0]) * (m[1]-m[0])
* P(cos(t2), sin(t2));
res.pb(C(p + v1, r));
res.pb(C(p + v2, r));
res.pb(C(p - v1, r));
res.pb(C(p - v2, r));
return res;
}
#undef sq
int contains(const G& g, const P& p) {
bool in = false;
for (int i = 0; i < g.size(); ++i) {
P a = curr(g,i) - p, b = next(g,i) - p;
if (imag(a) > imag(b)) swap(a, b);
if (imag(a) <= 0 && 0 < imag(b))
if (cross(a, b) < 0) in = !in;
if (cross(a, b) == 0 && dot(a, b) <= 0) return ON;
}
return in ? IN : OUT;
}
#define d(k) (dot(p[k], l[1] - l[0]))
P extreme(const vector<P> &p, const L &l) {
int k = 0;
for (int i = 1; i < p.size(); ++i)
if (d(i) > d(k)) k = i;
return p[k];
}
#undef d
double area2(const G& p) {
double A = 0;
for (int i = 0; i < p.size(); ++i)
A += cross(curr(p, i), next(p, i));
return A;
}
vector<P> convex_hull(vector<P> ps) {
int n = ps.size(), k = 0;
sort(ps.begin(), ps.end());
vector<P> ch(2*n);
for (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull
while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;
for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]) // upper-hull
while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;
ch.resize(k-1);
return ch;
}
bool isconvex(const G &P) {
for (int i = 0; i < P.size(); ++i)
if (ccw(prev(P, i), curr(P, i), next(P, i)) > 0) return false;
return true;
}
G convex_cut(const G& p, const L& l) {
G Q;
for (int i = 0; i < p.size(); ++i) {
P A = curr(p, i), B = next(p, i);
if (ccw(l[0], l[1], A) != -1) Q.push_back(A);
if (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)
Q.push_back(crosspoint(L(A, B), l));
}
return Q;
}
int convex_contains(const G &Q, const P &p) {
const int n = Q.size();
P g = (Q[0] + Q[n/3] + Q[2*n/3]) / 3.0; // inner-point
int a = 0, b = n;
while (a+1 < b) { // invariant: c is in fan g-Q[a]-Q[b]
int c = (a + b) / 2;
if (cross(Q[a]-g, Q[c]-g) > 0) { // angle < 180 deg
if (cross(Q[a]-g, p-g) > 0 && cross(Q[c]-g, p-g) < 0) b = c;
else a = c;
} else {
if (cross(Q[a]-g, p-g) < 0 && cross(Q[c]-g, p-g) > 0) a = c;
else b = c;
}
}
b %= n;
if (cross(Q[a] - p, Q[b] - p) < 0) return 0;
if (cross(Q[a] - p, Q[b] - p) > 0) return 2;
return 1;
}
bool intersect_1pt(const P& a, const P& b,
const P& c, const P& d, P &r) {
double D = cross(b - a, d - c);
if (EQ(D, 0)) return false;
double t = cross(c - a, d - c) / D;
double s = -cross(a - c, b - a) / D;
r = a + t * (b - a);
return GE(t, 0) && LE(t, 1) && GE(s, 0) && LE(s, 1);
}
G convex_intersect(const G &p, const G &Q) {
const int n = p.size(), m = Q.size();
int a = 0, b = 0, aa = 0, ba = 0;
enum { Pin, Qin, Unknown } in = Unknown;
G R;
do {
int a1 = (a+n-1) % n, b1 = (b+m-1) % m;
double C = cross(p[a] - p[a1], Q[b] - Q[b1]);
double A = cross(p[a1] - Q[b], p[a] - Q[b]);
double B = cross(Q[b1] - p[a], Q[b] - p[a]);
P r;
if (intersect_1pt(p[a1], p[a], Q[b1], Q[b], r)) {
if (in == Unknown) aa = ba = 0;
R.push_back( r );
in = B > 0 ? Pin : A > 0 ? Qin : in;
}
if (C == 0 && B == 0 && A == 0) {
if (in == Pin) { b = (b + 1) % m; ++ba; }
else { a = (a + 1) % m; ++aa; }
} else if (C >= 0) {
if (A > 0) { if (in == Pin) R.push_back(p[a]); a = (a+1)%n; ++aa; }
else { if (in == Qin) R.push_back(Q[b]); b = (b+1)%m; ++ba; }
} else {
if (B > 0) { if (in == Qin) R.push_back(Q[b]); b = (b+1)%m; ++ba; }
else { if (in == Pin) R.push_back(p[a]); a = (a+1)%n; ++aa; }
}
} while ( (aa < n || ba < m) && aa < 2*n && ba < 2*m );
if (in == Unknown) {
if (convex_contains(Q, p[0])) return p;
if (convex_contains(p, Q[0])) return Q;
}
return R;
}
double convex_diameter(const G &pt) {
const int n = pt.size();
int is = 0, js = 0;
for (int i = 1; i < n; ++i) {
if (imag(pt[i]) > imag(pt[is])) is = i;
if (imag(pt[i]) < imag(pt[js])) js = i;
}
double maxd = norm(pt[is]-pt[js]);
int i, maxi, j, maxj;
i = maxi = is;
j = maxj = js;
do {
if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;
else i = (i+1) % n;
if (norm(pt[i]-pt[j]) > maxd) {
maxd = norm(pt[i]-pt[j]);
maxi = i; maxj = j;
}
} while (i != is || j != js);
return maxd; /* farthest pair is (maxi, maxj). */
}
#define d(k) (dot(p[k], l[1] - l[0]))
P convex_extreme(const G &p, const L &l) {
const int n = p.size();
int a = 0, b = n;
if (d(0) >= d(n-1) && d(0) >= d(1)) return p[0];
while (a < b) {
int c = (a + b) / 2;
if (d(c) >= d(c-1) && d(c) >= d(c+1)) return p[c];
if (d(a+1) > d(a)) {
if (d(c+1) <= d(c) || d(a) > d(c)) b = c;
else a = c;
} else {
if (d(c+1) > d(c) || d(a) >= d(c)) a = c;
else b = c;
}
}
return P();
}
#undef d
int main(){
cout<<1<<endl<<1<<" "<<2<<" "<<3<<endl;
}
Submission Info
Submission Time |
|
Task |
A - 役人 |
User |
evima |
Language |
C++ (G++ 4.6.4) |
Score |
1 |
Code Size |
13044 Byte |
Status |
AC |
Exec Time |
80 ms |
Memory |
912 KB |
Judge Result
Set Name |
Subtask00 |
Subtask01 |
Subtask02 |
Subtask03 |
Subtask04 |
Subtask05 |
Subtask06 |
Subtask07 |
Subtask08 |
Subtask09 |
Subtask10 |
Subtask11 |
Subtask12 |
Subtask13 |
Subtask14 |
Subtask15 |
Subtask16 |
Subtask17 |
Subtask18 |
Subtask19 |
Subtask20 |
Subtask21 |
Subtask22 |
Subtask23 |
Subtask24 |
Subtask25 |
Subtask26 |
Subtask27 |
Subtask28 |
Subtask29 |
Subtask30 |
Subtask31 |
Subtask32 |
Subtask33 |
Subtask34 |
Subtask35 |
Subtask36 |
Subtask37 |
Subtask38 |
Subtask39 |
Subtask40 |
Subtask41 |
Subtask42 |
Subtask43 |
Subtask44 |
Subtask45 |
Subtask46 |
Subtask47 |
Subtask48 |
Subtask49 |
Subtask50 |
Subtask51 |
Subtask52 |
Subtask53 |
Subtask54 |
Subtask55 |
Subtask56 |
Subtask57 |
Subtask58 |
Subtask59 |
Subtask60 |
Subtask61 |
Subtask62 |
Subtask63 |
Subtask64 |
Subtask65 |
Subtask66 |
Subtask67 |
Subtask68 |
Subtask69 |
Subtask70 |
Subtask71 |
Subtask72 |
Subtask73 |
Subtask74 |
Subtask75 |
Subtask76 |
Subtask77 |
Subtask78 |
Subtask79 |
Subtask80 |
Subtask81 |
Subtask82 |
Subtask83 |
Subtask84 |
Subtask85 |
Subtask86 |
Subtask87 |
Subtask88 |
Subtask89 |
Subtask90 |
Subtask91 |
Subtask92 |
Subtask93 |
Subtask94 |
Subtask95 |
Subtask96 |
Subtask97 |
Subtask98 |
Subtask99 |
Score / Max Score |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
0.01 / 1 |
Status |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Set Name |
Test Cases |
Subtask00 |
11_rand00.txt |
Subtask01 |
11_rand01.txt |
Subtask02 |
11_rand02.txt |
Subtask03 |
11_rand03.txt |
Subtask04 |
11_rand04.txt |
Subtask05 |
11_rand05.txt |
Subtask06 |
11_rand06.txt |
Subtask07 |
11_rand07.txt |
Subtask08 |
11_rand08.txt |
Subtask09 |
11_rand09.txt |
Subtask10 |
11_rand10.txt |
Subtask11 |
11_rand11.txt |
Subtask12 |
11_rand12.txt |
Subtask13 |
11_rand13.txt |
Subtask14 |
11_rand14.txt |
Subtask15 |
11_rand15.txt |
Subtask16 |
11_rand16.txt |
Subtask17 |
11_rand17.txt |
Subtask18 |
11_rand18.txt |
Subtask19 |
11_rand19.txt |
Subtask20 |
11_rand20.txt |
Subtask21 |
11_rand21.txt |
Subtask22 |
11_rand22.txt |
Subtask23 |
11_rand23.txt |
Subtask24 |
11_rand24.txt |
Subtask25 |
11_rand25.txt |
Subtask26 |
11_rand26.txt |
Subtask27 |
11_rand27.txt |
Subtask28 |
11_rand28.txt |
Subtask29 |
11_rand29.txt |
Subtask30 |
11_rand30.txt |
Subtask31 |
11_rand31.txt |
Subtask32 |
11_rand32.txt |
Subtask33 |
11_rand33.txt |
Subtask34 |
11_rand34.txt |
Subtask35 |
11_rand35.txt |
Subtask36 |
11_rand36.txt |
Subtask37 |
11_rand37.txt |
Subtask38 |
11_rand38.txt |
Subtask39 |
11_rand39.txt |
Subtask40 |
11_rand40.txt |
Subtask41 |
11_rand41.txt |
Subtask42 |
11_rand42.txt |
Subtask43 |
11_rand43.txt |
Subtask44 |
11_rand44.txt |
Subtask45 |
11_rand45.txt |
Subtask46 |
11_rand46.txt |
Subtask47 |
11_rand47.txt |
Subtask48 |
11_rand48.txt |
Subtask49 |
11_rand49.txt |
Subtask50 |
11_rand50.txt |
Subtask51 |
11_rand51.txt |
Subtask52 |
11_rand52.txt |
Subtask53 |
11_rand53.txt |
Subtask54 |
11_rand54.txt |
Subtask55 |
11_rand55.txt |
Subtask56 |
11_rand56.txt |
Subtask57 |
11_rand57.txt |
Subtask58 |
11_rand58.txt |
Subtask59 |
11_rand59.txt |
Subtask60 |
11_rand60.txt |
Subtask61 |
11_rand61.txt |
Subtask62 |
11_rand62.txt |
Subtask63 |
11_rand63.txt |
Subtask64 |
11_rand64.txt |
Subtask65 |
11_rand65.txt |
Subtask66 |
11_rand66.txt |
Subtask67 |
11_rand67.txt |
Subtask68 |
11_rand68.txt |
Subtask69 |
11_rand69.txt |
Subtask70 |
11_rand70.txt |
Subtask71 |
11_rand71.txt |
Subtask72 |
11_rand72.txt |
Subtask73 |
11_rand73.txt |
Subtask74 |
11_rand74.txt |
Subtask75 |
11_rand75.txt |
Subtask76 |
11_rand76.txt |
Subtask77 |
11_rand77.txt |
Subtask78 |
11_rand78.txt |
Subtask79 |
11_rand79.txt |
Subtask80 |
11_rand80.txt |
Subtask81 |
11_rand81.txt |
Subtask82 |
11_rand82.txt |
Subtask83 |
11_rand83.txt |
Subtask84 |
11_rand84.txt |
Subtask85 |
11_rand85.txt |
Subtask86 |
11_rand86.txt |
Subtask87 |
11_rand87.txt |
Subtask88 |
11_rand88.txt |
Subtask89 |
11_rand89.txt |
Subtask90 |
11_rand90.txt |
Subtask91 |
11_rand91.txt |
Subtask92 |
11_rand92.txt |
Subtask93 |
11_rand93.txt |
Subtask94 |
11_rand94.txt |
Subtask95 |
11_rand95.txt |
Subtask96 |
11_rand96.txt |
Subtask97 |
11_rand97.txt |
Subtask98 |
11_rand98.txt |
Subtask99 |
11_rand99.txt |
Case Name |
Status |
Exec Time |
Memory |
11_rand00.txt |
AC |
33 ms |
864 KB |
11_rand01.txt |
AC |
28 ms |
860 KB |
11_rand02.txt |
AC |
30 ms |
896 KB |
11_rand03.txt |
AC |
30 ms |
856 KB |
11_rand04.txt |
AC |
29 ms |
848 KB |
11_rand05.txt |
AC |
26 ms |
872 KB |
11_rand06.txt |
AC |
23 ms |
908 KB |
11_rand07.txt |
AC |
24 ms |
880 KB |
11_rand08.txt |
AC |
25 ms |
852 KB |
11_rand09.txt |
AC |
22 ms |
880 KB |
11_rand10.txt |
AC |
26 ms |
904 KB |
11_rand11.txt |
AC |
33 ms |
864 KB |
11_rand12.txt |
AC |
23 ms |
848 KB |
11_rand13.txt |
AC |
24 ms |
900 KB |
11_rand14.txt |
AC |
23 ms |
900 KB |
11_rand15.txt |
AC |
37 ms |
864 KB |
11_rand16.txt |
AC |
23 ms |
900 KB |
11_rand17.txt |
AC |
23 ms |
908 KB |
11_rand18.txt |
AC |
25 ms |
848 KB |
11_rand19.txt |
AC |
25 ms |
844 KB |
11_rand20.txt |
AC |
27 ms |
888 KB |
11_rand21.txt |
AC |
26 ms |
788 KB |
11_rand22.txt |
AC |
25 ms |
828 KB |
11_rand23.txt |
AC |
23 ms |
896 KB |
11_rand24.txt |
AC |
52 ms |
888 KB |
11_rand25.txt |
AC |
37 ms |
904 KB |
11_rand26.txt |
AC |
25 ms |
768 KB |
11_rand27.txt |
AC |
25 ms |
880 KB |
11_rand28.txt |
AC |
23 ms |
904 KB |
11_rand29.txt |
AC |
26 ms |
876 KB |
11_rand30.txt |
AC |
24 ms |
844 KB |
11_rand31.txt |
AC |
23 ms |
900 KB |
11_rand32.txt |
AC |
22 ms |
760 KB |
11_rand33.txt |
AC |
56 ms |
868 KB |
11_rand34.txt |
AC |
23 ms |
900 KB |
11_rand35.txt |
AC |
24 ms |
844 KB |
11_rand36.txt |
AC |
24 ms |
856 KB |
11_rand37.txt |
AC |
25 ms |
848 KB |
11_rand38.txt |
AC |
24 ms |
908 KB |
11_rand39.txt |
AC |
49 ms |
860 KB |
11_rand40.txt |
AC |
23 ms |
856 KB |
11_rand41.txt |
AC |
49 ms |
860 KB |
11_rand42.txt |
AC |
21 ms |
824 KB |
11_rand43.txt |
AC |
24 ms |
900 KB |
11_rand44.txt |
AC |
23 ms |
908 KB |
11_rand45.txt |
AC |
23 ms |
904 KB |
11_rand46.txt |
AC |
23 ms |
900 KB |
11_rand47.txt |
AC |
23 ms |
864 KB |
11_rand48.txt |
AC |
23 ms |
860 KB |
11_rand49.txt |
AC |
22 ms |
908 KB |
11_rand50.txt |
AC |
48 ms |
860 KB |
11_rand51.txt |
AC |
23 ms |
904 KB |
11_rand52.txt |
AC |
21 ms |
868 KB |
11_rand53.txt |
AC |
21 ms |
908 KB |
11_rand54.txt |
AC |
37 ms |
904 KB |
11_rand55.txt |
AC |
22 ms |
896 KB |
11_rand56.txt |
AC |
22 ms |
848 KB |
11_rand57.txt |
AC |
25 ms |
856 KB |
11_rand58.txt |
AC |
23 ms |
904 KB |
11_rand59.txt |
AC |
23 ms |
904 KB |
11_rand60.txt |
AC |
23 ms |
852 KB |
11_rand61.txt |
AC |
23 ms |
900 KB |
11_rand62.txt |
AC |
44 ms |
900 KB |
11_rand63.txt |
AC |
69 ms |
848 KB |
11_rand64.txt |
AC |
23 ms |
856 KB |
11_rand65.txt |
AC |
25 ms |
908 KB |
11_rand66.txt |
AC |
24 ms |
852 KB |
11_rand67.txt |
AC |
21 ms |
876 KB |
11_rand68.txt |
AC |
80 ms |
844 KB |
11_rand69.txt |
AC |
24 ms |
904 KB |
11_rand70.txt |
AC |
24 ms |
908 KB |
11_rand71.txt |
AC |
24 ms |
908 KB |
11_rand72.txt |
AC |
26 ms |
776 KB |
11_rand73.txt |
AC |
32 ms |
860 KB |
11_rand74.txt |
AC |
23 ms |
904 KB |
11_rand75.txt |
AC |
24 ms |
860 KB |
11_rand76.txt |
AC |
23 ms |
900 KB |
11_rand77.txt |
AC |
23 ms |
904 KB |
11_rand78.txt |
AC |
25 ms |
912 KB |
11_rand79.txt |
AC |
23 ms |
896 KB |
11_rand80.txt |
AC |
22 ms |
884 KB |
11_rand81.txt |
AC |
24 ms |
856 KB |
11_rand82.txt |
AC |
22 ms |
900 KB |
11_rand83.txt |
AC |
22 ms |
904 KB |
11_rand84.txt |
AC |
23 ms |
904 KB |
11_rand85.txt |
AC |
23 ms |
848 KB |
11_rand86.txt |
AC |
24 ms |
900 KB |
11_rand87.txt |
AC |
23 ms |
884 KB |
11_rand88.txt |
AC |
23 ms |
876 KB |
11_rand89.txt |
AC |
58 ms |
852 KB |
11_rand90.txt |
AC |
25 ms |
908 KB |
11_rand91.txt |
AC |
25 ms |
908 KB |
11_rand92.txt |
AC |
25 ms |
844 KB |
11_rand93.txt |
AC |
23 ms |
912 KB |
11_rand94.txt |
AC |
36 ms |
876 KB |
11_rand95.txt |
AC |
47 ms |
908 KB |
11_rand96.txt |
AC |
22 ms |
908 KB |
11_rand97.txt |
AC |
30 ms |
844 KB |
11_rand98.txt |
AC |
24 ms |
900 KB |
11_rand99.txt |
AC |
23 ms |
912 KB |