# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
38223 |
2018-01-03T04:45:16 Z |
antimirage |
Money (IZhO17_money) |
C++14 |
|
0 ms |
60608 KB |
#include <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <set>
#include <iomanip>
#include <time.h>
#include <list>
#include <stdio.h>
#include <queue>
#include <map>
#include <algorithm>
#include <assert.h>
#include <memory.h>
#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
using namespace std;
const int N = 3e6 + 5;
int n, ar[N], cur, ans, l = 1, Pos = 1e9 + 7, t[N * 4], mx = 1e6 + 1;
void update (int pos, int v = 1, int tl = 1, int tr = mx)
{
if (tl == tr)
t[v] = 1;
else
{
int tm = (tl + tr) >> 1;
if (pos <= tm)
update( pos, v + v, tl, tm );
else
update( pos, v + v + 1, tm + 1, tr);
t[v] = t[v + v] + t[v + v + 1];
}
}
int get (int val, int v = 1, int tl = 1, int tr = mx)
{
if (!t[v])
return 1e9 + 7;
if (tl == tr)
return tl;
int tm = (tl + tr) >> 1;
if (val <= tm && t[v + v] )
return get( val, v + v, tl, tm );
return get ( val, v + v + 1, tm + 1, tr );
}
main ()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &ar[i]);
cur = ar[1];
int i = 1;
while (i <= n)
{
if ( ar[i] < ar[i - 1] || Pos < ar[i] )
{
ans++;
cur = ar[i];
while ( l < i )
update( ar[l] ), l++;
Pos = get( cur + 1 );
}
i++;
}
printf("%d\n", ans + 1);
}
Compilation message
money.cpp:59:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main ()
^
money.cpp: In function 'int main()':
money.cpp:61:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
money.cpp:64:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &ar[i]);
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
60608 KB |
Output is correct |
2 |
Correct |
0 ms |
60608 KB |
Output is correct |
3 |
Correct |
0 ms |
60608 KB |
Output is correct |
4 |
Correct |
0 ms |
60608 KB |
Output is correct |
5 |
Correct |
0 ms |
60608 KB |
Output is correct |
6 |
Incorrect |
0 ms |
60608 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
60608 KB |
Output is correct |
2 |
Correct |
0 ms |
60608 KB |
Output is correct |
3 |
Correct |
0 ms |
60608 KB |
Output is correct |
4 |
Correct |
0 ms |
60608 KB |
Output is correct |
5 |
Correct |
0 ms |
60608 KB |
Output is correct |
6 |
Incorrect |
0 ms |
60608 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
60608 KB |
Output is correct |
2 |
Correct |
0 ms |
60608 KB |
Output is correct |
3 |
Correct |
0 ms |
60608 KB |
Output is correct |
4 |
Correct |
0 ms |
60608 KB |
Output is correct |
5 |
Correct |
0 ms |
60608 KB |
Output is correct |
6 |
Incorrect |
0 ms |
60608 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
60608 KB |
Output is correct |
2 |
Correct |
0 ms |
60608 KB |
Output is correct |
3 |
Correct |
0 ms |
60608 KB |
Output is correct |
4 |
Correct |
0 ms |
60608 KB |
Output is correct |
5 |
Correct |
0 ms |
60608 KB |
Output is correct |
6 |
Incorrect |
0 ms |
60608 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |