# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093531 | vjudge1 | Toll (BOI17_toll) | C++17 | 220 ms | 75068 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.
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/
#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define isz(x) (int)x.size()
using namespace std;
const int inf = 1e9;
template<class T>
struct matrix{
int n, m;
vector<vector<T>> data;
vector<T> &operator[](int i){
assert(0 <= i && i < n);
return data[i];
}
const vector<T> &operator[](int i) const{
assert(0 <= i && i < n);
return data[i];
}
matrix &inplace_slice(int il, int ir, int jl, int jr){
assert(0 <= il && il <= ir && ir <= n);
assert(0 <= jl && jl <= jr && jr <= m);
# | 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... |