# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341716 | 2020-12-30T14:37:00 Z | denisa | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 1432 ms | 4332 KB |
#include <iostream> #include<fstream> #include<algorithm> int w[1000001]; using namespace std; int main() { int n, m, ok, i, ma, x, y, rez; cin>>n>>m; for(i=1;i<=n;i++) { cin>>w[i]; ma=min(ma, w[i]); } ok=1; for(i=1;i<=m;i++) { cin>>x>>y>>rez; if(rez>ma) { ok=0; } } if(ok==1) { for(i=1;i<=m;i++) { cout<<"0\n"; } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1432 ms | 4332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 108 ms | 748 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |