# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314484 | 2020-10-20T03:36:09 Z | jli12345 | Crocodile's Underground City (IOI11_crocodile) | C++14 | 0 ms | 384 KB |
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <functional> #include <cstdio> #include <array> #include <tuple> #include <unordered_map> #include <unordered_set> #include <queue> #include <set> #include <map> #include <list> #include <stack> #include <cstring> #include <string> #include <fstream> #include <sstream> #include <cstdlib> #include <iterator> #include <ext/pb_ds/assoc_container.hpp> #include "crocodile.h" using namespace std; using namespace __gnu_pbds; typedef long long ll; typedef pair<int, int> pii; #define FOR(i, a, b) for (int i = (a); i <= (b); ++i) #define ROF(i, b, a) for (int i = (b); i >= (a); --i) #define f first #define s second #define mp make_pair #define pb push_back const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3f; const ll MOD = 1e9+7; ll mod(ll x, ll mod){ return x >= mod ? x%mod:x; } void fio(string s){ freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); } int dist[100100]; int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) { return dist[0]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |