oj.uz

답안 #475716

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475716 2021-09-23T19:27:17 Z soba 보물 찾기 (CEOI13_treasure2) C++14
44 / 100
 1 ms 420 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 = 1 ; i <=N ; i++)
    {
        for(int j = 1 ; j <= N ; j++)
        {
            cnt=countTreasure(1,1,i,j);
            prfx[i][j]=cnt;
            grid[i][j]=prfx[i][j]-prfx[i-1][j]-prfx[i][j-1]+prfx[i-1][j-1];
        }
    }
    for(int i = 1 ; i <= N ; i++ )
    {
        for(int j  =1 ; j <= N ; j++)
        {
            if(grid[i][j]==1)
                Report(i, j);
        }
    }
}

Compilation message

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

Subtask #1
44.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 204 KB Output is partially correct - N = 5, K = 425, score = 8
2 Partially correct 1 ms 204 KB Output is partially correct - N = 10, K = 7075, score = 4
3 Partially correct 0 ms 204 KB Output is partially correct - N = 15, K = 36450, score = 4
4 Partially correct 0 ms 204 KB Output is partially correct - N = 16, K = 47296, score = 4
5 Partially correct 0 ms 332 KB Output is partially correct - N = 55, K = 6782050, score = 4
6 Partially correct 1 ms 332 KB Output is partially correct - N = 66, K = 14090571, score = 4
7 Partially correct 0 ms 332 KB Output is partially correct - N = 77, K = 26140961, score = 4
8 Partially correct 1 ms 332 KB Output is partially correct - N = 88, K = 44642224, score = 4
9 Partially correct 1 ms 420 KB Output is partially correct - N = 99, K = 71566902, score = 4
10 Partially correct 1 ms 332 KB Output is partially correct - N = 100, K = 74507500, score = 4