oj.uz

Submission #472989

# Submission time Handle Problem Language Result Execution time Memory
472989 2021-09-14T17:38:24 Z hidden1 Brunhilda’s Birthday (BOI13_brunhilda) C++14
65.5556 / 100
 1000 ms 968 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define debug(...) cout << "Line: " << __LINE__ << endl; \
    printDebug(", "#__VA_ARGS__, __VA_ARGS__)
template <typename T>
void printDebug(const char* name, T&& arg1) { cout << (name + 2) << " = " << arg1 << endl; }
template <typename T, typename... T2>
void printDebug(const char* names, T&& arg1, T2&&... args) {
    const char* end = strchr(names + 1, ',');
    cout.write(names + 2, end - names - 2) << " = " << arg1 << endl;
    printDebug(end, args...);
}

const int MAX_N = 1e5 + 10;
vector<int> arr;
int n, q;

const int MAX_Q = 1e8 + 10;
int dp[MAX_Q];

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    cin >> n >> q;
    arr.resize(n);
    for(int i = 0; i < n; i ++) {
        cin >> arr[i];
    }

    sort(arr.begin(), arr.end());
    arr.resize(unique(arr.begin(), arr.end()) - arr.begin());

    while(q --) {
        int now;
        int cnt = 0;
        cin >> now;
        while(now) {
            int best = 0;
            for(int i = n - 1; i >= max(0, n - 100); i --) {
                chkmax(best, now % arr[i]);
            }
            if(best == 0) {
                cout << "oo" << endl;
                break;
            }
            now -= best;
            cnt ++;
        }
        if(!now) {
            cout << cnt << endl;
        }
    }
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 9 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 5 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 7 ms 204 KB Output is correct
11 Correct 12 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 7 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 204 KB Output is correct
17 Correct 35 ms 332 KB Output is correct
18 Correct 9 ms 344 KB Output is correct

Subtask #2
15.5555555556 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 12 ms 588 KB Output is correct
3 Correct 9 ms 588 KB Output is correct
4 Incorrect 1 ms 204 KB Output isn't correct
5 Correct 7 ms 460 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 12 ms 588 KB Output is correct
10 Correct 9 ms 588 KB Output is correct
11 Incorrect 5 ms 460 KB Output isn't correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Incorrect 1 ms 332 KB Output isn't correct
15 Correct 5 ms 460 KB Output is correct
16 Correct 12 ms 588 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Incorrect 13 ms 700 KB Output isn't correct

Subtask #3
30.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 660 KB Output is correct
2 Correct 115 ms 560 KB Output is correct
3 Correct 351 ms 656 KB Output is correct
4 Execution timed out 1088 ms 408 KB Time limit exceeded
5 Correct 195 ms 960 KB Output is correct
6 Execution timed out 1091 ms 456 KB Time limit exceeded
7 Correct 140 ms 768 KB Output is correct
8 Correct 193 ms 532 KB Output is correct
9 Correct 198 ms 580 KB Output is correct
10 Incorrect 357 ms 332 KB Output isn't correct
11 Incorrect 694 ms 348 KB Output isn't correct
12 Incorrect 700 ms 496 KB Output isn't correct
13 Incorrect 715 ms 672 KB Output isn't correct
14 Execution timed out 1058 ms 204 KB Time limit exceeded
15 Incorrect 1000 ms 332 KB Output isn't correct
16 Incorrect 842 ms 504 KB Output isn't correct
17 Correct 53 ms 460 KB Output is correct
18 Correct 113 ms 544 KB Output is correct
19 Correct 97 ms 352 KB Output is correct
20 Correct 356 ms 652 KB Output is correct
21 Execution timed out 1088 ms 204 KB Time limit exceeded
22 Correct 375 ms 960 KB Output is correct
23 Correct 539 ms 632 KB Output is correct
24 Execution timed out 1092 ms 508 KB Time limit exceeded
25 Execution timed out 1089 ms 480 KB Time limit exceeded
26 Execution timed out 1092 ms 320 KB Time limit exceeded
27 Correct 208 ms 720 KB Output is correct
28 Execution timed out 1062 ms 348 KB Time limit exceeded
29 Correct 373 ms 864 KB Output is correct
30 Correct 517 ms 780 KB Output is correct
31 Correct 914 ms 536 KB Output is correct
32 Execution timed out 1085 ms 388 KB Time limit exceeded
33 Execution timed out 1092 ms 452 KB Time limit exceeded
34 Correct 140 ms 760 KB Output is correct
35 Execution timed out 1084 ms 460 KB Time limit exceeded
36 Correct 250 ms 968 KB Output is correct
37 Correct 192 ms 836 KB Output is correct
38 Execution timed out 1087 ms 488 KB Time limit exceeded
39 Execution timed out 1088 ms 436 KB Time limit exceeded
40 Execution timed out 1091 ms 472 KB Time limit exceeded
41 Correct 52 ms 716 KB Output is correct
42 Execution timed out 1088 ms 324 KB Time limit exceeded