oj.uz

답안 #119330

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
119330 2019-06-21T03:28:42 Z minhtung0404 보물 찾기 (CEOI13_treasure2) C++17
100 / 100
 2 ms 512 KB 
//https://oj.uz/problem/view/CEOI13_treasure2

#include<bits/stdc++.h>
#include "treasure.h"
const int N = 105;
using namespace std;

int n, sum[N][N];

int ask(int r1, int c1, int r2, int c2){
    if (r1 > r2) swap(r1, r2);
    if (c1 > c2) swap(c1, c2);
    return countTreasure(r1, c1, r2, c2);
}

void findTreasure(int n){
    int half = n / 2;
    for (int i = half+1; i <= n; i++) for (int j = half+1; j <= n; j++) sum[i][j] = ask(1, 1, i, j);
    for (int i = half+1; i <= n; i++) for (int j = 1; j <= half; j++) sum[i][j] = sum[i][n] - ask(i, j+1, 1, n);
    for (int i = 1; i <= half; i++) for (int j = half+1; j <= n; j++) sum[i][j] = sum[n][j] - ask(i+1, j, n, 1);
    for (int i = 1; i <= half; i++) for (int j = 1; j <= half; j++) sum[i][j] = sum[i][n] + sum[n][j] - sum[n][n] + ask(i+1, j+1, n, n);
    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]) Report(i, j);
//    cout << (cnt <= 7 * n * n * n * n / 16 + n * n);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 2 ms 384 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 2 ms 384 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 2 ms 384 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 2 ms 384 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 2 ms 384 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 2 ms 384 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 2 ms 384 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 2 ms 384 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 2 ms 512 KB Output is correct - N = 100, K = 43760000, score = 10