| Task: | Binge watching |
| Sender: | aalto25b_001 |
| Submission time: | 2025-09-10 16:35:42 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | details |
| #2 | WRONG ANSWER | 0.00 s | details |
| #3 | WRONG ANSWER | 0.00 s | details |
| #4 | WRONG ANSWER | 0.07 s | details |
| #5 | WRONG ANSWER | 0.06 s | details |
| #6 | WRONG ANSWER | 0.07 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | ACCEPTED | 0.00 s | details |
| #9 | ACCEPTED | 0.00 s | details |
Code
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
typedef struct {
uint64_t a;
uint64_t b;
} movie;
int comp(const void *m1, const void *m2){
movie cm1 = *((movie*)m1);
movie cm2 = *((movie*)m2);
if (cm1.b == cm2.b) return 0;
if (cm1.b < cm2.b) return -1;
return 1;
}
int main() {
uint64_t n = 0;
if (scanf("%ld", &n) == 0)
return EXIT_FAILURE;
movie *movies = (movie*) malloc(sizeof(movie) * n);
for (uint32_t i = 0; i < n; i++)
if (scanf("%ld %ld",&movies[i].a, &movies[i].b) == 0)
return EXIT_FAILURE;
qsort(movies, n, sizeof(double), comp);
uint64_t time = 0;
uint64_t acc = 0;
for(uint64_t i = 0; i < n; i++){
if (movies[i].a >= time){
time = movies[i].b;
acc++;
}
}
printf("%ld\n", acc);
// main algo
return EXIT_SUCCESS;
}
Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 10 6 7 4 5 8 9 2 3 ... |
| correct output |
|---|
| 10 |
| user output |
|---|
| 3 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 10 1 1000 1 1000 1 1000 1 1000 ... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 3 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 404 882 690 974 201 255 800 933 ... |
| correct output |
|---|
| 4 |
| user output |
|---|
| 2 |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 200000 177494 177495 157029 157030 6030 6031 15209 15210 ... |
| correct output |
|---|
| 200000 |
| user output |
|---|
| 34488 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 200000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 ... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 67232 |
Test 6
Verdict: WRONG ANSWER
| input |
|---|
| 200000 82334756 323555178 958182284 981100325 649818003 678160906 801994655 889397498 ... |
| correct output |
|---|
| 725 |
| user output |
|---|
| 25564 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 3 1 1000 2 3 5 6 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 3 3 4 5 6 7 8 |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 2 1 2 3 4 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
