結果
問題 | No.1437 01 Sort |
ユーザー | cn_449 |
提出日時 | 2021-03-16 05:16:27 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,228 bytes |
コンパイル時間 | 1,481 ms |
コンパイル使用メモリ | 136,708 KB |
実行使用メモリ | 9,548 KB |
最終ジャッジ日時 | 2024-04-25 07:14:25 |
合計ジャッジ時間 | 4,774 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | RE | - |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | AC | 37 ms
9,164 KB |
testcase_14 | AC | 36 ms
9,296 KB |
testcase_15 | RE | - |
testcase_16 | WA | - |
testcase_17 | RE | - |
testcase_18 | WA | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | RE | - |
testcase_26 | AC | 78 ms
9,164 KB |
ソースコード
#include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <string> #include <queue> #include <stack> #include <set> #include <map> #include <iomanip> #include <utility> #include <tuple> #include <functional> #include <bitset> #include <cassert> #include <complex> #include <stdio.h> #include <time.h> #include <numeric> #include <random> #include <unordered_set> #include <unordered_map> #define all(a) a.begin(), a.end() #define rep(i, n) for (ll i = 0; i < (n); i++) #define range(i, a, b) for (ll i = (a); i < (b); i++) #define pb push_back #define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\n' #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> P; typedef complex<ld> com; template<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>; template<class T> using pri_b = priority_queue<T>; constexpr int inf = 1000000010; constexpr ll INF = 1000000000000000010; constexpr int mod1e9 = 1000000007; constexpr int mod998 = 998244353; constexpr ld eps = 1e-12; constexpr ld pi = 3.141592653589793238; constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; }; int dx[] = { 1,0,-1,0,1,1,-1,-1 }; int dy[] = { 0,1,0,-1,1,-1,1,-1 }; ll mul(ll a, ll b) { return (a > INF / b ? INF : a * b); } void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); } template<class T> void er(T a) { cout << a << '\n'; exit(0); } template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; } template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; } template<class T> istream &operator >> (istream &s, vector<T> &v) { for (auto &e : v) s >> e; return s; } template<class T> ostream &operator << (ostream &s, const vector<T> &v) { for (auto &e : v) s << e << ' '; return s; } template<class T, class U> ostream &operator << (ostream &s, const pair<T, U> &p) { s << p.first << ' ' << p.second; return s; } struct fastio { fastio() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(20); } }fastio_; template<class T> class segtree { int n; vector<T> data; T id = 0; T operation(T a, T b) { return a + b; }; public: segtree(int _n) { n = 1; while (n < _n + 2) n <<= 1; data = vector<T>(2 * n, id); } segtree(vector<T> vec) { int _n = vec.size(); n = 1; while (n < _n + 2) n <<= 1; data = vector<T>(2 * n, id); for (int i = 0; i < _n; i++) data[i + n] = vec[i]; for (int i = n - 1; i >= 1; i--) data[i] = operation(data[i << 1], data[i << 1 | 1]); } void change(int i, T x) { i += n; data[i] = x; while (i > 1) { i >>= 1; data[i] = operation(data[i << 1], data[i << 1 | 1]); } } void add(int i, T x) { change(i, data[i + n] + x); } T get(int a, int b) { T left = id; T right = id; a += n; b += n; while (a < b) { if (a & 1) left = operation(left, data[a++]); if (b & 1) right = operation(data[--b], right); a >>= 1; b >>= 1; } return operation(left, right); } T get_all() { return data[1]; } T operator[](int i) { return data[i + n]; } }; int main() { ll n; cin >> n; assert(2 <= n && n <= ten(5)); string s; cin >> s; rep(i, n) assert(s[i] == '0' || s[i] == '1'); vector<ll> one; rep(i, n) if (s[i] == '1') one.pb(i); ll sz = one.size(); if (sz == 0) er(0); rep(i, sz) one.pb(one[i] + n); vector<ll> d; d.pb(0); rep(i, 2 * sz - 1) d.pb(one[i + 1] - one[i] - 1); rep(i, 2 * sz - 1) d[i + 1] += d[i]; segtree<ll> seg(2 * n); rep(i, sz) seg.change(d[i], 1); ll ans = INF; assert(s.back() == '1'); rep(i, sz) { ll ok = n, ng = -1; while (ok - ng > 1) { ll mid = (ok + ng) / 2; ll r = mid + d[i]; ll g = seg.get(r + 1, 2 * n); if (d[sz - 1] - d[i] <= mid && g != 0) g++; if (g <= mid) ok = mid; else ng = mid; } ll res = ok * n + d[i + sz - 1] - d[i] - ok; if (i != 0) res -= one[i - 1] + 1; if (res < 0) res += n; chmin(ans, res); seg.change(d[i], 0); seg.change(d[i + sz], 1); } cout << ans << '\n'; }