CSES - Aalto Competitive Programming 2024 - wk10 - Homework

CSES - Aalto Competitive Programming 2024 - wk10 - Homework - Results

Submission details
Task:	Line Intersections
Sender:	htoik
Submission time:	2024-11-14 17:20:40 +0200
Language:	C++ (C++20)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	ACCEPTED	0.00 s	details
#3	ACCEPTED	0.00 s	details
#4	ACCEPTED	0.00 s	details
#5	ACCEPTED	0.00 s	details
#6	ACCEPTED	0.00 s	details
#7	ACCEPTED	0.00 s	details
#8	ACCEPTED	0.00 s	details
#9	ACCEPTED	0.00 s	details
#10	ACCEPTED	0.00 s	details
#11	ACCEPTED	0.00 s	details
#12	ACCEPTED	0.00 s	details
#13	ACCEPTED	0.00 s	details
#14	ACCEPTED	0.00 s	details
#15	ACCEPTED	0.00 s	details
#16	ACCEPTED	0.00 s	details
#17	ACCEPTED	0.01 s	details
#18	ACCEPTED	0.00 s	details
#19	ACCEPTED	0.00 s	details
#20	ACCEPTED	0.00 s	details
#21	ACCEPTED	0.00 s	details
#22	ACCEPTED	0.00 s	details
#23	ACCEPTED	0.00 s	details
#24	ACCEPTED	0.00 s	details
#25	ACCEPTED	0.00 s	details
#26	ACCEPTED	0.00 s	details
#27	ACCEPTED	0.00 s	details
#28	ACCEPTED	0.00 s	details
#29	ACCEPTED	0.00 s	details
#30	ACCEPTED	0.00 s	details
#31	ACCEPTED	0.00 s	details
#32	ACCEPTED	0.00 s	details
#33	ACCEPTED	0.00 s	details
#34	ACCEPTED	0.00 s	details
#35	ACCEPTED	0.00 s	details
#36	ACCEPTED	0.00 s	details
#37	ACCEPTED	0.01 s	details
#38	ACCEPTED	0.01 s	details
#39	ACCEPTED	0.01 s	details
#40	ACCEPTED	0.01 s	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:21:19: warning: comparison of integer expressions of different signedness: 'int' and 'ull' {aka 'long long unsigned int'} [-Wsign-compare]
   21 |     for(int i=0; i<n; i++){
      |                  ~^~

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    ull n;
    cin >> n;

    // vector<tuple<ll,ll,ll,ll>> lines;
    // vector<tuple<ll,ull,bool,bool>> endpoints;
    // lines.reserve(n);
    // endpoints.reserve(2*n);

    set<ll> hs;
    set<ll> vs;

    for(int i=0; i<n; i++){
        ll x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        // lines.push_back({x1,y1,x2,y2});

        bool hor = y1 != y2;
        if(hor){
            hs.insert(x1);
        }
        else{
            vs.insert(y1);
        }
        // if(hor){
        //     endpoints.push_back({x1,i,hor,false});
        // }
        // endpoints.push_back({x2,i,hor,true});
    }

    cout <<  (ll)hs.size() * (ll)vs.size() << "\n";

    // sort(endpoints.begin(), endpoints.end());
    // set<ll> ys;
    // ull c = 0;
    // for(const auto& [_,i,ishor,isend] : endpoints){
    //     const auto& [x1, y1, x2, y2] = lines[i];
    //     if(!ishor){
    //         for(auto y :ys){
    //             if(!(y < y1 || y > y2)){
    //                 c++;
    //             }
    //         }
    //     }
    //     else if(isend){
    //         ys.erase(y1);
    //     }
    //     else{
    //         ys.insert(y1);
    //     }
    // }
    // cout << c << "\n";
}

Test details

Test 1

Verdict: ACCEPTED

input
`1 1 1 -1 1` view save

correct output
`0` view save

user output
`0` view save

Test 2

Verdict: ACCEPTED

input
`1 -1 1 1 1` view save

correct output
`0` view save

user output
`0` view save

Test 3

Verdict: ACCEPTED

input
`2 2 1 -2 1 -1 2 -2 2` view save

correct output
`0` view save

user output
`0` view save

Test 4

Verdict: ACCEPTED

input
`2 -2 2 2 2 -1 0 -2 0` view save

correct output
`0` view save

user output
`0` view save

Test 5

Verdict: ACCEPTED

input
`3 3 2 -3 2 -1 3 -2 3 -3 -1 -2 -1` view save

correct output
`0` view save

user output
`0` view save

Test 6

Verdict: ACCEPTED

input
`3 -3 3 2 3 -1 0 -3 0 -1 2 -1 -1` view save

correct output
`2` view save

user output
`2` view save

Test 7

Verdict: ACCEPTED

input
`4 4 2 -4 2 -2 4 -3 4 -4 -1 -3 -1 -1 0 3 0` view save

correct output
`0` view save

user output
`0` view save

Test 8

Verdict: ACCEPTED

input
`4 -4 3 3 3 -1 4 4 4 -4 1 -1 1 -1 0 -1 -2` view save

correct output
`3` view save

user output
`3` view save

Test 9

Verdict: ACCEPTED

input
`5 5 2 -5 2 -2 5 -4 5 -4 -1 -3 -1 -2 0 4 0 ...` view save

correct output
`0` view save

user output
`0` view save

Test 10

Verdict: ACCEPTED

input
`5 -5 4 4 4 -1 5 5 5 -5 1 -1 1 -2 0 -2 -2 ...` view save

correct output
`6` view save

user output
`6` view save

Test 11

Verdict: ACCEPTED

input
`5 5 -2 5 -3 -5 -5 -5 -1 5 1 -4 1 1 -1 1 0 ...` view save

correct output
`6` view save

user output
`6` view save

Test 12

Verdict: ACCEPTED

input
`6 6 3 -6 3 -3 6 -5 6 -5 -1 -4 -1 -2 2 -1 2 ...` view save

correct output
`5` view save

user output
`5` view save

Test 13

Verdict: ACCEPTED

input
`6 -6 5 4 5 -2 6 0 6 1 -1 3 -1 0 0 -3 0 ...` view save

correct output
`8` view save

user output
`8` view save

Test 14

Verdict: ACCEPTED

input
`7 7 3 6 3 -6 -3 7 -3 -4 -6 -2 -6 -2 -2 3 -2 ...` view save

correct output
`0` view save

user output
`0` view save

Test 15

Verdict: ACCEPTED

input
`7 -7 6 5 6 -2 7 0 7 2 -2 4 -2 0 0 -3 0 ...` view save

correct output
`10` view save

user output
`10` view save

Test 16

Verdict: ACCEPTED

input
`10 10 5 9 5 -8 -4 10 -4 -6 -9 -2 -9 -2 -3 4 -3 ...` view save

correct output
`9` view save

user output
`9` view save

Test 17

Verdict: ACCEPTED

input
`10 -7 -10 9 -10 9 -1 9 0 -4 -4 -7 -4 4 3 -8 3 ...` view save

correct output
`24` view save

user output
`24` view save

Test 18

Verdict: ACCEPTED

input
`10 -9 4 -9 7 -8 0 1 0 -1 8 -1 -10 -10 -6 -5 -6 ...` view save

correct output
`24` view save

user output
`24` view save

Test 19

Verdict: ACCEPTED

input
`10 8 1 8 -7 7 5 7 2 2 -6 2 -8 -6 -10 -6 4 ...` view save

correct output
`24` view save

user output
`24` view save

Test 20

Verdict: ACCEPTED

input
`10 -9 8 7 8 -3 9 10 9 -9 2 -2 2 -3 0 -3 -4 ...` view save

correct output
`24` view save

user output
`24` view save

Test 21

Verdict: ACCEPTED

input
`10 9 -4 9 -6 -9 -10 -9 -3 10 2 -8 2 2 -2 2 1 ...` view save

correct output
`21` view save

user output
`21` view save

Test 22

Verdict: ACCEPTED

input
`10 -6 6 -4 6 10 5 -1 5 -4 1 -4 -5 -9 -9 -9 -2 ...` view save

correct output
`24` view save

user output
`24` view save

Test 23

Verdict: ACCEPTED

input
`50 50 22 44 22 -38 -20 50 -20 -27 -41 -10 -41 -11 -16 17 -16 ...` view save

correct output
`576` view save

user output
`576` view save

Test 24

Verdict: ACCEPTED

input
`50 -32 -48 44 -48 45 -7 45 -2 -18 -17 -35 -17 20 12 -38 12 ...` view save

correct output
`621` view save

user output
`621` view save

Test 25

Verdict: ACCEPTED

input
`50 -43 21 -43 34 -38 1 7 1 -6 40 -6 -49 -46 -30 -25 -30 ...` view save

correct output
`616` view save

user output
`616` view save

Test 26

Verdict: ACCEPTED

input
`50 40 5 40 -33 36 22 36 11 10 -29 10 -36 -28 -50 -28 20 ...` view save

correct output
`624` view save

user output
`624` view save

Test 27

Verdict: ACCEPTED

input
`50 -45 37 33 37 -14 42 48 42 -41 11 -10 11 -15 2 -15 -1 ...` view save

correct output
`576` view save

user output
`576` view save

Test 28

Verdict: ACCEPTED

input
`100 100 44 87 44 -75 -40 100 -40 -53 -82 -21 -82 -23 -31 34 -31 ...` view save

correct output
`2464` view save

user output
`2464` view save

Test 29

Verdict: ACCEPTED

input
`100 -63 -95 87 -95 90 -13 90 -3 -36 -34 -69 -34 40 24 -76 24 ...` view save

correct output
`2475` view save

user output
`2475` view save

Test 30

Verdict: ACCEPTED

input
`100 -86 42 -86 68 -76 2 14 2 -13 80 -13 -97 -92 -59 -51 -59 ...` view save

correct output
`2500` view save

user output
`2500` view save

Test 31

Verdict: ACCEPTED

input
`100 81 9 81 -66 71 43 71 22 20 -57 20 -72 -55 -99 -55 40 ...` view save

correct output
`2464` view save

user output
`2464` view save

Test 32

Verdict: ACCEPTED

input
`100 -89 75 67 75 -27 84 96 84 -82 22 -21 22 -29 4 -29 -3 ...` view save

correct output
`2491` view save

user output
`2491` view save

Test 33

Verdict: ACCEPTED

input
`200 199 88 173 88 -149 -79 200 -79 -106 -163 -41 -163 -45 -62 68 -62 ...` view save

correct output
`9984` view save

user output
`9984` view save

Test 34

Verdict: ACCEPTED

input
`200 -126 -190 173 -190 180 -26 180 -6 -72 -68 -139 -68 80 48 -152 48 ...` view save

correct output
`9919` view save

user output
`9919` view save

Test 35

Verdict: ACCEPTED

input
`200 -172 83 -172 136 -152 4 28 4 -25 159 -25 -193 -184 -117 -101 -117 ...` view save

correct output
`9991` view save

user output
`9991` view save

Test 36

Verdict: ACCEPTED

input
`200 161 19 161 -131 143 86 143 44 39 -114 39 -144 -110 -198 -110 80 ...` view save

correct output
`9999` view save

user output
`9999` view save

Test 37

Verdict: ACCEPTED

input
`10000 9944 4407 8652 4407 -7438 -3954 9981 -3954 -5278 -8154 -2068 -8154 -2242 -3089 3395 -3089 ...` view save

correct output
`24992431` view save

user output
`24992431` view save

Test 38

Verdict: ACCEPTED

input
`10000 -6299 -9482 8631 -9482 8955 -1294 8955 -305 -3589 -3393 -6912 -3393 3977 2386 -7601 2386 ...` view save

correct output
`24999775` view save

user output
`24999775` view save

Test 39

Verdict: ACCEPTED

input
`10000 -8586 4163 -8586 6799 -7574 217 1386 217 -1259 7926 -1259 -9626 -9188 -5855 -5042 -5855 ...` view save

correct output
`24999856` view save

user output
`24999856` view save

Test 40

Verdict: ACCEPTED

input
`10000 8013 945 8013 -6546 7113 4297 7113 2181 1951 -5678 1951 -7171 -5510 -9876 -5510 3969 ...` view save

correct output
`24999996` view save

user output
`24999996` view save

Aalto Competitive Programming 2024 - wk10 - Homework

Line Intersections

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Tasks

Submissions (htoik)