oj.uz

답안 #249816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249816 2020-07-15T21:14:14 Z b00n0rp Birthday gift (IZhO18_treearray) C++17
56 / 100
 4000 ms 68624 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------

#pragma GCC optimize("Ofast,unroll-loops")

/*
#pragma GCC target("avx,avx2,fma")
*/ 

// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</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 WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#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){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.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(){
    // comment when using scanf,printf
    FAST_IO

    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES) \
    cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM) \
        printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,m,q;
vi adj[200005];
int par[200005][21];
int dep[200005];

void dfs(int u,int p,int d){
    dep[u] = d;
    par[u][0] = p;
    for(auto v:adj[u]){
        if(v!=p){
            dfs(v,u,d+1);
        }
    }
}

int lca(int u,int v){
    if(dep[v] > dep[u]) swap(u,v);
    FORD(j,20,0){
        if(dep[u]-(1<<j) >= dep[v]) u = par[u][j];
    }
    if(u == v) return u;
    FORD(j,20,0){
        if(par[u][j] != par[v][j]){
            u = par[u][j];
            v = par[v][j];
        }
    }
    return par[u][0];
}

int a[200005];
int b[200005];

set<int> s1[200005];
set<int> s2[200005];

void upd(int pos,int val){
    s1[a[pos]].erase(pos);
    a[pos] = val;
    s1[a[pos]].insert(pos);

    s2[b[pos-1]].erase(pos-1);
    s2[b[pos]].erase(pos);
    b[pos-1] = lca(a[pos-1],val);
    b[pos] = lca(val,a[pos+1]);
    s2[b[pos-1]].insert(pos-1);
    s2[b[pos]].insert(pos);
}

pii quer(int l,int r,int v){
    auto gg = lower_bound(all(s1[v]),l);
    if(gg != s1[v].end() and (*gg) <= r) return {(*gg),(*gg)};
    gg = lower_bound(all(s2[v]),l);
    if(gg != s2[v].end() and (*gg) < r) return {(*gg),(*gg)+1};
    return {-1,-1};
}
 
void solvethetestcase(){
    cin >> n >> m >> q;
    REP(i,n-1){
        int u,v; cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    dfs(1,1,0);
    FOR(j,1,21){
        FOR(i,1,n+1){
            par[i][j] = par[par[i][j-1]][j-1];
        }
    }
    REP(i,n+2){
        a[i] = 1;
        b[i] = 1;
        s1[1].insert(i);
        s2[1].insert(i);
    }
    FOR(i,1,m+1){
        int x;
        cin >> x;
        upd(i,x);
    }
    WL(q){
        int type; cin >> type;
        if(type == 1){
            int pos,val; cin >> pos >> val;
            upd(pos,val);
        }
        else{
            int l,r,v; cin >> l >> r >> v;
            pii res = quer(l,r,v);
            cout << res.F << " " << res.S << "\n";
        }
    }
}

Compilation message

treearray.cpp:25:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
treearray.cpp:189:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR MULTIPLE TEST CASES) \
     ^
treearray.cpp:192:9: warning: multi-line comment [-Wcomment]
         // (UNCOMMENT FOR CODEJAM) \
         ^

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23808 KB n=5
2 Correct 15 ms 23808 KB n=100
3 Correct 16 ms 23808 KB n=100
4 Correct 15 ms 23808 KB n=100
5 Correct 15 ms 23808 KB n=100
6 Correct 15 ms 23808 KB n=100
7 Correct 15 ms 23808 KB n=100
8 Correct 15 ms 23808 KB n=100
9 Correct 16 ms 23808 KB n=100
10 Correct 15 ms 23808 KB n=100
11 Correct 16 ms 23808 KB n=100
12 Correct 15 ms 23936 KB n=100
13 Correct 15 ms 23936 KB n=100
14 Correct 14 ms 23808 KB n=100
15 Correct 15 ms 23808 KB n=100
16 Correct 15 ms 23808 KB n=100
17 Correct 20 ms 23808 KB n=100
18 Correct 15 ms 23808 KB n=100
19 Correct 15 ms 23808 KB n=100
20 Correct 15 ms 23808 KB n=100
21 Correct 15 ms 23808 KB n=100
22 Correct 15 ms 23808 KB n=100
23 Correct 15 ms 23808 KB n=100
24 Correct 15 ms 23808 KB n=100
25 Correct 15 ms 23808 KB n=100
26 Correct 15 ms 23808 KB n=12
27 Correct 15 ms 23808 KB n=100

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23808 KB n=5
2 Correct 15 ms 23808 KB n=100
3 Correct 16 ms 23808 KB n=100
4 Correct 15 ms 23808 KB n=100
5 Correct 15 ms 23808 KB n=100
6 Correct 15 ms 23808 KB n=100
7 Correct 15 ms 23808 KB n=100
8 Correct 15 ms 23808 KB n=100
9 Correct 16 ms 23808 KB n=100
10 Correct 15 ms 23808 KB n=100
11 Correct 16 ms 23808 KB n=100
12 Correct 15 ms 23936 KB n=100
13 Correct 15 ms 23936 KB n=100
14 Correct 14 ms 23808 KB n=100
15 Correct 15 ms 23808 KB n=100
16 Correct 15 ms 23808 KB n=100
17 Correct 20 ms 23808 KB n=100
18 Correct 15 ms 23808 KB n=100
19 Correct 15 ms 23808 KB n=100
20 Correct 15 ms 23808 KB n=100
21 Correct 15 ms 23808 KB n=100
22 Correct 15 ms 23808 KB n=100
23 Correct 15 ms 23808 KB n=100
24 Correct 15 ms 23808 KB n=100
25 Correct 15 ms 23808 KB n=100
26 Correct 15 ms 23808 KB n=12
27 Correct 15 ms 23808 KB n=100
28 Correct 17 ms 23936 KB n=500
29 Correct 15 ms 23936 KB n=500
30 Correct 16 ms 23936 KB n=500
31 Correct 16 ms 23936 KB n=500
32 Correct 17 ms 23936 KB n=500
33 Correct 16 ms 23936 KB n=500
34 Correct 17 ms 23936 KB n=500
35 Correct 16 ms 23936 KB n=500
36 Correct 16 ms 23936 KB n=500
37 Correct 15 ms 23936 KB n=500
38 Correct 15 ms 23936 KB n=500
39 Correct 15 ms 23936 KB n=500
40 Correct 15 ms 23936 KB n=500
41 Correct 15 ms 23936 KB n=500
42 Correct 16 ms 23936 KB n=500
43 Correct 16 ms 23936 KB n=500
44 Correct 16 ms 23936 KB n=500
45 Correct 16 ms 23936 KB n=500
46 Correct 16 ms 23936 KB n=500
47 Correct 17 ms 23936 KB n=500
48 Correct 16 ms 23936 KB n=500
49 Correct 16 ms 23936 KB n=500
50 Correct 15 ms 23936 KB n=500
51 Correct 16 ms 23936 KB n=500
52 Correct 17 ms 23936 KB n=500
53 Correct 15 ms 23936 KB n=500
54 Correct 15 ms 23936 KB n=500
55 Correct 15 ms 23936 KB n=278
56 Correct 16 ms 23936 KB n=500
57 Correct 16 ms 23936 KB n=500
58 Correct 15 ms 23936 KB n=500

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23808 KB n=5
2 Correct 15 ms 23808 KB n=100
3 Correct 16 ms 23808 KB n=100
4 Correct 15 ms 23808 KB n=100
5 Correct 15 ms 23808 KB n=100
6 Correct 15 ms 23808 KB n=100
7 Correct 15 ms 23808 KB n=100
8 Correct 15 ms 23808 KB n=100
9 Correct 16 ms 23808 KB n=100
10 Correct 15 ms 23808 KB n=100
11 Correct 16 ms 23808 KB n=100
12 Correct 15 ms 23936 KB n=100
13 Correct 15 ms 23936 KB n=100
14 Correct 14 ms 23808 KB n=100
15 Correct 15 ms 23808 KB n=100
16 Correct 15 ms 23808 KB n=100
17 Correct 20 ms 23808 KB n=100
18 Correct 15 ms 23808 KB n=100
19 Correct 15 ms 23808 KB n=100
20 Correct 15 ms 23808 KB n=100
21 Correct 15 ms 23808 KB n=100
22 Correct 15 ms 23808 KB n=100
23 Correct 15 ms 23808 KB n=100
24 Correct 15 ms 23808 KB n=100
25 Correct 15 ms 23808 KB n=100
26 Correct 15 ms 23808 KB n=12
27 Correct 15 ms 23808 KB n=100
28 Correct 17 ms 23936 KB n=500
29 Correct 15 ms 23936 KB n=500
30 Correct 16 ms 23936 KB n=500
31 Correct 16 ms 23936 KB n=500
32 Correct 17 ms 23936 KB n=500
33 Correct 16 ms 23936 KB n=500
34 Correct 17 ms 23936 KB n=500
35 Correct 16 ms 23936 KB n=500
36 Correct 16 ms 23936 KB n=500
37 Correct 15 ms 23936 KB n=500
38 Correct 15 ms 23936 KB n=500
39 Correct 15 ms 23936 KB n=500
40 Correct 15 ms 23936 KB n=500
41 Correct 15 ms 23936 KB n=500
42 Correct 16 ms 23936 KB n=500
43 Correct 16 ms 23936 KB n=500
44 Correct 16 ms 23936 KB n=500
45 Correct 16 ms 23936 KB n=500
46 Correct 16 ms 23936 KB n=500
47 Correct 17 ms 23936 KB n=500
48 Correct 16 ms 23936 KB n=500
49 Correct 16 ms 23936 KB n=500
50 Correct 15 ms 23936 KB n=500
51 Correct 16 ms 23936 KB n=500
52 Correct 17 ms 23936 KB n=500
53 Correct 15 ms 23936 KB n=500
54 Correct 15 ms 23936 KB n=500
55 Correct 15 ms 23936 KB n=278
56 Correct 16 ms 23936 KB n=500
57 Correct 16 ms 23936 KB n=500
58 Correct 15 ms 23936 KB n=500
59 Correct 38 ms 24272 KB n=2000
60 Correct 19 ms 24320 KB n=2000
61 Correct 19 ms 24320 KB n=2000
62 Correct 20 ms 24320 KB n=2000
63 Correct 48 ms 24320 KB n=2000
64 Correct 19 ms 24320 KB n=2000
65 Correct 53 ms 24340 KB n=2000
66 Correct 19 ms 24320 KB n=2000
67 Correct 33 ms 24320 KB n=2000
68 Correct 20 ms 24320 KB n=2000
69 Correct 19 ms 24320 KB n=2000
70 Correct 18 ms 24320 KB n=2000
71 Correct 18 ms 24320 KB n=2000
72 Correct 19 ms 24320 KB n=2000
73 Correct 18 ms 24320 KB n=2000
74 Correct 38 ms 24312 KB n=1844
75 Correct 19 ms 24320 KB n=2000
76 Correct 19 ms 24320 KB n=2000
77 Correct 21 ms 24320 KB n=2000
78 Correct 19 ms 24320 KB n=2000
79 Correct 31 ms 24320 KB n=2000
80 Correct 19 ms 24320 KB n=2000
81 Correct 27 ms 24320 KB n=2000
82 Correct 32 ms 24320 KB n=2000
83 Correct 19 ms 24320 KB n=2000
84 Correct 19 ms 24320 KB n=2000
85 Correct 19 ms 24320 KB n=2000
86 Correct 20 ms 24320 KB n=2000
87 Correct 19 ms 24320 KB n=2000
88 Correct 19 ms 24320 KB n=2000
89 Correct 19 ms 24320 KB n=2000
90 Correct 19 ms 24320 KB n=2000
91 Correct 18 ms 24320 KB n=2000

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23808 KB n=5
2 Correct 15 ms 23808 KB n=100
3 Correct 16 ms 23808 KB n=100
4 Correct 15 ms 23808 KB n=100
5 Correct 15 ms 23808 KB n=100
6 Correct 15 ms 23808 KB n=100
7 Correct 15 ms 23808 KB n=100
8 Correct 15 ms 23808 KB n=100
9 Correct 16 ms 23808 KB n=100
10 Correct 15 ms 23808 KB n=100
11 Correct 16 ms 23808 KB n=100
12 Correct 15 ms 23936 KB n=100
13 Correct 15 ms 23936 KB n=100
14 Correct 14 ms 23808 KB n=100
15 Correct 15 ms 23808 KB n=100
16 Correct 15 ms 23808 KB n=100
17 Correct 20 ms 23808 KB n=100
18 Correct 15 ms 23808 KB n=100
19 Correct 15 ms 23808 KB n=100
20 Correct 15 ms 23808 KB n=100
21 Correct 15 ms 23808 KB n=100
22 Correct 15 ms 23808 KB n=100
23 Correct 15 ms 23808 KB n=100
24 Correct 15 ms 23808 KB n=100
25 Correct 15 ms 23808 KB n=100
26 Correct 15 ms 23808 KB n=12
27 Correct 15 ms 23808 KB n=100
28 Correct 17 ms 23936 KB n=500
29 Correct 15 ms 23936 KB n=500
30 Correct 16 ms 23936 KB n=500
31 Correct 16 ms 23936 KB n=500
32 Correct 17 ms 23936 KB n=500
33 Correct 16 ms 23936 KB n=500
34 Correct 17 ms 23936 KB n=500
35 Correct 16 ms 23936 KB n=500
36 Correct 16 ms 23936 KB n=500
37 Correct 15 ms 23936 KB n=500
38 Correct 15 ms 23936 KB n=500
39 Correct 15 ms 23936 KB n=500
40 Correct 15 ms 23936 KB n=500
41 Correct 15 ms 23936 KB n=500
42 Correct 16 ms 23936 KB n=500
43 Correct 16 ms 23936 KB n=500
44 Correct 16 ms 23936 KB n=500
45 Correct 16 ms 23936 KB n=500
46 Correct 16 ms 23936 KB n=500
47 Correct 17 ms 23936 KB n=500
48 Correct 16 ms 23936 KB n=500
49 Correct 16 ms 23936 KB n=500
50 Correct 15 ms 23936 KB n=500
51 Correct 16 ms 23936 KB n=500
52 Correct 17 ms 23936 KB n=500
53 Correct 15 ms 23936 KB n=500
54 Correct 15 ms 23936 KB n=500
55 Correct 15 ms 23936 KB n=278
56 Correct 16 ms 23936 KB n=500
57 Correct 16 ms 23936 KB n=500
58 Correct 15 ms 23936 KB n=500
59 Correct 38 ms 24272 KB n=2000
60 Correct 19 ms 24320 KB n=2000
61 Correct 19 ms 24320 KB n=2000
62 Correct 20 ms 24320 KB n=2000
63 Correct 48 ms 24320 KB n=2000
64 Correct 19 ms 24320 KB n=2000
65 Correct 53 ms 24340 KB n=2000
66 Correct 19 ms 24320 KB n=2000
67 Correct 33 ms 24320 KB n=2000
68 Correct 20 ms 24320 KB n=2000
69 Correct 19 ms 24320 KB n=2000
70 Correct 18 ms 24320 KB n=2000
71 Correct 18 ms 24320 KB n=2000
72 Correct 19 ms 24320 KB n=2000
73 Correct 18 ms 24320 KB n=2000
74 Correct 38 ms 24312 KB n=1844
75 Correct 19 ms 24320 KB n=2000
76 Correct 19 ms 24320 KB n=2000
77 Correct 21 ms 24320 KB n=2000
78 Correct 19 ms 24320 KB n=2000
79 Correct 31 ms 24320 KB n=2000
80 Correct 19 ms 24320 KB n=2000
81 Correct 27 ms 24320 KB n=2000
82 Correct 32 ms 24320 KB n=2000
83 Correct 19 ms 24320 KB n=2000
84 Correct 19 ms 24320 KB n=2000
85 Correct 19 ms 24320 KB n=2000
86 Correct 20 ms 24320 KB n=2000
87 Correct 19 ms 24320 KB n=2000
88 Correct 19 ms 24320 KB n=2000
89 Correct 19 ms 24320 KB n=2000
90 Correct 19 ms 24320 KB n=2000
91 Correct 18 ms 24320 KB n=2000
92 Execution timed out 4099 ms 68624 KB Time limit exceeded
93 Halted 0 ms 0 KB -