oj.uz

Submission #229961

# Submission time Handle Problem Language Result Execution time Memory
229961 2020-05-07T10:42:07 Z DodgeBallMan Treasure (different grader from official contest) (CEOI13_treasure2) C++14
100 / 100
 5 ms 512 KB 
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 110;
int pref[N][N];
 
void findTreasure( int n ) {
    int m = n >> 1;
    for( int i = n ; i > 0 ; i-- ) for( int j = n ; j > 0 ; --j ) {
        if( i > m && j > m ) pref[i][j] = countTreasure( 1, 1, i, j );
        if( i <= m && j > m ) pref[i][j] = pref[n][j] - countTreasure( i+1, 1, n, j );
        if( i > m && j <= m ) pref[i][j] = pref[i][n] - countTreasure( 1, j+1, i, n );
        if( i <= m && j <= m ) pref[i][j] = pref[n][j] + pref[i][n] - pref[n][n] + countTreasure( i+1, j+1, n, n );
    }
    for( int i = 1 ; i <= n ; i++ ) for( int j = 1 ; j <= n ; j++ ) if( pref[i][j] - pref[i-1][j] - pref[i][j-1] + pref[i-1][j-1] ) Report( i, j );
}

Subtask #1
100.0 / 100.0

# 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 5 ms 384 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 4 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 512 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 384 KB Output is correct - N = 100, K = 43760000, score = 10