QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#322939 | #8177. Sum is Integer | ucup-team134# | WA | 626ms | 57896kb | C++14 | 2.3kb | 2024-02-08 00:50:29 | 2024-02-08 00:50:30 |
Judging History
answer
#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;
int mod;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}
const int maxn=2e5+10;
const int nmods=4;/// must be even
int mods[nmods]={998244353,(int)1e9+7,(int)1e9+9,993192119};
/*const int nmods=2;/// must be even
int mods[nmods]={998244353,(int)1e9+7};*/
struct pt{
int a[nmods];
pt(){memset(a,0,sizeof(a));}
pt(int p,int q){
for(int i=0;i<nmods;i++){
mod=mods[i];
a[i]=mul(p,invv(q));
}
}
pt operator +(pt b){
pt ret;
for(int i=0;i<nmods;i++){
mod=mods[i];
ret.a[i]=add(a[i],b.a[i]);
}
return ret;
}
pt operator -(pt b){
pt ret;
for(int i=0;i<nmods;i++){
mod=mods[i];
ret.a[i]=sub(a[i],b.a[i]);
}
return ret;
}
ll get_diagonal(){
ll ret=0;
for(int i=0;i<nmods;i++){
if(i%2==0)ret+=a[i];
else ret-=a[i];
}
return ret;
}
}niz[maxn];
void ubaci(pt p,map<ll,ll>&mapa){
for(int i=0;i<(1<<nmods);i++){
pt np=p;
for(int j=0;j<nmods;j++){
if(i&(1<<j)){}
else np.a[j]-=mods[j];
}
/// printf("%lld added\n",diag);
mapa[np.get_diagonal()]++;
}
}
int main(){
///freopen("test.txt","r",stdin);
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
int p,q;
scanf("%d %d",&p,&q);
niz[i]=pt(p,q);
niz[i]=niz[i-1]+niz[i];
}
map<ll,ll>mapa;
ubaci(niz[0],mapa);
ll rez=0;
for(int i=1;i<=n;i++){
///printf("%lld DIAG %lld\n",niz[i].get_diagonal(),mapa[niz[i].get_diagonal()]);
rez+=mapa[niz[i].get_diagonal()];
ubaci(niz[i],mapa);
}
printf("%lld\n",rez);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 6936kb
input:
4 1 6 1 3 1 2 1 2
output:
2
result:
ok "2"
Test #2:
score: 0
Accepted
time: 1ms
memory: 6968kb
input:
5 1 1 2 2 3 3 4 4 5 5
output:
15
result:
ok "15"
Test #3:
score: 0
Accepted
time: 1ms
memory: 7224kb
input:
2 1 99999 99999 100000
output:
0
result:
ok "0"
Test #4:
score: 0
Accepted
time: 246ms
memory: 7952kb
input:
200000 82781 82781 86223 86223 16528 16528 84056 84056 94249 94249 54553 54553 25943 25943 10415 10415 52417 52417 46641 46641 70298 70298 84228 84228 55441 55441 49326 49326 11753 11753 89499 89499 58220 58220 71482 71482 32373 32373 7251 7251 78573 78573 74268 74268 46682 46682 20314 20314 85519 8...
output:
10603308211
result:
ok "10603308211"
Test #5:
score: 0
Accepted
time: 266ms
memory: 9996kb
input:
200000 50741 50741 86798 95775 51104 51104 29372 29372 43295 43295 55065 55065 68947 68947 35282 35282 62467 62467 68481 68481 82613 82613 95921 95921 46302 46302 53806 53806 61244 61244 16078 16078 33476 33476 9084 9084 99273 99273 11678 11678 36816 36816 30311 30311 51479 51479 2667 2667 57043 570...
output:
20066919
result:
ok "20066919"
Test #6:
score: 0
Accepted
time: 386ms
memory: 27808kb
input:
200000 98235 98235 67434 96040 49102 49102 16569 16569 1095 1095 23901 23901 6143 6143 78285 78285 9853 9853 46454 46454 52131 52131 72378 72378 53983 53983 91453 91453 38655 83910 6455 6455 80993 80993 66871 66871 45005 45005 72124 72124 17949 17949 34378 34378 81399 81399 89147 89147 72892 72892 8...
output:
1808373
result:
ok "1808373"
Test #7:
score: -100
Wrong Answer
time: 626ms
memory: 57896kb
input:
200000 64364 74993 65425 91573 10305 10305 31901 31901 90499 95090 13337 47707 32342 38531 75909 93251 95924 95924 12789 12789 77190 77190 82753 99616 33824 79787 48159 48159 32648 32648 90698 98365 89028 89028 36982 36982 11377 11377 79190 88165 23457 23457 24114 24114 55183 71128 65165 65165 4196 ...
output:
593734
result:
wrong answer 1st words differ - expected: '593601', found: '593734'