# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
453759 | Arian_Eft | Commuter Pass (JOI18_commuter_pass) | C++17 | 1345 ms | 65280 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///
/// "People's Dreams.. Never End!!"
///
/// ~Marshall D. Teach
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define mk make_pair
#define endl cout << '\n'
#define haha cerr << "haha\n"
#define all(x) x.begin(), x.end()
#define kill(x) exit((cout << (x) << '\n', 0))
#define yn(flag) ((flag) ? "YES\n": "NO\n")
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2")
ll const inf = 1'000'000'000'000'000 + 10;
ll const mod = 1'000'000'000 + 7;
ll const maxn = 300'000 + 10;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |