# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586851 | FatihSolak | Wombats (IOI13_wombats) | C++17 | 2662 ms | 204576 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 "wombats.h"
#include <bits/stdc++.h>
#define R 5005
#define C 205
using namespace std;
const int block = 40;
int r,c;
int h[R][C];
int w[R][C];
int opt[C][C];
struct node{
int a[C][C];
int l,r;
node(int init){
for(int i = 0;i<C;i++){
for(int j = 0;j<C;j++){
a[i][j] = init;
}
}
}
}tmp(0);
node merge(node a,node b){
for(int dif = -c-1;dif < c ;dif++){
for(int i = max(0,-dif);i + dif<c;i++){
int j = dif + i;
int l = 0,r = c-1;
if(j)
l = opt[i][j-1];
if(i + 1 != c)
r = opt[i+1][j];
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... |