結果
問題 | No.2967 Nana's Plus Permutation Game |
ユーザー |
![]() |
提出日時 | 2024-11-16 18:22:20 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 510 ms / 2,000 ms |
コード長 | 4,096 bytes |
コンパイル時間 | 12,919 ms |
コンパイル使用メモリ | 521,652 KB |
実行使用メモリ | 25,580 KB |
平均クエリ数 | 4160.77 |
最終ジャッジ日時 | 2024-11-16 18:22:56 |
合計ジャッジ時間 | 34,655 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 65 |
ソースコード
/* このコード、と~おれ! Be accepted! ∧_∧ (。・ω・。)つ━☆・*。 ⊂ ノ ・゜+. しーJ °。+ *´¨) .· ´¸.·*´¨) ¸.·*¨) (¸.·´ (¸.·'* ☆ */ #include <cstdio> #include <algorithm> #include <string> #include <cmath> #include <cstring> #include <vector> #include <numeric> #include <iostream> #include <random> #include <map> #include <unordered_map> #include <queue> #include <regex> #include <functional> #include <complex> #include <list> #include <cassert> #include <iomanip> #include <set> #include <stack> #include <bitset> #include <array> #include <chrono> #include <unordered_set> //#pragma GCC target("arch=skylake-avx512") #pragma GCC target("avx2") //#pragma GCC optimize("O3") #pragma GCC optimize("Ofast") //#pragma GCC target("sse4") #pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define repeat(i, n, m) for(int i = n; i < (m); ++i) #define rep(i, n) for(int i = 0; i < (n); ++i) #define printynl(a) printf(a ? "yes\n" : "no\n") #define printyn(a) printf(a ? "Yes\n" : "No\n") #define printYN(a) printf(a ? "YES\n" : "NO\n") #define printim(a) printf(a ? "possible\n" : "imposible\n") #define printdb(a) printf("%.50lf\n", a) #define printLdb(a) printf("%.50Lf\n", a) #define printdbd(a) printf("%.16lf\n", a) #define prints(s) printf("%s\n", s.c_str()) #define all(x) (x).begin(), (x).end() #define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI) #define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L) #define Please return #define AC 0 #define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d)) using ll = long long; using ull = unsigned long long; constexpr int INF = 1073741823; constexpr int MINF = -1073741823; constexpr ll LINF = ll(4661686018427387903); constexpr ll MOD = 1e9 + 7; constexpr ll mod = 998244353; constexpr long double eps = 1e-14; const long double PI = acosl(-1.0L); using namespace std; void scans(string& str) { char c; str = ""; scanf("%c", &c); if (c == '\n')scanf("%c", &c); while (c != '\n' && c != -1 && c != ' ') { str += c; scanf("%c", &c); } } void scanc(char& str) { char c; scanf("%c", &c); if (c == -1)return; while (c == '\n') { scanf("%c", &c); } str = c; } double acot(double x) { return PI / 2 - atan(x); } ll LSB(ll n) { return (n & (-n)); } template<typename T> inline T chmin(T& a, const T& b) { if (a > b)a = b; return a; } template<typename T> inline T chmax(T& a, const T& b) { if (a < b)a = b; return a; } //cpp_int #if __has_include(<boost/multiprecision/cpp_int.hpp>) #include <boost/multiprecision/cpp_int.hpp> #include <boost/multiprecision/cpp_dec_float.hpp> using namespace boost::multiprecision; #else using cpp_int = ll; #endif //atcoder library #if __has_include(<atcoder/all>) #include <atcoder/all> //using namespace atcoder; #endif /* random_device seed_gen; mt19937 engine(seed_gen()); uniform_int_distribution dist(1, 100); */ /*----------------------------------------------------------------------------------*/ int main() { int n; scanf("%d", &n); vector<int> ans(n), to(n, -1), from(n, -1), cnt(n), in(n); rep(i, n) { printf("1 %d %d\n", i + 1, i + 1); fflush(stdout); int ret; scanf("%d", &ret); --ret; if (ret != -2)to[ret] = i, ++in[i], from[i] = ret; } stack<int> st; rep(i, n)if (in[i] == 0)st.push(i); while (not st.empty()) { int cur = st.top(); st.pop(); if (to[cur] != -1) { cnt[to[cur]] = cnt[cur] + 1; st.push(to[cur]); } } int idx = distance(cnt.begin(), max_element(all(cnt))); ans[idx] = 1; for (int i = from[idx]; i != -1; i = from[i])ans[i] = ans[to[i]] * 2; for (int i = idx; i != -1; i = from[i]) { int curidx = i; for (int j = ans[i] + 1; j < min(ans[i] * 2, n + 1); ++j) { printf("1 %d %d\n", idx + 1, curidx + 1); fflush(stdout); int ret; scanf("%d", &ret); --ret; ans[ret] = j; curidx = ret; } } printf("2 "); rep(i, n)printf("%d%c", ans[i], i + 1 == n ? '\n' : ' '); Please AC; }