結果
問題 | No.2874 Gunegune Tree |
ユーザー | i_am_noob |
提出日時 | 2024-09-18 06:09:52 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 159 ms / 2,000 ms |
コード長 | 6,628 bytes |
コンパイル時間 | 5,231 ms |
コンパイル使用メモリ | 274,956 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-18 06:10:01 |
合計ジャッジ時間 | 7,581 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 12 ms
6,944 KB |
testcase_04 | AC | 67 ms
6,940 KB |
testcase_05 | AC | 25 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 150 ms
6,944 KB |
testcase_08 | AC | 75 ms
6,944 KB |
testcase_09 | AC | 9 ms
6,948 KB |
testcase_10 | AC | 132 ms
6,944 KB |
testcase_11 | AC | 103 ms
6,944 KB |
testcase_12 | AC | 33 ms
6,940 KB |
testcase_13 | AC | 154 ms
6,944 KB |
testcase_14 | AC | 124 ms
6,940 KB |
testcase_15 | AC | 22 ms
6,940 KB |
testcase_16 | AC | 153 ms
6,940 KB |
testcase_17 | AC | 20 ms
6,940 KB |
testcase_18 | AC | 20 ms
6,940 KB |
testcase_19 | AC | 14 ms
6,940 KB |
testcase_20 | AC | 18 ms
6,944 KB |
testcase_21 | AC | 51 ms
6,940 KB |
testcase_22 | AC | 75 ms
6,944 KB |
testcase_23 | AC | 47 ms
6,944 KB |
testcase_24 | AC | 62 ms
6,940 KB |
testcase_25 | AC | 108 ms
6,944 KB |
testcase_26 | AC | 77 ms
6,944 KB |
testcase_27 | AC | 150 ms
6,944 KB |
testcase_28 | AC | 36 ms
6,944 KB |
testcase_29 | AC | 88 ms
6,940 KB |
testcase_30 | AC | 72 ms
6,944 KB |
testcase_31 | AC | 58 ms
6,944 KB |
testcase_32 | AC | 159 ms
6,940 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; #define all(a) a.begin(),a.end() #define pb push_back #define sz(a) ((int)a.size()) using ll=long long; using u32=unsigned int; using u64=unsigned long long; using i128=__int128; using u128=unsigned __int128; using f128=__float128; using pii=pair<int,int>; using pll=pair<ll,ll>; template<typename T> using vc=vector<T>; template<typename T> using vvc=vc<vc<T>>; template<typename T> using vvvc=vc<vvc<T>>; using vi=vc<int>; using vll=vc<ll>; using vvi=vc<vi>; using vvll=vc<vll>; #define vv(type,name,n,...) \ vector<vector<type>> name(n,vector<type>(__VA_ARGS__)) #define vvv(type,name,n,m,...) \ vector<vector<vector<type>>> name(n,vector<vector<type>>(m,vector<type>(__VA_ARGS__))) template<typename T> using min_heap=priority_queue<T,vector<T>,greater<T>>; template<typename T> using max_heap=priority_queue<T>; // https://trap.jp/post/1224/ #define rep1(n) for(ll i=0; i<(ll)(n); ++i) #define rep2(i,n) for(ll i=0; i<(ll)(n); ++i) #define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i) #define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c)) #define cut4(a,b,c,d,e,...) e #define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__) #define per1(n) for(ll i=((ll)n)-1; i>=0; --i) #define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i) #define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i) #define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c)) #define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__) #define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s))) template<typename T, typename S> constexpr T ifloor(const T a, const S b){return a/b-(a%b&&(a^b)<0);} template<typename T, typename S> constexpr T iceil(const T a, const S b){return ifloor(a+b-1,b);} template<typename T> void sort_unique(vector<T> &vec){ sort(vec.begin(),vec.end()); vec.resize(unique(vec.begin(),vec.end())-vec.begin()); } template<typename T, typename S> constexpr bool chmin(T &a, const S b){if(a>b) return a=b,true; return false;} template<typename T, typename S> constexpr bool chmax(T &a, const S b){if(a<b) return a=b,true; return false;} template<typename T, typename S> istream& operator >> (istream& i, pair<T,S> &p){return i >> p.first >> p.second;} template<typename T, typename S> ostream& operator << (ostream& o, const pair<T,S> &p){return o << p.first << ' ' << p.second;} #ifdef i_am_noob #define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__) template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";} template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";} template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";} template<typename T> void _do(T && x) {cerr << x << endl;} template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);} #else #define bug(...) 777771449 #endif template<typename T> void print(vector<T> x){for(auto i: x) cout << i << ' ';cout << "\n";} template<typename T> void print(set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";} template<typename T> void print(unordered_set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";} template<typename T> void print(T && x) {cout << x << "\n";} template<typename T, typename... S> void print(T && x, S&&... y) {cout << x << ' ';print(y...);} template<typename T> istream& operator >> (istream& i, vector<T> &vec){for(auto &x: vec) i >> x; return i;} vvi read_graph(int n, int m, int base=1){ vvi adj(n); for(int i=0,u,v; i<m; ++i){ cin >> u >> v,u-=base,v-=base; adj[u].pb(v),adj[v].pb(u); } return adj; } vvi read_tree(int n, int base=1){return read_graph(n,n-1,base);} template<typename T, typename S> pair<T,S> operator + (const pair<T,S> &a, const pair<T,S> &b){return {a.first+b.first,a.second+b.second};} template<typename T> constexpr T inf=0; template<> constexpr int inf<int> = 0x3f3f3f3f; template<> constexpr ll inf<ll> = 0x3f3f3f3f3f3f3f3f; template<typename T> vector<T> operator += (vector<T> &a, int val){for(auto &i: a) i+=val; return a;} template<typename T> T isqrt(const T &x){T y=sqrt(x+2); while(y*y>x) y--; return y;} #define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()) #include<atcoder/all> using namespace atcoder; using mint=modint998244353; //using mint=modint1000000007; const double eps = 1e-8, pi = acos(-1); int sign(ll x) {return x == 0 ? 0 : (x > 0 ? 1 : -1);} struct Pt{ ll x,y; constexpr Pt(ll _x=0, ll _y=0):x(_x),y(_y){} Pt operator + (Pt o) {return Pt(x + o.x, y + o.y);} Pt operator - (Pt o) {return Pt(x - o.x, y - o.y);} Pt operator * (ll k) {return Pt(x * k, y * k);} Pt operator / (ll k) {return Pt (x / k, y / k);} ll operator * (Pt o) {return x * o.x + y * o.y;} ll operator ^ (Pt o) {return x * o.y - y * o.x;} bool operator < (const Pt &o) const {return x==o.x?y<o.y:x<o.x;} }; int ori(Pt o, Pt a, Pt b) {return sign((o - a) ^ (o - b));} int pos(Pt a) { return sign(a.y) == 0 ? sign(a.x) < 0 : a.y < 0; } bool cmp(Pt a, Pt b) {return pos(a) == pos(b) ? sign(a ^ b) > 0 : pos(a) < pos(b);} void PolarAngleSort(vector <Pt> &pts) { sort(all(pts), cmp); } bool operator ==(Pt a, Pt b){return a.x==b.x&&a.y==b.y;} vector <Pt> ConvexHull(vector <Pt> pt) { int n = pt.size(); sort(all(pt), [&](Pt a, Pt b) {return a.x == b.x ? a.y < b.y : a.x < b.x;}); vector <Pt> ans = {pt[0]}; for (int t : {0, 1}) { int m = ans.size(); for (int i = 1; i < n; ++i) { while (ans.size() > m && ori(ans[ans.size() - 2], ans.back(), pt[i]) <= 0) ans.pop_back(); ans.pb(pt[i]); } reverse(all(pt)); } if (ans.size() > 1) ans.pop_back(); return ans; } void ahcorz(){ vc<Pt> vec(5); vec[0]={1,0},vec[1]={-1,0},vec[2]={-1,1},vec[3]={0,1},vec[4]={1,1}; bool good[5][5]{}; rep(5) rep(j,5) good[i][j]=vec[i]*vec[j]>0; int n; cin >> n; vc<mint> p(5),dp(5); rep(5) p[i]=mint(1)/5,dp[i]=i>=2,dp[i]*=p[i]; rep(_,n-1){ vc<mint> np(5),ndp(5); rep(5){ int cnt=0; rep(j,5) if(good[i][j]) cnt++; mint tmp=mint(cnt).inv(); rep(j,5) if(good[i][j]){ np[j]+=p[i]*tmp; ndp[j]+=dp[i]*tmp; } } rep(i,2,5) ndp[i]+=np[i]; p=np,dp=ndp; } mint res; rep(5) res+=dp[i]; print(res.val()); } signed main(){ ios_base::sync_with_stdio(0),cin.tie(0); cout << fixed << setprecision(20); int t=1; //cin >> t; while(t--) ahcorz(); }