結果
| 問題 | No.652 E869120 and TimeZone |
| ユーザー |
 asdf1
|
| 提出日時 | 2018-05-26 11:06:18 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
WA
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 5,586 bytes |
| コンパイル時間 | 1,433 ms |
| コンパイル使用メモリ | 161,280 KB |
| 実行使用メモリ | 6,948 KB |
| 最終ジャッジ日時 | 2024-06-30 07:16:01 |
| 合計ジャッジ時間 | 2,684 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 28 WA * 2 |
ソースコード
#include <bits/stdc++.h>#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)#define all(v) (v).begin(), (v).end()#define pb(q) push_back(q)#define Abs(a,b) max(a,b)-min(a,b)#define YES(condition) if(condition){cout << "YES" << endl;}else{cout << "NO" << endl;}#define Yes(condition) if(condition){cout << "Yes" << endl;}else{cout << "No" << endl;}#define Cout(x) cout<<(x)<<endl#define POSSIBLE(condition) if(condition){cout << "POSSIBLE" << endl;}else{cout << "IMPOSSIBLE" << endl;}#define Possible(condition) if(condition){cout << "Possible" << endl;}else{cout << "Impossible" << endl;}#define possible(condition) if(condition){cout << "possible" << endl;}else{cout << "impossible" << endl;}#define Size(n) (n).size()typedef long long ll;using namespace std;const int INF = 1e9,MOD = 1e9 + 7,ohara=1e6;const ll LINF = 1e18;/*---------------------------------------------------------------long long int kaizyo(long long int hh){cmp=1;while(hh>1){cmp=(cmp*hh)%MOD;hh--;}return cmp;}long long int ruizyo(long long int aa, long long int bb){if(aa==0){return 1;}else if(aa%2==0){long long int tt=ruizyo(aa/2,bb);return (tt*tt)%MOD;}else{return (ruizyo(aa-1,bb)*bb)%MOD;}}フェルマ－のア---------------------------------------------------------------while(x!=0){sum+=x%10;/ x/=10;}各桁の和---------------------------------------------------------------pair<int,int> p[100000];cin >> tmp;p[i]=make_pair(tmp,i);cout << p[i].second+1 << endl;//ペアの右側つまりiを出力---------------------------------------------------------------bool f[100001];//1000000以下の素数を調べよう！rrep(i,2,100001){f[i]=false;}rrep(i,2,100001){if(!f[i]){for(int j=i+i;j<=100000;j+=i){f[j]=true;}}}for(int i=3;i<=100000;i+=2){if(!f[i]){c[i]++;}}---------------------------------------------------------------long long gcd(long long aaa,long long bbb){if(bbb==0){return aaa;}return gcd(bbb,aaa%bbb);}long long lcm(long long aaa,long long bbb){long long g = gcd(aaa,bbb);return aaa/g * bbb;}左から最大公約数と最小公倍数---------------------------------------------------------------long long int prime_cnt[10000];for(int i=2;i*i<=n;i++){while(n%i==0){n/=i;prime_cnt[i]+=1;}if(n>1){prime_cnt[n]+=1;break;}}ある数nを素因数分解しましょう---------------------------------------------------------------debug:cout<<"i: "<<i<<" j: "<<j<<" cnt: "<<cnt<<"\n";---------------------------------------------------------------*/long long int n,cnt=0,ans=0,a,b,c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos;int dy[]={1,0,-1,0};int dx[]={0,1,0,-1};string alph("abcdefghijklmnopqrstuvwxyz"),s;bool fl=true;struct edge{int to,cost;};//-------------------------↓↓↓↓↓↓------------------------int main(void){cin.tie(0);ios::sync_with_stdio(false);cin>>a>>b>>s;cmp=0;cmpp=0;rep(i,Size(s)){if(s[i]=='.')fl=false;}cnt=1;if(fl){rrrep(i,Size(s)-1,4){cmp+=(s[i]-'0')*cnt;cnt*=10;}if(s[3]=='-')cmp*=-1;cmp-=9;if(a+cmp<0){a=24+(a+cmp);}else if(a+cmp>=24){a=a+cmp-24;}else{a+=cmp;}if(a<=9)cout<<0;cout<<a<<':';if(b<=9)cout<<0;cout<<b<<"\n";}else{fl=true;double time,anss;// Cout(b);rrrep(i,Size(s)-1,4){if(s[i]!='.'){cmp+=(s[i]-'0')*cnt;cnt*=10;}}cmpp=cmp%10;cmp/=10;if(s[3]=='-')cmp*=-1,cmpp*=-1;time=(double)cmp+(double)cmpp/10;time-=9.0;time*=10;cmp=0;cmpp=0;cmp=(ll)time/10;time=(double)time-cmp*10;time=time*6;if(a+cmp<0){a=24+(a+cmp);}else if(a+cmp>=24){a=a+cmp-24;}else{a+=cmp;}if((double)b+time<0){anss=(double)60+(b+time);if(a-1<0){a=24-1;}else{a-=1;}}else if((double)b+time>=60){anss=b+time-60;if(a+1>=24){a=0;}else{a+=1;}}else{anss=b+time;}pos=(ll)anss;// Cout(pos);if(pos>=59){pos=b+time-60;if(a+1>=24){a=0;}else{a+=1;}if(a<=9)cout<<0;cout<<a<<':';if(pos<=9)cout<<0;cout<<pos<<"\n";return 0;}if(a<=9)cout<<0;cout<<a<<':';if(anss<=9)cout<<0;cout<<anss<<"\n";}return 0;}