| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 491870 |
2021-12-04T21:10:10 Z |
White |
Money (IZhO17_money) |
C++14 |
|
0 ms |
204 KB |
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int num[1000001];
vector<int>ans;
int main (){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,br=0;
cin>>n;
for(int i=1;i<=n;i++)cin>>num[i];
ans.push_back(0);ans.push_back(1000002);
for(int i=1;i<=n;){
int j=0;
while(ans[j]<num[i])j++;
ans.insert(ans.begin()+j,num[i]);
br++;
i++;
while(i<=n && num[i-1]<num[i] && num[i]<ans[j+1]){
j++;
ans.insert(ans.begin()+j,num[i]);
i++;
}
}
cout<<br<<endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
