oj.uz

답안 #475718

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475718 2021-09-23T19:58:51 Z soba 보물 찾기 (CEOI13_treasure2) C++14
0 / 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
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Error - not all of the treasure cells have been reported
2 Incorrect 0 ms 204 KB Error - not all of the treasure cells have been reported
3 Incorrect 0 ms 204 KB Error - not all of the treasure cells have been reported
4 Incorrect 0 ms 204 KB Error - not all of the treasure cells have been reported
5 Incorrect 1 ms 332 KB Error - not all of the treasure cells have been reported
6 Incorrect 1 ms 332 KB Error - not all of the treasure cells have been reported
7 Incorrect 1 ms 332 KB Error - not all of the treasure cells have been reported
8 Incorrect 1 ms 332 KB Error - not all of the treasure cells have been reported
9 Incorrect 1 ms 332 KB Error - not all of the treasure cells have been reported
10 Incorrect 1 ms 332 KB Error - not all of the treasure cells have been reported