답안 #681479

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681479	2023-01-13T06:57:44 Z	tegshzaya	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3000 ms	6344 KB

sortbooks

#include<bits/stdc++.h>
using namespace std;
int a,b,c[1000010],d,e,f,g=1,h,i,j,k,l,m;
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]&&c[j]+c[k]>f){g=0; break;}
            }
        if (g==0) break;
        }
    cout<<g<<" ";
    g=1;
    }
}

Compilation message

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

Subtask #1

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	1 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	23 ms	336 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	1 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	23 ms	336 KB	Output is correct
9	Correct	8 ms	212 KB	Output is correct
10	Correct	9 ms	212 KB	Output is correct
11	Correct	18 ms	340 KB	Output is correct
12	Correct	137 ms	340 KB	Output is correct
13	Correct	90 ms	340 KB	Output is correct
14	Correct	215 ms	340 KB	Output is correct
15	Correct	125 ms	340 KB	Output is correct
16	Execution timed out	3072 ms	340 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	479 ms	6268 KB	Output is correct
2	Correct	454 ms	6216 KB	Output is correct
3	Correct	500 ms	6344 KB	Output is correct
4	Correct	450 ms	6144 KB	Output is correct
5	Execution timed out	3089 ms	4160 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	3094 ms	596 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	1 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	23 ms	336 KB	Output is correct
9	Correct	8 ms	212 KB	Output is correct
10	Correct	9 ms	212 KB	Output is correct
11	Correct	18 ms	340 KB	Output is correct
12	Correct	137 ms	340 KB	Output is correct
13	Correct	90 ms	340 KB	Output is correct
14	Correct	215 ms	340 KB	Output is correct
15	Correct	125 ms	340 KB	Output is correct
16	Execution timed out	3072 ms	340 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #6

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	1 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	23 ms	336 KB	Output is correct
9	Correct	8 ms	212 KB	Output is correct
10	Correct	9 ms	212 KB	Output is correct
11	Correct	18 ms	340 KB	Output is correct
12	Correct	137 ms	340 KB	Output is correct
13	Correct	90 ms	340 KB	Output is correct
14	Correct	215 ms	340 KB	Output is correct
15	Correct	125 ms	340 KB	Output is correct
16	Execution timed out	3072 ms	340 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-