oj.uz

답안 #472988

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472988 2021-09-14T17:37:57 Z hidden1 Brunhilda’s Birthday (BOI13_brunhilda) C++14
61.9048 / 100
 1000 ms 888 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 - 30); 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

# 결과 실행 시간 메모리 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 5 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 6 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 11 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 4 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 23 ms 340 KB Output is correct
18 Correct 5 ms 332 KB Output is correct

Subtask #2
13.3333333333 / 20.0

# 결과 실행 시간 메모리 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 332 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 2 ms 332 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Correct 9 ms 588 KB Output is correct
10 Correct 9 ms 588 KB Output is correct
11 Incorrect 6 ms 460 KB Output isn't correct
12 Incorrect 1 ms 204 KB Output isn't correct
13 Correct 1 ms 332 KB Output is correct
14 Incorrect 1 ms 204 KB Output isn't correct
15 Correct 5 ms 460 KB Output is correct
16 Correct 13 ms 588 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Incorrect 14 ms 716 KB Output isn't correct

Subtask #3
28.5714285714 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 540 KB Output is correct
2 Correct 47 ms 540 KB Output is correct
3 Correct 121 ms 656 KB Output is correct
4 Incorrect 865 ms 580 KB Output isn't correct
5 Correct 82 ms 836 KB Output is correct
6 Incorrect 697 ms 600 KB Output isn't correct
7 Correct 66 ms 716 KB Output is correct
8 Correct 70 ms 540 KB Output is correct
9 Correct 69 ms 540 KB Output is correct
10 Incorrect 112 ms 460 KB Output isn't correct
11 Incorrect 217 ms 460 KB Output isn't correct
12 Incorrect 217 ms 332 KB Output isn't correct
13 Incorrect 230 ms 700 KB Output isn't correct
14 Execution timed out 1053 ms 328 KB Time limit exceeded
15 Incorrect 305 ms 340 KB Output isn't correct
16 Incorrect 257 ms 380 KB Output isn't correct
17 Correct 22 ms 460 KB Output is correct
18 Correct 46 ms 460 KB Output is correct
19 Correct 34 ms 332 KB Output is correct
20 Correct 120 ms 572 KB Output is correct
21 Execution timed out 1084 ms 300 KB Time limit exceeded
22 Correct 140 ms 836 KB Output is correct
23 Correct 176 ms 568 KB Output is correct
24 Incorrect 936 ms 760 KB Output isn't correct
25 Execution timed out 1091 ms 416 KB Time limit exceeded
26 Incorrect 860 ms 564 KB Output isn't correct
27 Correct 79 ms 844 KB Output is correct
28 Execution timed out 1088 ms 572 KB Time limit exceeded
29 Correct 140 ms 888 KB Output is correct
30 Correct 184 ms 752 KB Output is correct
31 Incorrect 280 ms 492 KB Output isn't correct
32 Execution timed out 1006 ms 696 KB Time limit exceeded
33 Incorrect 435 ms 480 KB Output isn't correct
34 Correct 60 ms 844 KB Output is correct
35 Execution timed out 1086 ms 620 KB Time limit exceeded
36 Correct 99 ms 836 KB Output is correct
37 Correct 82 ms 828 KB Output is correct
38 Incorrect 698 ms 688 KB Output isn't correct
39 Incorrect 815 ms 804 KB Output isn't correct
40 Incorrect 444 ms 560 KB Output isn't correct
41 Correct 32 ms 748 KB Output is correct
42 Execution timed out 1087 ms 388 KB Time limit exceeded