Submission #681469

# Submission time Handle Problem Language Result Execution time Memory
681469 2023-01-13T06:48:50 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);
      | ^~~~
# 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 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 22 ms 328 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 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 22 ms 328 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 138 ms 340 KB Output is correct
13 Correct 104 ms 340 KB Output is correct
14 Correct 198 ms 468 KB Output is correct
15 Correct 125 ms 340 KB Output is correct
16 Execution timed out 3056 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 462 ms 6232 KB Output is correct
2 Correct 437 ms 6268 KB Output is correct
3 Correct 417 ms 6228 KB Output is correct
4 Correct 466 ms 6232 KB Output is correct
5 Execution timed out 3050 ms 4160 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3067 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 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 22 ms 328 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 138 ms 340 KB Output is correct
13 Correct 104 ms 340 KB Output is correct
14 Correct 198 ms 468 KB Output is correct
15 Correct 125 ms 340 KB Output is correct
16 Execution timed out 3056 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 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 22 ms 328 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 138 ms 340 KB Output is correct
13 Correct 104 ms 340 KB Output is correct
14 Correct 198 ms 468 KB Output is correct
15 Correct 125 ms 340 KB Output is correct
16 Execution timed out 3056 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -