#876629 (C++14) No.2304 Distinct Elements

提出ソース

結果

問題	No.2304 Distinct Elements
ユーザー	woodywoody
提出日時	2023-06-02 20:47:29
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	456 ms / 3,000 ms
コード長	4,842 bytes
コンパイル時間	4,787 ms
コンパイル使用メモリ	244,280 KB
実行使用メモリ	42,104 KB
最終ジャッジ日時	2023-08-28 02:29:26
合計ジャッジ時間	20,391 ms
ジャッジサーバーID （参考情報）	judge12 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,376 KB
testcase_01	AC	2 ms 4,376 KB
testcase_02	AC	1 ms 4,376 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	325 ms 41,804 KB
testcase_05	AC	325 ms 41,792 KB
testcase_06	AC	326 ms 41,792 KB
testcase_07	AC	325 ms 41,732 KB
testcase_08	AC	326 ms 41,844 KB
testcase_09	AC	453 ms 41,796 KB
testcase_10	AC	453 ms 41,776 KB
testcase_11	AC	456 ms 41,968 KB
testcase_12	AC	453 ms 41,760 KB
testcase_13	AC	453 ms 42,104 KB
testcase_14	AC	2 ms 4,376 KB
testcase_15	AC	2 ms 4,376 KB
testcase_16	AC	2 ms 4,376 KB
testcase_17	AC	2 ms 4,380 KB
testcase_18	AC	2 ms 4,380 KB
testcase_19	AC	1 ms 4,380 KB
testcase_20	AC	2 ms 4,380 KB
testcase_21	AC	1 ms 4,376 KB
testcase_22	AC	1 ms 4,376 KB
testcase_23	AC	1 ms 4,376 KB
testcase_24	AC	2 ms 4,380 KB
testcase_25	AC	2 ms 4,376 KB
testcase_26	AC	1 ms 4,380 KB
testcase_27	AC	1 ms 4,376 KB
testcase_28	AC	2 ms 4,380 KB
testcase_29	AC	248 ms 35,240 KB
testcase_30	AC	17 ms 5,364 KB
testcase_31	AC	200 ms 25,640 KB
testcase_32	AC	361 ms 36,228 KB
testcase_33	AC	25 ms 5,584 KB
testcase_34	AC	369 ms 36,624 KB
testcase_35	AC	415 ms 39,288 KB
testcase_36	AC	20 ms 5,160 KB
testcase_37	AC	91 ms 13,816 KB
testcase_38	AC	329 ms 41,604 KB
testcase_39	AC	331 ms 41,764 KB
testcase_40	AC	218 ms 33,216 KB
testcase_41	AC	107 ms 18,360 KB
testcase_42	AC	321 ms 41,792 KB
testcase_43	AC	334 ms 41,836 KB
testcase_44	AC	328 ms 34,440 KB
testcase_45	AC	230 ms 23,040 KB
testcase_46	AC	180 ms 20,172 KB
testcase_47	AC	2 ms 4,380 KB
testcase_48	AC	2 ms 4,380 KB
testcase_49	AC	328 ms 42,028 KB
testcase_50	AC	331 ms 41,792 KB
testcase_51	AC	330 ms 41,948 KB
testcase_52	AC	282 ms 31,020 KB
testcase_53	AC	268 ms 25,028 KB
testcase_54	AC	305 ms 37,580 KB
testcase_55	AC	309 ms 39,648 KB
testcase_56	AC	315 ms 40,776 KB
testcase_57	AC	277 ms 30,936 KB
testcase_58	AC	315 ms 36,552 KB
testcase_59	AC	289 ms 36,484 KB
testcase_60	AC	2 ms 4,380 KB
testcase_61	AC	1 ms 4,380 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

pli op(pli a,pli b){
	if (a.fi==b.fi){
		return (a.se>b.se)?b:a;
	}else{
		return (a.fi>b.fi)?a:b;
	}
}
 
pli e(){
	return {-LINF,INF};
}
 
pli mapping(pll p,pli a){
	return {a.fi*p.fi + p.se, a.se};
}
 
pll composition(pll p,pll q){
	return {p.fi*q.fi , p.fi*q.se + p.se};
}
 
pll id(){
	return {1 , 0};
}


void solve(){
	int n; cin>>n;
	vl a(n);
	rep(i,n) cin>>a[i];
	sort(rng(a));
	rep(i,n) a[i] += (n-i);
	map<ll,vi> mp;
	rep(i,n) mp[a[i]].pb(i);
	ll now = 0;
	lazy_segtree<pli , op , e , pll , mapping , composition , id> ls(n);
	rep(i,n) ls.set(i, {0,i});
	rep(i,n) ls.apply(0,i+1,{1,1});
	int l = 0;
	vl b(n);
	while(1){
		pli p = ls.prod(l,n);
		if (p.fi<0){
			repx(j,l,n) b[j] = now;
			break;
		}
		repx(j,l,p.se) b[j] = now;
		l = p.se;
		vi vt;
		// pair<ll,vi> d = {now,vt};
		auto it = mp.upper_bound(now);
		now = (*it).fi;
		vi v = mp[now];
		fore(y, v) ls.apply(0, y+1, {1,-2});
	}
	ll ans = 0;
	rep(i,n) ans += abs(a[i]-b[i]);
	out;

	return;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t = 1;
	//cin>>t;

	rep(i,t){
		solve();
	}

	return 0;
}

yukicoder

結果

テストケース

ソースコード