oj.uz

Submission #66647

# Submission time Handle Problem Language Result Execution time Memory
66647 2018-08-11T22:09:11 Z IvanC Treasure (different grader from official contest) (CEOI13_treasure2) C++17
100 / 100
 3 ms 932 KB 
#include "treasure.h"
#include <bits/stdc++.h>
#define LSOne(S) (S & (-S))
using namespace std;

typedef tuple<int,int,int,int> quadra;

const int MAXN = 110;

static int matriz[MAXN][MAXN],N;

void findTreasure(int n){

    memset(matriz,0,sizeof(matriz));
    N = n;

    int mid = (1 + N)/2;

    for(int i = N;i>=1;i--){
      for(int j = N;j>=1;j--){
        if(i >= mid && j >= mid) matriz[i][j] = countTreasure(1,1,i,j);
        else if(i >= mid && j <= mid) matriz[i][j] = matriz[i][N] - countTreasure(1,j+1,i,N);
        else if(i <= mid && j >= mid) matriz[i][j] = matriz[N][j] - countTreasure(i+1,1,N,j);
        else matriz[i][j] = countTreasure(i+1,j+1,N,N) + matriz[i][N] + matriz[N][j] - matriz[N][N];
      }
    }

    for(int i = 1;i<=N;i++){
      for(int j = 1;j<=N;j++){
        if(matriz[i][j] - matriz[i][j-1] - matriz[i-1][j] + matriz[i-1][j-1]) Report(i,j);
      }
    }

}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 380 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 2 ms 380 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 3 ms 552 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 2 ms 552 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 2 ms 820 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 3 ms 820 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 2 ms 820 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 3 ms 820 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 2 ms 904 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 3 ms 932 KB Output is correct - N = 100, K = 43760000, score = 10