# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154270 | Breno_XD | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 3 ms | 504 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){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |