Submission #61362663
Source Code Expand
Copy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define re register
#define il inline
#define pii pair<int,int>
#define x first
#define y second
#define gc getchar()
#define rd read()
#define debug() puts("------------")
namespace yzqwq{
il int read(){
int x=0,f=1;char ch=gc;
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc;}
while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=gc;
return x*f;
}
il int qmi(int a,int b,int p){
int ans=1;
while(b){
if(b&1) ans=ans*a%p;
a=a*a%p,b>>=1;
}
return ans;
}
il int gcd(int a,int b){
if(!b) return a;
return gcd(b,a%b);
}
il int lcm(int a,int b){
return a/gcd(a,b)*b;
}
il void exgcd(int a,int b,int &x,int &y){
if(!b) return x=1,y=0,void(0);
exgcd(b,a%b,x,y);
int t=x;
x=y,y=t-a/b*x;
return ;
}
il int F(int n,int a,int b,int c){
//sum{|_ (ai+b)/c _| i:0~n}
if(!n) return b/c;
if(!a) return (n+1)*(b/c);
if(a>=c||b>=c){
int x=a/b,y=b/c;
return n*(n+1)/2*x+(n+1)*y+F(n,a%c,b%c,c);
}
int m=(a*n+b)/c;
return n*m+F(m-1,c,c-b+1,a);
}
struct lb{
int d[64];
il void print(){
for(re int i=0;i<63;++i)
if(d[i]) printf("%lld:%lld\n",i,d[i]);
return ;
}
lb(){memset(d,0,sizeof(d));}
il void operator +=(int x){
for(re int i=62;i>=0;--i){
if(!(x&(1ll<<i))) continue;
if(d[i]) x^=d[i];
else return d[i]=x,void(0);
}
return ;
}
int& operator [](int x){
return d[x];
}
il void operator +=(lb &x){
for(re int i=62;i>=0;--i)
if(x[i]) *this+=x[i];
return ;
}
il friend lb operator +(lb &x,lb &y){
lb z=x;
for(re int i=62;i>=0;--i)
if(y[i]) z+=y[i];
return z;
}
il int Max_calc(){
int ans=0;
for(re int i=62;i>=0;--i)
if((ans^d[i])>ans) ans^=d[i];
return ans;
}
};
mt19937 rnd(time(0));
}
using namespace yzqwq;
il void solve(){
int a=rd,b=rd;cout<<(a+b)*(a+b);
return ;
}
signed main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int t=1;while(t--)
solve();
return 0;
}
Submission Info
Submission Time
2025-01-04 12:00:24
Task
A - Happy New Year 2025
User
fzitb7912
Language
C++ 20 (gcc 12.2)
Score
100
Code Size
2625 Byte
Status
AC
Exec Time
1 ms
Memory
3664 KB
Compile Error
Main.cpp: In member function ‘void yzqwq::lb::print()’:
Main.cpp:56:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
56 | for(re int i=0;i<63;++i)
| ^
Main.cpp: In member function ‘void yzqwq::lb::operator+=(long long int)’:
Main.cpp:62:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
62 | for(re int i=62;i>=0;--i){
| ^
Main.cpp: In member function ‘void yzqwq::lb::operator+=(yzqwq::lb&)’:
Main.cpp:73:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
73 | for(re int i=62;i>=0;--i)
| ^
Main.cpp: In function ‘yzqwq::lb yzqwq::operator+(lb&, lb&)’:
Main.cpp:79:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
79 | for(re int i=62;i>=0;--i)
| ^
Main.cpp: In member function ‘long long int yzqwq::lb::Max_calc()’:
Main.cpp:85:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
85 | for(re int i=62;i>=0;--i)
| ^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
100 / 100
Status
Set Name
Test Cases
Sample
00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All
00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 02_handmade_00.txt, 02_handmade_01.txt, 02_handmade_02.txt, 02_handmade_03.txt
Case Name
Status
Exec Time
Memory
00_sample_00.txt
AC
1 ms
3584 KB
00_sample_01.txt
AC
1 ms
3536 KB
00_sample_02.txt
AC
1 ms
3468 KB
00_sample_03.txt
AC
1 ms
3548 KB
01_random_00.txt
AC
1 ms
3656 KB
01_random_01.txt
AC
1 ms
3548 KB
01_random_02.txt
AC
1 ms
3568 KB
01_random_03.txt
AC
1 ms
3664 KB
01_random_04.txt
AC
1 ms
3588 KB
01_random_05.txt
AC
1 ms
3536 KB
01_random_06.txt
AC
1 ms
3572 KB
02_handmade_00.txt
AC
1 ms
3544 KB
02_handmade_01.txt
AC
1 ms
3544 KB
02_handmade_02.txt
AC
1 ms
3468 KB
02_handmade_03.txt
AC
1 ms
3544 KB