답안 #681453

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
681453 2023-01-13T06:22:31 Z tegshzaya Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
3000 ms 6356 KB
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a,b,c[1000010],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; continue;}
    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);
      | ^~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 212 KB Output is correct
8 Correct 22 ms 212 KB Output is correct
9 Correct 9 ms 212 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 212 KB Output is correct
8 Correct 22 ms 212 KB Output is correct
9 Correct 9 ms 212 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 22 ms 340 KB Output is correct
12 Correct 145 ms 352 KB Output is correct
13 Correct 92 ms 340 KB Output is correct
14 Correct 202 ms 340 KB Output is correct
15 Correct 131 ms 340 KB Output is correct
16 Execution timed out 3034 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1519 ms 6184 KB Output is correct
2 Correct 1523 ms 6288 KB Output is correct
3 Correct 1545 ms 6356 KB Output is correct
4 Correct 1502 ms 6224 KB Output is correct
5 Execution timed out 3060 ms 4272 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3059 ms 724 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 212 KB Output is correct
8 Correct 22 ms 212 KB Output is correct
9 Correct 9 ms 212 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 22 ms 340 KB Output is correct
12 Correct 145 ms 352 KB Output is correct
13 Correct 92 ms 340 KB Output is correct
14 Correct 202 ms 340 KB Output is correct
15 Correct 131 ms 340 KB Output is correct
16 Execution timed out 3034 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 212 KB Output is correct
8 Correct 22 ms 212 KB Output is correct
9 Correct 9 ms 212 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 22 ms 340 KB Output is correct
12 Correct 145 ms 352 KB Output is correct
13 Correct 92 ms 340 KB Output is correct
14 Correct 202 ms 340 KB Output is correct
15 Correct 131 ms 340 KB Output is correct
16 Execution timed out 3034 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -