QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#378016 | #8177. Sum is Integer | willy109 | WA | 18ms | 6976kb | C++20 | 1.1kb | 2024-04-05 22:34:23 | 2024-04-05 22:34:23 |
Judging History
answer
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define pb push_back
#define F first
#define S second
#define ld long double
#define all(a) a.begin(),a.end()
#define ll long long
#define pii pair <int,int>
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ;
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e6 + 10, sq = 1e5 , lg = 19, inf = 1e8+10 , mod = 998244353;
ld p[maxn] ;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int n ;
cin >> n;
map <ld,int> mp ;
ll ans =0 ;
mp[0]++;
rep(i , 1, n){
int a , b;
cin >> a>> b;
p[i] = p[i-1] + (ld)((ld)a/(ld)b) ;
int z =p[i] ;
p[i]-=z ;
ans += mp[p[i]] ;
mp[p[i]] ++ ;
}
cout << ans << "\n";
return 0;
}
/*
10 7 4
8 4
9 4
7 2
10 2
4 5
3 5
6 7
*/
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3772kb
input:
4 1 6 1 3 1 2 1 2
output:
2
result:
ok "2"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3532kb
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: 3560kb
input:
2 1 99999 99999 100000
output:
0
result:
ok "0"
Test #4:
score: 0
Accepted
time: 18ms
memory: 6776kb
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: -100
Wrong Answer
time: 18ms
memory: 6976kb
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:
20030913
result:
wrong answer 1st words differ - expected: '20066919', found: '20030913'