oj.uz

Submission #897000

# Submission time Handle Problem Language Result Execution time Memory
897000 2024-01-02T12:06:22 Z Nexus Three Friends (BOI14_friends) C++17
0 / 100
 49 ms 2552 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <math.h>
#include <string>
#include <algorithm>
#include <random>
#include <iomanip>
#include <utility>
#include <cstring>
//#include <bits/stdc++.h>

#define ll long long
#define s .size()

using namespace std;

const ll N=1e5+9,M=1e18+9,mod=1e9+7;
//cout<<fixed<<setprecision(6)<<

ll n,x,y;
string a,b;
map<char,ll>m;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	
	cin>>n>>a;
	if(!(n%2))goto end;
	for(ll i=0;i<n;++i)++m[a[i]];
	for(auto i:m)if(i.second%2)++x,y=i.second;
	end:
	if(x!=1)cout<<"NOT POSSIBLE";
	else if(y>1)cout<<"NOT UNIQUE";
	else{
		for(ll i=0;i<n;++i)
		if(m[a[i]]>1)b+=a[i];
		n/=2;
		for(ll i=0;i<n;++i)cout<<b[i];
	}
}

Subtask #1
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Incorrect 1 ms 348 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 2552 KB Output isn't correct
2 Halted 0 ms 0 KB -