# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1074675 | AdrianSoh | Snail (NOI18_snail) | C++14 | 2 ms | 604 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 <bits/stdc++.h>
#define intt long long
using namespace std;
int main(){
intt h,p;cin >> h >> p;
vector <intt> vec(p);
intt total = 0;
for(intt i=0;i<p;i++){
cin >> vec[i];
total+=vec[i];
}
intt maxv = *max_element(vec.begin(),vec.end());
intt maxi = 0;
for(intt i=0;i<vec.size();i++){
if(vec[i] == maxv){
maxi = i;break;
}
}
if(h/total-1<0){
cout << -1 << " " << -1;
}else{
cout << h/total-1 << " " << maxi;
}
}
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... |