CSES - E4590 2020 0 - Results
Submission details
Task:3-sum
Sender:Kasper Kivimäki
Submission time:2020-09-07 00:35:48 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.01 sdetails
#30.01 sdetails
#40.01 sdetails
#5ACCEPTED0.01 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.01 sdetails
#90.00 sdetails
#100.00 sdetails
#110.01 sdetails
#12ACCEPTED0.01 sdetails
#130.01 sdetails
#14ACCEPTED0.01 sdetails
#150.01 sdetails
#16ACCEPTED0.01 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.01 sdetails
#19ACCEPTED0.01 sdetails
#20ACCEPTED0.01 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.01 sdetails
#23ACCEPTED0.01 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.01 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.01 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
input/code.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &d[i]);
         ~~~~~^~~~~~~~~~~~~

Code

#include <stdio.h>
#include <stdlib.h>

int f1(int *d, int n) {
    int j = 0;
    int m = d[j];

    for (int i = 1; i < n; i++) {
        if (d[i] > m) {
            j = i;
            m = d[i];
        }
    }
    return j;
}

int f2(int *d, int n, int m1) {
    int j = 0;
    int m = d[j];

    for (int i = 1; i < n; i++) {
        if (i == m1) continue;
        if (d[i] > m) {
            j = i;
            m = d[i];
        }
    }
    return j;
}

int f3(int *d, int n, int m1, int m2) {
    int j = 0;
    int m = d[j];

    for (int i = 1; i < n; i++) {
        if (i == m1) continue;
        if (i == m2) continue;
        if (d[i] > m) {
            j = i;
            m = d[i];
        }
    }
    return j;
}

int main() {
    int n;

    scanf("%d", &n);

    int *d = (int*)malloc(sizeof(int) * n);

    for (int i = 0; i < n; i++)
        scanf("%d", &d[i]);

    int m1 = f1(d, n);
    int m2 = f2(d, n, m1);
    int m3 = f3(d, n, m1, m2);

    printf("%d %d %d\n", d[m1], d[m2], d[m3]);

    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
3
-702 391 288

correct output
-702 391 288

user output
391 288 -702

Test 2

Verdict: ACCEPTED

input
3
-609 886 -448

correct output
-609 886 -448

user output
886 -448 -609

Test 3

Verdict:

input
3
484 -459 605

correct output
484 -459 605

user output
605 484 484

Test 4

Verdict:

input
10
491 934 -395 -873 -822 447 -90...

correct output
491 934 447

user output
934 491 491

Test 5

Verdict: ACCEPTED

input
10
-293 853 267 -762 -647 843 35 ...

correct output
853 843 744

user output
853 843 744

Test 6

Verdict: ACCEPTED

input
10
-389 -908 441 187 993 -68 -593...

correct output
441 187 993

user output
993 441 187

Test 7

Verdict: ACCEPTED

input
4
-195 251 -11 423

correct output
251 -11 423

user output
423 251 -11

Test 8

Verdict: ACCEPTED

input
4
-522 -222 -909 294

correct output
-522 -222 294

user output
294 -222 -522

Test 9

Verdict:

input
4
141 764 -262 3

correct output
141 764 3

user output
764 141 141

Test 10

Verdict:

input
5
669 -567 -224 160 194

correct output
669 160 194

user output
669 669 669

Test 11

Verdict:

input
5
294 783 -60 -637 126

correct output
294 783 126

user output
783 294 294

Test 12

Verdict: ACCEPTED

input
5
-941 391 -339 -982 808

correct output
391 -339 808

user output
808 391 -339

Test 13

Verdict:

input
11
726 997 -588 -186 465 472 -865...

correct output
726 997 472

user output
997 726 726

Test 14

Verdict: ACCEPTED

input
11
-346 950 -522 106 278 265 531 ...

correct output
950 531 678

user output
950 678 531

Test 15

Verdict:

input
11
633 -52 -771 449 409 684 -516 ...

correct output
633 449 684

user output
684 633 633

Test 16

Verdict: ACCEPTED

input
57
714 -738 -127 -549 613 11 263 ...

correct output
880 887 947

user output
947 887 880

Test 17

Verdict: ACCEPTED

input
57
-599 -338 -960 581 -979 -85 -1...

correct output
830 988 852

user output
988 852 830

Test 18

Verdict: ACCEPTED

input
57
-346 -990 -893 -109 876 438 -5...

correct output
876 910 885

user output
910 885 876

Test 19

Verdict: ACCEPTED

input
99
621 189 655 890 -48 -440 276 6...

correct output
945 962 994

user output
994 962 945

Test 20

Verdict: ACCEPTED

input
99
-617 799 -960 436 725 -177 -30...

correct output
976 930 968

user output
976 968 930

Test 21

Verdict: ACCEPTED

input
99
-34 722 -880 -572 -241 415 -28...

correct output
944 893 930

user output
944 930 893

Test 22

Verdict: ACCEPTED

input
100
-992 368 517 -516 -307 -813 -3...

correct output
987 983 978

user output
987 983 978

Test 23

Verdict: ACCEPTED

input
100
-410 683 -411 -720 -559 -997 4...

correct output
996 997 1000

user output
1000 997 996

Test 24

Verdict: ACCEPTED

input
100
42 -652 -295 -94 -213 -974 658...

correct output
960 997 933

user output
997 960 933

Test 25

Verdict: ACCEPTED

input
100
230 16 1000 314 599 242 -921 4...

correct output
1000 999 998

user output
1000 999 998

Test 26

Verdict: ACCEPTED

input
100
-557 -203 -490 -20 -187 -727 -...

correct output
-20 -12 -6

user output
-6 -12 -20

Test 27

Verdict: ACCEPTED

input
100
-857 -525 -888 -592 -468 -378 ...

correct output
-1 -16 -34

user output
-1 -16 -34

Test 28

Verdict: ACCEPTED

input
100
-985 -939 -972 -976 -936 -971 ...

correct output
-900 -901 -902

user output
-900 -901 -902