Submission #478663

#TimeUsernameProblemLanguageResultExecution timeMemory
478663VitaliyFSDreaming (IOI13_dreaming)C++17
0 / 100
25 ms4944 KiB
#include "dreaming.h" #include <bits/stdc++.h> #define fr first #define sc second using namespace std; //using namespace __gnu_pbds; typedef long long ll; typedef long double ld; typedef pair<ll, ll> pll; //typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> myset; const ll DIM = 100007, INF = 2000000000000000007, MOD = 998244353, split = 1000; ll t, n, m, z, q, nn,mm,kk, cl, cr, f, prev, mid, a[DIM], b[DIM], c[DIM], ans[DIM], p, res2, nComp = 0, ans1, ans2, res, mi, pos, pos1, pos2, sum, ct, y, k, tt, x, t1, t2, mi1 = INF, ma1 = -INF, mi2 = INF, ma2 = -INF, v, l = INF, r = -INF, u, w, ma = -INF, id, lx, xd, yd; bool flag; vector<ll> g[DIM]; int travelTime(int N, int M, int L, int A[], int B[], int T[]) { return 42; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...