답안 #539116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
539116 2022-03-18T12:28:54 Z vector Rope (JOI17_rope) C++17
0 / 100
12 ms 23828 KB
#include<bits/stdc++.h>
#define SIZE 1000001
using namespace std;
int N,M,A[SIZE],B[SIZE],C[SIZE],D[SIZE],ans[SIZE];
vector<int>v[SIZE];
int main()
{
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin>>N>>M;
    for(int i=1;i<=N;i++){
        cin>>A[i];
        B[A[i]]++;
    }
    for(int i=1;i<=M;i++){
        int mx=0;
        for(int j=1;j<=M;j++)C[j]=0;
        for(int j=1;j<N;j+=2){
            if(A[j]==i||A[j+1]==i)C[A[j]]++,C[A[j+1]]++;
            else if(A[j]==A[j+1])C[A[j]]+=2;
        }
        if(N%2)C[A[N]]++;
        for(int j=1;j<=M;j++)mx=max(B[j]-C[j],mx);
        for(int j=1;j<=M;j++)C[j]=0;
        C[A[1]]++;
        for(int j=2;j<N;j+=2){
            if(A[j]==i||A[j+1]==i)C[A[j]]++,C[A[j+1]]++;
            else if(A[j]==A[j+1])C[A[j]]+=2;
        }
        if(N%2==0)C[A[N]]++;
        for(int j=1;j<=M;j++)mx=max(B[j]-C[j],mx);
        printf("%d\n",N-B[i]-mx);
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23828 KB Output is correct
3 Incorrect 12 ms 23740 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23828 KB Output is correct
3 Incorrect 12 ms 23740 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23828 KB Output is correct
3 Incorrect 12 ms 23740 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23828 KB Output is correct
3 Incorrect 12 ms 23740 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23828 KB Output is correct
3 Incorrect 12 ms 23740 KB Output isn't correct
4 Halted 0 ms 0 KB -