제출 #248036

#제출 시각아이디문제언어결과실행 시간메모리
248036leakedSirni (COCI17_sirni)C++14
0 / 140
1129 ms89636 KiB
#include<bits/stdc++.h> using namespace std; //#include<ext/pb_ds/assoc_container.hpp> //#include<ext/pb_ds/tree_policy.hpp> // // #pragma GCC optimize("unroll-loops") // #pragma GCC optimize("Ofast") // #pragma GCC optimize("-O3") // #pragma GCC optimize("no-stack-protector") // #pragma GCC optimize("fast-math") //#define LOCAL #define sim template < class c #define ris return * this #define dor > debug & operator << #define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { #ifndef LOCAL ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } #else sim dor(const c&) { ris; } #endif }; #define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " #define fi first #define f first #define se second #define s second #define vi_a vector<int>a; #define p_b push_back ////////////////////////////////???????????????CHECK THIS OUT???????????????////////////////////////////// #define ll long long ////////////////////////////////???????????????CHECK THIS OUT???????????????////////////////////////////// #define ld long double #define pll pair<ll,ll> #define pii pair<int,int> #define m_p make_pair #define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0); #define all(x) x.begin(),x.end() #define getfiles ifstream cin("input.txt");ofstream cout("output.txt"); #define pw(x) (1ll << x) #define sz(x) (ll)x.size() #define endl "\n" #define rall(x) x.rbegin(),x.rend() #define len(a) (ll)a.size() #define rep(x,l,r) for(ll x=l;x<r;x++) //using namespace __gnu_pbds; ld eps = (ld)1 / 1e6; const ld pi=3.14159265359; ll inf = 1e18,mod1=1e9+7; ll sqr(ll a) { return a * a; } ll qb(ll a) { return a * a * a; } ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); } ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; } ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; } ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// const ll R=1e4; const ll tx[4]={0,0,-1,1}; const ll ty[4]={-1,1,0,0}; const char rev_to[4]={'E','W','N','S'}; const int N=1e6+1; const int M=1e9+7; //typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st; int p[N],sz[N],a[N]; pii mn[(int)1e7+1]; bool is[(int)1e7+1]; int get_p(int v) { return (v==p[v] ? v : p[v]=get_p(p[v])); } bool mg(int a,int b){ int ra=get_p(a),rb=get_p(b); if(ra!=rb){ if(sz[rb]>sz[ra]) swap(ra,rb); p[rb]=ra; sz[ra]+=sz[rb]; } } signed main() { fast_io; int n; cin>>n; iota(p,p+n,0); //memset(*sz,1,sizeof sz); // cout<<sz[0]; vector<pair<int,pii>>e; for(int i=0;i<n;i++){ sz[i]=1; cin>>a[i]; mn[a[i]]={1e9,1e9}; is[a[i]]=1; } sort(a,a+n); for(int i=0;i<n;i++){ for(int j=0;j<=a[0]-1;j++){ for(int k=j;k<=a[n-1];k+=a[i]){ if(k==a[i]) continue; if(is[k]){ mn[a[i]]=min(mn[a[i]],{j,1e9}); } // debug()<<imie(k)<<imie(mn[k])<<imie(j)<<imie(a[i]); mn[k]=min(mn[k],{j,i}); // debug()<<imie(k)<<imie(mn[k])<<imie(j)<<imie(a[i]); } } } ll ans=0; for(int i=1;i<n;i++){ int it=(upper_bound(a,a+n,a[i])-a)-2; if(it>=0 && a[it]==a[i]){ e.p_b({0,{i,it}}); continue; } ans+=mn[a[i]].f; // debug()<<imie(a[i])<<imie(mn[a[i]])<<imie(a[i]); } cout<<ans; return 0; } /* 4 4 1 2 a 3 2 a 1 4 a 3 4 b */

컴파일 시 표준 에러 (stderr) 메시지

sirni.cpp: In function 'bool mg(int, int)':
sirni.cpp:93:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...