Submission #681450

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
681450	2023-01-13T06:12:08 Z	tegshzaya	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3000 ms	596 KB

sortbooks

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a,b,c[20000],d,e,f,g,h,i,j,k,l;
main(){ios::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
    cin>>a>>b;
    for (i=1; i<=a; i++)
    {cin>>c[i];
    }
    for (i=1; i<=b; i++)
    {cin>>d>>e>>f;
        for (j=d; j<=e; j++)
        {
            for (k=j+1; k<=e; k++)
            {if (c[j]>c[k]){if (c[j]+c[k]>f) {cout<<"0"<<endl;g=100; break;}}
            }
        if (g==100) break;
        }
    if (g!=100) {cout<<'1'<<endl;}
    g=0;
    }

}

Compilation message

sortbooks.cpp:5:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    5 | main(){ios::sync_with_stdio(false);
      | ^~~~

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	3 ms	212 KB	Output is correct
8	Correct	23 ms	212 KB	Output is correct
9	Correct	8 ms	212 KB	Output is correct
10	Correct	9 ms	212 KB	Output is correct

Subtask #2

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	3 ms	212 KB	Output is correct
8	Correct	23 ms	212 KB	Output is correct
9	Correct	8 ms	212 KB	Output is correct
10	Correct	9 ms	212 KB	Output is correct
11	Correct	20 ms	212 KB	Output is correct
12	Correct	134 ms	340 KB	Output is correct
13	Correct	95 ms	340 KB	Output is correct
14	Correct	203 ms	340 KB	Output is correct
15	Correct	131 ms	340 KB	Output is correct
16	Execution timed out	3090 ms	340 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	596 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	4 ms	340 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	3 ms	212 KB	Output is correct
8	Correct	23 ms	212 KB	Output is correct
9	Correct	8 ms	212 KB	Output is correct
10	Correct	9 ms	212 KB	Output is correct
11	Correct	20 ms	212 KB	Output is correct
12	Correct	134 ms	340 KB	Output is correct
13	Correct	95 ms	340 KB	Output is correct
14	Correct	203 ms	340 KB	Output is correct
15	Correct	131 ms	340 KB	Output is correct
16	Execution timed out	3090 ms	340 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #6

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	3 ms	212 KB	Output is correct
8	Correct	23 ms	212 KB	Output is correct
9	Correct	8 ms	212 KB	Output is correct
10	Correct	9 ms	212 KB	Output is correct
11	Correct	20 ms	212 KB	Output is correct
12	Correct	134 ms	340 KB	Output is correct
13	Correct	95 ms	340 KB	Output is correct
14	Correct	203 ms	340 KB	Output is correct
15	Correct	131 ms	340 KB	Output is correct
16	Execution timed out	3090 ms	340 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-