QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#662764 | #9408. Hero of the Kingdom | TheShuMo# | WA | 1ms | 3764kb | C++14 | 2.1kb | 2024-10-21 10:10:37 | 2024-10-21 10:10:37 |
Judging History
answer
#include<bits/stdc++.h>
#define fo(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
#define rep(i,l,r) for(ll i(l),i##end(r);i<=i##end;++i)
#define per(i,r,l) for(ll i(r),i##end(l);i>=i##end;--i)
#define dbg(x) cerr<<#x<<" "<<x<<'\n';
#define ll __int128
#define gc getchar
#define pc putchar
using namespace std;
namespace WrongIO
{
#define Ts template<typename Ty,typename... Ar>
#define Tp template<typename Ty>
Tp Ty wmax(Ty a,Ty b){return a>=b? a:b;}
Tp Ty wmin(Ty a,Ty b){return a<=b? a:b;}
Tp void read(Ty &x){x=0;Ty opt=1;char c=gc();while(!isdigit(c)&&c!='-')c=gc();if(c=='-')opt=-1,c=gc();while(isdigit(c))x=(x<<3)+(x<<1),x+=c-'0',c=gc();x*=opt;return;}
Tp void write(Ty x){short OI_USE[150],OI_top=0;if(x<=0) if(x==0)pc('0');else pc('-'),x*=-1;while(x)OI_USE[++OI_top]=x%10,x/=10;while(OI_top--)pc(OI_USE[OI_top+1]+'0');return;}
void writec(char c[]){int len=strlen(c);for(int i=0;i<len;i++)pc(c[i]);}
void writes(string s){int len=s.length();for(int i=0;i<len;i++)pc(s[i]);}
void readc(char &c,int l,int r){c=gc(); while(c!=EOF&&(c<l||c>r)) c=gc();}
void readc(char &c,char val){c=gc();while(c!=EOF&&c!=val) c=gc();}
void readc(char val){char c;c=gc();while(c!=EOF&&c!=val) c=gc();}
void readls(string &s){char c=gc();while(c!='\n') s.push_back(c),c=gc();}
Ts void read(Ty &x,Ar &...y) {read(x),read(y...);}
Tp void writeln(Ty x) {write(x),pc('\n');}
Tp void writesp(Ty x) {write(x),pc(' ');}
#undef Ts
#undef Tp
} using namespace WrongIO;
ll T;
ll p,a,b,q,c,d,m,t;
void solve()
{
read(p,a,b,q,c,d,m,t);
while(t)
{
ll num=m/p;
if(num==0) break;
ll k=(p-m%p)/(q-p)/num;
if((p-m%p)%((q-p)*num)!=0) k++;
if(t>=k*(num*(a+c)+b+d))
{
t-=k*(num*(a+c)+b+d);
m+=k*num*(q-p);
}else{
t-=b+d;
ll ksk=(t/(a+c)); if(ksk<0) ksk=0;
m+=(q-p)*ksk;
break;
}
// if(m/p==0) break;
// t-=b+d;
// if(t<=0) break;
// if(t>=(m/p)*(a+c))
// {
// t-=(m/p)*(a+c);
// m+=(q-p)*(m/p);
// }
// else
// {
// ll ksk=t/(a+c);
// m+=ksk*(q-p);
// break;
// }
}
writeln(m);
}
int main()
{
read(T);
while(T--) solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
input:
3 5 2 3 8 1 5 14 36 5 2 0 8 1 3 17 6 100 1 0 10000 1 0 99 100000
output:
32 20 99
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3764kb
input:
500 252 34074578 3386884 628907 1207868 18 279 125908043 17268783 50414369 277106 17532337 45 0 17268784 4606 5506 3465964 19 5543 4786900 7 8109756 50825 23718927 66546966 0 23718931 96 0 117090491 99433206 537909 33389755 4 537910 1362118 0 538731 3 47 117 17333 1724743 7699 402536 79710763 684241...
output:
1886244 17268784 8109756 117090495 538731 136625731 586 25929035 17864 7905961573 38782804 670869825 16651 88588674 4502 7887 6379706119 1070452 135039489 495166 324797075 156 598405696216 53895 3503164 4727693 124349483 3764139838369 2840566939118 85930522 4319452 996195 54156125533 32693 216299285...
result:
wrong answer 13th lines differ - expected: '16635', found: '16651'