結果
| 問題 | No.1834 1D Gravity |
| ユーザー |
 cn_449
|
| 提出日時 | 2022-01-08 16:01:11 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 32 ms / 2,000 ms |
| コード長 | 4,604 bytes |
| コンパイル時間 | 1,747 ms |
| コンパイル使用メモリ | 141,296 KB |
| 最終ジャッジ日時 | 2025-01-27 09:59:28 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
ソースコード
#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 rep(i, n) for (int 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 pair<ll, P> Q;//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 int inf2 = 2000000010;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_;vector<int> make(int n) {vector<int> a(n);rep(i, n) a[i] = i;random_device seed_gen;mt19937 engine(seed_gen());shuffle(all(a), engine);return a;}int solve(vector<int> a) {//debug(a);int res = 0;int n = a.size();if (n == 2) return 0;vector<int> b(n, -1);chmax(b[1], a[0]);chmax(b[n - 2], a[n - 1]);for (int i = 1; i < n - 1; i++) {if (a[i - 1] < a[i + 1]) chmax(b[i + 1], a[i]);else chmax(b[i - 1], a[i]);}vector<vector<int>> v;vector<int> tmp;rep(i, n) {if (b[i] == -1) {if (tmp.size() != 0) v.pb(tmp);tmp.clear();}else tmp.pb(b[i]);}if (tmp.size() != 0) v.pb(tmp);for (vector<int> w : v) chmax(res, solve(w) + 1);return res;}int solve2(vector<int> w) {int cnt = 0;int sz = w.size();int x = 0;for (int i = 2; i < sz; i += 2) {if (w[i - 2] < w[i]) x = i / 2;}int y = 0;for (int i = 3; i < sz; i += 2) {if (w[i - 2] < w[i]) y = i / 2;}//debug(w);int xs = (sz + 1) / 2;int ys = sz / 2;while (xs > 1 || ys > 1) {//debug(xs); debug(ys); debug(x); debug(y);cnt++;int nx = x, ny = y;if (y >= x && x > 0) ny--;if (x > y) nx--;if (y < xs - 1) xs--;if (x != 0 && x != ys) ys--;if (x == 0) {swap(nx, ny);swap(xs, ys);}x = nx, y = ny;}return cnt;}int main() {int n;cin >> n;vector<int> a(n);rep(i, n) {cin >> a[i];a[i]--;}if (n == 2) {cout << 0 << ' ' << 1 << '\n';return 0;}vector<int> b(n, -1);chmax(b[1], a[0]);chmax(b[n - 2], a[n - 1]);for (int i = 1; i < n - 1; i++) {if (a[i - 1] < a[i + 1]) chmax(b[i + 1], a[i]);else chmax(b[i - 1], a[i]);}vector<vector<int>> v;vector<int> tmp;rep(i, n) {if (b[i] == -1) {if (tmp.size() != 0) v.pb(tmp);tmp.clear();}else tmp.pb(b[i]);}if (tmp.size() != 0) v.pb(tmp);int ans = 0;for (vector<int> w : v) {chmax(ans, solve2(w));}cout << ans + 1 << ' ' << v.size() << '\n';/*int n = 7;rep(_, 1000) {vector<int> v = make(n);bool f = false;rep(i, n - 4) if (v[i] > v[i + 2] && v[i + 2] < v[i + 4]) f = true;if (f) continue;if (solve(v) != solve2(v)) {debug(v);debug(solve(v));debug(solve2(v));}}*/}