結果
| 問題 | No.1657 Sum is Prime (Easy Version) |
| ユーザー |
 LayCurse
|
| 提出日時 | 2021-09-13 22:52:16 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 6,594 bytes |
| コンパイル時間 | 3,124 ms |
| コンパイル使用メモリ | 221,020 KB |
| 最終ジャッジ日時 | 2025-01-24 13:46:58 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 21 |
ソースコード
#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC optimize("inline")#include<bits/stdc++.h>using namespace std;template<class T> struct cLtraits_identity{using type = T;};template<class T> using cLtraits_try_make_signed =typename conditional<is_integral<T>::value,make_signed<T>,cLtraits_identity<T>>::type;template <class S, class T> struct cLtraits_common_type{using tS = typename cLtraits_try_make_signed<S>::type;using tT = typename cLtraits_try_make_signed<T>::type;using type = typename common_type<tS,tT>::type;};void*wmem;char memarr[96000000];template<class S, class T> inline auto min_L(S a, T b)-> typename cLtraits_common_type<S,T>::type{return (typename cLtraits_common_type<S,T>::type) a <= (typename cLtraits_common_type<S,T>::type) b ? a : b;}template<class S, class T> inline auto max_L(S a, T b)-> typename cLtraits_common_type<S,T>::type{return (typename cLtraits_common_type<S,T>::type) a >= (typename cLtraits_common_type<S,T>::type) b ? a : b;}template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );(*arr)=(T*)(*mem);(*mem)=((*arr)+x);}template<class T> inline void walloc1d(T **arr, int x1, int x2, void **mem = &wmem){walloc1d(arr, x2-x1, mem);(*arr) -= x1;}inline int my_getchar_unlocked(){static char buf[1048576];static int s = 1048576;static int e = 1048576;if(s == e && e == 1048576){e = fread_unlocked(buf, 1, 1048576, stdin);s = 0;}if(s == e){return EOF;}return buf[s++];}inline void rd(long long &x){int k;int m=0;x=0;for(;;){k = my_getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = my_getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}struct MY_WRITER{char buf[1048576];int s;int e;MY_WRITER(){s = 0;e = 1048576;}~MY_WRITER(){if(s){fwrite_unlocked(buf, 1, s, stdout);}}};MY_WRITER MY_WRITER_VAR;void my_putchar_unlocked(int a){if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);MY_WRITER_VAR.s = 0;}MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;}inline void wt_L(char a){my_putchar_unlocked(a);}inline void wt_L(int x){int s=0;int m=0;char f[10];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){my_putchar_unlocked('-');}while(s--){my_putchar_unlocked(f[s]+'0');}}inline void wt_L(unsigned x){int s=0;char f[10];while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}while(s--){my_putchar_unlocked(f[s]+'0');}}inline void wt_L(long long x){int s=0;int m=0;char f[20];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){my_putchar_unlocked('-');}while(s--){my_putchar_unlocked(f[s]+'0');}}inline void wt_L(unsigned long long x){int s=0;char f[21];while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}while(s--){my_putchar_unlocked(f[s]+'0');}}int WRITER_DOUBLE_DIGIT = 15;inline int writerDigit_double(){return WRITER_DOUBLE_DIGIT;}inline void writerDigit_double(int d){WRITER_DOUBLE_DIGIT = d;}inline void wt_L(double x){const int d = WRITER_DOUBLE_DIGIT;int k;int r;double v;if(x!=x || (x==x+1 && x==2*x)){my_putchar_unlocked('E');my_putchar_unlocked('r');my_putchar_unlocked('r');return;}if(x < 0){my_putchar_unlocked('-');x = -x;}x += 0.5 * pow(0.1, d);r = 0;v = 1;while(x >= 10*v){v *= 10;r++;}while(r >= 0){r--;k = floor(x / v);if(k >= 10){k = 9;}if(k <= -1){k = 0;}x -= k * v;v *= 0.1;my_putchar_unlocked(k + '0');}if(d > 0){my_putchar_unlocked('.');v = 1;for(r=(0);r<(d);r++){v *= 0.1;k = floor(x / v);if(k >= 10){k = 9;}if(k <= -1){k = 0;}x -= k * v;my_putchar_unlocked(k + '0');}}}inline void wt_L(const char c[]){int i=0;for(i=0;c[i]!='\0';i++){my_putchar_unlocked(c[i]);}}inline void wt_L(string &x){int i=0;for(i=0;x[i]!='\0';i++){my_putchar_unlocked(x[i]);}}template<class T> inline T pow2_L(T a){return a*a;}inline long long Isqrt_f_L(const long long n){long long r = sqrt(n);r =max_L(r-2, 0);while((pow2_L((r+1)))<= n ){r++;}return r;}long long cntPrime(long long n, void *mem = wmem){int i;int j;int k;int m;int sn;int ssn;int c;char*isp;long long*s1;long long*s2;long long x;long long tmp;const double nn = n;if(n <= 1){return 0;}if(n == 2){return 1;}c = 0;sn =Isqrt_f_L(n);ssn =Isqrt_f_L(sn);walloc1d(&s1, sn+1, &mem);walloc1d(&s2, sn+1, &mem);walloc1d(&isp, sn+1, &mem);s1[0] = 0;for(i=(1);i<(sn+1);i++){s1[i] = i - 1;}for(i=(1);i<(sn+1);i++){s2[i] = n/i - 1;}for(i=(2);i<(sn+1);i++){isp[i] = 1;}for(i=(2);i<(ssn+1);i++){if(isp[i]){for(j=i*i;j<=sn;j+=i){isp[j] = 0;}for(j=(1);j<(sn+1);j++){x = (long long) i * j;if(x > sn){s2[j] -= s1[(int)(nn / x)] - c;}else{s2[j] -= s2[x] - c;}}for(k = (sn+1)/i; k >= i; k--){m =min_L(sn+1, i*(k+1));tmp = s1[k] - c;for(j=(i*k);j<(m);j++){s1[j] -= tmp;}}c++;}}for(i=(ssn+1);i<(sn+1);i++){if(isp[i]){for(j=(1);j<(sn+1);j++){x = (long long) i * j;if(x * i > n){break;}if(x > sn){s2[j] -= s1[(int)(nn / x)] - c;}else{s2[j] -= s2[x] - c;}}c++;}}return s2[1];}int main(){wmem = memarr;long long L;rd(L);long long R;rd(R);wt_L(cntPrime(2*R) - cntPrime(2*L) + cntPrime(R) - cntPrime(L-1));wt_L('\n');return 0;}// cLay version 20210913-1// --- original code ---// ll @L, @R;// wt(cntPrime(2*R) - cntPrime(2*L) + cntPrime(R) - cntPrime(L-1));