oj.uz

답안 #667882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667882 2022-12-02T08:54:46 Z 600Mihnea 보물 찾기 (CEOI13_treasure2) C++17
10 / 100
 1 ms 468 KB 
#include "treasure.h"
#include <bits/stdc++.h>

using namespace std;

void findTreasure(int n)
{
  vector<pair<int, int>> sol;
  for (int i = 1; i <= n; i++)
  {
    for (int j = 1; j <= n; j++)
    {
      if (countTreasure(i, j, i, j))
      {
        sol.push_back({i, j});
      }
    }
  }
  for (auto &it : sol)
  {
    Report(it.first, it.second);
  }
}

Subtask #1
10.0 / 100.0

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