Submission #681467

# Submission time Handle Problem Language Result Execution time Memory
681467 2023-01-13T06:46:43 Z tegshzaya Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
3000 ms 6292 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"<<"\n"; g=100; break;}}
        if (g==100) break;
        }
    if (g!=100){cout<<'1'<<"\n"; 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);
      | ^~~~
# 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 0 ms 212 KB Output is correct
5 Correct 0 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 7 ms 332 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 0 ms 212 KB Output is correct
5 Correct 0 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 7 ms 332 KB Output is correct
10 Correct 9 ms 212 KB Output is correct
11 Correct 17 ms 340 KB Output is correct
12 Correct 130 ms 340 KB Output is correct
13 Correct 92 ms 340 KB Output is correct
14 Correct 197 ms 344 KB Output is correct
15 Correct 129 ms 340 KB Output is correct
16 Execution timed out 3092 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 413 ms 6228 KB Output is correct
2 Correct 413 ms 6292 KB Output is correct
3 Correct 403 ms 6196 KB Output is correct
4 Correct 419 ms 6176 KB Output is correct
5 Execution timed out 3067 ms 4168 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3053 ms 724 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 0 ms 212 KB Output is correct
5 Correct 0 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 7 ms 332 KB Output is correct
10 Correct 9 ms 212 KB Output is correct
11 Correct 17 ms 340 KB Output is correct
12 Correct 130 ms 340 KB Output is correct
13 Correct 92 ms 340 KB Output is correct
14 Correct 197 ms 344 KB Output is correct
15 Correct 129 ms 340 KB Output is correct
16 Execution timed out 3092 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 0 ms 212 KB Output is correct
5 Correct 0 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 7 ms 332 KB Output is correct
10 Correct 9 ms 212 KB Output is correct
11 Correct 17 ms 340 KB Output is correct
12 Correct 130 ms 340 KB Output is correct
13 Correct 92 ms 340 KB Output is correct
14 Correct 197 ms 344 KB Output is correct
15 Correct 129 ms 340 KB Output is correct
16 Execution timed out 3092 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -