oj.uz

답안 #503099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
503099 2022-01-07T08:46:54 Z bang627 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 1 ms 332 KB 
#include "treasure.h"
#include <bits/stdc++.h>
void findTreasure (int N) {
    int grid[N+1][N+1];
    int prfx[N+1][N+1]={0};
    int cnt , ans;
    for(int i = 0 ; i<= N ; i++)
    {
        for(int j = 0 ; j<=N ;j++)
        {
            prfx[i][j]=0;
        }
    }
    for(int i = (N/2)+1 ; i <=N ; i++)
    {
        for(int j = (N/2)+1 ; j <= N ; j++)
        {
            prfx[i][j]=countTreasure(1,1,i,j);;
        }
    }
    for(int i = (N/2)+1 ; i <=N ; i++)
    {
        for(int j = 1 ; j <= (N/2) ; j++)
        {
            prfx[i][j]= prfx[i][N]-countTreasure(1,j+1,i,N);
        }
    }
    for(int i = 1 ; i <= (N/2) ; i++)
    {
        for(int j = (N/2)+1 ; j <= N ; j++)
        {
            prfx[i][j]= prfx[N][j]-countTreasure(i+1,1,N,j);
        }
    }
    for(int i = 1 ; i <= (N/2) ; i++)
    {
        for(int j = 1 ; j <= (N/2) ; j++)
        {
            prfx[i][j]= prfx[N][j]+prfx[i][N]+countTreasure(i+1,j+1,N,N) - prfx[N][N];
        }
    }
    for(int i = 1 ; i <= N ; i++ )
    {
        for(int j  =1 ; j <= N ; j++)
        {
            grid[i][j]=prfx[i][j]-prfx[i-1][j]-prfx[i][j-1]+prfx[i-1][j-1];
            if(grid[i][j]==1)
                Report(i, j);
        }
    }
}

Compilation message

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:6:9: warning: unused variable 'cnt' [-Wunused-variable]
    6 |     int cnt , ans;
      |         ^~~
treasure.cpp:6:15: warning: unused variable 'ans' [-Wunused-variable]
    6 |     int cnt , ans;
      |               ^~~

Subtask #1
100.0 / 100.0

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