# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1036107 | HNa_seawjing | Robot (JOI21_ho_t4) | C++14 | 305 ms | 122432 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.
//**********************
//
//**********************
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define add(a,b) a=(a+b)%MOD
#define BIT(mask,i) ((mask >> i) & 1ll )
#define OFF(mask,i) (mask & (~(1ll << i)))
#define ON(mask,i) (mask | (1ll << i))
#define endl '\n'
#define DAO(mask,i) (mask ^ (1ll << i))
#define add(a,b) a=(a+b)%MOD
#define m_p make_pair
#define m_t make_tuple
#define built(mask) __builtin_popcountll(mask)
#define all(x) x.begin(),x.end()
#define XD cout << '\n'
#define ii pair <int,int>
#define iii pair<int,pair<int, int> >
#define TASK "robot1"
using namespace std;
const long long oo = 1e18;
const int N = 6e5+5;
const int MOD = 1e9+7;
vector< ii > a[N];
map<int , int> mp[N];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |