# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223032 | patrikpavic2 | Wild Boar (JOI18_wild_boar) | C++17 | 4486 ms | 636864 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 <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef long long ll;
typedef pair < ll, pair < int, int > > pth;
typedef vector < pth > vp;
const ll INF = 1e18;
const int N = 2e3 + 50;
const int OFF = (1 << 17);
inline void mnozi(const vp &A,const vp &B, vp &C){
C.clear();
for(pth L : A){
for(pth R : B){
if((L.Y.Y ^ 1) != R.Y.X)
C.PB({L.X + R.X, {L.Y.X, R.Y.Y}});
}
}
}
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... |