답안 #681466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
681466 2023-01-13T06:42:39 Z tegshzaya Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
3000 ms 6268 KB
#include<bits/stdc++.h>
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"<<" ";g=100; break;}}
        if (g==100) break;
        }
    if (g!=100){cout<<'1'<<" "; continue;}
    g=0;
    }
}

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);
      | ^~~~
# 결과 실행 시간 메모리 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 0 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 21 ms 328 KB Output is correct
9 Correct 7 ms 332 KB Output is correct
10 Correct 12 ms 340 KB Output is correct
# 결과 실행 시간 메모리 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 0 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 21 ms 328 KB Output is correct
9 Correct 7 ms 332 KB Output is correct
10 Correct 12 ms 340 KB Output is correct
11 Correct 17 ms 340 KB Output is correct
12 Correct 139 ms 340 KB Output is correct
13 Correct 91 ms 340 KB Output is correct
14 Correct 204 ms 344 KB Output is correct
15 Correct 124 ms 352 KB Output is correct
16 Execution timed out 3072 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 436 ms 6108 KB Output is correct
2 Correct 405 ms 6268 KB Output is correct
3 Correct 401 ms 6220 KB Output is correct
4 Correct 443 ms 6108 KB Output is correct
5 Execution timed out 3043 ms 4184 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3067 ms 724 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 0 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 21 ms 328 KB Output is correct
9 Correct 7 ms 332 KB Output is correct
10 Correct 12 ms 340 KB Output is correct
11 Correct 17 ms 340 KB Output is correct
12 Correct 139 ms 340 KB Output is correct
13 Correct 91 ms 340 KB Output is correct
14 Correct 204 ms 344 KB Output is correct
15 Correct 124 ms 352 KB Output is correct
16 Execution timed out 3072 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 0 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 21 ms 328 KB Output is correct
9 Correct 7 ms 332 KB Output is correct
10 Correct 12 ms 340 KB Output is correct
11 Correct 17 ms 340 KB Output is correct
12 Correct 139 ms 340 KB Output is correct
13 Correct 91 ms 340 KB Output is correct
14 Correct 204 ms 344 KB Output is correct
15 Correct 124 ms 352 KB Output is correct
16 Execution timed out 3072 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -