QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#237241 | #6836. A Plus B Problem | Andy# | AC ✓ | 1050ms | 44284kb | C++17 | 2.2kb | 2023-11-04 13:35:40 | 2023-11-04 13:35:41 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline int read(){
char c=getchar();
int f=1,x=0;
for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
for(;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
return f*x;
}
const int N=1e6+5;
char s[N];
int n,q;
int num[4][N];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>q;
cin>>s+1;
for(int i=1;i<=n;i++)
num[1][i]=s[i]-'0';
cin>>s+1;
for(int i=1;i<=n;i++)
num[2][i]=s[i]-'0';
int res=0;
set<int> v;
for(int i=n;i>=1;i--)
{
if(num[2][i]+num[1][i]!=9)
v.insert(i);
if(num[1][i]+num[2][i]+res>=10)
{
num[3][i]=(num[1][i]+num[2][i]+res)%10;
res=1;
}
else
{
num[3][i]=num[1][i]+num[2][i]+res;
res=0;
}
//cout<<num[3][i]<<' ';
}
v.insert(0);
int r,c,d;
int ans=0;
while(q--)
{
cin>>r>>c>>d;
auto u=v.upper_bound(c);
int flag=0;
if(u==v.end());
else
{
if(num[1][*u]+num[2][*u]>9)flag=1;
}
if(num[r][c]==d)
{
cout<<(num[1][c]+num[2][c]+flag)%10<<" 0\n";
continue;
}
if(num[1][c]+num[2][c]+flag<=9)
{
if(num[3-r][c]+d+flag<=9)
{
num[3][c]=num[3-r][c]+d+flag;
num[r][c]=d;
cout<<num[3][c]<<" 2\n";
if(num[1][c]+num[2][c]==9)v.erase(c);
else v.insert(c);
continue;
}
else
{
ans=2;
//cout<<num[3-r][c]<<' '<<d<<endl;
num[3][c]=(num[3-r][c]+d+flag)%10;
num[r][c]=d;
if(num[1][c]+num[2][c]==9)v.erase(c);
else v.insert(c);
auto bef=v.lower_bound(c);
bef--;
if(*bef)
ans+=c-*bef;
else ans+=c-*bef-1;
cout<<num[3][c]<<' '<<ans<<'\n';
continue;
}
}
else
{
if(num[3-r][c]+d+flag<=9)
{
ans=2;
num[3][c]=num[3-r][c]+d+flag;
num[r][c]=d;
if(num[1][c]+num[2][c]==9)
v.erase(c);
else v.insert(c);
auto bef=v.lower_bound(c);
bef--;
if(*bef)
ans+=c-*bef;
else ans+=c-*bef-1;
cout<<num[3][c]<<' '<<ans<<'\n';
continue;
}
else
{
ans=2;
num[3][c]=(num[3-r][c]+d+flag)%10;
num[r][c]=d;
if(num[1][c]+num[2][c]==9)v.erase(c);
else v.insert(c);
cout<<num[3][c]<<' '<<ans<<'\n';
}
}
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 11624kb
input:
5 5 01234 56789 2 1 0 2 2 1 2 3 2 2 4 3 2 5 4
output:
0 2 3 2 5 3 7 3 8 3
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 9556kb
input:
1 1 1 1 1 1 9
output:
0 2
result:
ok single line: '0 2'
Test #3:
score: 0
Accepted
time: 206ms
memory: 9676kb
input:
10 1000000 6869373857 3130626142 1 9 2 1 10 0 2 7 6 1 1 0 1 7 6 2 10 4 2 3 9 2 4 2 2 4 4 2 7 0 1 2 4 1 9 8 1 3 7 1 7 1 1 1 5 2 1 6 1 3 5 2 5 8 2 6 5 1 6 3 1 3 8 2 4 2 2 6 3 2 2 6 1 10 9 2 1 1 2 5 4 1 1 8 2 4 0 1 9 1 1 1 8 2 4 2 2 9 2 1 10 3 1 8 9 1 4 6 2 3 0 1 1 6 1 7 1 1 10 9 2 4 4 2 5 9 2 1 8 1 9 ...
output:
6 2 2 2 9 0 3 2 2 8 4 2 6 2 2 2 4 2 6 5 6 3 2 4 7 2 2 2 8 2 1 2 5 2 1 3 2 3 8 3 8 2 2 2 6 2 1 3 3 3 7 2 7 3 0 2 9 3 6 4 0 0 1 3 4 2 7 3 0 3 8 3 8 3 8 2 2 0 3 3 0 3 2 3 5 2 9 2 4 2 8 2 3 3 5 3 3 2 5 0 4 2 3 2 1 2 4 2 7 3 0 2 5 2 6 2 0 3 4 2 4 2 3 2 5 3 6 3 3 0 8 2 9 3 9 3 1 2 1 4 7 2 5 2 5 2 4 0 0 2 ...
result:
ok 1000000 lines
Test #4:
score: 0
Accepted
time: 199ms
memory: 9628kb
input:
10 1000000 8702774998 9088637390 1 3 3 2 4 7 1 4 0 1 6 7 1 1 1 1 4 0 2 3 8 1 7 7 2 4 5 2 4 2 1 8 2 2 6 7 1 1 2 1 1 4 1 10 3 1 2 3 1 2 5 1 4 8 1 6 5 1 9 8 1 1 9 1 2 1 1 8 5 1 8 3 1 7 1 1 9 7 1 10 7 1 8 5 1 5 1 2 6 4 1 6 1 2 10 2 1 10 5 2 10 1 1 9 3 2 2 0 1 1 0 1 6 6 2 2 5 2 4 4 2 5 6 2 7 4 1 2 5 2 4 ...
output:
2 3 0 2 8 3 1 0 0 2 8 0 1 0 5 2 6 2 3 2 6 3 5 2 1 2 3 2 3 2 4 2 6 2 1 3 3 2 7 2 8 2 2 2 9 2 7 2 8 3 6 2 7 2 9 2 8 3 9 3 5 2 9 2 7 2 6 2 2 2 2 0 9 2 0 3 7 2 2 2 8 0 5 2 1 3 0 2 2 3 3 2 0 2 3 3 2 2 0 2 2 0 5 2 1 2 3 2 4 3 6 0 6 2 2 2 1 2 6 3 0 2 7 2 7 3 4 0 3 2 8 2 3 2 4 0 8 3 8 2 4 2 5 2 5 2 5 2 7 2 ...
result:
ok 1000000 lines
Test #5:
score: 0
Accepted
time: 184ms
memory: 11592kb
input:
10 1000000 6869373857 3130626142 1 3 2 1 8 6 1 8 8 1 3 6 1 1 6 1 1 6 2 5 3 2 5 6 2 4 2 2 5 7 2 5 6 2 4 0 2 5 0 2 5 6 1 3 7 1 3 6 2 7 0 2 1 6 2 1 3 2 7 6 2 5 8 2 6 6 2 5 2 2 5 8 2 3 3 2 2 1 2 2 1 2 3 3 2 4 0 2 5 4 2 5 8 2 4 0 2 6 2 2 1 2 2 1 3 1 1 8 2 3 9 2 3 3 1 1 6 2 5 6 2 7 7 1 4 6 1 1 2 1 1 6 1 4...
output:
5 2 7 2 9 2 9 2 9 0 9 0 6 2 9 2 1 5 0 3 9 3 9 5 3 2 9 2 0 4 9 4 3 2 2 2 9 2 9 2 1 6 3 3 6 6 2 6 0 0 0 0 0 0 0 0 0 0 8 6 2 6 0 0 9 3 9 2 0 2 2 2 6 2 0 2 0 2 9 6 0 8 7 5 5 2 9 2 0 5 9 8 5 2 3 5 5 2 9 2 9 5 9 2 8 2 9 2 7 2 9 2 3 10 8 3 0 3 9 10 8 2 5 2 2 4 6 2 4 4 6 3 3 3 9 3 3 2 5 4 7 2 6 2 8 2 1 3 9 ...
result:
ok 1000000 lines
Test #6:
score: 0
Accepted
time: 231ms
memory: 11608kb
input:
10 1000000 6869373857 3130626142 1 9 6 1 9 5 1 10 8 1 10 7 2 7 8 2 7 6 1 6 8 1 6 7 1 7 8 1 7 3 2 10 4 2 10 2 2 8 3 2 8 1 2 9 7 2 9 4 2 9 9 2 9 4 2 7 7 2 7 6 1 7 4 1 7 3 1 9 6 1 9 5 1 8 9 1 8 8 1 7 5 1 7 3 1 6 9 1 6 7 2 6 8 2 6 2 1 8 9 1 8 8 2 10 6 2 10 2 2 6 9 2 6 2 1 6 9 1 6 7 1 8 9 1 8 8 2 9 7 2 9...
output:
0 10 9 10 0 11 9 11 1 8 9 8 0 7 9 7 4 8 9 8 1 11 9 11 1 9 9 9 2 10 9 10 4 10 9 10 0 8 9 8 0 8 9 8 0 10 9 10 0 9 9 9 1 8 9 8 1 7 9 7 5 7 9 7 0 9 9 9 3 11 9 11 6 7 9 7 1 7 9 7 0 9 9 9 2 10 9 10 2 7 9 7 1 8 9 8 1 11 9 11 4 7 9 7 5 11 9 11 0 7 9 7 0 10 9 10 1 10 9 10 0 7 9 7 2 10 9 10 2 10 9 10 1 11 9 1...
result:
ok 1000000 lines
Test #7:
score: 0
Accepted
time: 926ms
memory: 44284kb
input:
1000000 1000000 68693738574822907668000669943297325347608140886272616051068251483556534289323531160993017440087302814083329820936792365202060610991343493080865626095241885616863256382251749215319751373247876361270911203617554820406029584474249635378527788208607403822974202545637490373196507887743784...
output:
4 2 6 2 4 2 5 2 7 97772 8 2 0 140233 6 2 5 2 1 2 1 70008 8 2 1 987 0 138405 5 2 6 138113 1 121002 2 35285 4 2 0 2 3 25467 5 2 8 2 4 5543 6 2 1 3862 8 2 3 107304 6 81700 0 0 2 2 0 0 0 15551 5 14120 3 4872 7 2 0 0 6 58933 6 2 9 7954 4 2 4 2 3 63166 0 0 8 38562 1 349 6 10624 3 2 3 2 4 2 8 65159 4 21435...
result:
ok 1000000 lines
Test #8:
score: 0
Accepted
time: 1050ms
memory: 43248kb
input:
1000000 1000000 61693798575862907668150369943297325385708140884272416052068257423550554279326571150943024493087202814853321120702792765522060610138341594081829639894344885616853227782222149213319781393275876306231911209117574815406667384452247691376587753208747407802994802745837490373194507888042646...
output:
9 6 6 4 0 3 0 2 6 2 4 2 9 3 2 3 1 6 3 2 2 2 9 4 0 5 4 2 9 4 0 2 9 3 9 2 6 2 8 0 7 3 8 5 0 0 4 4 9 3 9 3 0 3 4 3 9 2 5 2 9 3 0 0 6 3 1 7 0 3 9 0 0 0 9 2 3 2 0 2 9 3 5 2 6 0 1 2 5 2 9 3 2 0 1 2 9 9 0 3 3 6 9 0 9 3 1 5 0 0 9 2 8 3 0 3 0 2 0 3 1 2 9 2 9 3 0 2 6 3 0 3 9 2 9 2 0 3 3 2 0 3 0 4 6 2 0 2 6 3 ...
result:
ok 1000000 lines
Test #9:
score: 0
Accepted
time: 345ms
memory: 17660kb
input:
1000000 1000000 68693738574822907668000669943297325347608140886272616051068251483556534289323531160993017440087302814083329820936792365202060610991343493080865626095241885616863256382251749215319751373247876361270911203617554820406029584474249635378527788208607403822974202545637490373196507887743784...
output:
3 958194 6 349300 6 259789 4 2 1 77093 6 2 9 2 8 2 9 2 5 133811 5 2 0 8254 9 0 9 0 9 8254 9 2 4 5608 4 2 3 328452 6 97720 7 8629 0 0 7 13938 9 113207 0 113207 4 2 0 0 4 2 9 2 1 2 6 2 9 2 0 2 0 0 1 2 0 2 0 2 4 2808 9 2808 0 13938 2 206652 0 206652 9 115835 0 115835 0 0 2 2 9 2 2 2 3 2 0 2 0 2 9 8629 ...
result:
ok 1000000 lines
Test #10:
score: 0
Accepted
time: 244ms
memory: 16228kb
input:
1000000 1000000 68693738574822907668000669943297325347608140886272616051068251483556534289323531160993017440087302814083329820936792365202060610991343493080865626095241885616863256382251749215319751373247876361270911203617554820406029584474249635378527788208607403822974202545637490373196507887743784...
output:
0 832279 9 832279 9 0 9 0 0 754544 9 754544 1 609087 9 609087 4 930049 9 930049 0 809411 9 809411 0 749318 9 749318 0 582458 9 582458 9 0 9 0 0 868657 9 868657 9 0 9 0 2 707359 9 707359 1 869642 9 869642 0 568452 9 568452 0 735732 9 735732 2 568160 9 568160 0 551049 9 551049 1 535285 9 535285 0 8651...
result:
ok 1000000 lines