Submission #681472

# Submission time Handle Problem Language Result Execution time Memory
681472 2023-01-13T06:53:17 Z tegshzaya Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
3000 ms 6480 KB
#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);
      | ^~~~
# Verdict Execution time Memory 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 21 ms 328 KB Output is correct
9 Correct 7 ms 328 KB Output is correct
10 Correct 9 ms 212 KB Output is correct
# Verdict Execution time Memory 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 21 ms 328 KB Output is correct
9 Correct 7 ms 328 KB Output is correct
10 Correct 9 ms 212 KB Output is correct
11 Correct 17 ms 336 KB Output is correct
12 Correct 130 ms 340 KB Output is correct
13 Correct 87 ms 352 KB Output is correct
14 Correct 197 ms 340 KB Output is correct
15 Correct 125 ms 340 KB Output is correct
16 Execution timed out 3076 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 454 ms 6220 KB Output is correct
2 Correct 431 ms 6220 KB Output is correct
3 Correct 491 ms 6176 KB Output is correct
4 Correct 440 ms 6480 KB Output is correct
5 Execution timed out 3087 ms 4124 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3077 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 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 21 ms 328 KB Output is correct
9 Correct 7 ms 328 KB Output is correct
10 Correct 9 ms 212 KB Output is correct
11 Correct 17 ms 336 KB Output is correct
12 Correct 130 ms 340 KB Output is correct
13 Correct 87 ms 352 KB Output is correct
14 Correct 197 ms 340 KB Output is correct
15 Correct 125 ms 340 KB Output is correct
16 Execution timed out 3076 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 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 21 ms 328 KB Output is correct
9 Correct 7 ms 328 KB Output is correct
10 Correct 9 ms 212 KB Output is correct
11 Correct 17 ms 336 KB Output is correct
12 Correct 130 ms 340 KB Output is correct
13 Correct 87 ms 352 KB Output is correct
14 Correct 197 ms 340 KB Output is correct
15 Correct 125 ms 340 KB Output is correct
16 Execution timed out 3076 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -