Submission #349404

#	Time	Username	Problem	Language	Result	Execution time	Memory
349404		Rainbowbunny	Three Friends (BOI14_friends)	C++17	100 / 100	65 ms	9196 KiB

friends

#include <iostream>
#include <vector>

int n, pt;
bool ok1, ok2;
std::string s, t1, t2;

int main()
{
	std::cin >> n;
	if(n % 2 == 0)
	{
		std::cout << "NOT POSSIBLE";
		return 0;
	}
	std::cin >> s;
	for(int i = 0; i < n / 2; i++)
	{
		t1.push_back(s[i]);
	}
	for(int i = n / 2 + 1; i < n; i++)
	{
		t2.push_back(s[i]);
	}
	pt = 0;
	for(int i = n / 2; i < n; i++)
	{
		if(pt != t1.size() and s[i] == t1[pt])
		{
			pt++;
		}
	}
	if(pt == t1.size())
	{
		ok1 = true;
	}
	pt = 0;
	for(int i = 0; i <= n / 2; i++)
	{
		if(pt != t2.size() and s[i] == t2[pt])
		{
			pt++;
		}
	}
	if(pt == t2.size())
	{
		ok2 = true;
	}
	if(ok1 and ok2 and t1 != t2)
	{
		std::cout << "NOT UNIQUE";
	}
	else if(ok1)
	{
		std::cout << t1;
	}
	else if(ok2)
	{
		std::cout << t2;
	}
	else
	{
		std::cout << "NOT POSSIBLE";
	}
}

Compilation message (stderr)

friends.cpp: In function 'int main()':
friends.cpp:28:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   if(pt != t1.size() and s[i] == t1[pt])
      |      ~~~^~~~~~~~~~~~
friends.cpp:33:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  if(pt == t1.size())
      |     ~~~^~~~~~~~~~~~
friends.cpp:40:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |   if(pt != t2.size() and s[i] == t2[pt])
      |      ~~~^~~~~~~~~~~~
friends.cpp:45:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  if(pt == t2.size())
      |     ~~~^~~~~~~~~~~~

• Subtask 1: 35 / 35
• Subtask 2: 65 / 65