oj.uz

답안 #822502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
822502 2023-08-12T03:37:17 Z GrindMachine 보물 찾기 (CEOI13_treasure2) C++17
10 / 100
 1 ms 400 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "treasure.h"

void findTreasure (int n) {
    // int cnt = countTreasure(1, 1, N, N);
    // if(cnt > 0) Report (1, 1);
    int a[n+5][n+5];
    memset(a,0,sizeof a);

    rep1(i,n){
        rep1(j,n){
            int cnt = countTreasure(i,j,i,j);
            if(cnt){
                a[i][j] = 1;
            }
        }
    }

    rep1(i,n){
        rep1(j,n){
            if(a[i][j]){
                Report(i,j);
            }
        }
    }
}

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 212 KB Output is partially correct - N = 5, K = 625, score = 1
2 Partially correct 0 ms 212 KB Output is partially correct - N = 10, K = 10000, score = 1
3 Partially correct 0 ms 212 KB Output is partially correct - N = 15, K = 50625, score = 1
4 Partially correct 1 ms 212 KB Output is partially correct - N = 16, K = 65536, score = 1
5 Partially correct 0 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 340 KB Output is partially correct - N = 88, K = 59969536, score = 1
9 Partially correct 1 ms 400 KB Output is partially correct - N = 99, K = 96059601, score = 1
10 Partially correct 1 ms 340 KB Output is partially correct - N = 100, K = 100000000, score = 1