# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257666 | davi_bart | Wombats (IOI13_wombats) | C++14 | 20073 ms | 42664 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("O3")
#include <bits/stdc++.h>
#include "wombats.h"
using namespace std;
typedef long long ll;
int h[5000][200],v[5000][200];
int ans[5000][200][200];
int r,c;
struct node{
int r,c,d,fin;
bool operator<(const node &x)const {
return d<x.d;
}
bool operator>(const node &x)const {
return d>x.d;
}
};
void calc(){
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
for(int x=0;x<c;x++)ans[i][j][x]=-1;
}
}
priority_queue<node,vector<node>,greater<node> >q;
for(int i=0;i<c;i++)q.push({r-1,i,0,i});
while(!q.empty()){
node x=q.top();
q.pop();
if(ans[x.r][x.c][x.fin]>=0)continue;
ans[x.r][x.c][x.fin]=x.d;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |