CSES - Aalto Competitive Programming 2024 - wk2 - Wed - Results
Submission details
Task:Binge watching
Sender:aalto2024b_010
Submission time:2024-09-11 16:45:02 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#30.00 sdetails
#4ACCEPTED0.15 sdetails
#5ACCEPTED0.14 sdetails
#60.20 sdetails
#7ACCEPTED0.00 sdetails
#80.00 sdetails
#9ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:27:13: warning: unused variable 'startc' [-Wunused-variable]
   27 |         int startc = movies[v].first, endc = movies[v].second;
      |             ^~~~~~
input/code.cpp:28:39: warning: unused variable 'endn' [-Wunused-variable]
   28 |         int startn = movies[b].first, endn = movies[b].second;
      |                                       ^~~~
input/code.cpp:8:12: warning: unused variable 'm' [-Wunused-variable]
    8 |     int n, m, k;
      |            ^
input/code.cpp:8:15: warning: unused variable 'k' [-Wunused-variable]
    8 |     int n, m, k;
      |               ^

Code

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n, m, k;
    cin >> n;

    vector<pair<int, int> > movies(n);

    for (int i = 0; i < n; ++i) cin >> movies[i].first >> movies[i].second;

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

    //for (int i = 0; i < n; ++i) cout << '('  << movies[i].first << ' ' << movies[i].second << ')' << endl;
    

    //int k = 0;
    //while(k >)

    int v = 0; int b = 0;

    int nmovies = 1;
    for (int i = 0; i <= n; ++i) {
        int startc = movies[v].first, endc = movies[v].second;
        int startn = movies[b].first, endn = movies[b].second;

        //cout << "COMP " << startc << ' ' << endc << ") vs (" << startn << ' ' << endn << endl;



        if (endc <= startn) {
            ++nmovies;

            //++v;
            v = b;
            ++b;
            
        } else {
            ++b;
        }
    }

    cout << nmovies << endl;

}

Test details

Test 1

Verdict: ACCEPTED

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

correct output
10

user output
10

Test 2

Verdict: ACCEPTED

input
10
1 1000
1 1000
1 1000
1 1000
...

correct output
1

user output
1

Test 3

Verdict:

input
10
404 882
690 974
201 255
800 933
...

correct output
4

user output
2

Test 4

Verdict: ACCEPTED

input
200000
177494 177495
157029 157030
6030 6031
15209 15210
...

correct output
200000

user output
200000

Test 5

Verdict: ACCEPTED

input
200000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
...

correct output
1

user output
1

Test 6

Verdict:

input
200000
82334756 323555178
958182284 981100325
649818003 678160906
801994655 889397498
...

correct output
725

user output
15

Test 7

Verdict: ACCEPTED

input
3
1 1000
2 3
5 6

correct output
2

user output
2

Test 8

Verdict:

input
3
3 4
5 6
7 8

correct output
3

user output
4

Test 9

Verdict: ACCEPTED

input
2
1 2
3 4

correct output
2

user output
2