# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122124 | mosesmayer | Bulldozer (JOI17_bulldozer) | C++17 | 1333 ms | 32452 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>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define DEBUG
#define fi first
#define se second
#define pb push_back
using namespace std;
//using namespace __gnu_pbds;
typedef long long LL;
typedef pair<int,int> pii;
typedef vector<int> vi;
//template<typename T>
//using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>; // find_by_order, order_of_key
template<class F, class S>
ostream& operator<< (ostream& os, const pair<F, S> p){
os << '{' << p.fi << ", " << p.se << '}';
return os;
}
template<class T>
ostream& operator<< (ostream& os, const vector<T>& v){
os << '{';
for (int i = 0, t = v.size(); i < t; i++) os << v[i] << (i+1==t?", " : "}");
return os;
}
const int INF = 0x3f3f3f3f;
const LL LINF = 1e18;
//////////////////END OF TEMPLATE//////////////////////////////
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |