oj.uz

Submission #62519

# Submission time Handle Problem Language Result Execution time Memory
62519 2018-07-28T21:14:18 Z Mamnoon_Siam Three Friends (BOI14_friends) C++17
100 / 100
 113 ms 16788 KB 
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
// #include <bits/extc++.h>
using namespace std;

#define debug(s) cout << #s << " = " << s << endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a, val) memset(a, val, sizeof (a))
#define PB push_back
#define endl '\n'
typedef long long ll;

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}

template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
	return os<<"(" <<p.first<<", "<<p.second<<")"; }

typedef pair<int, int> ii;

template<typename T> using min_pq =
	std::priority_queue<T, vector<T>, greater<T> >;

//int dx[] = {-1, +0, +1, +0};
//int dy[] = {+0, +1, +0, -1};

bool can(string s, string p) {
	for(int i = 0; i < s.size(); i++) {
		if(s[i] != p[i]) {
			p.erase(p.begin() + i);
			return s == p;
		}
	} return true;
}

int32_t main () {
	// freopen("in", "r", stdin);
    int n; cin >> n;
    if(n % 2 == 0) {
    	cout << "NOT POSSIBLE" << endl;
    	return 0;
    }
    string s; cin >> s;
    string L = s.substr(0, (n >> 1));
    string LL = s.substr(0, (n >> 1) + 1);
    string R = s.substr((n >> 1) + 1, (n >> 1));
    string RR = s.substr((n >> 1), (n >> 1) + 1);
    assert(L + RR == s and LL + R == s);
    set<string> st;
    if(can(L, RR)) st.insert(L);
    if(can(R, LL)) st.insert(R);
    if(st.size() > 1) cout << "NOT UNIQUE" << endl;
    else if(can(L, RR)) cout << L << endl;
    else if(can(R, LL)) cout << R << endl;
    else cout << "NOT POSSIBLE" << endl;
}

Compilation message

friends.cpp: In function 'int myrand(int, int)':
friends.cpp:18:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
friends.cpp:18:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~
friends.cpp: In function 'bool can(std::__cxx11::string, std::__cxx11::string)':
friends.cpp:35:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < s.size(); i++) {
                 ~~^~~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 3 ms 572 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 3 ms 652 KB Output is correct
14 Correct 3 ms 652 KB Output is correct
15 Correct 3 ms 652 KB Output is correct
16 Correct 3 ms 652 KB Output is correct
17 Correct 3 ms 652 KB Output is correct
18 Correct 2 ms 652 KB Output is correct
19 Correct 2 ms 684 KB Output is correct
20 Correct 2 ms 684 KB Output is correct
21 Correct 3 ms 684 KB Output is correct
22 Correct 2 ms 684 KB Output is correct
23 Correct 2 ms 684 KB Output is correct
24 Correct 3 ms 684 KB Output is correct
25 Correct 2 ms 684 KB Output is correct
26 Correct 2 ms 684 KB Output is correct
27 Correct 2 ms 684 KB Output is correct
28 Correct 3 ms 720 KB Output is correct
29 Correct 3 ms 720 KB Output is correct
30 Correct 3 ms 728 KB Output is correct
31 Correct 2 ms 728 KB Output is correct
32 Correct 3 ms 728 KB Output is correct
33 Correct 2 ms 728 KB Output is correct
34 Correct 3 ms 728 KB Output is correct
35 Correct 3 ms 744 KB Output is correct
36 Correct 3 ms 744 KB Output is correct
37 Correct 2 ms 744 KB Output is correct
38 Correct 3 ms 744 KB Output is correct
39 Correct 3 ms 744 KB Output is correct
40 Correct 3 ms 744 KB Output is correct
41 Correct 2 ms 744 KB Output is correct
42 Correct 3 ms 772 KB Output is correct
43 Correct 3 ms 772 KB Output is correct
44 Correct 3 ms 772 KB Output is correct
45 Correct 4 ms 796 KB Output is correct
46 Correct 4 ms 796 KB Output is correct
47 Correct 4 ms 804 KB Output is correct
48 Correct 3 ms 812 KB Output is correct
49 Correct 3 ms 816 KB Output is correct
50 Correct 3 ms 816 KB Output is correct
51 Correct 3 ms 820 KB Output is correct
52 Correct 2 ms 824 KB Output is correct
53 Correct 3 ms 824 KB Output is correct
54 Correct 3 ms 824 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 11564 KB Output is correct
2 Correct 90 ms 11580 KB Output is correct
3 Correct 104 ms 11580 KB Output is correct
4 Correct 94 ms 11596 KB Output is correct
5 Correct 101 ms 11600 KB Output is correct
6 Correct 3 ms 11600 KB Output is correct
7 Correct 90 ms 11644 KB Output is correct
8 Correct 113 ms 12252 KB Output is correct
9 Correct 99 ms 14004 KB Output is correct
10 Correct 91 ms 15780 KB Output is correct
11 Correct 109 ms 16788 KB Output is correct
12 Correct 3 ms 16788 KB Output is correct
13 Correct 2 ms 16788 KB Output is correct
14 Correct 3 ms 16788 KB Output is correct
15 Correct 3 ms 16788 KB Output is correct
16 Correct 3 ms 16788 KB Output is correct
17 Correct 3 ms 16788 KB Output is correct
18 Correct 3 ms 16788 KB Output is correct
19 Correct 3 ms 16788 KB Output is correct
20 Correct 3 ms 16788 KB Output is correct
21 Correct 3 ms 16788 KB Output is correct
22 Correct 4 ms 16788 KB Output is correct
23 Correct 2 ms 16788 KB Output is correct
24 Correct 3 ms 16788 KB Output is correct
25 Correct 2 ms 16788 KB Output is correct
26 Correct 3 ms 16788 KB Output is correct
27 Correct 2 ms 16788 KB Output is correct
28 Correct 3 ms 16788 KB Output is correct
29 Correct 2 ms 16788 KB Output is correct
30 Correct 3 ms 16788 KB Output is correct
31 Correct 3 ms 16788 KB Output is correct
32 Correct 3 ms 16788 KB Output is correct
33 Correct 2 ms 16788 KB Output is correct
34 Correct 3 ms 16788 KB Output is correct
35 Correct 3 ms 16788 KB Output is correct
36 Correct 2 ms 16788 KB Output is correct
37 Correct 2 ms 16788 KB Output is correct
38 Correct 3 ms 16788 KB Output is correct
39 Correct 2 ms 16788 KB Output is correct
40 Correct 2 ms 16788 KB Output is correct
41 Correct 3 ms 16788 KB Output is correct
42 Correct 3 ms 16788 KB Output is correct
43 Correct 3 ms 16788 KB Output is correct
44 Correct 3 ms 16788 KB Output is correct
45 Correct 3 ms 16788 KB Output is correct
46 Correct 3 ms 16788 KB Output is correct
47 Correct 4 ms 16788 KB Output is correct
48 Correct 3 ms 16788 KB Output is correct
49 Correct 4 ms 16788 KB Output is correct
50 Correct 3 ms 16788 KB Output is correct
51 Correct 3 ms 16788 KB Output is correct
52 Correct 3 ms 16788 KB Output is correct
53 Correct 3 ms 16788 KB Output is correct
54 Correct 3 ms 16788 KB Output is correct