結果
問題 | No.1653 Squarefree |
ユーザー | hotman78 |
提出日時 | 2021-08-20 22:41:13 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 345 ms / 2,000 ms |
コード長 | 5,639 bytes |
コンパイル時間 | 3,037 ms |
コンパイル使用メモリ | 231,180 KB |
実行使用メモリ | 19,016 KB |
最終ジャッジ日時 | 2024-04-27 05:09:17 |
合計ジャッジ時間 | 13,405 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 343 ms
18,932 KB |
testcase_01 | AC | 11 ms
6,944 KB |
testcase_02 | AC | 11 ms
6,940 KB |
testcase_03 | AC | 11 ms
6,940 KB |
testcase_04 | AC | 11 ms
6,940 KB |
testcase_05 | AC | 11 ms
6,940 KB |
testcase_06 | AC | 11 ms
6,940 KB |
testcase_07 | AC | 11 ms
6,940 KB |
testcase_08 | AC | 11 ms
6,940 KB |
testcase_09 | AC | 12 ms
6,944 KB |
testcase_10 | AC | 11 ms
6,940 KB |
testcase_11 | AC | 336 ms
18,884 KB |
testcase_12 | AC | 297 ms
18,836 KB |
testcase_13 | AC | 343 ms
18,756 KB |
testcase_14 | AC | 344 ms
18,728 KB |
testcase_15 | AC | 331 ms
18,912 KB |
testcase_16 | AC | 332 ms
18,896 KB |
testcase_17 | AC | 345 ms
18,792 KB |
testcase_18 | AC | 331 ms
18,828 KB |
testcase_19 | AC | 332 ms
18,752 KB |
testcase_20 | AC | 332 ms
18,840 KB |
testcase_21 | AC | 337 ms
19,016 KB |
testcase_22 | AC | 336 ms
18,868 KB |
testcase_23 | AC | 327 ms
18,636 KB |
testcase_24 | AC | 328 ms
18,780 KB |
testcase_25 | AC | 334 ms
18,788 KB |
testcase_26 | AC | 337 ms
18,668 KB |
testcase_27 | AC | 331 ms
18,824 KB |
testcase_28 | AC | 333 ms
18,676 KB |
testcase_29 | AC | 329 ms
18,796 KB |
testcase_30 | AC | 323 ms
18,652 KB |
testcase_31 | AC | 331 ms
18,832 KB |
testcase_32 | AC | 325 ms
18,824 KB |
testcase_33 | AC | 339 ms
18,668 KB |
testcase_34 | AC | 339 ms
18,676 KB |
testcase_35 | AC | 332 ms
18,676 KB |
testcase_36 | AC | 10 ms
6,940 KB |
testcase_37 | AC | 11 ms
6,940 KB |
testcase_38 | AC | 11 ms
6,944 KB |
testcase_39 | AC | 10 ms
6,940 KB |
testcase_40 | AC | 10 ms
6,940 KB |
ソースコード
#line 2 "cpplib/util/template.hpp" #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("avx2") #include<bits/stdc++.h> using namespace std; struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__; typedef long long lint; #define INF (1LL<<60) #define IINF (1<<30) #define EPS (1e-10) #define endl ('\n') typedef vector<lint> vec; typedef vector<vector<lint>> mat; typedef vector<vector<vector<lint>>> mat3; typedef vector<string> svec; typedef vector<vector<string>> smat; template<typename T>using V=vector<T>; template<typename T>using VV=V<V<T>>; template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;} template<typename T>inline void output2(T t){for(auto i:t)output(i);} template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;} template<typename T>inline void debug2(T t){for(auto i:t)debug(i);} #define loop(n) for(long long _=0;_<(long long)(n);++_) #define _overload4(_1,_2,_3,_4,name,...) name #define __rep(i,a) repi(i,0,a,1) #define _rep(i,a,b) repi(i,a,b,1) #define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c) #define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__) #define _overload3_rev(_1,_2,_3,name,...) name #define _rep_rev(i,a) repi_rev(i,0,a) #define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i) #define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__) // #define rep(i,...) for(auto i:range(__VA_ARGS__)) // #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__))) // #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i) // #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i) // #define irep(i) for(lint i=0;;++i) // inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;} // inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;} // inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;} // template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;} #define all(n) begin(n),end(n) template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;} template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;} const vector<lint> dx={1,0,-1,0,1,1,-1,-1}; const vector<lint> dy={0,1,0,-1,1,-1,1,-1}; #define SUM(v) accumulate(all(v),0LL) #if __cplusplus>=201703L template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));} #endif #define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__})) #define bit(n,a) ((n>>a)&1) vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;} using graph=vector<vector<int>>; template<typename T>using graph_w=vector<vector<pair<int,T>>>; template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;} #if __cplusplus>=201703L constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;} #endif template<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;} template<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;} template<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;} template<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;} #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024)); #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_); #line 3 "cpplib/math/binary_search.hpp" /** * @brief 二分探索 */ template<typename T=long long,typename F> T bs(T mn,T mx,F func){ mn--; mx++; while(mx-mn>1){ T mid=(mn+mx)/2; if(!func(mid))mx=mid; else mn=mid; } return mn; } #line 3 "main.cpp" int main(){ lint a,b; cin>>a>>b; lint k=powll(10,6); vec v(b-a+1); rep(i,b-a+1)v[i]=i+a; vec ok(b-a+1,1); rep(i,2,k+1){ for(lint j=(a+i-1)/i*i;j<=b;j+=i){ lint cnt=0; while(v[j-a]%i==0){ v[j-a]/=i; cnt++; } if(cnt>=2){ ok[j-a]=0; } } } rep(i,b-a+1){ if(v[i]==1)continue; rep(k,-1,2){ lint t=sqrtl(v[i])+k; if(t*t==v[i]){ ok[i]=0; } } } cout<<SUM(ok)<<endl; }