CSES - Aalto Competitive Programming 2024 - wk6 - Wed - Results
Submission details
Task:Fence
Sender:aalto2024g_002
Submission time:2024-10-09 16:40:13 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#40ACCEPTED0.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#43ACCEPTED0.00 sdetails
#44ACCEPTED0.00 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.00 sdetails
#49ACCEPTED0.00 sdetails
#50ACCEPTED0.00 sdetails
#51ACCEPTED0.00 sdetails
#52ACCEPTED0.00 sdetails
#53ACCEPTED0.00 sdetails
#54ACCEPTED0.00 sdetails
#55ACCEPTED0.00 sdetails
#56ACCEPTED0.01 sdetails
#57ACCEPTED0.00 sdetails
#58ACCEPTED0.00 sdetails
#59ACCEPTED0.00 sdetails
#60ACCEPTED0.00 sdetails
#61ACCEPTED0.00 sdetails
#62ACCEPTED0.00 sdetails
#63--details
#64--details
#65--details
#66--details
#67--details
#68--details
#69--details
#70--details
#71--details
#72--details

Code

#include <bits/stdc++.h>

using namespace std;
#define int long long
#define vout(x) for(int i=0;i<(long long)x.size();i++) printf("%lld ",x[i]);

// g++ <filename>.cpp -g -Wall -Wextra -DDEBUG -o <executable>

// copied from: https://codeforces.com/blog/entry/79024
// === Debug macro starts here ===

int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) {++recur_depth; auto x_=x; --recur_depth; cerr<<string(recur_depth, '\t')<<"\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<#x<<" = "<<x_<<"\e[39m"<<endl;}
#else
#define dbg(x)
#endif
template<typename Ostream, typename Cont>
typename enable_if<is_same<Ostream,ostream>::value, Ostream&>::type operator<<(Ostream& os,  const Cont& v){
	os<<"[";
	for(auto& x:v){os<<x<<", ";}
	return os<<"]";
}
template<typename Ostream, typename ...Ts>
Ostream& operator<<(Ostream& os,  const pair<Ts...>& p){
	return os<<"{"<<p.first<<", "<<p.second<<"}";
}

// === Debug macro ends here ===

signed main() {
    
    int n, k;
    cin >> n >> k;
    
    vector<int> vec;
    
    for (int i = 0; i < n * 2; i++) {
        int a; 
        cin >> a;
        vec.push_back(a);
    }

    sort(vec.begin(), vec.end());

    int current_height = 0;

    int fence_pieces = 0;

    while (!vec.empty()) {
        current_height = vec.back();
        vec.pop_back();

        while(!vec.empty() && current_height < k) {
            current_height += vec.front();
            vec.erase(vec.begin());        
        }

        if (current_height >= k) fence_pieces++;
    }

    if (fence_pieces >= n) {
        cout << "Yes" << "\n";
    }
    else {
        cout << "No" << "\n";
    }



    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1 8
3 5 

correct output
Yes

user output
Yes

Test 2

Verdict: ACCEPTED

input
1 9
3 4 

correct output
No

user output
No

Test 3

Verdict: ACCEPTED

input
2 3
2 1 2 1 

correct output
Yes

user output
Yes

Test 4

Verdict: ACCEPTED

input
2 3
2 1 1 2 

correct output
Yes

user output
Yes

Test 5

Verdict: ACCEPTED

input
3 5
3 2 2 3 2 3 

correct output
Yes

user output
Yes

Test 6

Verdict: ACCEPTED

input
3 8
3 5 3 5 2 6 

correct output
Yes

user output
Yes

Test 7

Verdict: ACCEPTED

input
3 4
3 1 1 3 2 2 

correct output
Yes

user output
Yes

Test 8

Verdict: ACCEPTED

input
4 2
1 1 1 1 1 1 1 1 

correct output
Yes

user output
Yes

Test 9

Verdict: ACCEPTED

input
4 8
1 7 2 6 7 1 2 6 

correct output
Yes

user output
Yes

Test 10

Verdict: ACCEPTED

input
4 2
1 1 1 1 1 1 1 1 

correct output
Yes

user output
Yes

Test 11

Verdict: ACCEPTED

input
4 2
1 1 1 1 1 1 1 1 

correct output
Yes

user output
Yes

Test 12

Verdict: ACCEPTED

input
4 8
5 2 6 2 2 6 4 3 

correct output
No

user output
No

Test 13

Verdict: ACCEPTED

input
5 6
4 2 5 1 4 2 5 1 5 3 

correct output
Yes

user output
Yes

Test 14

Verdict: ACCEPTED

input
5 5
3 2 4 1 1 4 1 4 2 3 

correct output
Yes

user output
Yes

Test 15

Verdict: ACCEPTED

input
5 5
1 4 3 4 2 2 2 2 2 1 

correct output
No

user output
No

Test 16

Verdict: ACCEPTED

input
5 6
4 5 2 1 3 3 5 3 5 1 

correct output
Yes

user output
Yes

Test 17

Verdict: ACCEPTED

input
5 10
5 5 2 8 9 1 8 2 7 3 

correct output
Yes

user output
Yes

Test 18

Verdict: ACCEPTED

input
5 3
2 2 1 1 2 2 1 1 2 1 

correct output
Yes

user output
Yes

Test 19

Verdict: ACCEPTED

input
5 10
3 7 2 8 8 2 1 9 1 9 

correct output
Yes

user output
Yes

Test 20

Verdict: ACCEPTED

input
5 2
1 1 1 1 1 1 1 1 1 1 

correct output
Yes

user output
Yes

Test 21

Verdict: ACCEPTED

input
5 9
8 2 7 4 5 7 2 4 1 5 

correct output
Yes

user output
Yes

Test 22

Verdict: ACCEPTED

input
5 2
1 1 1 1 1 1 1 1 1 1 

correct output
Yes

user output
Yes

Test 23

Verdict: ACCEPTED

input
10 6
4 2 5 1 4 2 5 1 5 3 4 2 4 2 2 ...

correct output
Yes

user output
Yes

Test 24

Verdict: ACCEPTED

input
10 5
3 2 4 1 1 4 1 4 2 3 4 1 1 4 1 ...

correct output
Yes

user output
Yes

Test 25

Verdict: ACCEPTED

input
10 5
1 4 3 4 2 2 2 2 2 1 1 3 3 1 2 ...

correct output
No

user output
No

Test 26

Verdict: ACCEPTED

input
10 6
4 5 2 1 3 3 5 3 5 1 1 1 2 2 1 ...

correct output
No

user output
No

Test 27

Verdict: ACCEPTED

input
10 10
5 5 2 8 9 1 8 2 7 3 6 4 7 3 6 ...

correct output
Yes

user output
Yes

Test 28

Verdict: ACCEPTED

input
10 3
2 2 1 1 2 2 1 1 2 1 2 1 2 1 1 ...

correct output
Yes

user output
Yes

Test 29

Verdict: ACCEPTED

input
10 10
3 7 2 8 8 2 1 9 1 9 4 6 1 9 9 ...

correct output
Yes

user output
Yes

Test 30

Verdict: ACCEPTED

input
10 2
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
Yes

user output
Yes

Test 31

Verdict: ACCEPTED

input
10 9
8 2 7 4 5 7 2 4 1 5 4 7 4 4 5 ...

correct output
Yes

user output
Yes

Test 32

Verdict: ACCEPTED

input
10 2
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
Yes

user output
Yes

Test 33

Verdict: ACCEPTED

input
100 54882
39253 15632 47086 7798 23252 3...

correct output
No

user output
No

Test 34

Verdict: ACCEPTED

input
100 41703
30040 11663 38890 2813 5 41698...

correct output
Yes

user output
Yes

Test 35

Verdict: ACCEPTED

input
100 43601
1131 40616 23966 41322 18981 2...

correct output
No

user output
No

Test 36

Verdict: ACCEPTED

input
100 55081
39006 46265 16024 6683 28137 3...

correct output
No

user output
No

Test 37

Verdict: ACCEPTED

input
100 96704
52920 43784 16701 80003 94062 ...

correct output
Yes

user output
Yes

Test 38

Verdict: ACCEPTED

input
100 22201
19331 18456 4590 8076 20394 21...

correct output
No

user output
No

Test 39

Verdict: ACCEPTED

input
100 89287
29642 59645 18698 70589 73325 ...

correct output
Yes

user output
Yes

Test 40

Verdict: ACCEPTED

input
100 7632
5952 2435 3346 7465 5521 3477 ...

correct output
No

user output
No

Test 41

Verdict: ACCEPTED

input
100 87344
84597 20914 75919 32974 46368 ...

correct output
No

user output
No

Test 42

Verdict: ACCEPTED

input
100 1039
521 518 6 1030 146 890 911 126...

correct output
No

user output
No

Test 43

Verdict: ACCEPTED

input
200 54882
39253 15632 47086 7798 23252 3...

correct output
No

user output
No

Test 44

Verdict: ACCEPTED

input
200 41703
30040 11663 38890 2813 5 41698...

correct output
Yes

user output
Yes

Test 45

Verdict: ACCEPTED

input
200 43601
1131 40616 23966 41322 18981 2...

correct output
No

user output
No

Test 46

Verdict: ACCEPTED

input
200 55081
39006 46265 16024 6683 28137 3...

correct output
No

user output
No

Test 47

Verdict: ACCEPTED

input
200 96704
52920 43784 16701 80003 94062 ...

correct output
Yes

user output
Yes

Test 48

Verdict: ACCEPTED

input
200 22201
19331 18456 4590 8076 20394 21...

correct output
No

user output
No

Test 49

Verdict: ACCEPTED

input
200 89287
29642 59645 18698 70589 73325 ...

correct output
Yes

user output
Yes

Test 50

Verdict: ACCEPTED

input
200 7632
5952 2435 3346 7465 5521 3477 ...

correct output
No

user output
No

Test 51

Verdict: ACCEPTED

input
200 87344
84597 20914 75919 32974 46368 ...

correct output
No

user output
No

Test 52

Verdict: ACCEPTED

input
200 1039
521 518 6 1030 146 890 911 126...

correct output
No

user output
No

Test 53

Verdict: ACCEPTED

input
1000 54882
39253 15632 47086 7798 23252 3...

correct output
No

user output
No

Test 54

Verdict: ACCEPTED

input
1000 41703
30040 11663 38890 2813 5 41698...

correct output
Yes

user output
Yes

Test 55

Verdict: ACCEPTED

input
1000 43601
1131 40616 23966 41322 18981 2...

correct output
No

user output
No

Test 56

Verdict: ACCEPTED

input
1000 55081
39006 46265 16024 6683 28137 3...

correct output
No

user output
No

Test 57

Verdict: ACCEPTED

input
1000 96704
52920 43784 16701 80003 94062 ...

correct output
Yes

user output
Yes

Test 58

Verdict: ACCEPTED

input
1000 22201
19331 18456 4590 8076 20394 21...

correct output
No

user output
No

Test 59

Verdict: ACCEPTED

input
1000 89287
29642 59645 18698 70589 73325 ...

correct output
Yes

user output
Yes

Test 60

Verdict: ACCEPTED

input
1000 7632
5952 2435 3346 7465 5521 3477 ...

correct output
No

user output
No

Test 61

Verdict: ACCEPTED

input
1000 87344
84597 20914 75919 32974 46368 ...

correct output
No

user output
No

Test 62

Verdict: ACCEPTED

input
1000 1039
521 518 6 1030 146 890 911 126...

correct output
No

user output
No

Test 63

Verdict:

input
100000 54882
39253 15632 47086 7798 23252 3...

correct output
No

user output
(empty)

Test 64

Verdict:

input
100000 41703
30040 11663 38890 2813 5 41698...

correct output
Yes

user output
(empty)

Test 65

Verdict:

input
100000 43601
1131 40616 23966 41322 18981 2...

correct output
No

user output
(empty)

Test 66

Verdict:

input
100000 55081
39006 46265 16024 6683 28137 3...

correct output
No

user output
(empty)

Test 67

Verdict:

input
100000 96704
52920 43784 16701 80003 94062 ...

correct output
Yes

user output
(empty)

Test 68

Verdict:

input
100000 22201
19331 18456 4590 8076 20394 21...

correct output
No

user output
(empty)

Test 69

Verdict:

input
100000 89287
29642 59645 18698 70589 73325 ...

correct output
Yes

user output
(empty)

Test 70

Verdict:

input
100000 7632
5952 2435 3346 7465 5521 3477 ...

correct output
No

user output
(empty)

Test 71

Verdict:

input
100000 87344
84597 20914 75919 32974 46368 ...

correct output
No

user output
(empty)

Test 72

Verdict:

input
100000 1039
521 518 6 1030 146 890 911 126...

correct output
No

user output
(empty)