# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154263 | Breno_XD | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 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 n;
int quarter(int r, int c){
//Primeiro quadrante -> célula (1,n)
int primeiro = r * (abs(n - c) +1);
//Segundo quadrante -> célula (1,1);
int segundo = r * c;
//Terceiro quadrante -> célula(n,1);
int terceiro = (abs(n - r) + 1) * c;
//Quarto quadrante -> célula (n,n)
int quarto = (abs(n-r) + 1) * (abs(n-c) + 1);
int ans = max(primeiro, max(segundo, max(terceiro, quarto)));
if(ans == primeiro) return 1;
if(ans == segundo) return 2;
if(ans == terceiro) return 3;
if(ans == quarto) return 4;
}
void findTreasure(int N){
n = N;
int pre[n+1][n+1];
memset(resp, 0, sizeof(resp));
memset(pre, 0, sizeof(pre));
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
if(quarter(i,j) == 1){
pref[i][j] = pre[i][n] - countTreasure(1,j+1,i,n);
}else if(quarter(i,j) == 2){
pre[i][j] = countTreasure(1,1, i,j);
}else if(quarter(i,j) == 3){
pre[i][j] = pre[n][j] - countTreasure(i+1, 1, n, j);
}else{
pre[i][j] = -pre[n][n] + pre[i][n] + pre[n][j] + countTreasure(i+1, j+1, n, n);
}
}
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
if(pre[i][j] - pre[i-1][j] - pre[i][j-1] + pre[i-1][j-1] == 1)
Report(i, j);
}
}
return;
}