結果

問題 No.2073 Concon Substrings (Swap Version)
ユーザー deuteridayodeuteridayo
提出日時 2023-12-02 23:25:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,346 bytes
コンパイル時間 4,400 ms
コンパイル使用メモリ 271,368 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-26 21:43:34
合計ジャッジ時間 6,052 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 22 ms
5,376 KB
testcase_06 AC 23 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 15 ms
5,376 KB
testcase_09 AC 19 ms
5,376 KB
testcase_10 AC 25 ms
5,376 KB
testcase_11 AC 24 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 4 ms
5,376 KB
testcase_14 AC 21 ms
5,376 KB
testcase_15 AC 9 ms
5,376 KB
testcase_16 AC 17 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 3 ms
5,376 KB
testcase_19 AC 17 ms
5,376 KB
testcase_20 AC 12 ms
5,376 KB
testcase_21 AC 11 ms
5,376 KB
testcase_22 AC 17 ms
5,376 KB
testcase_23 AC 2 ms
5,376 KB
testcase_24 AC 2 ms
5,376 KB
testcase_25 AC 12 ms
5,376 KB
testcase_26 AC 17 ms
5,376 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 14 ms
5,376 KB
testcase_29 AC 6 ms
5,376 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

// Smartphone Coding

#include"bits/stdc++.h"
#include"atcoder/all"
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
using llint = __int128_t;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
lint const mod107 = 1e9+7;
using mint107 = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint a, lint b){if(a%b==0){return a/b;}
  if(a>=0){return (a/b)+1;}
  else{return -((-a)/b);}}
lint floorDiv(lint a, lint b){if(a%b==0){return a/b;}
  if(a>=0){return (a/b);}
  else{return -((-a)/b)-1;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[250001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=250000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= p;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(r<0)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define al(x) x.begin(),x.end()
#define ral(x) x.rbegin(),x.rend()
using str=string;


template< typename T >
T extgcd(T a, T b, T &x, T &y) {
  T d = a;
  if(b != 0) {
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  } else {
    x = 1;
    y = 0;
  }
  return d;
}
struct edge{
    int to;
    lint cost;
};
using graph = vector<vec<edge>>;
vec<lint>dijkstra(int s, graph& g){
	priority_queue<pair<lint,lint>>que;
	vec<lint> cost(g.size(),INF64);
	cost[s]=0;
	que.push({0,s});
	while(!que.empty()){
		auto q=que.top();
		que.pop();
		int v=q.second;
		for(auto e:g[v]){
			if(cost[e.to]>cost[v]+e.cost){
				cost[e.to]=cost[v]+e.cost;
				que.push({-cost[e.to],e.to});
			}
		}
	}
	return cost;
}


int main(){
	int n;cin>>n;
	string s;cin>>s;
	vec<vec<int>>C(3,vec<int>(3));
	string con="con";
	int ans=0;
	rep(i,3){
		rep(j,n){
			rep(k,3){
				if(s[j *3+i]==con[k]){
					C[i][k]++;
				}
			}
		}
		
	}
	rep(i,3){
		int m=INF;
		rep(k,3)m=min(m,C[(i+k)%3][k]);
		
		if(i>0)m=min(m,n-1);
		ans+=m;
	}
	
	cout<<ans;
}
0