oj.uz

답안 #789024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789024 2023-07-20T21:34:57 Z stefanneagu Self Study (JOI22_ho_t2) C++17
62 / 100
 1000 ms 26128 KB 
#include <iostream>
#include <set>
#include <algorithm>
#define int long long
 
using namespace std;
 
const int nmax = 3e5 + 7;
 
int v[nmax], b[nmax], cnt[nmax], n, k;
 
struct pairing {
    int first, second;
    const bool operator < (pairing a) const {
        if(first != a.first) {
            return first < a.first;
        } else {
            return second > a.second;
        }
    }
};
 
bool check(int x) {
    int sum = 0;
    for(int i = 1; i <= n; i ++) {
        int curr = x / v[i];
        if(v[i] * curr < x) {
            curr ++;
        }
        sum += curr;
    }
    if(sum <= n * k) {
        return 1;
    }
    return 0;
}
 
int32_t main() {
    int test = 0;
    cin >> n >> k;
    for(int i = 1; i <= n; i ++) {
        cin >> v[i];
    } 
    for(int i = 1; i <= n; i ++){
        cin >> b[i];
        if(b[i] != v[i]) {
            test = 1;
        }
    }
  /*
    if(!test) {
        sort(v + 1, v + n + 1);
        int l = 0, r = 1e18;
        while(l < r) {
            int mid = (l + r) / 2;
            if(check(mid) == 1) {
                l = mid + 1;
            } else {
                r = mid;
            }
        }
        while(check(r) == 0 && r > 0) {
            r --;
        }
        while(check(r + 1) == 1) {
            r ++;
        }
        cout << r;
        return 0;
    } */
    set<pairing> pq;
    for(int i = 1; i <= n; i ++) {
        pq.insert({max(v[i], b[i]), i});
        cnt[i] = 1;
    }
    for(int i = 2; i <= k; i ++) {
        for(int j = 1; j <= n; j ++) {
            pairing curr = *(pq.begin());
            int sum = curr.first, ind = curr.second;
            pq.erase({sum, ind});
            if(cnt[ind] < k) {
                sum += max(v[ind], b[ind]);
                cnt[ind] ++;
            } else {
                sum +=  b[ind];
            }
            pq.insert({sum, ind});
        }
    } 
    int minn = 1e18;
    for(auto it : pq) {
        // cout << it.first << " " << it.second << endl;
        minn = min(minn, it.first);
    }
    cout << minn;
    return 0;
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:39:9: warning: variable 'test' set but not used [-Wunused-but-set-variable]
   39 |     int test = 0;
      |         ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 287 ms 26088 KB Output is correct
12 Correct 389 ms 26088 KB Output is correct
13 Correct 186 ms 26056 KB Output is correct
14 Correct 180 ms 26008 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 128 ms 26036 KB Output is correct
17 Correct 247 ms 26076 KB Output is correct
18 Correct 292 ms 26128 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 128 ms 26036 KB Output is correct
3 Correct 247 ms 26076 KB Output is correct
4 Correct 292 ms 26128 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 156 ms 13200 KB Output is correct
14 Correct 118 ms 8920 KB Output is correct
15 Correct 75 ms 6752 KB Output is correct
16 Correct 91 ms 5460 KB Output is correct
17 Correct 26 ms 368 KB Output is correct
18 Correct 21 ms 212 KB Output is correct
19 Correct 17 ms 324 KB Output is correct
20 Correct 9 ms 316 KB Output is correct
21 Correct 10 ms 320 KB Output is correct
22 Correct 41 ms 596 KB Output is correct
23 Correct 43 ms 596 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 287 ms 26088 KB Output is correct
12 Correct 389 ms 26088 KB Output is correct
13 Correct 186 ms 26056 KB Output is correct
14 Correct 180 ms 26008 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 156 ms 13200 KB Output is correct
24 Correct 118 ms 8920 KB Output is correct
25 Correct 75 ms 6752 KB Output is correct
26 Correct 91 ms 5460 KB Output is correct
27 Correct 26 ms 368 KB Output is correct
28 Correct 21 ms 212 KB Output is correct
29 Correct 17 ms 324 KB Output is correct
30 Correct 9 ms 316 KB Output is correct
31 Correct 10 ms 320 KB Output is correct
32 Correct 41 ms 596 KB Output is correct
33 Correct 43 ms 596 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 128 ms 26036 KB Output is correct
36 Correct 247 ms 26076 KB Output is correct
37 Correct 292 ms 26128 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 37 ms 732 KB Output is correct
46 Correct 10 ms 980 KB Output is correct
47 Correct 7 ms 340 KB Output is correct
48 Correct 49 ms 4680 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 33 ms 332 KB Output is correct
51 Correct 46 ms 700 KB Output is correct
52 Correct 12 ms 212 KB Output is correct
53 Correct 24 ms 212 KB Output is correct
54 Correct 31 ms 212 KB Output is correct
55 Correct 173 ms 13020 KB Output is correct
56 Correct 106 ms 8868 KB Output is correct
57 Correct 101 ms 8904 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 156 ms 13200 KB Output is correct
10 Correct 118 ms 8920 KB Output is correct
11 Correct 75 ms 6752 KB Output is correct
12 Correct 91 ms 5460 KB Output is correct
13 Correct 26 ms 368 KB Output is correct
14 Correct 21 ms 212 KB Output is correct
15 Correct 17 ms 324 KB Output is correct
16 Correct 9 ms 316 KB Output is correct
17 Correct 10 ms 320 KB Output is correct
18 Correct 41 ms 596 KB Output is correct
19 Correct 43 ms 596 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 128 ms 26036 KB Output is correct
22 Correct 247 ms 26076 KB Output is correct
23 Correct 292 ms 26128 KB Output is correct
24 Execution timed out 1087 ms 4220 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 287 ms 26088 KB Output is correct
12 Correct 389 ms 26088 KB Output is correct
13 Correct 186 ms 26056 KB Output is correct
14 Correct 180 ms 26008 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 156 ms 13200 KB Output is correct
24 Correct 118 ms 8920 KB Output is correct
25 Correct 75 ms 6752 KB Output is correct
26 Correct 91 ms 5460 KB Output is correct
27 Correct 26 ms 368 KB Output is correct
28 Correct 21 ms 212 KB Output is correct
29 Correct 17 ms 324 KB Output is correct
30 Correct 9 ms 316 KB Output is correct
31 Correct 10 ms 320 KB Output is correct
32 Correct 41 ms 596 KB Output is correct
33 Correct 43 ms 596 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 37 ms 732 KB Output is correct
42 Correct 10 ms 980 KB Output is correct
43 Correct 7 ms 340 KB Output is correct
44 Correct 49 ms 4680 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 33 ms 332 KB Output is correct
47 Correct 46 ms 700 KB Output is correct
48 Correct 12 ms 212 KB Output is correct
49 Correct 24 ms 212 KB Output is correct
50 Correct 31 ms 212 KB Output is correct
51 Correct 173 ms 13020 KB Output is correct
52 Correct 106 ms 8868 KB Output is correct
53 Correct 101 ms 8904 KB Output is correct
54 Execution timed out 1087 ms 4220 KB Time limit exceeded
55 Halted 0 ms 0 KB -