結果
問題 | No.1262 グラフを作ろう! |
ユーザー | 👑 tute7627 |
提出日時 | 2020-10-16 22:58:54 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 438 ms / 3,000 ms |
コード長 | 2,947 bytes |
コンパイル時間 | 2,677 ms |
コンパイル使用メモリ | 203,280 KB |
実行使用メモリ | 34,308 KB |
最終ジャッジ日時 | 2023-09-28 04:55:05 |
合計ジャッジ時間 | 26,526 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 162 ms
20,404 KB |
testcase_01 | AC | 120 ms
16,248 KB |
testcase_02 | AC | 204 ms
24,760 KB |
testcase_03 | AC | 126 ms
15,260 KB |
testcase_04 | AC | 186 ms
22,220 KB |
testcase_05 | AC | 146 ms
19,460 KB |
testcase_06 | AC | 211 ms
25,532 KB |
testcase_07 | AC | 35 ms
7,728 KB |
testcase_08 | AC | 223 ms
26,848 KB |
testcase_09 | AC | 80 ms
11,208 KB |
testcase_10 | AC | 99 ms
14,184 KB |
testcase_11 | AC | 266 ms
28,900 KB |
testcase_12 | AC | 149 ms
18,820 KB |
testcase_13 | AC | 132 ms
16,352 KB |
testcase_14 | AC | 102 ms
15,040 KB |
testcase_15 | AC | 62 ms
9,252 KB |
testcase_16 | AC | 223 ms
25,488 KB |
testcase_17 | AC | 168 ms
21,756 KB |
testcase_18 | AC | 270 ms
27,516 KB |
testcase_19 | AC | 147 ms
20,272 KB |
testcase_20 | AC | 299 ms
28,320 KB |
testcase_21 | AC | 217 ms
25,472 KB |
testcase_22 | AC | 143 ms
18,672 KB |
testcase_23 | AC | 91 ms
12,476 KB |
testcase_24 | AC | 233 ms
26,572 KB |
testcase_25 | AC | 79 ms
12,940 KB |
testcase_26 | AC | 107 ms
15,320 KB |
testcase_27 | AC | 192 ms
24,084 KB |
testcase_28 | AC | 151 ms
20,788 KB |
testcase_29 | AC | 182 ms
22,160 KB |
testcase_30 | AC | 108 ms
15,832 KB |
testcase_31 | AC | 180 ms
21,384 KB |
testcase_32 | AC | 144 ms
18,464 KB |
testcase_33 | AC | 41 ms
7,404 KB |
testcase_34 | AC | 256 ms
28,304 KB |
testcase_35 | AC | 132 ms
16,700 KB |
testcase_36 | AC | 44 ms
7,520 KB |
testcase_37 | AC | 255 ms
28,032 KB |
testcase_38 | AC | 169 ms
22,496 KB |
testcase_39 | AC | 85 ms
11,704 KB |
testcase_40 | AC | 94 ms
13,796 KB |
testcase_41 | AC | 192 ms
24,176 KB |
testcase_42 | AC | 273 ms
27,840 KB |
testcase_43 | AC | 190 ms
19,732 KB |
testcase_44 | AC | 143 ms
18,560 KB |
testcase_45 | AC | 316 ms
29,144 KB |
testcase_46 | AC | 240 ms
27,356 KB |
testcase_47 | AC | 80 ms
11,156 KB |
testcase_48 | AC | 208 ms
25,484 KB |
testcase_49 | AC | 230 ms
27,052 KB |
testcase_50 | AC | 233 ms
27,576 KB |
testcase_51 | AC | 101 ms
13,532 KB |
testcase_52 | AC | 219 ms
25,984 KB |
testcase_53 | AC | 58 ms
10,380 KB |
testcase_54 | AC | 155 ms
19,544 KB |
testcase_55 | AC | 146 ms
18,480 KB |
testcase_56 | AC | 183 ms
23,288 KB |
testcase_57 | AC | 277 ms
31,588 KB |
testcase_58 | AC | 135 ms
17,408 KB |
testcase_59 | AC | 183 ms
24,152 KB |
testcase_60 | AC | 242 ms
29,616 KB |
testcase_61 | AC | 95 ms
14,252 KB |
testcase_62 | AC | 199 ms
24,604 KB |
testcase_63 | AC | 145 ms
18,120 KB |
testcase_64 | AC | 127 ms
17,292 KB |
testcase_65 | AC | 100 ms
15,108 KB |
testcase_66 | AC | 104 ms
15,260 KB |
testcase_67 | AC | 121 ms
17,560 KB |
testcase_68 | AC | 272 ms
27,112 KB |
testcase_69 | AC | 161 ms
16,884 KB |
testcase_70 | AC | 256 ms
29,740 KB |
testcase_71 | AC | 185 ms
23,480 KB |
testcase_72 | AC | 275 ms
30,088 KB |
testcase_73 | AC | 230 ms
26,996 KB |
testcase_74 | AC | 176 ms
22,168 KB |
testcase_75 | AC | 202 ms
24,532 KB |
testcase_76 | AC | 177 ms
22,700 KB |
testcase_77 | AC | 194 ms
23,544 KB |
testcase_78 | AC | 208 ms
25,372 KB |
testcase_79 | AC | 286 ms
31,092 KB |
testcase_80 | AC | 268 ms
29,812 KB |
testcase_81 | AC | 183 ms
22,712 KB |
testcase_82 | AC | 206 ms
25,216 KB |
testcase_83 | AC | 247 ms
28,680 KB |
testcase_84 | AC | 208 ms
23,072 KB |
testcase_85 | AC | 267 ms
31,608 KB |
testcase_86 | AC | 196 ms
24,808 KB |
testcase_87 | AC | 248 ms
28,896 KB |
testcase_88 | AC | 175 ms
22,544 KB |
testcase_89 | AC | 237 ms
27,364 KB |
testcase_90 | AC | 319 ms
34,176 KB |
testcase_91 | AC | 308 ms
34,288 KB |
testcase_92 | AC | 315 ms
34,168 KB |
testcase_93 | AC | 348 ms
34,308 KB |
testcase_94 | AC | 438 ms
34,296 KB |
testcase_95 | AC | 325 ms
34,292 KB |
ソースコード
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1}; template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));} template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;} template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,m;cin>>n>>m; vector<ll>a(m); rep(i,0,m)cin>>a[i]; vector<ll>v(n+1); rep(i,0,m)v[a[i]]++; vector<ll>dp(n+1); vector<ll>div(n+1); //rep(i,1,n+1)div[i]=n/i; rrep(i,1,n+1){ for(ll j=i;j<=n;j+=i){ dp[i]-=dp[j]; dp[i]+=v[j]*(j/i); } res+=(i-1)*dp[i]; //if(dp[i]>0)cout<<i spa dp[i]<<endl; } cout<<res<<endl; return 0; }