# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1074671 |
2024-08-25T12:07:15 Z |
jundi |
Snail (NOI18_snail) |
C++17 |
|
1000 ms |
604 KB |
#include <bits/stdc++.h>
using namespace std;
bool myCmp(int i, int j)
{ return(i>j); }
void printArray(int arr[], int size){
int i;for (i = 0; i < size; i++)
{ cout << arr[i] << " ";cout << endl; }
}//means "if n is non-zero" or true
#define asort(a,x) sort(a,a+x,myCmp)//big to small
#define pb(x) push_back(x)
#define vsort(v) sort(v.begin(),v.end())
//string=vector
#define sp " "
#define ll long long int
ll t,n;
void solve(){
cin>>t>>n;ll a[n],cnt=0,tmp=0,tp=n;
for(ll i=0;i<n;i++)
{ cin>>a[i]; }
for(int i=0;i<n;i++){
tmp+=a[i];
if(tmp<0){ tmp=0; }
if(tmp>=t)
{ cout<<cnt<<" "<<i;return; }
}if(tmp<=0){ cout<<-1<<" "<<-1;return; }
t-=tmp;
while(t>0){
cnt++;
if(t-tmp>0){ t-=tmp; }
else{
for(int i=0;i<n;i++){
t-=a[i];tp=i;
if(t<=0)
{ cout<<cnt<<" "<<i;return; }
}
}
}cout<<cnt<<" "<<tp;
}
int main() {
ios::sync_with_stdio(0);cin.tie(0);
solve();cout<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Execution timed out |
1089 ms |
348 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
456 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Execution timed out |
1096 ms |
348 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
5 ms |
548 KB |
Output is correct |
3 |
Correct |
1 ms |
604 KB |
Output is correct |
4 |
Correct |
1 ms |
604 KB |
Output is correct |
5 |
Correct |
1 ms |
604 KB |
Output is correct |
6 |
Correct |
1 ms |
600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Execution timed out |
1089 ms |
348 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |