QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#647954 | #6836. A Plus B Problem | N_z_ | AC ✓ | 882ms | 31860kb | C++23 | 6.8kb | 2024-10-17 16:20:24 | 2024-10-17 16:20:29 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
struct time_helper{
#ifdef LOCAL
clock_t time_last;time_helper(){time_last=clock();}void test(){auto time_now=clock();std::cerr<<"time:"<<1.*(time_now-time_last)/CLOCKS_PER_SEC<<";all_time:"<<1.*time_now/CLOCKS_PER_SEC<<std::endl;time_last=time_now;}~time_helper(){test();}
#else
void test(){}
#endif
}time_helper;
#ifdef LOCAL
#include"dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
int print_precision=10;bool print_T_endl=1;char print_between=' ';
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader;struct Writer;template<size_t id>struct read_tuple{template<typename...T>static void read(Reader&stream,std::tuple<T...>&x){read_tuple<id-1>::read(stream,x);stream>>get<id-1>(x);}};template<>struct read_tuple<0>{template<typename...T>static void read([[maybe_unused]]Reader&stream,[[maybe_unused]]std::tuple<T...>&x){}};template<size_t id>struct print_tuple{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){print_tuple<id-1>::print(stream,x);putchar(print_between);stream<<get<id-1>(x);}};template<>struct print_tuple<1>{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){stream<<get<0>(x);}};template<>struct print_tuple<0>{template<typename...T>static void print([[maybe_unused]]Writer&stream,[[maybe_unused]]const std::tuple<T...>&x){}};
struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename...T>Reader&operator>>(std::tuple<T...>&x){read_tuple<sizeof...(T)>::read(*this,x);return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}template<typename T1,typename T2>Reader&operator>>(std::pair<T1,T2>&x){*this>>x.first>>x.second;return *this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';
struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(const T&x){for(auto q:x){*this<<q;if(!is_class<decltype(q)>::value)*this<<print_between;}if(!is_class<typename T::value_type>::value&&print_T_endl)*this<<'\n';return *this;}template<typename...T>Writer&operator<<(const std::tuple<T...>&x){print_tuple<sizeof...(T)>::print(*this,x);if(print_T_endl)*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-print_precision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<print_precision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<print_precision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(const T&c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}template<typename T1,typename T2>Writer&operator<<(const std::pair<T1,T2>&x){*this<<x.first<<print_between<<x.second;if(print_T_endl)*this<<'\n';return *this;}Writer&operator<<(const std::string&str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
template<class Fun>class y_combinator_result{Fun fun_;public:template<class T>explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}template<class ...Args>decltype(auto) operator()(Args &&...args){return fun_(std::ref(*this), std::forward<Args>(args)...);}};template<class Fun>decltype(auto) y_combinator(Fun &&fun){return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));}
void init();void solve(int tc);
main()
{
init();int t=1;
// cin>>t;
for(int tc=1;tc<=t;tc++)solve(tc);
}
void init()
{
}
void solve([[maybe_unused]]int tc)
{
int n,q;
cin>>n>>q;
string a[2];
cin>>a[0]>>a[1];
set<int>st;
a[0]='0'+a[0],a[1]='0'+a[1];
for(int x=0;x<=n;x++)
{
a[0][x]-='0',a[1][x]-='0';
if(a[0][x]+a[1][x]!=9)st.insert(x);
}
while(q--)
{
int r,c,d;
cin>>r>>c>>d;
r--;
int up=0;
auto it=st.upper_bound(c);
if(it!=st.end()&&a[0][*it]+a[1][*it]>=10)up=1;
cout<<(a[!r][c]+d+up)%10<<' ';
if(d!=a[r][c])
{
if((a[!r][c]+a[r][c]+up)/10==(a[!r][c]+d+up)/10)cout<<2<<endl;
else
{
auto it2=prev(it);
if(*it2==c)it2--;
cout<<c-*it2+1+(*it2!=0)<<endl;
}
}
else cout<<0<<endl;
st.erase(c);
a[r][c]=d;
if(a[!r][c]+a[r][c]!=9)st.insert(c);
}
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3632kb
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: 0ms
memory: 3636kb
input:
1 1 1 1 1 1 9
output:
0 2
result:
ok single line: '0 2'
Test #3:
score: 0
Accepted
time: 84ms
memory: 3752kb
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: 81ms
memory: 3992kb
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: 76ms
memory: 3768kb
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: 37ms
memory: 3696kb
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: 780ms
memory: 31780kb
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: 882ms
memory: 31860kb
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: 163ms
memory: 7356kb
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: 56ms
memory: 7144kb
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