oj.uz

Submission #94990

# Submission time Handle Problem Language Result Execution time Memory
94990 2019-01-26T14:33:55 Z updown1 Treasure (different grader from official contest) (CEOI13_treasure2) C++17
100 / 100
 2 ms 376 KB 
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 1, N+1)
#define ffj For(j, 1, N+1)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e endl//"\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
int pre[101][101]; /// prefix sums
void findTreasure (int N) {
    //int cnt = countTreasure(1, 1, N, N);
    //Report (2, 1);
    for (int i=N; i>=1; i--) for (int j=N; j>=1; j--) {
        if (i <= N/2 && j <= N/2) pre[i][j] = pre[N][j] + pre[i][N] + countTreasure(i+1, j+1, N, N) - pre[N][N];
        else if (i <= N/2) pre[i][j] = pre[N][j] - countTreasure(i+1, 1, N, j);
        else if (j <= N/2) pre[i][j] = pre[i][N] - countTreasure(1, j+1, i, N);
        else pre[i][j] = countTreasure(1, 1, i, j);
        //w<< i s j c pre[i][j] <<e;
    }
    ffa if (pre[i][j] - pre[i-1][j] - pre[i][j-1] + pre[i-1][j-1] == 1) Report(i, j);
}

Subtask #1
100.0 / 100.0

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