Submission #23620661

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<ll>>;


int main(){

  ll n;
  cin >> n;

  ll ax = 200001;
  vector<ll> a(n+1);
  vector<bool> cou(ax+1);
  Graph G(ax+1,vector<ll>(ax+1,0));

  REP1(i,n){
    cin >> a.at(i);
  }

  ll sum=0;

  for(ll i=1;i<=n/2;i++){
    if(a.at(i)!=a.at(n+1-i)){
      cou[a.at(i)] =true;
      cou[a.at(n+1-i)] =true;
    }
  }


  REP1(i,ax){
    if(cou[i]){
      sum++;
    }
  }
  sum--;
  if(sum<0){
    sum = 0;
  }

  ll sum2=0;
  for(ll i=1;i<=n/2;i++){
    if(a.at(i)!=a.at(n+1-i)){
      if(G[a.at(i)][a.at(n+1-i)]!=1){
        sum2++;
      }

      G[a.at(i)][a.at(n+1-i)]=1;
      G[a.at(n+1-i)][a.at(i)]=1;
    }
  }

  
  cout << min(sum,sum2)<< endl;
}

Submission Info

Submission Time
Task D - KAIBUNsyo
User takkey
Language C++ (GCC 9.2.1)
Score 0
Code Size 1195 Byte
Status RE
Exec Time 2147 ms
Memory 3502896 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
RE × 3
RE × 31
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt
Case Name Status Exec Time Memory
sample_01.txt RE 2070 ms 3501076 KiB
sample_02.txt RE 2018 ms 3501656 KiB
sample_03.txt RE 2053 ms 3502020 KiB
test_01.txt RE 2038 ms 3502616 KiB
test_02.txt RE 2039 ms 3501948 KiB
test_03.txt RE 2079 ms 3502080 KiB
test_04.txt RE 2050 ms 3501996 KiB
test_05.txt RE 2074 ms 3501828 KiB
test_06.txt RE 2051 ms 3500356 KiB
test_07.txt RE 2066 ms 3502896 KiB
test_08.txt RE 2068 ms 3501976 KiB
test_09.txt RE 2053 ms 3501760 KiB
test_10.txt RE 2041 ms 3502684 KiB
test_11.txt RE 2066 ms 3501624 KiB
test_12.txt RE 2067 ms 3501692 KiB
test_13.txt RE 2065 ms 3501324 KiB
test_14.txt RE 2033 ms 3501272 KiB
test_15.txt RE 2132 ms 3502056 KiB
test_16.txt RE 2070 ms 3501476 KiB
test_17.txt RE 2069 ms 3501340 KiB
test_18.txt RE 2081 ms 3501504 KiB
test_19.txt RE 2057 ms 3502188 KiB
test_20.txt RE 2128 ms 3502516 KiB
test_21.txt RE 2055 ms 3501708 KiB
test_22.txt RE 2053 ms 3501408 KiB
test_23.txt RE 2098 ms 3502332 KiB
test_24.txt RE 2065 ms 3501852 KiB
test_25.txt RE 2048 ms 3502112 KiB
test_26.txt RE 2147 ms 3501820 KiB
test_27.txt RE 2043 ms 3501732 KiB
test_28.txt RE 2050 ms 3502456 KiB