oj.uz

답안 #362434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362434 2021-02-03T08:01:18 Z ray5273 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 1 ms 512 KB 
#include "treasure.h"
#include <iostream>
using namespace std;

// bool arr[101][101];
// 체크대신에 그냥 바로 Report하면되네
//1+N*N-S의 에너지 사용을 N^2 + 7/16*N^4 이하로 사용하게 하여라
int arr[101][101];
void check_treasure(int N){
    int mid = N/2;
    //홀짝은 이해해보기
    for(int i=mid+1;i<=N;i++)
        for(int j=mid+1;j<=N;j++)
            arr[i][j] = countTreasure(1,1,i,j);

    for(int i=1;i<=mid;i++)
        for(int j=mid+1;j<=N;j++)
            arr[i][j] = arr[N][j] - countTreasure(i+1,1,N,j); //1,1, to i,j까지 합
    
    for(int i=mid+1;i<=N;i++)
        for(int j=1;j<=mid;j++)
            arr[i][j] = arr[i][N] - countTreasure(1,j+1,i,N); //1,1 to i,j의 합
    
    for(int i=1;i<=mid;i++)
        for(int j=1;j<=mid;j++)
            arr[i][j] = arr[i][N] + arr[N][j] + countTreasure(i+1,j+1,N,N) - arr[N][N];//그려보면 이해가능
    
    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
            if(arr[i][j]-arr[i-1][j]-arr[i][j-1]+arr[i-1][j-1])
                Report(i,j);
}

void findTreasure (int N) {
    // int cnt = countTreasure(1, 1, N, N);
    // find_treasure(1,1,N,N);
    check_treasure(N);
}

Subtask #1
100.0 / 100.0

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