結果

問題 No.1486 ロボット
ユーザー kazuppakazuppa
提出日時 2024-12-16 08:46:39
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 5,454 bytes
コンパイル時間 12,214 ms
コンパイル使用メモリ 340,000 KB
実行使用メモリ 25,472 KB
最終ジャッジ日時 2024-12-16 08:47:18
合計ジャッジ時間 39,340 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2 TLE * 1
other AC * 12 TLE * 5
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,a,b) for(it i=(it)(a);i<=(it)b;i++)
#define irep(i,a,b) for(int i=(int)(a);i<=(int)b;i++)
#define nrep(i,a,b) for(it i=(it)(a);i>=(it)b;i--)
#define inrep(i,a,b) for(int i=(int)(a);i>=(int)b;i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define moda 998244353LL
#define modb 1000000007LL
#define modc 968244353LL
#define dai 2500000000000000000LL
#define sho -dai
#define aoi 1e+18
#define tyu 2500000000
#define giri 1000000000
#define en 3.14159265358979
#define eps 1e-14
#define endl '\n'
#define yn(x) cout<<(x?"Yes\n":"No\n");
#define YN(x) cout<<(x?"YES\n":"NO\n");
#define ci(x) cin>>x;
#define fi(x) cout<<fixed<<setprecision(x);
using it=long long;
using itn=int;
using un=unsigned long long;
using db=long double;
using st=string;
using ch=char;
using bo=bool;
using P=pair<it,it>;
using ip=pair<int,int>;
using vi=vector<it>;
using ivi=vector<int>;
using vd=vector<db>;
using vs=vector<st>;
using vc=vector<ch>;
using vb=vector<bo>;
using vp=vector<P>;
using ivp=vector<ip>;
using sp=set<P>;
using isp=set<ip>;
using ss=set<st>;
using sca=set<ch>;
using si=set<it>;
using isi=set<int>;
using svi=set<vi>;
using vvi=vector<vi>;
using ivvi=vector<ivi>;
using vvd=vector<vd>;
using vvs=vector<vs>;
using vvb=vector<vb>;
using vvc=vector<vc>;
using vvp=vector<vp>;
using ivvp=vector<ivp>;
using vsi=vector<si>;
using ivsi=vector<isi>;
using vsp=vector<sp>;
using ivsp=vector<isp>;
using vvsi=vector<vsi>;
using ivvsi=vector<ivsi>;
using vvsp=vector<vsp>;
using ivvsp=vector<ivsp>;
using vvvi=vector<vvi>;
using ivvvi=vector<ivvi>;
using vvvd=vector<vvd>;
using vvvb=vector<vvb>;
using ivvvp=vector<ivvp>;
using vvvvi=vector<vvvi>;
using ivvvvi=vector<ivvvi>;
using vvvvd=vector<vvvd>;
const it dx[4]={0,1,0,-1};
const it dy[4]={1,0,-1,0};
st abc="abcdefghijklmnopqrstuvwxyz";
st ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
st num="0123456789";
st mb="xo";
st MB="XO";
#include <atcoder/all>
using namespace atcoder;
using mints=modint998244353;
using mint=modint;
using minto=modint1000000007;
using vm=vector<mint>;
using vms=vector<mints>;
using vmo=vector<minto>;
using vvm=vector<vm>;
using vvms=vector<vms>;
using vvmo=vector<vmo>;
using vvvm=vector<vvm>;
using vvvms=vector<vvms>;
using vvvmo=vector<vvmo>;
using vvvvm=vector<vvvm>;
using vvvvms=vector<vvvms>;
using vvvvmo=vector<vvvmo>;
using vvvvvm=vector<vvvvm>;
using vvvvvms=vector<vvvvms>;
using vvvvvmo=vector<vvvvmo>;
using vvvvvvm=vector<vvvvvm>;
using vvvvvvms=vector<vvvvvms>;
using vvvvvvmo=vector<vvvvvmo>;
template<typename T>
void scan(vector<T> &a){
rep(i,0,a.size()-1)cin>>a[i];
}
template<typename T>
void scan(vector<T> &a,vector<T>&b){
rep(i,0,a.size()-1)cin>>a[i]>>b[i];
}
template<typename T>
void scan(vector<pair<T,T>> &a){
rep(i,0,a.size()-1)cin>>a[i].first>>a[i].second;
}
template<typename T>
void dec(vector<T> &a){
rep(i,0,a.size()-1)a[i]--;
}
it gcda(it a,it b){
if(!a||!b){
return max(a,b);
}
while(a%b&&b%a){
if(a>b)a%=b;
else b%=a;
}
return min(a,b);
}
it lcma(it a,it b){
return a/gcda(a,b)*b;
}
const it MOD=modb;
vi fact,fact_inv,inv;
/* init_nCk :
:O(n)
*/
void init_nCk(int SIZE){
fact.resize(SIZE+5);
fact_inv.resize(SIZE+5);
inv.resize(SIZE+5);
fact[0]=fact[1]=1;
fact_inv[0]=fact_inv[1]=1;
inv[1]=1;
rep(i,2,SIZE+4){
fact[i]=fact[i-1]*i%MOD;
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
fact_inv[i]=fact_inv[i-1]*inv[i]%MOD;
}
}
/* nCk :MOD( int_nCk )
:O(1)
*/
it nCk(int n, int k){
assert(!(n<k));
assert(!(n<0||k<0));
return fact[n]*(fact_inv[k]*fact_inv[n-k]%MOD)%MOD;
}
/*
struct nod{
it val;
int siz;
nod(it v=0,int s=0):val(v),siz(s){}
};
nod op(nod a,nod b){return nod(a.val+b.val,a.siz+b.siz);}
nod e(){return nod(0,0);}
struct act{
it a;
act(it e=0):a(e){}
};
nod mapping(act f,nod x){return nod(f.a+x.val,x.siz);}
act comp(act f,act g){return act(f.a+g.a);}
act id(){return act(0);}*/
ivsi g(200000);
ivi haba(int n){
ivi dist(n,-1);
queue<int> que;
irep(i,0,n-1)
if(g[i].size()==1){
dist[i]=0;
que.push(i);
}
while(que.size()){
int u=que.front();que.pop();
for(int i:g[u]){
if(dist[i]==-1){
dist[i]=dist[u]+1;
que.push(i);
}
}
}
return dist;
}
ivi haba(int n,int s){
ivi dist(n,-1);
dist[s]=0;
queue<int> que;
que.push(s);
while(que.size()){
int u=que.front();que.pop();
for(int i:g[u]){
if(dist[i]==-1){
dist[i]=dist[u]+1;
que.push(i);
}
}
}
return dist;
}
int tyo(int n){
int o=0;
irep(i,0,n-1)
if(g[i].size()){
o=i;
break;
}
ivi fir=haba(n,o);
int s=0;
rep(i,1,n-1)
if(fir[s]<fir[i])s=i;
ivi sec=haba(n,s);
int t=0;
rep(i,1,n-1)
if(sec[t]<sec[i])t=i;
return sec[t];
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
fi(20);
int a,b,c,d,e;cin>>a>>b>>c>>d>>e;
int f=(a+b)*(c+d);
vb ok(f);
irep(i,0,f-1)
ok[i]=(i%(a+b)<a&&i%(c+d)<c);
int ans=0,now=0;
irep(i,0,e-1){
ans+=ok[now];
now++;
if(now>=f)now-=f;
}
cout<<ans<<endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0