oj.uz

답안 #344915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
344915 2021-01-06T18:04:23 Z Valera_Grinenko Money (IZhO17_money) C++17
0 / 100
 1 ms 384 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e6 + 42;
int fw[N], a[N];
void upd(int pos) {
  for(; pos < N; pos += (pos & -pos)) fw[pos]++;
}
int get(int pos) {
  int res = 0;
  for(; pos > 0; pos -= (pos & -pos)) res += fw[pos];
  return res;
}
int get(int l, int r) {
  if(l > r) return 0;
  return get(r) - get(l - 1);
}
int main() {

  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  int n = 0;

  cin >> n;

  for(int i = 0; i < n; i++) cin >> a[i];

  int ans = 0;

  for(int i = 0; i < n; i++) {
    int cpos = i;
    while(cpos + 1 < n && a[cpos] <= a[cpos + 1] && get(a[cpos] + 1, a[cpos + 1] - 1) == 0) cpos++;
    for(int j = i; j <= cpos; j++) upd(a[j]);
    ans++;
  }

  cout << ans;

  return 0;
}
/*

*/

Compilation message

money.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -