oj.uz

답안 #78647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
78647 2018-10-06T19:17:20 Z MohamedAhmed0 보물 찾기 (CEOI13_treasure2) C++14
10 / 100
 2 ms 700 KB 
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std ;
 
void findTreasure (int N)
{
    int arr[N+1][N+1] ;
    for(int i = 1 ; i <= N ; ++i)
    {
        for(int j = 1 ; j <= N ; ++j)
            arr[i][j] = countTreasure(i , j , i , j);
    }
    //int cnt = countTreasure(1, 1, N, N);
    //if(cnt > 0) Report(1 , 1);
    for(int i = 1 ; i <= N ; ++i)
    {
        for(int j = 1 ; j <= N ; ++j)
        {
            if(arr[i][j] > 0)
              Report(i , j);
        }
    }
}

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 376 KB Output is partially correct - N = 5, K = 625, score = 1
2 Partially correct 2 ms 384 KB Output is partially correct - N = 10, K = 10000, score = 1
3 Partially correct 2 ms 592 KB Output is partially correct - N = 15, K = 50625, score = 1
4 Partially correct 2 ms 592 KB Output is partially correct - N = 16, K = 65536, score = 1
5 Partially correct 2 ms 592 KB Output is partially correct - N = 55, K = 9150625, score = 1
6 Partially correct 2 ms 700 KB Output is partially correct - N = 66, K = 18974736, score = 1
7 Partially correct 2 ms 700 KB Output is partially correct - N = 77, K = 35153041, score = 1
8 Partially correct 2 ms 700 KB Output is partially correct - N = 88, K = 59969536, score = 1
9 Partially correct 2 ms 700 KB Output is partially correct - N = 99, K = 96059601, score = 1
10 Partially correct 2 ms 700 KB Output is partially correct - N = 100, K = 100000000, score = 1