답안 #957268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
957268	2024-04-03T11:06:12 Z	Nika533	Rope (JOI17_rope)	C++14	0 / 100	13 ms	29528 KB

rope

#pragma gcc diagnostic "-std=c++1z"
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
using namespace std;
const int N=1e6+5;
int n,m,T,k,arr[N],ans[N];
int t[N*4];
vector<int> pos[N];
void build(int v, int tl, int tr) {
     if (tl==tr) {
          t[v]=pos[tl].size();
          return;
     }
     int mid=(tl+tr)/2;
     build(v*2,tl,mid); build(v*2+1,mid+1,tr);
     t[v]=max(t[v*2],t[v*2+1]);
}
void update(int v, int tl, int tr, int ind, int val) {
     if (ind<tl || ind>tr) return;
     if (tl==tr) {
          t[v]+=val;
          return;
     }
     int mid=(tl+tr)/2;
     update(v*2,tl,mid,ind,val); update(v*2+1,mid+1,tr,ind,val);
     t[v]=max(t[v*2],t[v*2+1]);
}
void solve(int st) {
     build(1,1,m);
     for (int i=1; i<=m; i++) {
          int freq=pos[i].size();
          vector<int> p;
          for (auto j:pos[i]) {
               int o;
               if ((st+j)%2) o=j-1;
               else o=j+1;
               if (arr[o]) p.pb(arr[o]);
               p.pb(arr[j]);
          }
          for (auto x:p) update(1,1,m,x,-1);
          int mx=t[1];
          ans[i]=min(ans[i],n-mx-freq);
          for (auto x:p) update(1,1,m,x,1);
     }
}
void test_case() {
     cin>>n>>m;
     for (int i=1; i<=n; i++) {
          cin>>arr[i];
          pos[arr[i]].pb(i);
     }
     for (int i=1; i<=m; i++) ans[i]=1e9;
     solve(0); solve(1);
     for (int i=1; i<=m; i++) cout<<ans[i]<<endl;
}
main () {
	ios :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	T=1; 
	while (T--) test_case();
}

Compilation message

rope.cpp:1: warning: ignoring '#pragma gcc diagnostic' [-Wunknown-pragmas]
    1 | #pragma gcc diagnostic "-std=c++1z"
      | 
rope.cpp:63:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 | main () {
      | ^~~~

Subtask #1

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	29528 KB	Output is correct
2	Correct	7 ms	29276 KB	Output is correct
3	Correct	6 ms	29276 KB	Output is correct
4	Correct	6 ms	29276 KB	Output is correct
5	Correct	7 ms	29360 KB	Output is correct
6	Correct	6 ms	29276 KB	Output is correct
7	Correct	7 ms	29292 KB	Output is correct
8	Correct	6 ms	29272 KB	Output is correct
9	Correct	7 ms	29272 KB	Output is correct
10	Correct	7 ms	29276 KB	Output is correct
11	Correct	7 ms	29276 KB	Output is correct
12	Correct	6 ms	29276 KB	Output is correct
13	Correct	7 ms	29276 KB	Output is correct
14	Correct	6 ms	29276 KB	Output is correct
15	Correct	7 ms	29308 KB	Output is correct
16	Correct	7 ms	29276 KB	Output is correct
17	Correct	6 ms	29356 KB	Output is correct
18	Correct	6 ms	29528 KB	Output is correct
19	Correct	7 ms	29308 KB	Output is correct
20	Correct	8 ms	29276 KB	Output is correct
21	Correct	6 ms	29276 KB	Output is correct
22	Correct	6 ms	29360 KB	Output is correct
23	Correct	7 ms	29276 KB	Output is correct
24	Correct	6 ms	29276 KB	Output is correct
25	Correct	6 ms	29276 KB	Output is correct
26	Incorrect	7 ms	29272 KB	Output isn't correct
27	Halted	0 ms	0 KB	-

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	29528 KB	Output is correct
2	Correct	7 ms	29276 KB	Output is correct
3	Correct	6 ms	29276 KB	Output is correct
4	Correct	6 ms	29276 KB	Output is correct
5	Correct	7 ms	29360 KB	Output is correct
6	Correct	6 ms	29276 KB	Output is correct
7	Correct	7 ms	29292 KB	Output is correct
8	Correct	6 ms	29272 KB	Output is correct
9	Correct	7 ms	29272 KB	Output is correct
10	Correct	7 ms	29276 KB	Output is correct
11	Correct	7 ms	29276 KB	Output is correct
12	Correct	6 ms	29276 KB	Output is correct
13	Correct	7 ms	29276 KB	Output is correct
14	Correct	6 ms	29276 KB	Output is correct
15	Correct	7 ms	29308 KB	Output is correct
16	Correct	7 ms	29276 KB	Output is correct
17	Correct	6 ms	29356 KB	Output is correct
18	Correct	6 ms	29528 KB	Output is correct
19	Correct	7 ms	29308 KB	Output is correct
20	Correct	8 ms	29276 KB	Output is correct
21	Correct	6 ms	29276 KB	Output is correct
22	Correct	6 ms	29360 KB	Output is correct
23	Correct	7 ms	29276 KB	Output is correct
24	Correct	6 ms	29276 KB	Output is correct
25	Correct	6 ms	29276 KB	Output is correct
26	Incorrect	7 ms	29272 KB	Output isn't correct
27	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	29528 KB	Output is correct
2	Correct	7 ms	29276 KB	Output is correct
3	Correct	6 ms	29276 KB	Output is correct
4	Correct	6 ms	29276 KB	Output is correct
5	Correct	7 ms	29360 KB	Output is correct
6	Correct	6 ms	29276 KB	Output is correct
7	Correct	7 ms	29292 KB	Output is correct
8	Correct	6 ms	29272 KB	Output is correct
9	Correct	7 ms	29272 KB	Output is correct
10	Correct	7 ms	29276 KB	Output is correct
11	Correct	7 ms	29276 KB	Output is correct
12	Correct	6 ms	29276 KB	Output is correct
13	Correct	7 ms	29276 KB	Output is correct
14	Correct	6 ms	29276 KB	Output is correct
15	Correct	7 ms	29308 KB	Output is correct
16	Correct	7 ms	29276 KB	Output is correct
17	Correct	6 ms	29356 KB	Output is correct
18	Correct	6 ms	29528 KB	Output is correct
19	Correct	7 ms	29308 KB	Output is correct
20	Correct	8 ms	29276 KB	Output is correct
21	Correct	6 ms	29276 KB	Output is correct
22	Correct	6 ms	29360 KB	Output is correct
23	Correct	7 ms	29276 KB	Output is correct
24	Correct	6 ms	29276 KB	Output is correct
25	Correct	6 ms	29276 KB	Output is correct
26	Incorrect	7 ms	29272 KB	Output isn't correct
27	Halted	0 ms	0 KB	-

Subtask #4

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	29528 KB	Output is correct
2	Correct	7 ms	29276 KB	Output is correct
3	Correct	6 ms	29276 KB	Output is correct
4	Correct	6 ms	29276 KB	Output is correct
5	Correct	7 ms	29360 KB	Output is correct
6	Correct	6 ms	29276 KB	Output is correct
7	Correct	7 ms	29292 KB	Output is correct
8	Correct	6 ms	29272 KB	Output is correct
9	Correct	7 ms	29272 KB	Output is correct
10	Correct	7 ms	29276 KB	Output is correct
11	Correct	7 ms	29276 KB	Output is correct
12	Correct	6 ms	29276 KB	Output is correct
13	Correct	7 ms	29276 KB	Output is correct
14	Correct	6 ms	29276 KB	Output is correct
15	Correct	7 ms	29308 KB	Output is correct
16	Correct	7 ms	29276 KB	Output is correct
17	Correct	6 ms	29356 KB	Output is correct
18	Correct	6 ms	29528 KB	Output is correct
19	Correct	7 ms	29308 KB	Output is correct
20	Correct	8 ms	29276 KB	Output is correct
21	Correct	6 ms	29276 KB	Output is correct
22	Correct	6 ms	29360 KB	Output is correct
23	Correct	7 ms	29276 KB	Output is correct
24	Correct	6 ms	29276 KB	Output is correct
25	Correct	6 ms	29276 KB	Output is correct
26	Incorrect	7 ms	29272 KB	Output isn't correct
27	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	29528 KB	Output is correct
2	Correct	7 ms	29276 KB	Output is correct
3	Correct	6 ms	29276 KB	Output is correct
4	Correct	6 ms	29276 KB	Output is correct
5	Correct	7 ms	29360 KB	Output is correct
6	Correct	6 ms	29276 KB	Output is correct
7	Correct	7 ms	29292 KB	Output is correct
8	Correct	6 ms	29272 KB	Output is correct
9	Correct	7 ms	29272 KB	Output is correct
10	Correct	7 ms	29276 KB	Output is correct
11	Correct	7 ms	29276 KB	Output is correct
12	Correct	6 ms	29276 KB	Output is correct
13	Correct	7 ms	29276 KB	Output is correct
14	Correct	6 ms	29276 KB	Output is correct
15	Correct	7 ms	29308 KB	Output is correct
16	Correct	7 ms	29276 KB	Output is correct
17	Correct	6 ms	29356 KB	Output is correct
18	Correct	6 ms	29528 KB	Output is correct
19	Correct	7 ms	29308 KB	Output is correct
20	Correct	8 ms	29276 KB	Output is correct
21	Correct	6 ms	29276 KB	Output is correct
22	Correct	6 ms	29360 KB	Output is correct
23	Correct	7 ms	29276 KB	Output is correct
24	Correct	6 ms	29276 KB	Output is correct
25	Correct	6 ms	29276 KB	Output is correct
26	Incorrect	7 ms	29272 KB	Output isn't correct
27	Halted	0 ms	0 KB	-