Submission #681459

# Submission time Handle Problem Language Result Execution time Memory
681459 2023-01-13T06:31:24 Z tegshzaya Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
3000 ms 6232 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"<<" ";g=100; break;}}
        if (g==100) break;
        }
    if (g!=100){cout<<'1'<<" "; 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);
      | ^~~~
# Verdict Execution time Memory 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 0 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 212 KB Output is correct
9 Correct 8 ms 328 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
# Verdict Execution time Memory 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 0 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 212 KB Output is correct
9 Correct 8 ms 328 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 19 ms 340 KB Output is correct
12 Correct 131 ms 340 KB Output is correct
13 Correct 98 ms 340 KB Output is correct
14 Correct 201 ms 340 KB Output is correct
15 Correct 123 ms 352 KB Output is correct
16 Execution timed out 3051 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 416 ms 6232 KB Output is correct
2 Correct 404 ms 6144 KB Output is correct
3 Correct 411 ms 6156 KB Output is correct
4 Correct 471 ms 6104 KB Output is correct
5 Execution timed out 3071 ms 4120 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3057 ms 724 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 0 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 212 KB Output is correct
9 Correct 8 ms 328 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 19 ms 340 KB Output is correct
12 Correct 131 ms 340 KB Output is correct
13 Correct 98 ms 340 KB Output is correct
14 Correct 201 ms 340 KB Output is correct
15 Correct 123 ms 352 KB Output is correct
16 Execution timed out 3051 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 0 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 212 KB Output is correct
9 Correct 8 ms 328 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 19 ms 340 KB Output is correct
12 Correct 131 ms 340 KB Output is correct
13 Correct 98 ms 340 KB Output is correct
14 Correct 201 ms 340 KB Output is correct
15 Correct 123 ms 352 KB Output is correct
16 Execution timed out 3051 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -