結果
問題 | No.2893 Minahoshi (Hard) |
ユーザー | 👑 amentorimaru |
提出日時 | 2024-08-11 16:17:28 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,777 bytes |
コンパイル時間 | 4,124 ms |
コンパイル使用メモリ | 235,632 KB |
実行使用メモリ | 8,516 KB |
最終ジャッジ日時 | 2024-09-13 20:52:24 |
合計ジャッジ時間 | 107,317 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,806 ms
6,812 KB |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | TLE | - |
testcase_07 | TLE | - |
testcase_08 | TLE | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
ソースコード
#define ATCODER #define _USE_MATH_DEFINES #include <stdio.h> #include <iostream> #include <fstream> #include <algorithm> #include <vector> #include <string> #include <cassert> #include <numeric> #include <unordered_map> #include <unordered_set> #include <queue> #include <math.h> #include <climits> #include <set> #include <map> #include <list> #include <random> #include <iterator> #include <bitset> #include <chrono> #include <type_traits> using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; #define FOR(i, a, b) for (ll i = (a); i < (b); i++) #define REP(i, n) for (ll i = 0; i < (n); i++) #define ROF(i, a, b) for (ll i = (b - 1); i >= (a); i--) #define PER(i, n) for (ll i = n - 1; i >= 0; i--) #define VL vector<ll> #define VVL vector<vector<ll>> #define VP vector<pair<ll, ll>> #define LPQ(T) priority_queue<T, vector<T>, greater<T>> #define all(i) begin(i), end(i) #define SORT(i) sort(all(i)) #define EXISTBIT(x, i) (((x >> i) & 1) != 0) #define CHMAX(n, v) n = n < v ? v : n #define CHMIN(n, v) n = n > v ? v : n #define MP(a, b) make_pair(a, b) #define DET2(x1, y1, x2, y2) (x1) * (y2) - (x2) * (y1) #define DET3(x1, y1, z1, x2, y2, z2, x3, y3, z3) (x1) * (y2) * (z3) + (x2) * (y3) * (z1) + (x3) * (y1) * (z2) - (z1) * (y2) * (x3) - (z2) * (y3) * (x1) - (z3) * (y1) * (x2) #define INC(a) \ for (auto &v : a) \ v++; #define DEC(a) \ for (auto &v : a) \ v--; #define SQU(x) (x) * (x) #ifdef ATCODER #include <atcoder/all> using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template <typename T = ll> vector<T> read(size_t n) { vector<T> ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template <typename TV, const ll N> void read_tuple_impl(TV &) {} template <typename TV, const ll N, typename Head, typename... Tail> void read_tuple_impl(TV &ts) { get<N>(ts).emplace_back(*(istream_iterator<Head>(cin))); read_tuple_impl<TV, N + 1, Tail...>(ts); } template <typename... Ts> decltype(auto) read_tuple(size_t n) { tuple<vector<Ts>...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return max(a, b); } val e() { return -1e18; } val mp(func f, val a) { return a + f; } func comp(func f, func g) { return f + g; } func id() { return 0; } ll di[4] = {1, 0, -1, 0}; ll dj[4] = {0, 1, 0, -1}; ll si[4] = {0, 3, 3, 0}; ll sj[4] = {0, 0, 3, 3}; // ll di[4] = { -1,-1,1,1 }; // ll dj[4] = { -1,1,-1,1 }; ll di8[8] = {0, -1, -1, -1, 0, 1, 1, 1}; ll dj8[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; void solve() { ll t; cin>>t; double limit=1800/t; while(t--){ ll n; cin>>n; ll zc=n/2; ll oc=n-zc; vector<bool> ans; ll lcmin=1e18; auto start = std::chrono::system_clock::now(); while(1){ auto end = std::chrono::system_clock::now(); double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end - start) .count(); if(elapsed > limit) break; vector<bool> b(n); ll tzc=0,toc=0; REP(i,n){ bool add = rand()%2; if(tzc==zc || (toc!=oc && add)){ b[i]=true; toc++; }else{ b[i]=false; tzc++; } } auto sa=suffix_array(b); auto lc=lcp_array(b,sa); ll sum=0; for(auto&v:lc) sum+=v; if(lcmin > sum){ lcmin=sum; ans=b; } } REP(i,n){ if(ans[i]){ cout<<'b'; }else{ cout<<'a'; } } cout<<endl; } return; } int main() { ll t = 1; // cin >> t; while (t--) { solve(); } return 0; }