oj.uz

Submission #822963

# Submission time Handle Problem Language Result Execution time Memory
822963 2023-08-12T06:10:35 Z GrindMachine Treasure (different grader from official contest) (CEOI13_treasure2) C++17
44 / 100
 1 ms 340 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

/*

refs:
edi

*/

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 p[n+5][n+5];
    memset(p,0,sizeof p);

    rep1(i,n){
        rep1(j,n){
            p[i][j] = countTreasure(1,1,i,j);
        }
    }

    rep1(i,n){
        rep1(j,n){
            int x = p[i][j]-p[i-1][j]-p[i][j-1]+p[i-1][j-1];
            if(x) Report(i,j);
        }
    }
}

Subtask #1
44.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 304 KB Output is partially correct - N = 5, K = 425, score = 8
2 Partially correct 0 ms 212 KB Output is partially correct - N = 10, K = 7075, score = 4
3 Partially correct 0 ms 300 KB Output is partially correct - N = 15, K = 36450, score = 4
4 Partially correct 0 ms 212 KB Output is partially correct - N = 16, K = 47296, score = 4
5 Partially correct 1 ms 340 KB Output is partially correct - N = 55, K = 6782050, score = 4
6 Partially correct 1 ms 340 KB Output is partially correct - N = 66, K = 14090571, score = 4
7 Partially correct 1 ms 340 KB Output is partially correct - N = 77, K = 26140961, score = 4
8 Partially correct 1 ms 340 KB Output is partially correct - N = 88, K = 44642224, score = 4
9 Partially correct 1 ms 340 KB Output is partially correct - N = 99, K = 71566902, score = 4
10 Partially correct 1 ms 340 KB Output is partially correct - N = 100, K = 74507500, score = 4