| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 78729 | Plurm | Treasure (different grader from official contest) (CEOI13_treasure2) | C++11 | 0 ms | 0 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>
#include "treasure.h"
using namespace std;
int knownval[128][128];
class Hasher{
public:
const size_t operator()(const tuple<int,int,int,int>& x) const{
return get<0>(x) + get<1>(x) + get<2>(x) + get<3>(x);
}
};
unordered_map<tuple<int,int,int,int>,int,Hasher> cache;
int n;
int getval(int a,int b,int c,int d){
if(c == 0 || d == 0 || a == n+1 || b == n+1) return 0;
if(cache.find(make_tuple(a,b,c,d)) == cache.end()){
int res = countTreasure(a,b,c,d);
cache[make_tuple(a,b,c,d)] = res;
return res;
}else{
return cache[make_tuple(a,b,c,d)];
}
}
void findTreasure(int N){
memset(knownval,-1,sizeof(knownval));
n = N;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(i*j > n*n/2){
knownval[i][j] = getval(1,1,i,j) - getval(1,1,i-1,j) - getval(1,1,i,j-1) + getval(1,1,i-1,j-1);
}else{
knownval[i][j] = getval(i,j,n,n) - getval(i+1,j,n,n) - getval(i,j+1,n,n) + getval(i+1,j+1,n,n);
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(knownval[i][j] == 1){
Report(i,j);
}
}
}
return 0;
}