# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978179 | vjudge1 | Cats or Dogs (JOI18_catdog) | C++17 | 158 ms | 30036 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 "catdog.h"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
using vi=vector<int>;
#define PB push_back
using pi=pair<int,int>;
const ll inf64=LLONG_MAX/3;
template<class T,class U>
void chmin(T&t,const U&u){
if(t>u)t=u;
}
template<class T,class U>
void chmax(T&t,const U&u){
if(t<u)t=u;
}
struct SegTree{
struct Node{
ll cost[2][2];
};
vector<Node> buf;
int s;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |