結果
問題 | No.984 Inversion |
ユーザー |
![]() |
提出日時 | 2020-02-11 14:32:50 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 13 ms / 2,000 ms |
コード長 | 3,930 bytes |
コンパイル時間 | 3,617 ms |
コンパイル使用メモリ | 290,800 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-01 07:40:46 |
合計ジャッジ時間 | 4,626 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 24 |
コンパイルメッセージ
main.cpp:50:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 50 | inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;} | ^~~~ main.cpp:50:33: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 50 | inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;} | ^~~~ main.cpp:51:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 51 | inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;} | ^~~~ main.cpp:51:33: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 51 | inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;} | ^~~~
ソースコード
// #pragma GCC optimize("Ofast","unroll-loops")// #pragma GCC push_options// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")#include<bits/stdc++.h>#include <xmmintrin.h>#include <immintrin.h>using namespace::std;__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}#include<ext/pb_ds/assoc_container.hpp>#include<ext/pb_ds/tree_policy.hpp>#include <ext/pb_ds/priority_queue.hpp>#include<ext/pb_ds/tag_and_trait.hpp>// #include <boost/multiprecision/cpp_dec_float.hpp>// #include <boost/multiprecision/cpp_int.hpp>// namespace mp = boost::multiprecision;// typedef mp::number<mp::cpp_dec_float<0>> cdouble;// typedef mp::cpp_int cint;template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;typedef long long lint;#define INF (1LL<<60)#define IINF (1<<30)#define EPS (1e-10)#define MOD 1000000007LL//#define MOD 998244353LLtypedef vector<lint> vec;typedef vector<vector<lint>> mat;typedef vector<vector<vector<lint>>> mat3;typedef vector<string> svec;typedef vector<vector<string>> smat;template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}template<typename T>inline void output2(T t){for(auto i:t)output(i);}template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}#define rep(i,n) for(lint i=0;i<lint(n);++i)#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)#define irep(i) for(lint i=0;;++i)#define all(n) begin(n),end(n)#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}const vector<lint> dx={1,0,-1,0,1,1,-1,-1};const vector<lint> dy={0,1,0,-1,1,-1,1,-1};#define SUM(v) accumulate(all(v),0LL)//auto call=[&](auto f,auto... args){return f(f,args...);};int64_t mod_log(int64_t a, int64_t b, int64_t p) {int64_t g = 1;for(int64_t i = p; i; i /= 2) (g *= a) %= p;g = __gcd(g, p);int64_t t = 1, c = 0;for(; t % g; c++) {if(t == b) return c;(t *= a) %= p;}if(b % g) return -1;t /= g;b /= g;int64_t n = p / g, h = 0, gs = 1;for(; h * h < n; h++) (gs *= a) %= n;unordered_map< int64_t, int64_t > bs;for(int64_t s = 0, e = b; s < h; bs[e] = ++s) {(e *= a) %= n;}for(int64_t s = 0, e = t; s < n;) {(e *= gs) %= n;s += h;if(bs.count(e)) return c + s - bs[e];}return -1;}lint mod_pow(lint x,lint y,lint mod){lint ret=1;while(y>0) {if(y&1)(ret*=x)%=mod;(x*=x)%=mod;y>>=1;}return ret;}int main(){lint p,n;cin>>p>>n;lint d=mod_log(n,mod_pow(n,p-2,p),p)+1;if(n==1){cout<<0<<endl;return 0;}cout<<(p+1+(p-1)/d)%2<<endl;}