Submission #681461

# Submission time Handle Problem Language Result Execution time Memory
681461 2023-01-13T06:32:26 Z tegshzaya Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
3000 ms 6220 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 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 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 22 ms 336 KB Output is correct
9 Correct 7 ms 212 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
# 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 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 22 ms 336 KB Output is correct
9 Correct 7 ms 212 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
11 Correct 18 ms 340 KB Output is correct
12 Correct 129 ms 340 KB Output is correct
13 Correct 88 ms 352 KB Output is correct
14 Correct 191 ms 352 KB Output is correct
15 Correct 123 ms 352 KB Output is correct
16 Execution timed out 3082 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 417 ms 6200 KB Output is correct
2 Correct 396 ms 6196 KB Output is correct
3 Correct 432 ms 6176 KB Output is correct
4 Correct 399 ms 6220 KB Output is correct
5 Execution timed out 3046 ms 4144 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3019 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 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 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 22 ms 336 KB Output is correct
9 Correct 7 ms 212 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
11 Correct 18 ms 340 KB Output is correct
12 Correct 129 ms 340 KB Output is correct
13 Correct 88 ms 352 KB Output is correct
14 Correct 191 ms 352 KB Output is correct
15 Correct 123 ms 352 KB Output is correct
16 Execution timed out 3082 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# 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 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 22 ms 336 KB Output is correct
9 Correct 7 ms 212 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
11 Correct 18 ms 340 KB Output is correct
12 Correct 129 ms 340 KB Output is correct
13 Correct 88 ms 352 KB Output is correct
14 Correct 191 ms 352 KB Output is correct
15 Correct 123 ms 352 KB Output is correct
16 Execution timed out 3082 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -