# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341716 | denisa | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 1432 ms | 4332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |