답안 #155296

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
155296	2019-09-27T13:29:16 Z	ryansee	Rope (JOI17_rope)	C++14	100 / 100	1524 ms	76172 KB

rope

#include "bits/stdc++.h"
using namespace std;
 
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define ph push
#define f first
#define s second
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ((ll)x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define btinpct(x) __builtin_popcountll((x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return (rng() % (y+1-x)) + x; } //inclusivesss
string to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?b:gcd(b%a,a); }
 
#define ll /*long long*/ int 
#define ld long double
#define FOR(ii, ss, ee) for(ll ii = (ss); ii <= (ll)(ee); ++ii)
#define DEC(ii, ss, ee) for(ll ii = (ss); ii >= (ll)(ee); --ii)
typedef pair <ll, ll> pi; typedef pair <ll, pi> spi; typedef pair <pi, pi> dpi;
 
#define LLINF INF// ((long long) 1e18)//1234567890987654321
#define INF 1234567890ll
// #define cerr if(0)cout
#define MAXN (1000006)
ll n, m, A[MAXN]; ll N;
vector<pi> v;
ll ans[MAXN];
vector<ll> cnt;
vector<ll> o;
void solve() {
	ll n=v.size();
	vector<vector<ll>> adj(m+1, vector<ll>());
	FOR(i,0,n-1) if(v[i].s!=-1 && v[i].f^v[i].s) {
		adj[v[i].f].eb(v[i].s);
		adj[v[i].s].eb(v[i].f);
	}
	FOR(i,1,m) {
		// ll n=v.size();
		ll add = 0; ll mx = 0;
		for(auto j:adj[i]) --cnt[j];
		for(ll j=0;j<siz(o)&&j<=siz(adj[i])+1; ++ j) if(o[j] ^ i) {
			mx=max(mx, cnt[o[j]]);
		}
		add = N-cnt[i]-mx;
		ans[i]=min(ans[i], add);
		for(auto j:adj[i]) ++ cnt[j];
	}
}
#define gc getchar_unlocked
void in(ll &x) {
	x=0;
	char ch=gc();
	while(ch<'0'||ch>'9') ch=gc();
	while(ch>='0'&&ch<='9'){
		x=(x<<3)+(x<<1)+ch-48;
		ch=gc();
	}
}
int main()
{
	FAST
	in(n),in(m);N=n;
	if(m==1) {
		cout<<0; return 0;
	}
	FOR(i,1,n) in(A[i]); cnt.resize(m+1, 0); for(ll i=1;i<=n;++i) cnt[A[i]] ++; FOR(i,1,m) o.eb(i); sort(all(o), [](ll x,ll y){return cnt[x]>cnt[y];});
	for(ll i=1;i<=n;i+=2) v.eb(A[i], (i+1>n?-1:A[i+1]));
	fill(ans, ans+MAXN, LLINF);
	solve();
	v.clear();
	v.eb(A[1], -1);
	for(ll i=2;i<=n;i+=2) v.eb(A[i], (i+1>n?-1:A[i+1]));
	solve();
	for(ll i=1;i<=m;++i) cout<<ans[i]<<'\n';
}

Compilation message

rope.cpp: In function 'int main()':
rope.cpp:24:25: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define FOR(ii, ss, ee) for(ll ii = (ss); ii <= (ll)(ee); ++ii)
                         ^
rope.cpp:73:2: note: in expansion of macro 'FOR'
  FOR(i,1,n) in(A[i]); cnt.resize(m+1, 0); for(ll i=1;i<=n;++i) cnt[A[i]] ++; FOR(i,1,m) o.eb(i); sort(all(o), [](ll x,ll y){return cnt[x]>cnt[y];});
  ^~~
rope.cpp:73:23: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  FOR(i,1,n) in(A[i]); cnt.resize(m+1, 0); for(ll i=1;i<=n;++i) cnt[A[i]] ++; FOR(i,1,m) o.eb(i); sort(all(o), [](ll x,ll y){return cnt[x]>cnt[y];});
                       ^~~

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	4216 KB	Output is correct
2	Correct	5 ms	4344 KB	Output is correct
3	Correct	5 ms	4216 KB	Output is correct
4	Correct	8 ms	4220 KB	Output is correct
5	Correct	6 ms	4344 KB	Output is correct
6	Correct	33 ms	4216 KB	Output is correct
7	Correct	6 ms	4344 KB	Output is correct
8	Correct	7 ms	4216 KB	Output is correct
9	Correct	7 ms	4244 KB	Output is correct
10	Correct	3 ms	4216 KB	Output is correct
11	Correct	6 ms	4216 KB	Output is correct
12	Correct	6 ms	4216 KB	Output is correct
13	Correct	6 ms	4216 KB	Output is correct
14	Correct	5 ms	4216 KB	Output is correct
15	Correct	5 ms	4212 KB	Output is correct
16	Correct	5 ms	4216 KB	Output is correct
17	Correct	5 ms	4344 KB	Output is correct
18	Correct	6 ms	4344 KB	Output is correct
19	Correct	5 ms	4216 KB	Output is correct
20	Correct	6 ms	4344 KB	Output is correct
21	Correct	5 ms	4216 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	6 ms	4216 KB	Output is correct
24	Correct	7 ms	4344 KB	Output is correct
25	Correct	6 ms	4344 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	4216 KB	Output is correct
2	Correct	5 ms	4344 KB	Output is correct
3	Correct	5 ms	4216 KB	Output is correct
4	Correct	8 ms	4220 KB	Output is correct
5	Correct	6 ms	4344 KB	Output is correct
6	Correct	33 ms	4216 KB	Output is correct
7	Correct	6 ms	4344 KB	Output is correct
8	Correct	7 ms	4216 KB	Output is correct
9	Correct	7 ms	4244 KB	Output is correct
10	Correct	3 ms	4216 KB	Output is correct
11	Correct	6 ms	4216 KB	Output is correct
12	Correct	6 ms	4216 KB	Output is correct
13	Correct	6 ms	4216 KB	Output is correct
14	Correct	5 ms	4216 KB	Output is correct
15	Correct	5 ms	4212 KB	Output is correct
16	Correct	5 ms	4216 KB	Output is correct
17	Correct	5 ms	4344 KB	Output is correct
18	Correct	6 ms	4344 KB	Output is correct
19	Correct	5 ms	4216 KB	Output is correct
20	Correct	6 ms	4344 KB	Output is correct
21	Correct	5 ms	4216 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	6 ms	4216 KB	Output is correct
24	Correct	7 ms	4344 KB	Output is correct
25	Correct	6 ms	4344 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	13 ms	6036 KB	Output is correct
28	Correct	11 ms	5876 KB	Output is correct
29	Correct	13 ms	5872 KB	Output is correct
30	Correct	12 ms	5616 KB	Output is correct
31	Correct	13 ms	5884 KB	Output is correct
32	Correct	13 ms	5720 KB	Output is correct
33	Correct	12 ms	5876 KB	Output is correct
34	Correct	11 ms	5748 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	4216 KB	Output is correct
2	Correct	5 ms	4344 KB	Output is correct
3	Correct	5 ms	4216 KB	Output is correct
4	Correct	8 ms	4220 KB	Output is correct
5	Correct	6 ms	4344 KB	Output is correct
6	Correct	33 ms	4216 KB	Output is correct
7	Correct	6 ms	4344 KB	Output is correct
8	Correct	7 ms	4216 KB	Output is correct
9	Correct	7 ms	4244 KB	Output is correct
10	Correct	3 ms	4216 KB	Output is correct
11	Correct	6 ms	4216 KB	Output is correct
12	Correct	6 ms	4216 KB	Output is correct
13	Correct	6 ms	4216 KB	Output is correct
14	Correct	5 ms	4216 KB	Output is correct
15	Correct	5 ms	4212 KB	Output is correct
16	Correct	5 ms	4216 KB	Output is correct
17	Correct	5 ms	4344 KB	Output is correct
18	Correct	6 ms	4344 KB	Output is correct
19	Correct	5 ms	4216 KB	Output is correct
20	Correct	6 ms	4344 KB	Output is correct
21	Correct	5 ms	4216 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	6 ms	4216 KB	Output is correct
24	Correct	7 ms	4344 KB	Output is correct
25	Correct	6 ms	4344 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	13 ms	6036 KB	Output is correct
28	Correct	11 ms	5876 KB	Output is correct
29	Correct	13 ms	5872 KB	Output is correct
30	Correct	12 ms	5616 KB	Output is correct
31	Correct	13 ms	5884 KB	Output is correct
32	Correct	13 ms	5720 KB	Output is correct
33	Correct	12 ms	5876 KB	Output is correct
34	Correct	11 ms	5748 KB	Output is correct
35	Correct	14 ms	6008 KB	Output is correct
36	Correct	14 ms	6008 KB	Output is correct
37	Correct	14 ms	6008 KB	Output is correct
38	Correct	14 ms	6004 KB	Output is correct
39	Correct	14 ms	6008 KB	Output is correct
40	Correct	16 ms	6136 KB	Output is correct
41	Correct	15 ms	6136 KB	Output is correct
42	Correct	13 ms	6012 KB	Output is correct
43	Correct	14 ms	6132 KB	Output is correct
44	Correct	14 ms	6008 KB	Output is correct
45	Correct	14 ms	6016 KB	Output is correct
46	Correct	15 ms	6040 KB	Output is correct
47	Correct	15 ms	6084 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	4216 KB	Output is correct
2	Correct	5 ms	4344 KB	Output is correct
3	Correct	5 ms	4216 KB	Output is correct
4	Correct	8 ms	4220 KB	Output is correct
5	Correct	6 ms	4344 KB	Output is correct
6	Correct	33 ms	4216 KB	Output is correct
7	Correct	6 ms	4344 KB	Output is correct
8	Correct	7 ms	4216 KB	Output is correct
9	Correct	7 ms	4244 KB	Output is correct
10	Correct	3 ms	4216 KB	Output is correct
11	Correct	6 ms	4216 KB	Output is correct
12	Correct	6 ms	4216 KB	Output is correct
13	Correct	6 ms	4216 KB	Output is correct
14	Correct	5 ms	4216 KB	Output is correct
15	Correct	5 ms	4212 KB	Output is correct
16	Correct	5 ms	4216 KB	Output is correct
17	Correct	5 ms	4344 KB	Output is correct
18	Correct	6 ms	4344 KB	Output is correct
19	Correct	5 ms	4216 KB	Output is correct
20	Correct	6 ms	4344 KB	Output is correct
21	Correct	5 ms	4216 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	6 ms	4216 KB	Output is correct
24	Correct	7 ms	4344 KB	Output is correct
25	Correct	6 ms	4344 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	13 ms	6036 KB	Output is correct
28	Correct	11 ms	5876 KB	Output is correct
29	Correct	13 ms	5872 KB	Output is correct
30	Correct	12 ms	5616 KB	Output is correct
31	Correct	13 ms	5884 KB	Output is correct
32	Correct	13 ms	5720 KB	Output is correct
33	Correct	12 ms	5876 KB	Output is correct
34	Correct	11 ms	5748 KB	Output is correct
35	Correct	14 ms	6008 KB	Output is correct
36	Correct	14 ms	6008 KB	Output is correct
37	Correct	14 ms	6008 KB	Output is correct
38	Correct	14 ms	6004 KB	Output is correct
39	Correct	14 ms	6008 KB	Output is correct
40	Correct	16 ms	6136 KB	Output is correct
41	Correct	15 ms	6136 KB	Output is correct
42	Correct	13 ms	6012 KB	Output is correct
43	Correct	14 ms	6132 KB	Output is correct
44	Correct	14 ms	6008 KB	Output is correct
45	Correct	14 ms	6016 KB	Output is correct
46	Correct	15 ms	6040 KB	Output is correct
47	Correct	15 ms	6084 KB	Output is correct
48	Correct	120 ms	20336 KB	Output is correct
49	Correct	121 ms	19924 KB	Output is correct
50	Correct	111 ms	20136 KB	Output is correct
51	Correct	108 ms	20140 KB	Output is correct
52	Correct	87 ms	19040 KB	Output is correct
53	Correct	107 ms	19312 KB	Output is correct
54	Correct	98 ms	18544 KB	Output is correct
55	Correct	100 ms	18144 KB	Output is correct
56	Correct	97 ms	17912 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	4216 KB	Output is correct
2	Correct	5 ms	4344 KB	Output is correct
3	Correct	5 ms	4216 KB	Output is correct
4	Correct	8 ms	4220 KB	Output is correct
5	Correct	6 ms	4344 KB	Output is correct
6	Correct	33 ms	4216 KB	Output is correct
7	Correct	6 ms	4344 KB	Output is correct
8	Correct	7 ms	4216 KB	Output is correct
9	Correct	7 ms	4244 KB	Output is correct
10	Correct	3 ms	4216 KB	Output is correct
11	Correct	6 ms	4216 KB	Output is correct
12	Correct	6 ms	4216 KB	Output is correct
13	Correct	6 ms	4216 KB	Output is correct
14	Correct	5 ms	4216 KB	Output is correct
15	Correct	5 ms	4212 KB	Output is correct
16	Correct	5 ms	4216 KB	Output is correct
17	Correct	5 ms	4344 KB	Output is correct
18	Correct	6 ms	4344 KB	Output is correct
19	Correct	5 ms	4216 KB	Output is correct
20	Correct	6 ms	4344 KB	Output is correct
21	Correct	5 ms	4216 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	6 ms	4216 KB	Output is correct
24	Correct	7 ms	4344 KB	Output is correct
25	Correct	6 ms	4344 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	13 ms	6036 KB	Output is correct
28	Correct	11 ms	5876 KB	Output is correct
29	Correct	13 ms	5872 KB	Output is correct
30	Correct	12 ms	5616 KB	Output is correct
31	Correct	13 ms	5884 KB	Output is correct
32	Correct	13 ms	5720 KB	Output is correct
33	Correct	12 ms	5876 KB	Output is correct
34	Correct	11 ms	5748 KB	Output is correct
35	Correct	14 ms	6008 KB	Output is correct
36	Correct	14 ms	6008 KB	Output is correct
37	Correct	14 ms	6008 KB	Output is correct
38	Correct	14 ms	6004 KB	Output is correct
39	Correct	14 ms	6008 KB	Output is correct
40	Correct	16 ms	6136 KB	Output is correct
41	Correct	15 ms	6136 KB	Output is correct
42	Correct	13 ms	6012 KB	Output is correct
43	Correct	14 ms	6132 KB	Output is correct
44	Correct	14 ms	6008 KB	Output is correct
45	Correct	14 ms	6016 KB	Output is correct
46	Correct	15 ms	6040 KB	Output is correct
47	Correct	15 ms	6084 KB	Output is correct
48	Correct	120 ms	20336 KB	Output is correct
49	Correct	121 ms	19924 KB	Output is correct
50	Correct	111 ms	20136 KB	Output is correct
51	Correct	108 ms	20140 KB	Output is correct
52	Correct	87 ms	19040 KB	Output is correct
53	Correct	107 ms	19312 KB	Output is correct
54	Correct	98 ms	18544 KB	Output is correct
55	Correct	100 ms	18144 KB	Output is correct
56	Correct	97 ms	17912 KB	Output is correct
57	Correct	1524 ms	76172 KB	Output is correct
58	Correct	1026 ms	56584 KB	Output is correct
59	Correct	991 ms	56336 KB	Output is correct
60	Correct	1253 ms	62796 KB	Output is correct
61	Correct	1234 ms	62796 KB	Output is correct
62	Correct	445 ms	40548 KB	Output is correct
63	Correct	643 ms	47684 KB	Output is correct
64	Correct	755 ms	43204 KB	Output is correct
65	Correct	213 ms	31696 KB	Output is correct

답안 #155296

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 30.0 / 30.0

Subtask #3 10.0 / 10.0

Subtask #4 25.0 / 25.0

Subtask #5 20.0 / 20.0

Subtask #1
15.0 / 15.0

Subtask #2
30.0 / 30.0

Subtask #3
10.0 / 10.0

Subtask #4
25.0 / 25.0

Subtask #5
20.0 / 20.0