Submission #19460357


Source Code Expand

Copy
#include <iostream>
#include <string>
#include <set>

using namespace std;

int main(){
	int n;
	cin >> n;
	string s;
	cin >> s;
	int maks = -1;
	set<char> a[n],b[n];
	for (int i = 1; i < n; ++i)
	{	
		for (int j = 0; j < i; ++j)
		{
			a[i].insert(s[j]); 
		}
		for (int j = i; j < n; ++j)
		{
			b[i].insert(s[j]);
		}
		int y = 0;
		for (auto x: b[i]){
			if (a[i].count(x) == 1)
				y++;
		}
		if (y > maks){
			maks =y;
		}
	}
	cout << maks;

	return 0;
}

Submission Info

Submission Time
Task B - Cut and Count
User Markisha
Language C++ (GCC 9.2.1)
Score 200
Code Size 495 Byte
Status AC
Exec Time 12 ms
Memory 3812 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 25
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt
Case Name Status Exec Time Memory
sample_01.txt AC 12 ms 3600 KB
sample_02.txt AC 2 ms 3600 KB
sample_03.txt AC 2 ms 3620 KB
subtask_1_01.txt AC 1 ms 3608 KB
subtask_1_02.txt AC 1 ms 3560 KB
subtask_1_03.txt AC 2 ms 3584 KB
subtask_1_04.txt AC 1 ms 3532 KB
subtask_1_05.txt AC 2 ms 3492 KB
subtask_1_06.txt AC 2 ms 3608 KB
subtask_1_07.txt AC 2 ms 3644 KB
subtask_1_08.txt AC 5 ms 3700 KB
subtask_1_09.txt AC 3 ms 3604 KB
subtask_1_10.txt AC 2 ms 3564 KB
subtask_1_11.txt AC 3 ms 3556 KB
subtask_1_12.txt AC 2 ms 3424 KB
subtask_1_13.txt AC 3 ms 3564 KB
subtask_1_14.txt AC 3 ms 3644 KB
subtask_1_15.txt AC 4 ms 3664 KB
subtask_1_16.txt AC 5 ms 3812 KB
subtask_1_17.txt AC 2 ms 3736 KB
subtask_1_18.txt AC 3 ms 3636 KB
subtask_1_19.txt AC 3 ms 3492 KB