oj.uz

답안 #663375

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
663375 2022-11-26T20:17:06 Z JoanaPA 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
#include "treasure.h"
using namespace std;
int gg[102][102];
void findTreasure(int N)
{
    int m = N/2;
    for(int i = N; i >= 1; --i)
    {
        for(int j = N; j >= 1; --j)
        {
            if(i > m && j > m)
                gg[i][j] = countTreasure(1, 1, i, j);
            if(i <= m && j > m)
                gg[i][j] = gg[N][j] - countTreasure(i+1, 1, N, j);
            if(i > m && j <= m)
                gg[i][j] = gg[i][N] - countTreasure(1, j+1, i, N);
            if(i <= m && j <= m)
                gg[i][j] = gg[N][j] + gg[i][N] - gg[N][N] + countTreasure(i+1, j+1, N, N);
        }
    }
    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= N; ++j)
            if(gg[i][j] > gg[i-1][j] + gg[i][j-1] - gg[i-1][j-1])
                Report(i, j);
    return;
}

Subtask #1
100.0 / 100.0

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