# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
256549 | 2020-08-02T20:25:55 Z | blacktulip | Spiderman (COCI20_spiderman) | C++17 | 196 ms | 23672 KB |
#include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define int long long #define fi first #define se second #define mp make_pair #define endl "\n" #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 1000005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev,mpp[li]; string s; PII p[li]; vector<int> v; inline void sieve(){ for(int i=2;i<=1000000;i++){ if(mpp[i]==0)continue; for(int j=0;j<=1000000;j+=i){ if(j+k<=1000000 && j+k<j+i)a[j+k]+=mpp[i]; } } } main(void){ scanf("%lld %lld",&n,&k); FOR{ scanf("%lld",&p[i].fi); mpp[p[i].fi]++; } sieve(); FOR{ printf("%lld ",a[p[i].fi]); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 21 ms | 11264 KB | Output is correct |
2 | Correct | 23 ms | 9984 KB | Output is correct |
3 | Correct | 69 ms | 13844 KB | Output is correct |
4 | Correct | 114 ms | 18680 KB | Output is correct |
5 | Correct | 117 ms | 18424 KB | Output is correct |
6 | Correct | 187 ms | 23672 KB | Output is correct |
7 | Correct | 92 ms | 18428 KB | Output is correct |
8 | Correct | 108 ms | 18552 KB | Output is correct |
9 | Correct | 196 ms | 23416 KB | Output is correct |
10 | Correct | 163 ms | 23544 KB | Output is correct |