Submission #241571

# Submission time Handle Problem Language Result Execution time Memory
241571 2020-06-24T13:36:44 Z Mercenary Treasure (different grader from official contest) (CEOI13_treasure2) C++14
100 / 100
5 ms 512 KB
#include<bits/stdc++.h>
#include "treasure.h"

using namespace std;
typedef long long ll;
const int maxn = 105;
void findTreasure (int N);
int n, sum[maxn][maxn];

void findTreasure (int N) {
    for(int i = N ; i >= 1 ; --i){
        for(int j = N ; j >= 1 ; --j){
            if(i > N / 2 && j > N / 2){
                sum[i][j] = countTreasure(1,1,i,j);
            }else if(i > N / 2 && j <= N / 2){
                sum[i][j] = sum[i][N] - countTreasure(1 , j + 1 , i , N);
            }else if(i <= N / 2 && j > N / 2){
                sum[i][j] = sum[N][j] - countTreasure(i + 1 , 1 , N , j);
            }else{
                sum[i][j] = sum[i][N] + sum[N][j] - sum[N][N] + countTreasure(i + 1 , j + 1 , N , N);
            }
//            cout << i << " " << j << " " << sum[i][j] << endl;
        }
    }
    for(int i = 1 ; i <= N ; ++i){
        for(int j = 1 ; j <= N ; ++j){
            if(sum[i][j] - sum[i - 1][j] - sum[i][j - 1] + sum[i - 1][j - 1] > 0){
                Report(i , j);
            }
        }
    }
}
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 4 ms 384 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 4 ms 384 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 5 ms 384 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 5 ms 384 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 5 ms 384 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 5 ms 384 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 5 ms 384 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 5 ms 384 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 5 ms 512 KB Output is correct - N = 100, K = 43760000, score = 10