| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 391814 |
2021-04-20T03:12:47 Z |
SoGood |
Money (IZhO17_money) |
C++17 |
|
1 ms |
332 KB |
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define mp make_pair
#define fo(i, n1, n, x) for(int i = n1; i <= n; i += x)
#define foo(i, n, n1, x) for(int i = n; i >= n1; i -= x)
#define bit __builtin_popcount
#define md (l + ((r - l) / 2))
#define all(x) x.begin(),x.end()
#define eb emplace_back
#define ub upper_bound
#define lb lower_bound
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
using namespace std;
//using namespace __gnu_pbds;
//using namespace __gnu_cxx;
using ll = long long;
//#define int ll
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
const int N = 1e6 + 11, mod = 1e9 + 7, mod2 = 998244353;
const int MAX = 1e5 + 11;
const int INF1 = 2e9 + 11;
const ll INF2 = 6e18 + 11;
const double INF3 = 1e8 + 11;
const int base = 500;
const int P = 31;
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
const double EPS = 1e-4;
const double PI = acos(-1.0);
//template<typename T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r) { return uniform_int_distribution<int> (l, r)(rng); }
int n, a[N], t[N], cnt[N];
void upd(int pos, int val) {
for (int i = pos; i <= N; i = (i | (i + 1))) t[i] += val;
}
int get(int pos) {
int res = 0;
for (int i = pos; i >= 0; i = (i & (i + 1)) - 1) res += t[i];
return res;
}
int get(int l, int r) {
int res = 0;
fo(i, l, r, 1) res += cnt[i];
return res;
}
main() {
file("paint");
ios;
cin >> n;
fo(i, 1, n, 1) cin >> a[i];
int mn = a[1], mx = a[1];
bool flag = 0;
int ans = 1, l = -1;
fo(i, 1, n, 1) {
// cerr << "CH " << i << " " << ans << " " << get(a[l], a[i]) << " " << a[l] << " " << a[i] << "\n";
if (!flag) {
while (i + 1 <= n and a[i + 1] >= a[i]) ++i, chmin(mn, a[i]), chmax(mx, a[i]);
fo(j, a[1], a[i], 1) ++cnt[j];
flag = 1;
} else {
if (l == -1) {
l = i;
chmin(mn, a[i]);
chmax(mx, a[i]);
++ans;
} else {
if (a[i] >= a[i - 1] and get(a[l], a[i]) == a[i] - a[l] + 1) {
continue;
} else {
l = i;
if (a[i] < mn) {
fo(j, a[i], mn - 1, 1) ++cnt[j];
mn = a[i];
}
if (mx < a[i]) {
fo(j, mx + 1, a[i], 1) ++cnt[j];
mx = a[i];
}
++ans;
}
}
}
}
cout << ans;
return 0;
}
/**
6
3 6 4 5 1 2
*/
Compilation message
money.cpp:75:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
75 | main() {
| ^
money.cpp: In function 'int main()':
money.cpp:23:48: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
23 | #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~
money.cpp:76:3: note: in expansion of macro 'file'
76 | file("paint");
| ^~~~
money.cpp:23:77: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
23 | #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
money.cpp:76:3: note: in expansion of macro 'file'
76 | file("paint");
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
