# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537630 | S2speed | Crossing (JOI21_crossing) | C++17 | 7056 ms | 28728 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>
using namespace std;
#pragma GCC optimize("Ofast")
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define all(x) x.begin() , x.end()
#define sze(x) (int)(x.size())
typedef long long ll;
typedef pair<ll , ll> pll;
const ll maxn = 2e5 + 16 , maxsq = 450 , inf = 2e16;
set<vector<int>> s;
vector<int> operator+ (vector<int> a , vector<int> b){
vector<int> res(27);
for(int i = 0 ; i < 27 ; i++){
if(a[i] == b[i]){
res[i] = a[i];
} else {
res[i] = 3 - a[i] - b[i];
}
}
return res;
}
vector<int> v[27] , a[27];
# | 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... |