結果
問題 | No.2537 多重含意 |
ユーザー | gucci0512 |
提出日時 | 2023-11-10 23:04:15 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,508 bytes |
コンパイル時間 | 4,182 ms |
コンパイル使用メモリ | 236,076 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-26 02:08:17 |
合計ジャッジ時間 | 6,122 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 3 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 | AC | 2 ms
5,376 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 2 ms
5,376 KB |
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 | - |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")// url#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=b-1;i>=a;i--)#define all(x) (x).begin(),(x).end()#define pb(x) push_back(x);template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }typedef long long ll;typedef long double lld;using namespace std;using namespace atcoder;int dx[4]={1,0,-1,0};int dy[4]={0,1,0,-1};const string zton="0123456789";const string atoz="abcdefghijklmnopqrstuvwxyz";const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";const ll inf=(1ll<<60);// const int inf=(1<<30);lld dist(lld x1,lld x2,lld y1,lld y2){lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);res=sqrt(abs(res));return res;}lld arg(lld x,lld y){const lld eps=1e-8;lld res=0;if(abs(x)+abs(y)<=eps)return 0.0;else if(abs(x)<=eps){if(y>=0.0)return (M_PI/2);else return (M_PI/2+M_PI);}else if(abs(y)<=eps){if(x>=0.0)return 0.0;else return M_PI;}res=atan2(abs(y),abs(x));if(x<=0&&y>=0)res=(M_PI-res);else if(x<=0&&y<=0)res+=(M_PI);else if(x>=0&&y<=0)res=(M_PI*2-res);return res;}ll gcd(ll a,ll b){if(a==0||b==0)return a+b;ll r;r=a%b;if(r==0){return b;}else{return gcd(b,r);}}std::ostream &operator<<(std::ostream &dest, __int128_t value) {std::ostream::sentry s(dest);if (s) {__uint128_t tmp = value < 0 ? -value : value;char buffer[128];char *d = std::end(buffer);do {--d;*d = "0123456789"[tmp % 10];tmp /= 10;} while (tmp != 0);if (value < 0) {--d;*d = '-';}int len = std::end(buffer) - d;if (dest.rdbuf()->sputn(d, len) != len) {dest.setstate(std::ios_base::badbit);}}return dest;}__int128 parse128(string &s) {__int128 ret = 0;for (int i = 0; i < s.length(); i++){if ('0' <= s[i] && s[i] <= '9'){ret = 10 * ret + s[i] - '0';}}return ret;}using l3 = __int128;bool comp_arg(pair<ll,ll> a,pair<ll,ll> b){if(a.second>=0&&b.second<0)return true;else if(a.second<0&&b.second>=0)return false;if(a.second>=0&&b.second>=0){if(a.first>=0&&b.first<0)return true;}else{if(a.first>=0&&b.first<0)return false;}ll det=a.first*b.second-a.second*b.first;if(det>0)return true;return false;}typedef pair<ll,int> P;using mint = modint;int main(void){ios::sync_with_stdio(false);cin.tie(nullptr);int N,B;cin >> N >> B;mint::set_mod(B);int A[N];rep(i,0,N){cin >> A[i];A[i]--;}mint power2[N+1];power2[0]=1;rep(i,1,N+1)power2[i]=power2[i-1]*2;vector<mint> ans;bool used[N];rep(i,0,N)used[i]=false;ans.pb(power2[N-1]);used[A[0]]=true;bool flag=false;rep(i,0,N-1){if(used[A[i+1]]){flag=true;}if(flag){ans.pb(power2[N]);}else{ans.pb(power2[N]-power2[i]);}used[A[i+1]]=true;}for(auto x:ans){cout << x.val() << endl;}}