oj.uz

답안 #1061368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061368 2024-08-16T08:21:23 Z thieunguyenhuy 저장 (Saveit) (IOI10_saveit) C++17
0 / 100
 134 ms 13568 KB 
#ifndef hwe
	#include "grader.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

void encode(int n, int h, int m, int *a, int *b) {
	encode_bit(0);
}

#ifdef hwe
signed main() {


    cerr << '\n'; return 0;
}
#endif
#ifndef hwe
	#include "grader.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

void decode(int n, int h) {
	decode_bit();
	hops(0, 0, 0);
}

#ifdef hwe
signed main() {


    cerr << '\n'; return 0;
}
#endif

Subtask #1
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 134 ms 13476 KB function hops(h,c,d) must be called exactly N×H times
2 Incorrect 1 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
3 Incorrect 4 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
4 Incorrect 2 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
5 Incorrect 4 ms 11264 KB function hops(h,c,d) must be called exactly N×H times
6 Incorrect 4 ms 11280 KB function hops(h,c,d) must be called exactly N×H times
7 Incorrect 13 ms 11264 KB function hops(h,c,d) must be called exactly N×H times
8 Incorrect 3 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
9 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
10 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
11 Incorrect 5 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
12 Incorrect 5 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
13 Incorrect 15 ms 11524 KB function hops(h,c,d) must be called exactly N×H times
14 Incorrect 3 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
15 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
16 Incorrect 16 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
17 Incorrect 13 ms 11384 KB function hops(h,c,d) must be called exactly N×H times
18 Incorrect 18 ms 11532 KB function hops(h,c,d) must be called exactly N×H times
19 Incorrect 8 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
20 Incorrect 18 ms 13568 KB function hops(h,c,d) must be called exactly N×H times
21 Incorrect 29 ms 13476 KB function hops(h,c,d) must be called exactly N×H times
22 Incorrect 16 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
23 Incorrect 38 ms 13484 KB function hops(h,c,d) must be called exactly N×H times

Subtask #2
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 134 ms 13476 KB function hops(h,c,d) must be called exactly N×H times
2 Incorrect 1 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
3 Incorrect 4 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
4 Incorrect 2 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
5 Incorrect 4 ms 11264 KB function hops(h,c,d) must be called exactly N×H times
6 Incorrect 4 ms 11280 KB function hops(h,c,d) must be called exactly N×H times
7 Incorrect 13 ms 11264 KB function hops(h,c,d) must be called exactly N×H times
8 Incorrect 3 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
9 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
10 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
11 Incorrect 5 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
12 Incorrect 5 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
13 Incorrect 15 ms 11524 KB function hops(h,c,d) must be called exactly N×H times
14 Incorrect 3 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
15 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
16 Incorrect 16 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
17 Incorrect 13 ms 11384 KB function hops(h,c,d) must be called exactly N×H times
18 Incorrect 18 ms 11532 KB function hops(h,c,d) must be called exactly N×H times
19 Incorrect 8 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
20 Incorrect 18 ms 13568 KB function hops(h,c,d) must be called exactly N×H times
21 Incorrect 29 ms 13476 KB function hops(h,c,d) must be called exactly N×H times
22 Incorrect 16 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
23 Incorrect 38 ms 13484 KB function hops(h,c,d) must be called exactly N×H times

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 134 ms 13476 KB function hops(h,c,d) must be called exactly N×H times
2 Incorrect 1 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
3 Incorrect 4 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
4 Incorrect 2 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
5 Incorrect 4 ms 11264 KB function hops(h,c,d) must be called exactly N×H times
6 Incorrect 4 ms 11280 KB function hops(h,c,d) must be called exactly N×H times
7 Incorrect 13 ms 11264 KB function hops(h,c,d) must be called exactly N×H times
8 Incorrect 3 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
9 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
10 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
11 Incorrect 5 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
12 Incorrect 5 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
13 Incorrect 15 ms 11524 KB function hops(h,c,d) must be called exactly N×H times
14 Incorrect 3 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
15 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
16 Incorrect 16 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
17 Incorrect 13 ms 11384 KB function hops(h,c,d) must be called exactly N×H times
18 Incorrect 18 ms 11532 KB function hops(h,c,d) must be called exactly N×H times
19 Incorrect 8 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
20 Incorrect 18 ms 13568 KB function hops(h,c,d) must be called exactly N×H times
21 Incorrect 29 ms 13476 KB function hops(h,c,d) must be called exactly N×H times
22 Incorrect 16 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
23 Incorrect 38 ms 13484 KB function hops(h,c,d) must be called exactly N×H times

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 134 ms 13476 KB function hops(h,c,d) must be called exactly N×H times
2 Incorrect 1 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
3 Incorrect 4 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
4 Incorrect 2 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
5 Incorrect 4 ms 11264 KB function hops(h,c,d) must be called exactly N×H times
6 Incorrect 4 ms 11280 KB function hops(h,c,d) must be called exactly N×H times
7 Incorrect 13 ms 11264 KB function hops(h,c,d) must be called exactly N×H times
8 Incorrect 3 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
9 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
10 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
11 Incorrect 5 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
12 Incorrect 5 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
13 Incorrect 15 ms 11524 KB function hops(h,c,d) must be called exactly N×H times
14 Incorrect 3 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
15 Incorrect 4 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
16 Incorrect 16 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
17 Incorrect 13 ms 11384 KB function hops(h,c,d) must be called exactly N×H times
18 Incorrect 18 ms 11532 KB function hops(h,c,d) must be called exactly N×H times
19 Incorrect 8 ms 11276 KB function hops(h,c,d) must be called exactly N×H times
20 Incorrect 18 ms 13568 KB function hops(h,c,d) must be called exactly N×H times
21 Incorrect 29 ms 13476 KB function hops(h,c,d) must be called exactly N×H times
22 Incorrect 16 ms 11268 KB function hops(h,c,d) must be called exactly N×H times
23 Incorrect 38 ms 13484 KB function hops(h,c,d) must be called exactly N×H times