text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, t, n, m, x, p, k;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> t;
while (t--) {
cin >> n;
int ways = 0;
vector<int> ans;
vector<int> v(n);
for (long long i = 0; i < n; i++) cin >> v[i];
bool repeat = 0;
set<int> elems;
set<int> other(v.begin(), v.end());
map<int, int> counts;
for (long long i = 0; i < n; i++) {
counts[v[i]]++;
}
int smal = 1e8;
int lar = -1e8;
for (int i = 0; i < n - 1; i++) {
if (elems.find(v[i]) == elems.end()) {
elems.insert(v[i]);
counts[v[i]]--;
if (counts[v[i]] == 0) other.erase(v[i]);
if (v[i] < smal) smal = v[i];
if (v[i] > lar) lar = v[i];
if (lar - smal + 1 == elems.size() && smal == 1 && lar == elems.size())
if ((n - i - 1 == other.size() && *other.begin() == 1 &&
*other.rbegin() == other.size()))
ans.push_back(i + 1);
} else {
repeat = 0;
break;
}
}
cout << ans.size() << '\n';
for (int x : ans) cout << x << ' ' << n - x << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i = 0, j = 0, n, m, d, e = 0, t = 0, x, y, f = 0, o, k, z = 0,
l = 0, x1, x2, y1, y2;
cin >> t;
while (t--) {
cin >> n;
vector<long long int> v;
vector<long long int> v1;
vector<long long int> a;
vector<long long int> b;
vector<long long int> c;
vector<long long int> h;
vector<long long int> p, p1, p2;
set<long long int> s1, s2;
s1.clear();
s2.clear();
p1.clear();
p2.clear();
p.clear();
h.clear();
f = 0;
z = 0;
l = 0;
v1.clear();
a.clear();
b.clear();
c.clear();
v.clear();
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
if (x == 1) {
v1.push_back(i);
f++;
}
}
if (f != 2) {
cout << "0" << endl;
continue;
} else {
for (i = 0; i < n; i++) {
s1.insert(v[i]);
s2.insert(v[n - 1 - i]);
p1.push_back(s1.size());
p2.push_back(s2.size());
}
long long int sum = 0;
k = 1;
d = 0;
for (i = 0; i < n; i++) {
d = d + k;
c.push_back(d);
k++;
}
d = 0;
k = 1;
for (i = 0; i < n; i++) {
sum = sum + v[i];
a.push_back(sum);
}
sum = 0;
for (i = 0; i < n; i++) {
sum = sum + v[n - 1 - i];
b.push_back(sum);
}
for (j = v1[0]; j < v1[1]; j++) {
if (b[n - 1 - j - 1] == c[n - 1 - j - 1] && a[j] == c[j] &&
p1[j] == j + 1 && p2[n - 1 - j - 1] == n - (j + 1)) {
l++;
h.push_back(j + 1);
p.push_back(n - (j + 1));
z = 1;
}
}
if (z == 0) {
cout << "0" << endl;
}
if (z == 1) {
cout << l << endl;
for (i = 0; i < l; i++) {
cout << h[i] << " " << p[i] << endl;
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<pair<int, int>> pref(n + 1, {0, 0});
vector<int> isPref(n, 0);
pref[0].first = 1;
pref[0].second = 1;
int maxi = 0;
for (int i = 0; i < n - 1; i++) {
maxi = max(maxi, a[i]);
if (!(pref[a[i]].first == 1)) {
if (pref[a[i] - 1].second == 1 && pref[a[i] - 1].first == 1) {
pref[a[i] - 1].second = 0;
pref[a[i]].first = 1;
pref[a[i]].second = 1;
int ind = a[i] + 1;
while (pref[ind].first == 1) {
ind++;
}
pref[ind - 1].first = 1;
pref[ind - 1].second = 1;
if (ind - 1 == maxi) isPref[i] = 1;
} else {
pref[a[i]].first = 1;
}
} else
break;
}
maxi = 0;
vector<pair<int, int>> suff(n + 1, {0, 0});
vector<int> isSuff(n, 0);
suff[0].first = 1;
suff[0].second = 1;
for (int i = n - 1; i >= 1; i--) {
maxi = max(maxi, a[i]);
if (!(suff[a[i]].first == 1)) {
if (suff[a[i] - 1].second == 1 && suff[a[i] - 1].first == 1) {
suff[a[i] - 1].second = 0;
suff[a[i]].first = 1;
suff[a[i]].second = 1;
int ind = a[i] + 1;
while (suff[ind].first == 1) {
ind++;
}
suff[ind - 1].first = 1;
suff[ind - 1].second = 1;
if (ind - 1 == maxi) isSuff[i] = 1;
} else {
suff[a[i]].first = 1;
}
} else
break;
}
vector<int> ans;
for (int i = 0; i < n - 1; i++) {
if (isPref[i] && isSuff[i + 1]) {
ans.push_back(i);
}
}
cout << ans.size() << "\n";
for (auto i : ans) {
cout << i + 1 << " " << n - i - 1 << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t, n, m, k, x;
void genF(map<int, int> &f, map<int, int> &b, vector<int> *arr) {
int mina = 10000000;
int maxa = -1;
for (int x = 1; x <= n - 1; x++) {
if (arr[x].size() == 0) break;
mina = min(mina, arr[x][0]);
maxa = max(maxa, arr[x][0]);
if (maxa - mina + 1 == x) {
if (mina == 1) f[x]++;
}
}
}
void genB(map<int, int> &f, map<int, int> &b, vector<int> *arr) {
int mina = 10000000;
int maxa = -1;
int p = 0;
for (int x = 1; x <= n - 1; x++) {
if (arr[x].size() == 0) break;
if (arr[x].size() == 1)
p = 0;
else if (arr[x].size() == 2)
p = 1;
else
break;
mina = min(mina, arr[x][p]);
maxa = max(maxa, arr[x][p]);
if (maxa - mina + 1 == x) {
if (maxa == n) b[x]++;
}
}
}
int main() {
cin >> t;
while (t--) {
cin >> n;
vector<int> arr[n];
for (int x = 1; x <= n; x++) {
cin >> m;
arr[m].push_back(x);
}
if (arr[1].size() < 2) {
cout << 0 << endl;
continue;
}
map<int, int> forw;
map<int, int> backw;
genF(forw, backw, arr);
genB(forw, backw, arr);
int res = 0;
vector<pair<int, int> > r;
for (auto i = forw.begin(); i != forw.end(); i++) {
if (backw[n - i->first]) {
res++;
r.push_back({i->first, n - i->first});
}
}
cout << res << endl;
for (int x = 0; x < r.size(); x++) {
cout << r[x].first << " " << r[x].second << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int modularExponentiation(long long int x, long long int y,
long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
bool isPrime(long long int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t = 1;
cin >> t;
while (t--) {
long long int n;
cin >> n;
vector<long long int> v(n);
long long int _max1 = 0;
long long int _max2 = 0;
map<long long int, long long int> mp;
set<long long int> s;
for (int i = 0; i < n; i++) {
cin >> v[i];
_max1 = max(v[i], _max1);
mp[v[i]]++;
if (mp[v[i]] == 2) _max2 = max(v[i], _max2);
}
long long int flag = 1;
for (int i = 1; i <= _max1; i++) {
if (mp.count(i) == 0 && mp[i] == 0)
flag = 0;
else
mp[i]--;
}
for (int i = 1; i <= _max2; i++) {
if (mp.count(i) == 0 && mp[i] == 0)
flag = 0;
else
mp[i]--;
}
for (auto e : mp) {
if (e.second) flag = 0;
}
if (flag == 0 || _max1 + _max2 != n) {
cout << 0 << endl;
} else {
flag = 1;
vector<pair<long long int, long long int> > ans;
vector<long long int> c(n, 0);
for (int i = 0; i < n; i++) {
s.insert(v[i]);
c[v[i]]++;
if (s.size() == _max1 && _max1 == i + 1 && n - i - 1 == _max2) {
for (int j = 1; j <= _max1; j++) {
if (c[j] == 1)
continue;
else
flag = 0;
}
if (flag) ans.push_back({i + 1, _max2});
flag = 1;
continue;
}
if (s.size() == _max2 && _max2 == i + 1 && n - i - 1 == _max1) {
for (int j = 1; j <= _max2; j++) {
if (c[j] == 1)
continue;
else
flag = 0;
}
if (flag) ans.push_back({i + 1, _max1});
flag = 1;
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i].first << " " << ans[i].second << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, t;
cin >> n;
vector<long long> v(n), cnt(n + 2, 0), ans;
for (long long i = 0; i < n; ++i) {
cin >> v[i];
++cnt[v[i]];
}
long long ind = 1;
if (cnt[1] != 2) {
cout << "0\n";
return;
}
while (cnt[ind] == 2) ++ind;
long long p1, p2;
p1 = ind - 1;
p2 = ind;
long long sum = 0;
if (2 * p1 == n) {
for (long long i = 0; i < n; ++i) {
sum += v[i];
if (i == p1 - 1 && sum == ((p1 * p1 + p1) / 2)) ans.push_back(p1);
}
cout << ans.size() << "\n";
if (!ans.empty()) {
for (auto& now : ans) cout << now << " " << n - now << "\n";
}
return;
}
if (cnt[ind] != 1) {
cout << "0\n";
return;
}
while (cnt[ind] == 1) ++ind;
p2 = ind - p2;
if (2 * p1 + p2 != n) {
cout << "0\n";
return;
}
p2 += p1;
sum = 0;
for (long long i = 0; i < n; ++i) {
sum += v[i];
if (i == p1 - 1 && sum == ((p1 * p1 + p1) / 2)) ans.push_back(p1);
if (i == p2 - 1 && sum == ((p2 * p2 + p2) / 2)) ans.push_back(p2);
}
cout << ans.size() << "\n";
if (!ans.empty()) {
for (auto& now : ans) cout << now << " " << n - now << "\n";
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
for (long long i = 1; i <= t; ++i) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> perm(n);
vector<bool> l(n), r(n);
for (int i = 0; i < n; i++) cin >> perm[i];
set<int> s;
for (int i = 0; i < n; i++) {
if (s.find(perm[i]) != s.end()) break;
s.insert(perm[i]);
if (*s.rbegin() == s.size()) l[i] = true;
}
s = set<int>();
for (int i = n - 1; i >= 0; i--) {
if (s.find(perm[i]) != s.end()) break;
s.insert(perm[i]);
if (*s.rbegin() == s.size()) r[i] = true;
}
vector<pair<int, int>> answers;
for (int i = 0; i < n - 1; i++) {
if (l[i] && r[i + 1]) answers.push_back({i + 1, n - (i + 1)});
}
cout << answers.size() << "\n";
for (auto i : answers) cout << i.first << " " << i.second << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long p[n];
p[0] = a[0];
for (int i = 1; i < n; i++) p[i] = p[i - 1] + (long long)a[i];
unordered_set<int> s;
int pc[n];
for (int i = 0; i < n; i++) {
s.insert(a[i]);
pc[i] = s.size();
}
s.clear();
int sc[n];
for (int i = n - 1; i >= 0; i--) {
s.insert(a[i]);
sc[i] = s.size();
}
vector<pair<int, int>> v;
for (long long i = 0; i < n - 1; i++) {
long long l = (i + 1) * (i + 2) / 2;
long long r = (n - 1 - i) * (n - i) / 2;
if (pc[i] == (i + 1) && sc[i + 1] == (n - 1 - i) && p[i] == l &&
p[n - 1] - p[i] == r) {
v.push_back(make_pair(i + 1, n - 1 - i));
}
}
cout << v.size() << "\n";
for (int i = 0; i < v.size(); i++) {
cout << v[i].first << " " << v[i].second << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, p[212345], visto[212345], mex1[212345], mex2[212345];
vector<pair<int, int>> resp;
scanf("%d", &t);
while (t--) {
resp.clear();
scanf("%d", &n);
for (int i = 1; i <= n; ++i) visto[i] = 0;
int next1 = 1, next2 = 1;
for (int i = 1; i <= n; ++i) {
scanf("%d", &p[i]);
if (next1 == p[i]) {
next1++;
for (int j = p[i] + 1; j <= n; ++j) {
if (visto[j])
next1++;
else
break;
}
}
visto[p[i]] = 1;
mex1[i] = next1;
}
for (int i = 1; i <= n; ++i) visto[i] = 0;
for (int i = n; i >= 1; --i) {
if (next2 == p[i]) {
next2++;
for (int j = p[i] + 1; j <= n; ++j) {
if (visto[j])
next2++;
else
break;
}
}
visto[p[i]] = 1;
mex2[i] = next2;
}
for (int i = 1; i <= (n - 1); ++i) {
if (mex1[i] == i + 1 && mex2[i + 1] == n - i + 1) {
resp.push_back({i, n - i});
}
}
printf("%d\n", resp.size());
for (int i = 0; i < resp.size(); ++i)
printf("%d %d\n", resp[i].first, resp[i].second);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t, n, m, k, x;
void genF(map<int, int> &f, int *arr) {
set<int> s;
for (int x = 0; x < n; x++) {
s.insert(arr[x]);
if (s.size() == x + 1 && s.find(1) != s.end() && *--s.end() == x + 1) {
f[x + 1]++;
}
}
}
void genB(map<int, int> &b, int *arr) {
set<int> s;
for (int x = n - 1; x >= 0; x--) {
s.insert(arr[x]);
if (s.size() == (n - x) && s.find(1) != s.end() && *--s.end() == n - x) {
b[n - x]++;
}
}
}
int main() {
cin >> t;
while (t--) {
cin >> n;
int arr[n];
for (int x = 0; x < n; x++) {
cin >> arr[x];
}
map<int, int> forw;
map<int, int> backw;
genF(forw, arr);
genB(backw, arr);
int res = 0;
vector<pair<int, int> > r;
for (auto i = forw.begin(); i != forw.end(); i++) {
if (backw[n - i->first]) {
res++;
r.push_back({i->first, n - i->first});
}
}
cout << res << endl;
for (int x = 0; x < r.size(); x++) {
cout << r[x].first << " " << r[x].second << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
long long int modpower(long long int a, long long int b, long long int c) {
long long int res = 1;
while (b) {
if (b & 1LL) res = (res * a) % c;
a = (a * a) % c;
b >>= 1;
}
return res;
}
long long int gcd(long long int a, long long int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << fixed << setprecision(12);
int miami;
miami = 1;
cin >> miami;
while (miami--) {
int n, x, y, z;
cin >> n;
int a[n];
for (long long int i = 0; i < n; i++) {
cin >> a[i];
};
int m = 1;
for (long long int i = 0; i < n; i++) {
if (a[i] > m) m = a[i];
}
x = m;
y = n - m;
if (x > 0 && y > 0 && y <= x) {
int flag1 = 0, flag2 = 0;
set<int> s1, s2;
for (long long int i = 0; i < x; i++) s1.insert(a[i]);
for (long long int i = x; i < n; i++) s2.insert(a[i]);
if (s1.size() + s2.size() == n) {
auto it1 = s1.end();
--it1;
auto it2 = s2.end();
--it2;
if (s1.size() == x && *it1 == x && s2.size() == y && *it2 == y)
flag1 = 1;
}
x = n - m;
y = m;
s1.clear();
s2.clear();
for (long long int i = 0; i < x; i++) s1.insert(a[i]);
for (long long int i = x; i < n; i++) s2.insert(a[i]);
if (s1.size() + s2.size() == n) {
auto it1 = s1.end();
--it1;
auto it2 = s2.end();
--it2;
if (s1.size() == x && *it1 == x && s2.size() == y && *it2 == y)
flag2 = 1;
}
if (x == y) {
cout << (flag1 + flag2) / 2 << '\n';
if (flag1 > 0) cout << x << " " << y << '\n';
continue;
}
cout << flag1 + flag2 << '\n';
if (flag1 > 0) cout << m << " " << n - m << '\n';
if (flag2 > 0) cout << n - m << " " << m << '\n';
} else
cout << 0 << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
void GO_GO_GO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void BYE_BYE() {
cerr << "Time elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
bool primeArr[1000001] = {false};
long long int fact[1000001];
long long int lazy[1000001] = {0};
long long int BIT[1000001] = {0};
vector<long long int> primes;
int main() {
GO_GO_GO();
long long int t = 1;
cin >> t;
while (t--) {
long long int i = 0, j = 0;
long long int n;
cin >> n;
vector<long long int> v(n);
unordered_map<long long int, long long int, custom_hash> mp;
bool flag = true;
for (i = 0; i < n; i++) {
cin >> v[i];
mp[v[i]]++;
if (mp[v[i]] > 2) {
flag = false;
}
}
if (!flag) {
cout << 0 << "\n";
continue;
}
set<long long int> s;
vector<pair<long long int, long long int> > ans;
vector<long long int> temp1;
for (i = 0; i < n; i++) {
s.insert(v[i]);
if (*(s.rbegin()) == i + 1 && i + 1 == s.size()) {
temp1.push_back(i + 1);
}
}
s.clear();
for (i = n - 1; i >= 0; i--) {
s.insert(v[i]);
long long int len = n - 1 - i + 1;
if (*(s.rbegin()) == s.size() && s.size() == len) {
auto it = lower_bound(temp1.begin(), temp1.end(), n - len);
if (it != temp1.end() && *it == n - len) {
ans.push_back({n - len, len});
}
}
}
cout << ans.size() << "\n";
for (auto p : ans) {
cout << p.first << " " << p.second << "\n";
;
}
}
BYE_BYE();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
long long res = 1;
for (long long i = 0; i < b; ++i) {
res *= a;
}
return res;
}
long long logx(long long base, long long num) {
int cnt = 0;
while (num != 1) {
num /= base;
++cnt;
}
return cnt;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void print(vector<long long> a) {
for (int i = 0; i < a.size(); i++) {
cout << a[i] << ' ';
}
cout << "\n";
}
vector<long long> inp(int n) {
vector<long long> a;
long long x;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
}
return a;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long x;
cin >> x;
while (x--) {
long long y;
cin >> y;
long long a[y], b[y];
for (int i = 0; i < y; i++) {
cin >> a[i];
}
map<long long, long long> m;
for (int i = 0; i < y; i++) {
m[a[i]]++;
}
long long k = 0;
for (auto i : m) {
if (i.second == 1) {
break;
} else {
k++;
}
}
if (k == 0) {
cout << 0 << "\n";
continue;
}
long long k1 = m.size();
if (k + k1 != y) {
cout << 0 << "\n";
} else {
vector<long long> v, v1;
vector<pair<long long, long long> > v3;
for (long long i = 0; i < k1; i++) {
v.push_back(a[i]);
}
for (long long i = k1; i < y; i++) {
v1.push_back(a[i]);
}
sort(v.begin(), v.end());
sort(v1.begin(), v1.end());
long long ans = 0;
long long flg = 0, flg1 = 0;
if (v[0] != 1) {
flg = 1;
}
for (int i = 0; i < v.size() - 1; i++) {
if (v[i + 1] != v[i] + 1) {
flg = 1;
break;
}
}
if (v1[0] != 1) {
flg1 = 1;
}
for (int i = 0; i < v1.size() - 1; i++) {
if (v1[i + 1] != v1[i] + 1) {
flg1 = 1;
break;
}
}
if (flg == 0 && flg1 == 0) {
ans++;
v3.push_back(make_pair(k1, k));
}
v.clear();
v1.clear();
for (long long i = 0; i < k; i++) {
v.push_back(a[i]);
}
for (long long i = k; i < y; i++) {
v1.push_back(a[i]);
}
sort(v.begin(), v.end());
sort(v1.begin(), v1.end());
flg = 0, flg1 = 0;
if (v[0] != 1) {
flg = 1;
}
for (int i = 0; i < v.size() - 1; i++) {
if (v[i + 1] != v[i] + 1) {
flg = 1;
break;
}
}
if (v1[0] != 1) {
flg1 = 1;
}
for (int i = 0; i < v1.size() - 1; i++) {
if (v1[i + 1] != v1[i] + 1) {
flg1 = 1;
break;
}
}
if (flg == 0 && flg1 == 0) {
ans++;
v3.push_back(make_pair(k, k1));
}
if (k == k1) {
if (ans > 0) {
cout << 1 << "\n";
cout << k << " " << k1 << "\n";
continue;
}
}
cout << ans << "\n";
for (int i = 0; i < v3.size(); i++) {
cout << v3[i].first << " " << v3[i].second << "\n";
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int m, n, t = 1, zx[200005], vis[200005];
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
int d = 0, ok = 1, sum1 = 0, sum2 = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &zx[i]);
d = max(d, zx[i]);
}
int a = d, b = n - d;
for (int i = 0; i < d; ++i) {
if (!vis[zx[i]]) {
a--;
vis[zx[i]]++;
} else
break;
}
if (a != 0) ok = 0;
if (ok) {
a = b;
for (int i = 1; i <= n; i++) vis[i] = 0;
for (int i = d; i < n; i++) {
if (!vis[zx[i]] && zx[i] >= 1 && zx[i] <= b) {
a--;
vis[zx[i]]++;
} else
break;
}
if (a == 0) sum1++;
}
ok = 1;
for (int i = 1; i <= n; i++) vis[i] = 0;
a = d;
for (int i = b; i < n; ++i) {
if (!vis[zx[i]]) {
a--;
vis[zx[i]]++;
} else
break;
}
if (a != 0) ok = 0;
if (ok) {
a = b;
for (int i = 1; i <= n; i++) vis[i] = 0;
for (int i = 0; i < b; i++) {
if (!vis[zx[i]] && zx[i] >= 1 && zx[i] <= b) {
a--;
vis[zx[i]]++;
} else
break;
}
if (a == 0) sum2++;
}
for (int i = 1; i <= n; i++) vis[i] = 0;
if (b != d)
printf("%d\n", sum1 + sum2);
else
printf("%d\n", (sum1 + sum2) / 2);
if (sum1) printf("%d %d\n", d, b);
if (sum2 && b != d) printf("%d %d\n", b, d);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int res = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') res = res * 10 + ch - 48, ch = getchar();
return res * f;
}
const int maxn = 200005;
int a[maxn], cnt1[maxn], cnt2[maxn], cnt3, cnt4, max1, max2, suf[maxn];
signed main() {
int t = read();
while (t--) {
int n = read();
memset(cnt1, 0, sizeof cnt1);
memset(cnt2, 0, sizeof cnt2);
memset(suf, 0, sizeof suf);
memset(a, 0, sizeof a);
max1 = 0;
cnt3 = 0;
cnt4 = 0;
for (register int i = 1; i <= n; i++) a[i] = read();
for (register int i = n; i >= 1; i--) {
if (cnt2[a[i]] == 0) cnt4++;
cnt2[a[i]]++;
suf[i] = max(suf[i + 1], a[i]);
}
vector<int> ans;
int cnt = 0;
for (register int i = 1; i < n; i++) {
if (cnt1[a[i]] == 0) cnt3++;
max1 = max(a[i], max1);
cnt1[a[i]]++;
if (cnt2[a[i]] == 1) cnt4--;
cnt2[a[i]]--;
if (cnt3 == max1 && i == cnt3 && cnt4 == suf[i + 1] &&
n - i == suf[i + 1]) {
cnt++;
ans.push_back(i);
}
}
cout << cnt << endl;
for (auto i : ans) cout << i << ' ' << n - i << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int big = 10e10 + 11;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t;
cin >> t;
while (t--) {
int n, flag = 0, vang = 0, point;
cin >> n;
vector<int> v(n);
map<int, int> mp;
mp.clear();
for (int i = 0; i < n; i++) {
cin >> v[i];
mp[v[i]]++;
if (mp[v[i]] == 3)
flag = 1;
else if (mp[v[i]] == 2 && !vang) {
vang = i;
}
}
if (flag)
cout << 0 << "\n";
else {
for (int i = 0; i < vang; i++) {
if (mp[v[i]] == 2) point = i;
}
map<int, int> mp1, mp2, mp3;
mp1.clear();
mp2.clear();
mp3.clear();
int x, y, z;
x = y = z = 0;
for (int i = 0; i <= point; i++) {
mp1[v[i]] = 1;
x++;
}
for (int i = point + 1; i < vang; i++) {
mp2[v[i]] = 1;
y++;
}
for (int i = vang; i < n; i++) {
mp3[v[i]] = 1;
z++;
}
int f1, f2, f3, flag1, flag3;
flag1 = flag3 = 0;
f1 = f2 = f3 = 0;
for (int i = 1; i <= x; i++) {
if (!mp1[i]) {
f1 = 1;
}
}
for (int i = point + 1; i < vang; i++) {
mp1[v[i]] = 1;
}
for (int i = 1; i <= x + y; i++) {
if (!mp1[i]) {
flag1 = -1;
}
}
for (int i = 1; i <= z; i++) {
if (!mp3[i]) {
f3 = 1;
}
}
for (int i = point + 1; i < vang; i++) {
mp3[v[i]] = 1;
}
for (int i = 1; i <= z + y; i++) {
if (!mp3[i]) {
flag3 = -1;
}
}
if (!f1 && !flag3 && !flag1 && !f3) {
set<pair<int, int> > ans;
ans.insert({point + 1, (n - (point + 1))});
ans.insert({vang, n - vang});
cout << ans.size() << "\n";
for (auto it = ans.begin(); it != ans.end(); it++) {
cout << it->first << " " << it->second << "\n";
}
} else if (!f1 && !flag3) {
cout << "1"
<< "\n";
cout << point + 1 << " " << (n - (point + 1)) << "\n";
} else if (!flag1 && !f3) {
cout << "1"
<< "\n";
cout << vang << " " << n - vang << "\n";
} else {
cout << "0\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200005], ans[200005], ans1[200005], ans2[200005], vis1[200005],
vis2[200005];
int main() {
int t;
while (cin >> t) {
while (t--) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
vis1[a[i]] = 0;
vis2[a[i]] = 0;
}
ans[0] = a[0];
for (int i = 1; i < n; i++) {
if (a[i] > ans[i - 1]) {
ans[i] = a[i];
} else {
ans[i] = ans[i - 1];
}
}
reverse(a, a + n);
ans1[0] = a[0];
vis2[a[0]]++;
int flag = -2;
for (int i = 1; i < n; i++) {
if (a[i] > ans1[i - 1]) {
ans1[i] = a[i];
} else {
ans1[i] = ans1[i - 1];
}
if (flag == -2 && vis2[a[i]] != 0) flag = n - 1 - i;
if (vis2[a[i]] == 0) vis2[a[i]] = 1;
}
int num = 0;
reverse(a, a + n);
for (int i = 0; i < n - 1; i++) {
if (vis1[a[i]] != 0)
break;
else
vis1[a[i]] = 1;
if (ans[i] == i + 1 && ans1[n - i - 2] == n - i - 1 && i >= flag) {
ans2[num++] = i + 1;
}
}
cout << num << endl;
for (int i = 0; i < num; i++) {
cout << ans2[i] << " " << n - ans2[i] << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double doINF = 1.0 / 0.0;
ostream_iterator<int> outp(cout, " ");
inline long long modadd(long long n, long long m, long long mod) {
long long sum = ((n + m) % mod + mod) % mod;
return sum;
}
inline long long modsub(long long n, long long m, long long mod) {
long long diff = ((n - m + mod) % mod + mod) % mod;
return diff;
}
inline long long modpro(long long n, long long m, long long mod) {
long long pro = ((n * m) % mod + mod) % mod;
return pro;
}
inline long long pow(int x, int y) {
long long res = 1;
while (y > 0) {
if (y & 1) res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
inline long long powmod(long long x, long long y, long long mod) {
long long res = 1;
while (y > 0) {
if (y & 1) res = modpro(res, x, mod);
y = y >> 1;
x = modpro(x, x, mod);
}
return res;
}
long long min(long long a, long long b) {
if (a > b) {
return b;
}
return a;
}
long long max(long long a, long long b) {
if (a > b) {
return a;
} else
return b;
}
bool pairdec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first != b.first)
return (a.first > b.first);
else
return a.second > b.second;
}
long long power(long long x, long long y, long long mod) {
long long res = 1;
x = x % mod;
while (y > 0) {
if (y & 1) res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res;
}
long long modInverse(long long a, long long mod) {
return powmod(a, mod - 2, mod);
}
long long modFact(long long n, long long mod) {
if (n >= mod) return 0;
long long result = 1;
for (long long i = 1; i <= n; i++) result = (result * i) % mod;
return result;
}
bool comp(const pair<int, int> pia, const pair<int, int> pib) {
if (pia.first == pib.first)
return pia.second > pib.second;
else
return pia.first > pib.first;
}
const int N = 1e9 + 7;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
set<int> lft, rt;
int check = 0;
bool over[n + 2], over2[n + 2];
memset(over, false, sizeof(over));
memset(over2, false, sizeof(over2));
vector<int> vl, vr;
for (int i = 0; i < n; i++) {
lft.insert(arr[i]);
if (over[arr[i]]) check++;
over[arr[i]] = true;
if (check != 0)
break;
else {
auto it = lft.end();
it--;
if (*it == i + 1) vl.push_back(i);
}
}
check = 0;
for (int i = n - 1; i >= 0; i--) {
rt.insert(arr[i]);
if (over2[arr[i]]) check++;
over2[arr[i]] = true;
if (check != 0)
break;
else {
auto it = rt.end();
it--;
if (*it == n - i) vr.push_back(i);
}
}
vector<int> out;
sort(vl.begin(), vl.end());
for (int i = 0; i < vr.size(); i++) {
if (binary_search(vl.begin(), vl.end(), vr[i] - 1))
out.push_back(n - vr[i]);
}
cout << out.size() << "\n";
for (int i = 0; i < out.size(); i++) {
cout << n - out[i] << " " << out[i] << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t, n, sum;
cin >> t;
while (t--) {
cin >> n;
vector<long long int> a(n), s(n), lenS(n);
vector<pair<long long int, long long int>> ans;
set<long long int> u, u1;
for (long long int i = 0; i < n; i++) cin >> a[i];
s[n - 1] = a[n - 1];
for (long long int i = n - 2; i >= 0; i--) s[i] = s[i + 1] + a[i];
for (long long int i = n - 1; i >= 0; i--) {
u.insert(a[i]);
lenS[i] = u.size();
}
sum = 0;
for (long long int i = 0; i < n - 1; i++) {
sum += a[i];
u1.insert(a[i]);
if (sum == ((i + 1) * (i + 2)) / 2 &&
s[i + 1] == ((n - i) * (n - i - 1)) / 2 && u1.size() == i + 1 &&
lenS[i + 1] == n - 1 - i)
ans.push_back({i + 1, n - 1 - i});
}
cout << ans.size() << endl;
for (pair<long long int, long long int> p : ans)
cout << p.first << " " << p.second << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int solve() {
int n, x;
cin >> n;
vector<int> a(n), b(n + 5, 0), c(n + 5, 0);
int no = 0;
int j = -1, k = -1;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] == 1) {
if (j == -1) {
j = i;
} else if (k == -1) {
k = i;
} else {
no = 1;
}
}
}
if (j == -1 || k == -1) no = 1;
if (no == 1) {
cout << 0 << endl;
return 0;
}
int mx1 = 0, mx2 = 0, n1 = 0, n2 = 0;
int li = -1, ri = -1, ln = -1, rn = -1;
for (int i = 0; i <= j; ++i) {
++b[a[i]], ++n1;
if (b[a[i]] > 1) {
no = 1;
break;
}
mx1 = max(mx1, a[i]);
if (mx1 == n1) {
li = j;
ln = n1;
}
}
if (no == 1) {
cout << 0 << endl;
return 0;
}
for (int i = k; i < n; ++i) {
++c[a[i]];
++n2;
if (c[a[i]] > 1) {
no = 1;
}
mx2 = max(mx2, a[i]);
if (mx2 == n2) {
ri = k;
rn = n2;
}
}
if (no) {
cout << "0" << endl;
return 0;
}
if (k == j + 1) {
if (mx1 == n1 && mx2 == n2)
cout << 1 << endl << n1 << " " << n2 << endl;
else
cout << 0 << endl;
return 0;
}
map<int, int> mp1, mp2;
if (n1 == mx1) {
mp1[j] = n1;
}
if (n2 == mx2) {
mp2[k] = n2;
}
for (int i = j + 1; i < k; ++i) {
if (b[a[i]] == 0) {
++n1, ++b[a[i]];
mx1 = max(a[i], mx1);
if (n1 == mx1) {
li = i;
ln = n1;
mp1[i] = mx1;
}
} else {
break;
}
}
for (int i = k - 1; i > j; --i) {
if (c[a[i]] == 0) {
++n2, ++c[a[i]];
mx2 = max(a[i], mx2);
if (n2 == mx2) {
ri = i;
rn = n2;
mp2[i] = mx2;
}
} else {
break;
}
}
if (no) {
cout << "0" << endl;
return 0;
}
int cnt = 0;
vector<pair<int, int>> v;
for (int i = j; i <= k; ++i) {
if (mp1[i] && mp2[i + 1]) {
++cnt;
v.push_back({mp1[i], mp2[i + 1]});
}
}
cout << cnt << endl;
for (auto &x : v) {
cout << x.first << " " << x.second << endl;
}
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
using namespace std;
inline long long read() {
long long x = 0, neg = 1;
char op = getchar();
while (!isdigit(op)) {
if (op == '-') neg = -1;
op = getchar();
}
while (isdigit(op)) {
x = 10 * x + op - '0';
op = getchar();
}
return neg * x;
}
inline void print(long long x) {
if (x < 0) {
putchar('-');
x = -x;
}
if (x >= 10) print(x / 10);
putchar(x % 10 + '0');
}
const long long maxn = 2e5 + 10;
long long n, a[maxn], memo[maxn];
bool check(long long mx) {
memset(memo, 0, sizeof(memo));
for (long long i = 1; i <= mx; i++) {
if (a[i] > mx) return false;
memo[a[i]]++;
}
for (long long i = 1; i <= mx; i++)
if (memo[i] != 1) return false;
memset(memo, 0, sizeof(memo));
long long k = n - mx;
for (long long i = n; i >= n - k + 1; i--) {
if (a[i] > k) return false;
memo[a[i]]++;
}
for (long long i = 1; i <= k; i++)
if (memo[i] != 1) return false;
return true;
}
vector<pair<long long, long long> > ans;
signed main() {
long long t;
t = read();
while (t-- > 0) {
n = read();
memset(memo, 0, sizeof(memo));
for (long long i = 1; i <= n; i++) {
a[i] = read();
memo[a[i]]++;
}
bool v = true;
long long mx = 1;
for (long long i = 1; i <= n; i++) {
if (memo[i] > 2) {
v = false;
break;
}
if (memo[i] == 2) {
mx = max(i, mx);
}
}
if (!v) {
cout << 0 << endl;
continue;
}
long long k1 = min(mx, n - mx), k2 = max(mx, n - mx);
ans.clear();
if (check(k1)) ans.push_back({k1, k2});
if (k1 != k2 && check(k2)) ans.push_back({k2, k1});
cout << ans.size() << endl;
for (auto it : ans) {
cout << it.first << " " << it.second << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn];
bool pre[maxn], suf[maxn], vis[maxn];
int n;
int main() {
int t;
cin >> t;
while (t--) {
memset(pre, false, sizeof(pre));
memset(suf, false, sizeof(suf));
memset(vis, false, sizeof(vis));
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int cnt = 0, ma = 0;
for (int i = 1; i <= n; i++) {
if (!vis[a[i]]) {
vis[a[i]] = true;
cnt++;
ma = max(ma, a[i]);
if (cnt == ma) pre[i] = true;
} else
break;
}
cnt = 0, ma = 0;
memset(vis, false, sizeof(vis));
for (int i = n; i >= 1; i--) {
if (!vis[a[i]]) {
vis[a[i]] = true;
cnt++;
ma = max(ma, a[i]);
if (cnt == ma) suf[i] = true;
} else
break;
}
vector<int> ans1, ans2;
for (int i = 2; i <= n; i++) {
if (pre[i - 1] && suf[i]) {
ans1.push_back(i - 1);
ans2.push_back(n - i + 1);
}
}
cout << ans1.size() << "\n";
for (int i = 0; i < ans1.size(); i++)
cout << ans1[i] << " " << ans2[i] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[n + 2];
int m = 0;
vector<pair<int, int>> ans;
int p1[n + 2];
bool c = true;
for (int i = 0; i < n; i++) {
cin >> arr[i];
m = max(m, arr[i]);
}
for (int i = 0; i < m; i++) {
p1[i] = arr[i];
}
sort(p1, p1 + m);
for (int i = 0; i < m; i++) {
if (p1[i] != i + 1) c = false;
}
for (int i = 0; i < n - m; i++) {
p1[i] = arr[n - i - 1];
}
sort(p1, p1 + n - m);
for (int i = 0; i < n - m; i++) {
if (p1[i] != i + 1) c = false;
}
if (c && n - m != 0 && m != 0) {
ans.push_back(make_pair(m, n - m));
}
if (m != n - m) {
for (int i = 0; i < n - m; i++) {
p1[i] = arr[i];
}
sort(p1, p1 + n - m);
c = true;
for (int i = 0; i < n - m; i++) {
if (p1[i] != i + 1) c = false;
}
for (int i = 0; i < m; i++) {
p1[i] = arr[n - i - 1];
}
sort(p1, p1 + m);
for (int i = 0; i < m; i++) {
if (p1[i] != i + 1) c = false;
}
if (c && n - m != 0 && m != 0) {
ans.push_back(make_pair(n - m, m));
}
}
cout << ans.size() << endl;
for (auto it : ans) {
cout << it.first << " " << it.second << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long in() {
long long s = 0, f = 0, ch = getchar();
while (!isdigit(ch)) f |= ch == '-', ch = getchar();
while (isdigit(ch)) s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
return f ? -s : s;
}
const long long N = 1e6 + 5;
const long long mod = 1e9 + 7;
const long long inf = ~(1ULL << 63);
long long n, m, k;
long long a[N], b[N], f[N];
long long c[N];
long long qp(long long a, long long b) {
long long sum = 1;
while (b) {
if (b & 1) sum = sum * a % mod;
a = a * a % mod;
b >>= 1;
}
return sum;
}
bool flag[N];
long long p[N], tot;
long long find(long long x) { return x == f[x] ? x : f[x] = find(f[x]); }
long long judge(long long l) {
vector<long long> s1, s2;
for (long long i = 1; i <= (l); ++i) {
s1.push_back(a[i]);
}
for (long long i = l + 1; i <= (n); ++i) {
s2.push_back(a[i]);
}
sort(s1.begin(), s1.end());
sort(s2.begin(), s2.end());
if (s1.back() == s1.size() && s2.back() == s2.size()) {
long long tot1 = unique(s1.begin(), s1.end()) - s1.begin();
long long tot2 = unique(s2.begin(), s2.end()) - s2.begin();
if (s1.back() == tot1 && s2.back() == tot2) return 1;
}
return 0;
}
void work() {
n = in();
long long mx = 0;
vector<pair<long long, long long> > ans;
for (long long i = 1; i <= (n); ++i) {
a[i] = in();
mx = max(mx, a[i]);
}
if (judge(mx)) {
ans.push_back({mx, n - mx});
}
if (judge(n - mx)) {
ans.push_back({n - mx, mx});
}
if (mx * 2 == n && ans.size()) ans.pop_back();
cout << ans.size() << "\n";
for (auto i : ans) {
cout << i.first << " " << i.second << "\n";
}
}
signed main() {
for (long long _ = in(); _; --_) work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int vis[200005];
int vis2[200005];
int vis3[200005];
int main() {
int T;
cin >> T;
while (T--) {
memset(vis, 0, sizeof(vis));
memset(a, 0, sizeof(a));
memset(vis2, 0, sizeof(vis2));
memset(vis3, 0, sizeof(vis3));
int n;
cin >> n;
int Max = -1;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (Max < a[i]) Max = a[i];
vis[a[i]]++;
}
int id = -1;
int sign = 0;
int sign2 = 0;
int sign3 = 0;
int Min = 2000005;
for (int i = 1; i <= Max; i++) {
if (vis[i] == 2) {
id = i;
}
if (vis[i] > 2) {
sign = -1;
break;
}
if (Min < vis[i]) {
sign = -1;
break;
} else {
Min = vis[i];
}
}
if (sign == -1) {
printf("0\n");
continue;
}
if (id == -1) {
printf("0\n");
continue;
}
for (int i = 0; i < id; i++) {
vis2[a[i]]++;
}
for (int i = 1; i <= id; i++) {
if (vis2[i] == 1)
continue;
else {
sign2 = -1;
break;
}
}
for (int i = 0; i < id; i++) {
vis3[a[n - i - 1]]++;
}
for (int i = 1; i <= id; i++) {
if (vis3[i] == 1)
continue;
else {
sign3 = -1;
break;
}
}
if (sign2 == -1 && sign3 == -1) {
printf("0\n");
continue;
} else if (sign2 == 0 && sign3 == -1) {
printf("1\n%d %d\n", id, n - id);
} else if (sign2 == -1 && sign3 == 0) {
printf("1\n%d %d\n", n - id, id);
} else if (sign2 == 0 && sign3 == 0 && 2 * id != n)
printf("2\n%d %d\n%d %d\n", id, n - id, n - id, id);
else if (sign2 == 0 && sign3 == 0 && 2 * id == n)
printf("1\n%d %d\n", n - id, id);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793238L;
int t, N[200005], n, Cnt[200005], Cnt1[200005];
bool P[200005];
vector<int> v;
void init() {
for (int i = 1; i <= n; i++) {
Cnt[i] = 0;
Cnt1[i] = 0;
P[i] = false;
}
v.clear();
}
int solve() {
int cntD = 0;
int mx = 0;
int num = 0;
for (int i = n - 1; i >= 0; i--) {
num++;
mx = max(mx, N[i]);
Cnt[N[i]]++;
if (Cnt[N[i]] == 2)
cntD++;
else if (Cnt[N[i]] > 2)
return 0;
if (cntD == 0 && mx == num) {
P[i] = true;
}
}
mx = 0;
num = 0;
cntD = 0;
for (int i = 0; i < n - 1; i++) {
num++;
mx = max(mx, N[i]);
Cnt1[N[i]]++;
if (Cnt1[N[i]] == 2)
cntD++;
else if (Cnt1[N[i]] > 2)
return 0;
if (cntD == 0 && mx == num) {
if (P[i + 1]) v.push_back(i + 1);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T, sz;
cin >> T;
for (t = 1; t <= T; t++) {
cin >> n;
init();
for (int i = 0; i < n; i++) {
cin >> N[i];
}
solve();
sz = v.size();
cout << sz << endl;
for (int i = 0; i < sz; i++) {
cout << v[i] << " " << n - v[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
long long f1 = 0, f2 = 0;
cin >> n;
vector<long long> a(n);
vector<pair<long long, long long> > ans;
map<long long, long long> mii;
set<long long> first, second;
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
for (long long i = 0; i < n - 1; i++) {
if (first.find(a[i]) != first.end()) f1++;
first.insert(a[i]);
mii[a[i]]++;
}
second.insert(a.back());
for (long long i = n - 2; i >= 0; i--) {
if (!f2 && !f1 && first.size() == *first.rbegin() &&
second.size() == *second.rbegin()) {
ans.push_back({first.size(), second.size()});
}
if (second.find(a[i]) != second.end()) f2++;
second.insert(a[i]);
if (mii[a[i]] > 1) {
f1--;
mii[a[i]]--;
} else
first.erase(a[i]);
}
cout << ans.size() << endl;
for (long long i = 0; i < ans.size(); i++) {
cout << ans[i].first << " " << ans[i].second << endl;
}
}
signed main() {
long long t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> a(n + 1);
for (long long i = 1; i <= n; i++) cin >> a[i];
vector<long long> ans_left;
vector<long long> ans_right;
long long mx = 0;
set<long long> s;
for (long long i = 1; i <= n; i++) {
mx = max(mx, a[i]);
s.insert(a[i]);
if (mx == s.size() && i == mx) ans_left.push_back(i);
}
mx = 0;
s.clear();
for (long long i = n; i >= 1; i--) {
mx = max(mx, a[i]);
s.insert(a[i]);
if (mx == s.size() && (n - i + 1) == mx) ans_right.push_back(n - i + 1);
}
long long ans = 0;
vector<long long> k;
for (auto i : ans_left) {
if (binary_search(ans_right.begin(), ans_right.end(), n - i)) {
ans++;
k.push_back(i);
}
}
cout << ans << "\n";
for (auto i : k) cout << i << " " << n - i << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while ((t--) > 0) {
long long int n;
cin >> n;
long long int a[n];
long long int totsum = 0;
for (long long int i = 0; i < n; i++) cin >> a[i], totsum += a[i];
long long int sum[n];
sum[0] = a[0];
for (long long int i = 1; i < n; i++) sum[i] = sum[i - 1] + a[i];
long long int answer = 0;
vector<pair<long long int, long long int>> vect;
set<long long int> s1;
long long int isunique[n];
unordered_map<long long int, long long int> umap;
umap[a[n - 1]] = 1;
isunique[n - 1] = 1;
for (long long int i = n - 2; i >= 0; i--) {
if (umap.find(a[i]) == umap.end() && isunique[i + 1] == 1) {
isunique[i] = 1;
umap[a[i]] = 1;
} else {
isunique[i] = 0;
umap[a[i]] = 1;
}
}
for (long long int i = 0; i < n; i++) {
s1.insert(a[i]);
if (sum[i] == ((i + 1) * (i + 2) / 2) && s1.size() == i + 1 &&
(totsum - sum[i]) == ((n - i - 1) * (n - i) / 2) &&
isunique[i + 1] == 1 && i != n - 1) {
answer += 1;
vect.push_back(make_pair(i + 1, n - i - 1));
}
if (sum[i] == ((i + 1) * (i + 2) / 2) && s1.size() == i + 1 &&
i == n - 1) {
answer += 1;
vect.push_back(make_pair(i + 1, n - i - 1));
}
}
cout << answer << endl;
for (long long int i = 0; i < vect.size(); i++) {
cout << vect[i].first << " " << vect[i].second << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long n, m, i, j, a[N], lemax, rimax;
set<long long> le, ri;
vector<pair<long long, long long> > ans;
bool leval[N], rival[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
ans.clear();
le.clear();
ri.clear();
lemax = 0, rimax = 0;
cin >> n;
for (i = 0; i < n; i++) {
leval[i] = false;
rival[i] = false;
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (le.count(a[i]) == 0) {
lemax = max(lemax, a[i]);
le.insert(a[i]);
} else
break;
if (lemax == le.size()) leval[i] = true;
}
for (i = n - 1; i >= 0; i--) {
if (ri.count(a[i]) == 0) {
rimax = max(rimax, a[i]);
ri.insert(a[i]);
} else
break;
if (rimax == ri.size()) rival[i] = true;
}
for (i = 0; i < n - 1; i++) {
if (leval[i] && rival[i + 1]) ans.push_back(make_pair(i + 1, n - i - 1));
}
cout << ans.size() << endl;
for (i = 0; i < ans.size(); i++) {
cout << ans[i].first << " " << ans[i].second << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool eratSieve(long long n) {
long long cnt = 0;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
cnt++;
if (i != n / i) cnt++;
}
}
return cnt == 2;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
};
long long mx = 0;
for (long long i = 0; i < n; i++)
if (mx < a[i]) mx = a[i];
set<long long> s, t;
set<pair<long long, long long> > ans;
for (long long i = 0; i < mx; i++) s.insert(a[i]);
for (long long i = n - 1; i >= mx; i--) t.insert(a[i]);
if (s.size() == mx && *prev(s.end()) == mx && t.size() == n - mx &&
*prev(t.end()) == n - mx) {
ans.insert({mx, n - mx});
}
s.clear();
t.clear();
for (long long i = 0; i < n - mx; i++) s.insert(a[i]);
for (long long i = n - 1; i >= n - mx; i--) t.insert(a[i]);
if (s.size() == n - mx && *prev(s.end()) == n - mx && t.size() == mx &&
*prev(t.end()) == mx) {
ans.insert({n - mx, mx});
}
cout << ans.size() << '\n';
for (auto i : ans) cout << i.first << " " << i.second << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n, res1 = 0, res2 = 0, flag = 1;
cin >> n;
vector<long long int> v, s;
for (int i = 0; i < n; i++) {
long long int t;
cin >> t;
v.push_back(t);
}
long long int temp = *max_element(v.begin(), v.end());
s = v;
sort(s.begin(), s.begin() + temp);
for (int i = 0; i < temp; i++) {
if (s[i] != i + 1) {
flag = 0;
break;
}
}
if (flag == 1) {
sort(s.begin() + temp, s.end());
for (int i = 0; i < n - temp; i++) {
if (s[i + temp] != i + 1) {
flag = 0;
break;
}
}
if (flag == 1) res1++;
}
flag = 1;
s.clear();
s = v;
sort(s.begin(), s.end() - temp);
for (int i = 0; i < n - temp; i++) {
if (s[i] != i + 1) {
flag = 0;
break;
}
}
if (flag == 1) {
sort(s.end() - temp, s.end());
for (int i = 0; i < temp; i++) {
if (s[i + n - temp] != i + 1) {
flag = 0;
break;
}
}
if (flag == 1) res2++;
}
if (res1 + res2 == 0) cout << 0 << endl;
if (res1 == 1 && res2 == 0) {
cout << res1 + res2 << endl;
cout << temp << " " << n - temp << endl;
} else if (res1 == 0 && res2 == 1) {
cout << res1 + res2 << endl;
cout << n - temp << " " << temp << endl;
}
if (res1 == 1 && res2 == 1) {
if (n - temp == temp) {
cout << res1 + res2 - 1 << endl;
cout << temp << " " << temp << endl;
} else {
cout << res1 + res2 << endl;
cout << n - temp << " " << temp << endl;
cout << temp << " " << n - temp << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[n];
map<long long, long long> m;
map<long long, long long> m1;
map<long long, long long> m2;
map<long long, long long> m3;
vector<pair<long long, long long>> v;
for (long long i = 0; i < n; i++) {
cin >> a[i];
m2[a[i]]++;
}
for (auto it = m2.begin(); it != m2.end(); it++) {
m3[it->second]++;
}
for (long long i = 0; i < n - 1; i++) {
long long x = ++m[a[i]];
m1[x]++;
m1[x - 1]--;
long long y = m2[a[i]];
if (y == 1) {
m2.erase(m2.find(a[i]));
} else
m2[a[i]]--;
m3[y]--;
m3[y - 1]++;
auto it = m.end();
it--;
x = it->first;
it = m2.end();
it--;
y = it->first;
if (x == m.size() && y == m2.size() && m1[1] == x && m3[1] == y) {
v.push_back({x, y});
}
}
cout << v.size() << "\n";
for (long long i = 0; i < (long long)v.size(); i++) {
cout << v[i].first << " " << v[i].second << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
long long int n;
while (t--) {
cin >> n;
long long int a[n];
for (long long int i = 0; i < n; i++) cin >> a[i];
long long int k = 0;
vector<pair<long long int, long long int>> ans;
long long int maxf[n - 1];
long long int maxb[n - 1];
long long int rep1[n];
long long int rep2[n];
for (long long int i = 0; i < n; i++) rep1[i] = rep2[i] = 0;
long long int x1 = -1;
long long int x2 = -1;
long long int max1 = -1;
long long int truth1[n - 1];
long long int truth2[n - 1];
for (long long int i = 0; i < n - 1; i++) truth1[i] = truth2[i] = 1;
for (long long int i = 0; i < n - 1; i++) {
if (a[i] > max1) max1 = a[i];
long long int x = a[i];
maxf[i] = max1;
if (rep1[x] == 0)
rep1[x] = 1;
else
x1 = 1;
if (x1 == 1) truth1[i] = -1;
}
max1 = -1;
for (long long int i = n - 1; i > 0; i--) {
if (a[i] > max1) max1 = a[i];
maxb[i - 1] = max1;
long long int x = a[i];
if (rep2[x] == 0)
rep2[x] = 1;
else
x2 = 1;
if (x2 == 1) truth2[i - 1] = -1;
}
for (long long int i = 0; i < n - 1; i++) {
if ((maxf[i] == i + 1) && (truth1[i] == 1) && (maxb[i] == n - 1 - i) &&
(truth2[i] == 1)) {
k++;
ans.push_back(make_pair(i + 1, n - 1 - i));
}
}
cout << k << "\n";
for (auto i = 0; i < k; i++) {
cout << (ans[i].first) << " " << (ans[i].second) << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e3 + 7;
long long cnt, n, m, mx;
string s;
int main() {
long long T;
cin >> T;
while (T--) {
cin >> n;
long long arr[n + 1];
vector<pair<int, int>> p;
vector<long long> v(n + 10, 0), v2(n + 10, 0);
mx = 0;
for (int i = 1; i <= n; i++) cin >> arr[i];
for (int i = 1; i <= n; i++) {
if (v[arr[i]]) break;
v[arr[i]] = 1;
mx = max(mx, arr[i]);
if (mx == i) v2[i] = 1;
}
vector<long long> f(n + 10, 0);
mx = 0;
for (int i = n; i >= 1; i--) {
if (f[arr[i]]) break;
f[arr[i]] = 1;
mx = max(mx, arr[i]);
if (mx == n - i + 1 and v2[i - 1]) p.push_back({i - 1, n - i + 1});
}
cout << p.size() << endl;
for (auto it : p) cout << it.first << " " << it.second << endl;
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
template <class T>
using V = vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
long long int cmp(pair<long long int, long long int> a,
pair<long long int, long long int> b) {
if (a.second != b.second)
return a.second < b.second;
else
return a.first < b.first;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
int cnt = 0;
bool seiok[200020];
memset(seiok, 0, sizeof(seiok));
set<long long int> s1;
long long int max1 = 0;
for (int i = 0; i < n - 1; i++) {
s1.insert(a[i]);
max1 = (max1 > a[i] ? max1 : a[i]);
if (max1 > i + 1) continue;
if (s1.size() == i + 1) seiok[i] = 1;
}
bool hanok[200020];
memset(hanok, 0, sizeof(hanok));
set<long long int> s2;
long long int max2 = 0;
for (int i = n - 2; i >= 0; i--) {
s2.insert(a[i + 1]);
max2 = (max2 > a[i + 1] ? max2 : a[i + 1]);
if (max2 > n - 2 - i + 1) continue;
if (s2.size() == n - 2 - i + 1) hanok[i] = 1;
}
V<pair<long long int, long long int> > ans;
for (int i = 0; i < n - 1; i++) {
if (seiok[i] && hanok[i]) {
cnt++;
ans.push_back(make_pair(i + 1, n - i - 1));
}
}
cout << cnt << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i].first << " " << ans[i].second << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int numberOfCases;
cin >> numberOfCases;
for (int i = 0; i < numberOfCases; ++i) {
int len;
cin >> len;
vector<int> mem(len, 0);
for (int i = 0; i < len; ++i) {
cin >> mem[i];
}
int maxNumber;
maxNumber = *max_element(mem.begin(), mem.end());
vector<int> count(len, 0);
for (auto& itermem : mem) {
count[itermem]++;
}
int state = 0;
int startNumberOfOne = -1;
bool isFailedSecondStep = false;
for (int number = 1; number < len; ++number) {
if (state == 0) {
if (count[number] == 2) {
continue;
} else if (count[number] == 1) {
startNumberOfOne = number;
state = 1;
} else {
if (count[number] == 0 && (len % 2 == 0) && (number - 1) == len / 2) {
startNumberOfOne = number;
break;
} else {
isFailedSecondStep = true;
break;
}
}
} else {
if (count[number] == 1) {
continue;
} else {
if (number != (maxNumber + 1)) {
isFailedSecondStep = true;
break;
} else {
break;
}
}
}
}
if (isFailedSecondStep) {
cout << 0 << endl;
continue;
}
if (len == 2 && mem[0] == 1 && mem[1] == 1) {
startNumberOfOne = 2;
}
vector<bool> searchedFullStep(maxNumber + 1, false);
vector<bool> searchedSmallStep(startNumberOfOne, false);
bool isSearchingFull = true;
bool isSearchingSmall = true;
int isSearchingFullCount = 0;
int isSearchingSmallCount = 0;
int retSearchingFull = -1;
int retSearchingSmall = -1;
for (int index = 0; index < (int)mem.size(); ++index) {
int preVal = mem[index];
if (isSearchingFull) {
if (preVal <= maxNumber && !searchedFullStep[preVal]) {
searchedFullStep[preVal] = true;
isSearchingFullCount++;
if (isSearchingFullCount == maxNumber) {
retSearchingFull = index;
isSearchingFull = false;
}
} else {
isSearchingFull = false;
}
}
if (isSearchingSmall) {
if (preVal < startNumberOfOne && !searchedSmallStep[preVal]) {
searchedSmallStep[preVal] = true;
isSearchingSmallCount++;
if (isSearchingSmallCount == (startNumberOfOne - 1)) {
retSearchingSmall = index;
isSearchingSmall = false;
}
} else {
isSearchingSmall = false;
}
}
}
int retCount = 0;
if (retSearchingFull != -1) retCount++;
if (retSearchingSmall != -1) retCount++;
if (retSearchingFull == retSearchingSmall && retSearchingFull != -1) {
retCount--;
retSearchingSmall = -1;
}
cout << retCount << endl;
if (retSearchingFull != -1) {
cout << retSearchingFull + 1 << " " << len - (retSearchingFull + 1)
<< endl;
}
if (retSearchingSmall != -1) {
cout << retSearchingSmall + 1 << " " << len - (retSearchingSmall + 1)
<< endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = (1e9) + 7;
const double pi = acos(-1);
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
vector<long long> mxl(200001), mxr(200001), mnl(200001), mnr(200001),
sum(200001), a(200001), b(200001);
void solve() {
long long n, i, num, l, r, ok;
cin >> n;
set<long long> all;
for (i = 1; i <= n; i++) {
cin >> a[i];
if (i == 1) {
sum[i] = a[i];
mnl[i] = mxl[i] = a[i];
} else {
sum[i] = sum[i - 1] + a[i];
mxl[i] = max(mxl[i - 1], a[i]);
mnl[i] = min(mnl[i - 1], a[i]);
}
}
mnr[n] = mxr[n] = a[n];
all.insert(a[n]);
b[n] = 1;
for (i = n - 1; i >= 1; i--) {
mxr[i] = max(mxr[i + 1], a[i]);
mnr[i] = min(mnr[i + 1], a[i]);
all.insert(a[i]);
b[i] = (all.size() == (n - i + 1)) ? (1) : (0);
}
all.clear();
all.insert(a[1]);
a[1] = 1;
for (i = 2; i <= n; i++) {
all.insert(a[i]);
a[i] = (all.size() == i) ? (1) : (0);
}
vector<pair<long long, long long> > ans;
for (i = 1; i < n; i++) {
l = i;
r = n - i;
if (mxl[i] == l && mnl[i] == 1 && mxr[i + 1] == r && mnr[i + 1] == 1) {
l = (l * (l + 1)) / 2;
r = (r * (r + 1)) / 2;
if (sum[i] == l && sum[n] - sum[i] == r && a[i] && b[i + 1])
ans.push_back({i, n - i});
}
}
cout << ans.size() << "\n";
for (auto x : ans) cout << x.first << " " << x.second << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, x;
long long int arr[500000];
long long int brr[500000];
long long int c[500000];
int main() {
int tc;
cin >> tc;
while (tc--) {
cin >> n;
vector<int> res;
for (int i = 0; i < n; i++) {
cin >> arr[i];
brr[i] = arr[i];
}
int x = *max_element(arr, arr + n);
bool check1 = true;
bool check2 = true;
sort(arr, arr + x);
sort(arr + x, arr + n);
for (int i = 0; i < x; i++) {
if (arr[i] != i + 1) {
check1 = false;
break;
}
}
for (int i = x; i < n; i++) {
if (arr[i] != i + 1 - x) {
check2 = false;
break;
}
}
if (check1 == true && check2 == true) {
res.push_back(x);
}
check1 = true;
check2 = true;
sort(brr, brr + n - x);
sort(brr + n - x, brr + n);
for (int i = 0; i < n - x; i++) {
if (brr[i] != i + 1) {
check1 = false;
break;
}
}
for (int i = n - x; i < n; i++) {
if (brr[i] != i + 1 - n + x) {
check2 = false;
break;
}
}
if (check1 == true && check2 == true) {
res.push_back(n - x);
}
if (res.size() == 2 && res[0] == res[1]) {
res.pop_back();
}
cout << res.size() << "\n";
for (int i = 0; i < res.size(); i++) {
cout << res[i] << " " << n - res[i] << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const int MAX = 1e5 + 10;
const double exps = 1e-8;
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a > b ? b : a; }
int t, n, a[N], b[N], c[N];
int main() {
scanf("%d", &t);
while (t--) {
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
}
int pos = 1;
vector<vector<int>> ans;
for (int i = 1; i <= n; ++i) {
b[a[i]]++;
if (b[a[i]] == 2) {
b[a[i]]--;
pos = i;
break;
}
}
bool ok = true;
for (int i = 1; i <= pos - 1; ++i) {
if (b[i] == 0) {
ok = false;
break;
}
}
for (int j = pos; j <= n && ok; ++j) {
c[a[j]]++;
}
for (int j = 1; j <= n - pos + 1 && ok; ++j) {
if (c[j] == 0 || c[j] > 1) {
ok = false;
break;
}
}
if (ok) {
ans.push_back({pos - 1, n - pos + 1});
}
memset(c, 0, sizeof(c));
memset(b, 0, sizeof(b));
ok = true;
for (int i = n; i >= 1; --i) {
c[a[i]]++;
if (c[a[i]] == 2) {
c[a[i]]--;
pos = i;
break;
}
}
for (int i = 1; i <= n - pos; ++i) {
if (c[i] == 0) {
ok = false;
break;
}
}
for (int j = 1; j <= pos && ok; ++j) {
b[a[j]]++;
}
for (int j = 1; j <= pos && ok; ++j) {
if (b[j] == 0 || b[j] > 2) {
ok = false;
break;
}
}
if (ok) {
if (ans.size()) {
if (pos != ans[0][0] && n - pos != ans[0][1])
ans.push_back({pos, n - pos});
} else {
ans.push_back({pos, n - pos});
}
}
printf("%d\n", ans.size());
for (int i = 0; i < ans.size(); ++i)
printf("%d %d\n", ans[i][0], ans[i][1]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)998244353;
void test_case() {
long long n;
cin >> n;
vector<long long> arr(n), pos(n);
for (long long i = 0; i < n; i++) cin >> arr[i];
set<long long> st;
long long sum = 0;
for (long long i = 0; i < n - 1; i++) {
sum += arr[i];
st.insert(arr[i]);
if (sum == ((i + 1) * (i + 2) / 2) && (long long)st.size() == i + 1)
pos[i] = 1;
}
st.clear(), sum = 0;
vector<pair<long long, long long> > len;
for (long long i = n - 1; i > 0; i--) {
sum += arr[i];
st.insert(arr[i]);
long long j = n - i;
if (sum == ((j + 1) * (j) / 2) && (long long)st.size() == j) {
if (pos[i - 1]) {
len.push_back({n - j, j});
}
}
}
cout << len.size() << "\n";
for (long long i = 0; i < (long long)len.size(); i++)
cout << len[i].first << " " << len[i].second << "\n";
}
signed main() {
long long t = 1;
cin >> t;
while (t--) test_case();
}
|
#include <bits/stdc++.h>
using namespace std;
void check(vector<int>& v, vector<bool>& ans) {
int n = v.size();
vector<bool> found(n + 1);
int curV = 1;
int maxV = 0;
for (int i = 0; i < n; i++) {
if (found[v[i]]) {
break;
}
found[v[i]] = true;
maxV = max(maxV, v[i]);
for (; found[curV]; curV++) {
}
if (curV > maxV) {
ans[i] = true;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
for (int ii = 0; ii < t; ii++) {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<bool> bstart(n);
vector<bool> bend(n);
check(v, bstart);
reverse(v.begin(), v.end());
check(v, bend);
reverse(bend.begin(), bend.end());
vector<pair<int, int>> ans;
for (int i = 0; i < n - 1; i++) {
if (bstart[i] && bend[i + 1]) {
ans.push_back({i + 1, n - i - 1});
}
}
cout << ans.size() << "\n";
for (int i = 0; i < ans.size(); i++) {
cout << ans[i].first << " " << ans[i].second << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int t, n;
int cnt, num, maxx;
int a[maxn];
int vis[maxn];
int m1[maxn];
int m2[maxn];
void init() {
num = 0;
maxx = 0;
memset(vis, 0, sizeof(vis));
}
int main() {
scanf("%d", &t);
while (t--) {
cnt = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) m1[i] = 0, m2[i] = 0;
init();
for (int i = 1; i <= n; i++) {
maxx = max(maxx, a[i]);
if (!vis[a[i]]) {
num++;
vis[a[i]] = 1;
} else
break;
if (num == maxx)
m1[i] = 1;
else
m1[i] = 0;
}
init();
for (int i = n; i >= 1; i--) {
maxx = max(maxx, a[i]);
if (!vis[a[i]]) {
num++;
vis[a[i]] = 1;
} else
break;
if (num == maxx) {
m2[i] = 1;
if (i > 1 && m1[i - 1]) cnt++;
} else
m2[i] = 0;
}
printf("%d\n", cnt);
for (int i = 1; i < n; i++)
if (m1[i] && m2[i + 1]) printf("%d %d\n", i, n - i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool has(vector<long long>& a, long long item) {
long long l = -1;
long long r = a.size();
while (r - l > 1) {
long long mid = (l + r) / 2;
if (a[mid] > item)
r = mid;
else
l = mid;
}
return a[l] == item;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cout.tie(0);
std::cin.tie(0);
set<long long> sums;
for (long long i = 1; i < 200 * 1000 + 9; ++i) sums.insert((i + 1) * i / 2);
long long t;
cin >> t;
for (long long o = 0; o < t; ++o) {
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; i < n; ++i) cin >> a[i];
vector<long long> prefixSum(n);
prefixSum[0] = a[0];
for (long long i = 1; i < n; ++i) prefixSum[i] = prefixSum[i - 1] + a[i];
vector<long long> suffixSum(n);
suffixSum[n - 1] = a[n - 1];
for (long long i = n - 2; i >= 0; --i)
suffixSum[i] = suffixSum[i + 1] + a[i];
std::set<int> pre;
std::set<int> suf;
std::multiset<int> sufMulti;
for (int i = 0; i < n; ++i) suf.insert(a[i]), sufMulti.insert(a[i]);
long long ans = 0;
vector<std::pair<long long, long long>> answers;
for (long long i = 0; i < n - 1; ++i) {
pre.insert(a[i]);
sufMulti.erase(sufMulti.find(a[i]));
if (sufMulti.find(a[i]) == sufMulti.end()) suf.erase(a[i]);
if ((sums.find(prefixSum[i]) != sums.end()) &&
(sums.find(suffixSum[i + 1]) != sums.end()) &&
(*(--pre.end()) == pre.size()) && (*(--suf.end()) == suf.size()) &&
pre.size() == i + 1 && suf.size() == n - i - 1) {
++ans;
answers.push_back(std::make_pair(i + 1, n - i - 1));
}
}
cout << ans << "\n";
for (long long i = 0; i < answers.size(); ++i)
cout << answers[i].first << " " << answers[i].second << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fio() {}
int main() {
fio();
int t = 1;
cin >> t;
while (t--) {
long long int n, x;
cin >> n;
vector<long long int> v(n);
set<long long int> st1, st2;
map<long long int, long long int> ml, mr;
vector<long long int> pref(n + 1), suff(n + 1);
int i;
pref[0] = 0;
long long int tot = 0ll;
for (i = 0; i < n; i++) cin >> v[i], tot += v[i];
vector<pair<long long int, long long int> > vp;
for (i = n - 1; i >= 1; i--) {
st2.insert(v[i]);
mr[i] = st2.size();
}
long long int sum = 0;
for (i = 0; i < n - 1; i++) {
tot -= v[i];
sum += v[i];
st1.insert(v[i]);
long long int k = st1.size();
if (sum == k * (k + 1ll) / 2ll &&
tot == (mr[i + 1]) * (mr[i + 1] + 1ll) / 2ll)
vp.push_back({i + 1, n - i - 1});
}
cout << vp.size() << endl;
if (vp.size()) {
for (auto u : vp) cout << u.first << " " << u.second << endl;
}
st1.clear();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int tc = 0; tc < t; tc++) {
int n;
cin >> n;
vector<int> v(n + 3), cnt(n + 3);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
int mx = 0;
set<int> st;
for (int i = 1; i <= n; i++) {
st.insert(v[i]);
mx = max(mx, v[i]);
if (mx == i && st.size() == i) {
cnt[i]++;
}
}
set<int> st2;
int mx2 = 0;
for (int i = n; i > 0; i--) {
st2.insert(v[i]);
mx2 = max(mx2, v[i]);
if (mx2 == n - i + 1 && st2.size() == n - i + 1) {
cnt[i - 1]++;
}
}
vector<pair<int, int> > vec;
for (int i = 1; i <= n; i++) {
if (cnt[i] == 2) {
vec.push_back({i, n - i});
}
}
cout << vec.size() << '\n';
for (int i = 0; i < vec.size(); i++) {
cout << vec[i].first << ' ' << vec[i].second << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n], loc = 0, loc2 = 0;
map<int, int> mp, mp2;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
if (mp[a[i]] == 2 && !loc) loc = i;
if (mp[a[i]] > 2) loc = -1;
}
for (int i = n - 1; i >= 0; i--) {
mp2[a[i]]++;
if (mp2[a[i]] == 2 && !loc2) loc2 = i;
}
if (loc == -1) {
puts("0");
continue;
}
set<int> st;
int mx = -1;
pair<int, int> ans[2];
mp2.clear();
for (int i = 0; i < loc; i++) {
st.insert(a[i]);
mx = max(mx, a[i]);
mp2[a[i]]++;
if (mp2[a[i]] > 1) {
mx = -1;
break;
}
}
if (st.size() != mx) loc = n;
st.clear();
mx = -1;
mp2.clear();
for (int i = loc; i < n; i++) {
st.insert(a[i]);
mx = max(mx, a[i]);
mp2[a[i]]++;
if (mp2[a[i]] > 1) {
mx = -1;
break;
}
}
int sz = 0;
if (st.size() == mx) {
ans[0].first = loc;
ans[0].second = n - (loc);
sz++;
}
st.clear();
mx = -1;
mp2.clear();
for (int i = n - 1; i > loc2; i--) {
st.insert(a[i]);
mx = max(mx, a[i]);
mp2[a[i]]++;
if (mp2[a[i]] > 1) {
mx = -1;
break;
}
}
if (st.size() != mx) loc2 = -1;
st.clear();
mx = -1;
mp2.clear();
for (int i = loc2; i >= 0; i--) {
st.insert(a[i]);
mx = max(mx, a[i]);
mp2[a[i]]++;
if (mp2[a[i]] > 1) {
mx = -1;
break;
}
}
if (st.size() == mx && loc2 + 1 != loc) {
ans[sz].first = loc2 + 1;
ans[sz].second = min(n - 1, n - (loc2 + 1));
sz++;
}
cout << sz << endl;
for (int i = 0; i < sz; i++)
cout << ans[i].first << " " << ans[i].second << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int INF2 = 0x3f3f3f3f;
const long long INF64 = 1e18;
const double INFD = 1e30;
const double EPS = 1e-9;
const double PI = acos(-1);
const int MOD = 998244353;
template <typename T>
inline T read() {
T X = 0, w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '-';
ch = getchar();
}
while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
return w ? -X : X;
}
const int MAXN = 200005;
int n, m, k;
int dr[4] = {1, 0, -1, 0};
int dc[4] = {0, 1, 0, -1};
int dr2[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int dc2[8] = {1, 0, -1, 1, 0, -1, 1, -1};
int CASE = 1;
template <typename T>
struct List {
T* data;
int sz;
List() : data(nullptr), sz(0) {}
~List() {
if (data) delete data;
}
};
int arr[MAXN];
pair<int, int> s() {
set<int> stt;
set<int> stt2;
int i = 1;
for (; i <= n; i++) {
if (!stt.count(arr[i]))
stt.insert(arr[i]);
else
break;
}
for (int i = 1; i <= stt.size(); i++) {
if (!stt.count(i)) return {-1, -1};
}
for (; i <= n; i++) {
if (!stt2.count(arr[i]))
stt2.insert(arr[i]);
else
break;
}
for (int i = 1; i <= stt2.size(); i++) {
if (!stt2.count(i)) return {-1, -1};
}
if (i <= n) return {-1, -1};
return {stt.size(), stt2.size()};
}
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
arr[i] = read<int>();
}
vector<pair<int, int>> c;
auto x = s();
if (x.first != -1) c.push_back(x);
reverse(arr + 1, arr + n + 1);
x = s();
if (x.first != -1 &&
(c.empty() || (pair<int, int>){x.second, x.first} != c.back()))
c.push_back({x.second, x.first});
printf("%d\n", c.size());
for (auto a : c) {
printf("%d %d\n", a.first, a.second);
}
}
int main() {
int T = read<int>();
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
void solve() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
A[i]--;
}
vector<int> cnt(n, 0);
for (int t : A) cnt[t]++;
int p;
for (p = 0; p < n; p++) {
if (cnt[p] != 2) break;
}
for (int q = p; q < n; q++) {
if (cnt[q] != 1) {
for (int k = q; k < n; k++) {
if (cnt[k] != 0) {
cout << 0 << endl;
return;
}
}
break;
}
}
vector<int> cc(n, 0);
vector<int> res;
for (int i = 0; i < n; i++) {
cc[A[i]]++;
if (i == p - 1 || i == n - p - 1) {
bool f = true;
for (int j = 0; j <= i; j++) {
if (cc[j] == 0) {
f = false;
break;
}
}
if (f) res.push_back(i + 1);
}
}
cout << res.size() << "\n";
for (int i = 0; i < res.size(); i++) {
cout << res[i] << " " << n - res[i] << "\n";
}
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int T = 1;
cin >> T;
for (int i = 1; i <= T; i++) {
solve();
}
cout.flush();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i += 1) cin >> vec[i];
int mm = -1;
vector<int> cantIz;
vector<int> maxIz;
set<int> cc;
for (int i = 0; i < n; i += 1) {
mm = max(mm, vec[i]);
maxIz.push_back(mm);
cc.insert(vec[i]);
cantIz.push_back((int)(cc).size());
}
int mm2 = -1;
vector<int> cantDer(n);
vector<int> maxDer(n);
set<int> cc2;
for (int i = n - 1; i >= 0; i--) {
mm2 = max(vec[i], mm2);
maxDer[i] = mm2;
cc2.insert(vec[i]);
cantDer[i] = (int)(cc2).size();
}
int res = 0;
int rr = 1;
vector<pair<int, int> > re2;
for (int i = 0; i < n - 1; i += 1) {
if ((maxIz[i] == cantIz[i] && maxIz[i] == i + 1) &&
(maxDer[i + 1] == cantDer[i + 1] && maxDer[i + 1] == n - rr)) {
res++;
re2.push_back(make_pair(i + 1, n - rr));
}
rr++;
}
cout << res << endl;
for (int i = 0; i < (int)(re2).size(); i += 1) {
cout << re2[i].first << " " << re2[i].second << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e3 + 3;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
set<int> l, r;
int sl[200020], sr[200020];
set<int>::iterator it;
int n, a[200020];
vector<pair<int, int> > ans;
int main() {
int t;
cin >> t;
while (t--) {
scanf("%d", &n);
l.clear(), r.clear(), ans.clear();
for (int i = (int)0; i < (int)n + 5; i++) sl[i] = sr[i] = 0;
for (int i = (int)0; i < (int)n; i++) {
scanf("%d", &a[i]);
r.insert(a[i]);
sr[a[i]]++;
}
for (int i = (int)0; i < (int)n; i++) {
sr[a[i]]--;
if (!sr[a[i]]) r.erase(r.find(a[i]));
if (sl[a[i]]) break;
sl[a[i]]++;
l.insert(a[i]);
it = l.end();
it--;
int ml = *it;
it = r.end();
it--;
int mr = *it;
if (l.size() == i + 1 && ml == i + 1 && r.size() == n - i - 1 &&
mr == n - i - 1) {
ans.push_back(pair<int, int>(i + 1, n - i - 1));
}
}
printf("%d\n", (int)ans.size());
for (int i = (int)0; i < (int)(int)ans.size(); i++)
printf("%d %d\n", ans[i].first, ans[i].second);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200 * 1000 + 10;
const int MOD = 1000 * 1000 * 1000 + 7;
int a[MAXN];
vector<int> pos[MAXN], vec, ans;
map<int, int> mp, mark;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t;
cin >> t;
while (t--) {
ans.clear();
mark.clear();
mp.clear();
vec.clear();
int n;
cin >> n;
int p1 = -1, p2 = -1, mx1 = -1, mx2 = -1;
bool bad1 = 0, bad2 = 0, ok = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
vec.push_back(a[i]);
pos[a[i]].push_back(i);
if ((int)pos[a[i]].size() > 2) ok = 0;
if (a[i] == 1) {
if (p1 == -1)
p1 = i;
else {
if (p2 == -1)
p2 = i;
else
ok = 0;
}
}
}
if (!ok || p1 == -1 || p2 == -1) {
cout << 0 << endl;
goto hell;
}
for (int i = 0; i < p1; i++) {
mx1 = max(mx1, a[i]);
if (mark[a[i]] == 1) {
bad1 = 1;
break;
}
mark[a[i]] = 1;
}
if (bad1) {
cout << 0 << endl;
goto hell;
}
for (int i = p1; i < n; i++) {
if (mark[a[i]] == 1) break;
mark[a[i]] = 1;
mx1 = max(mx1, a[i]);
if (mx1 == i + 1) mp[i]++;
}
for (int i = n - 1; i > p2; i--) {
mx2 = max(mx2, a[i]);
if (mark[a[i]] == 2) {
bad2 = 1;
break;
}
mark[a[i]] = 2;
}
if (bad2) {
cout << 0 << endl;
goto hell;
}
for (int i = p2; i > -1; i--) {
if (mark[a[i]] == 2) break;
mark[a[i]] = 2;
mx2 = max(mx2, a[i]);
if (mx2 == n - i && mp[i - 1]) ans.push_back(n - i);
}
cout << (int)ans.size() << endl;
for (auto a : ans) cout << n - a << ' ' << a << endl;
hell:;
for (auto u : vec) pos[u].clear();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200010];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
int a1[3], b[3];
scanf("%d", &n);
int maxx = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] > a[maxx]) maxx = i;
}
int num = 0;
int c = 0;
map<int, bool> p;
for (int i = 1; i <= a[maxx]; i++) {
if (p[a[i]] == 0 && a[i] <= a[maxx]) {
p[a[i]] = 1;
c++;
}
}
int c1 = 0;
map<int, bool> p1;
for (int i = a[maxx] + 1; i <= n; i++) {
if (p1[a[i]] == 0) {
p1[a[i]] = 1;
}
}
for (int i = 1; i <= n - a[maxx]; i++) {
if (p1[i]) c1++;
}
if (c1 == n - a[maxx] && c == a[maxx]) {
num++;
a1[num] = a[maxx];
b[num] = n - a[maxx];
}
c = 0;
map<int, bool> p2;
for (int i = n - a[maxx] + 1; i <= n; i++) {
if (p2[a[i]] == 0 && a[i] <= a[maxx]) {
p2[a[i]] = 1;
c++;
}
}
c1 = 0;
map<int, bool> p3;
for (int i = 1; i <= n - a[maxx]; i++) {
if (p3[a[i]] == 0) {
p3[a[i]] = 1;
}
}
for (int i = 1; i <= n - a[maxx]; i++) {
if (p3[i]) c1++;
}
if (c == a[maxx] && c1 == n - a[maxx]) {
num++;
a1[num] = n - a[maxx];
b[num] = a[maxx];
if (num == 2 && a1[num] == a1[1]) num--;
}
printf("%d\n", num);
for (int i = num; i >= 1; i--) {
printf("%d %d\n", a1[i], b[i]);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int tc, o;
scanf("%d", &tc);
for (o = 1; o <= tc; o++) {
long long n, m, a, b, c, d, e, f, g, p, q, r, fr, sc, tr, sz, tz, sz1, sz2,
i, j, k, mx = -9, mn = 999999999999;
string str, ttr, ntr;
long long x = 0, y = 0, cnt = 0, res = -3, ttl = -3, ans = 0, sum = 0;
long long flg = 0, flag = 1, na = 0, as = 1;
vector<long long> u, v, w;
vector<pair<long long, long long> > vct, tct;
vector<string> vst;
set<long long> st, nt, tt;
map<long long, long long> mp, nq, qr, mp1, mp2;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &a);
v.push_back(a);
}
for (i = 0; i < n; i++) {
fr = v[i];
mp[fr]++;
if (mp[fr] == 1) {
if (fr > mx) {
mx = fr;
}
} else {
y++;
if (y == 2) {
flg = 9;
break;
}
mp.clear();
if (mx == i) {
p = i + 1 - 1;
} else {
flg = 9;
break;
}
mp[fr]++;
mx = fr;
}
}
if (flg == 0) {
q = n - p;
if (q == mx && p != 0 && p != n) {
vct.push_back(make_pair(p, q));
res = p;
ttl = q;
}
}
flg = 0;
mx = -9;
mp.clear();
y = 0;
for (i = n - 1; i >= 0; i--) {
fr = v[i];
mp[fr]++;
if (mp[fr] == 1) {
if (fr > mx) {
mx = fr;
}
} else {
y++;
if (y == 2) {
flg = 9;
break;
}
mp.clear();
if (mx == n - i - 1) {
p = n - i - 1;
} else {
flg = 9;
break;
}
mp[fr]++;
mx = fr;
}
}
if (flg == 0) {
q = n - p;
if (q == mx && q != n && q != 0 && q != res) {
vct.push_back(make_pair(q, p));
}
}
sz = vct.size();
printf("%lld\n", sz);
for (i = 0; i < sz; i++) {
f = vct[i].first;
g = vct[i].second;
if (i == 0) {
printf("%lld %lld\n", f, g);
} else {
printf("%lld %lld\n", f, g);
}
}
v.clear();
vct.clear();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
template <class T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template <class T>
T modpow(T a, T b, T m) {
T res = 1;
for (; b; b /= 2, a = (a * a) % m)
if (b & 1) res = (res * a) % m;
return res;
}
template <class T>
T inv(T a, T b) {
return 1 < a ? b - inv(b % a, a) * b / a : 1;
}
void re(int& e) { cin >> e; }
void re(long long& e) { cin >> e; }
void re(int* v, int n) {
for (int i = (0); i < (n); i++) cin >> v[i];
}
void re(vector<int>& v, int n) {
for (int i = (0); i < (n); i++) cin >> v[i];
}
void Solve() {
const int N = 200000 + 99;
int t, n;
vector<int> a(N);
re(t);
while (t--) {
re(n);
re(a, n);
multiset<int> L, R;
set<int> Lu, Ru;
for (int i = (0); i < (n); i++) R.insert(a[i]), Ru.insert(a[i]);
vector<pair<int, int> > ans;
for (int i = (0); i < (n - 1); i++) {
L.insert(a[i]);
R.erase(R.find(a[i]));
Lu.insert(a[i]);
if (!(R.find(a[i]) != R.end()) && (Ru.find(a[i]) != Ru.end()))
Ru.erase(Ru.find(a[i]));
if (*L.rbegin() == L.size() && L.size() == Lu.size() &&
*R.rbegin() == R.size() && R.size() == Ru.size())
ans.push_back({L.size(), R.size()});
}
cout << ans.size() << endl;
for (auto& e : ans) cout << e.first << ' ' << e.second << endl;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(6);
Solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
long long hell = round(1e18);
signed solve() {
long long n;
cin >> n;
vector<long long> v(n);
for (long long i = 0; i < n; i++) cin >> v[i];
long long mx = 0;
vector<long long> v1(n);
vector<long long> a(n + 1);
vector<long long> b(n + 1);
for (long long i = 0; i < n; i++) {
v1[v[i]]++;
if (v1[v[i]] > 1) break;
mx = max(mx, v[i]);
if (mx == i + 1) a[i + 1] = 1;
}
reverse((v).begin(), (v).end());
vector<long long> v2(n);
mx = 0;
long long c = 0;
for (long long i = 0; i < n; i++) {
v2[v[i]]++;
if (v2[v[i]] > 1) break;
mx = max(mx, v[i]);
if (mx == i + 1) {
b[i + 1] = 1;
if (a[n - i - 1] == 1) c++;
}
}
cout << c << endl;
for (long long i = 1; i < n; i++) {
if (a[i] == 1 & b[n - i] == 1) {
cout << i << " " << n - i << endl;
}
}
return 0;
}
signed main() {
long long t = 1;
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
multiset<int> s;
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> v;
map<int, int> m;
int x = 1;
int ans[n];
memset(ans, 0, sizeof(ans));
for (int i = 0; i < n; i++) {
s.insert(a[i]);
m[a[i]]++;
if (m[a[i]] > 1) break;
while (s.find(x) != s.end()) {
s.erase(s.find(x));
x++;
}
if (s.size() == 0) ans[i] = 1;
}
s.clear();
m.clear();
int c = 0;
x = 1;
for (int i = n - 1; i > 0; i--) {
s.insert(a[i]);
m[a[i]]++;
if (m[a[i]] > 1) break;
while (s.find(x) != s.end()) {
s.erase(s.find(x));
x++;
}
if (s.size() == 0 && ans[i - 1] == 1)
ans[i] = 1, v.push_back(i - 1);
else
ans[i] = 0;
}
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) {
cout << v[i] + 1 << " " << n - v[i] - 1 << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << " " << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
const long long N = 100005;
const long long mod = 1e9 + 7;
long long mx = -1e18, mn = 1e18;
void inp_out() {}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
inp_out();
long long t;
cin >> t;
while (t--) {
long long i, j, k, n, m, ans = 0, cnt = 0, sum = 0;
cin >> n;
long long a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
set<long long> s;
vector<pair<long long, long long> > dpl(n + 1);
for (i = 0; i < n; i++) {
s.insert(a[i]);
dpl[i] = {s.size(), *s.rbegin()};
}
set<long long> ss;
vector<pair<long long, long long> > dpr(n + 1);
for (i = n - 1; i >= 0; i--) {
ss.insert(a[i]);
dpr[i] = {ss.size(), *ss.rbegin()};
}
vector<pair<long long, long long> > rv;
for (i = 0; i < n - 1; i++) {
if (dpl[i].first == dpl[i].second && dpl[i].first == i + 1 &&
dpr[i + 1].first == dpr[i + 1].second &&
dpr[i + 1].first == n - i - 1) {
rv.push_back({dpl[i].second, dpr[i + 1].second});
}
}
cout << rv.size() << "\n";
for (auto ele : rv) {
cout << ele.first << " " << ele.second << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 9;
int a[MAX], n, b[MAX], c[MAX];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int t;
cin >> t;
while (t--) {
cin >> n;
vector<pair<int, int> > ans;
fill(b, b + n + 5, 0);
fill(c, c + n + 5, 0);
int mx = 0;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
if (c[a[i]]) break;
c[a[i]] = 1;
mx = max(mx, a[i]);
if (mx == i + 1) b[i] = 1;
}
mx = 0;
fill(c, c + n + 5, 0);
for (int i = n - 1; i >= 0; i--) {
if (c[a[i]]) break;
c[a[i]] = 1;
mx = max(mx, a[i]);
if (mx == n - i && b[i - 1]) ans.push_back({i, n - i});
}
cout << ans.size() << '\n';
for (auto x : ans) cout << x.first << " " << x.second << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
template <class T>
T gcd(T a, T b) {
return ((b == 0) ? a : gcd(b, a % b));
}
int MAXN;
template <class T>
struct BIT {
vector<T> bit;
BIT() { bit.assign(MAXN, 0); }
void add(int ind, T delta) {
for (; ind < MAXN; ind = ind | (ind + 1)) {
bit[ind] += delta;
}
}
T query(int ind) {
T sum = 0;
for (; ind >= 0; ind = (ind & (ind + 1)) - 1) {
sum += bit[ind];
}
return sum;
}
};
void solve() {
int n;
cin >> n;
MAXN = n + 5;
vector<int> a(n);
for (int i = 0; i < (int)(n); i++) cin >> a[i];
BIT<int> bit, bit1;
unordered_map<int, int> vis, vis1;
vector<pair<int, int> > ans;
vector<int> pos(n, 0);
int mx = 0, mx1 = 0;
for (int i = 0; i < (int)(n); i++) {
if (vis[a[i]]) break;
vis[a[i]] = 1;
mx = max(mx, a[i]);
bit.add(a[i], 1);
if (bit.query(mx) == mx) pos[i] = 1;
}
for (int i = n - 1; i >= 1; i--) {
if (vis1[a[i]]) break;
vis1[a[i]] = 1;
mx1 = max(mx1, a[i]);
bit1.add(a[i], 1);
if (bit1.query(mx1) == mx1 && pos[i - 1]) {
ans.push_back({i, n - i});
}
}
cout << ans.size() << endl;
for (int i = 0; i < (int)(ans.size()); i++)
cout << ans[i].first << " " << ans[i].second << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int a[n + 1], b[n + 1];
long long int mx = 0;
for (long long int i = 1; i <= n; i++) {
cin >> a[i];
b[i] = a[i];
mx = max(mx, a[i]);
}
long long int l1 = mx, l2 = n - mx;
sort(a + 1, a + l1 + 1);
sort(a + l1 + 1, a + n + 1);
sort(b + 1, b + l2 + 1);
sort(b + l2 + 1, b + n + 1);
set<pair<int, int> > ans;
int f1 = 1, f2 = 1;
for (int i = 1; i <= l1; i++) {
if (a[i] != i) {
f1 = 0;
}
}
int c = 1;
for (int i = l1 + 1; i <= n; i++) {
if (a[i] != c) {
f2 = 0;
}
c++;
}
if (f1 && f2) {
ans.insert(make_pair(l1, l2));
}
f1 = 1, f2 = 1;
for (int i = 1; i <= l2; i++) {
if (b[i] != i) {
f1 = 0;
}
}
c = 1;
for (int i = l2 + 1; i <= n; i++) {
if (b[i] != c) {
f2 = 0;
}
c++;
}
if (f1 && f2) {
ans.insert(make_pair(l2, l1));
}
cout << ans.size() << '\n';
if (ans.size()) {
for (auto p : ans) {
cout << p.first << " " << p.second << '\n';
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool check(long long v[], long long start, long long end, long long total) {
map<long long, long long> hash;
for (long long i = 1; i <= total; i++) {
hash.insert({i, 0});
}
for (long long i = start; i < end; i++) {
hash[v[i]]++;
}
for (long long i = 1; i <= total; i++) {
if (hash[i] != 1) {
return false;
}
}
return true;
}
bool get(long long v[], long long pehle, long long badme) {
return check(v, 0, pehle, pehle) && check(v, pehle, pehle + badme, badme);
}
int main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long v[n];
long long ma = INT_MIN;
for (long long i = 0; i < n; i++) {
cin >> v[i];
ma = max(ma, v[i]);
}
set<pair<long long, long long> > ans;
bool f1 = get(v, ma, n - ma);
if (f1 == true) {
ans.insert({ma, n - ma});
}
bool f2 = get(v, n - ma, ma);
if (f2 == true) {
ans.insert({n - ma, ma});
}
cout << ans.size() << endl;
for (auto i = ans.begin(); i != ans.end(); i++) {
cout << i->first << " " << i->second << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long mul(long long a, long long b, long long p = 1000000007) {
return ((a % p) * (b % p)) % p;
}
long long add(long long a, long long b, long long p = 1000000007) {
return (a % p + b % p) % p;
}
void input(long long a[], long long sz) {
for (long long i = 0; i < sz; i++) cin >> a[i];
}
void print(long long a[], long long sz) {
for (long long i = 0; i < sz; i++) {
if (i == sz - 1)
cout << a[i] << "\n";
else
cout << a[i] << " ";
}
}
long long maxr(long long a[], long long sz) {
long long ma;
for (long long i = 0; i < sz; i++) {
if (i == 0)
ma = a[i];
else if (a[i] > ma)
ma = a[i];
}
return ma;
}
long long minr(long long a[], long long sz) {
long long mi;
for (long long i = 0; i < sz; i++) {
if (i == 0)
mi = a[i];
else if (a[i] < mi)
mi = a[i];
}
return mi;
}
long long isprm(long long n) {
if (n <= 1) return 0;
if (n <= 3) return 1;
if (n % 2 == 0 || n % 3 == 0) return 0;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return 0;
return 1;
}
long long power(long long x, long long y, long long p = 1000000007) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long modInverse(long long n, long long p = 1000000007) {
return power(n, p - 2, p);
}
long long ncrMod(long long n, long long r, long long p = 1000000007) {
if (r == 0) return 1;
long long fac[n + 1];
fac[0] = 1;
for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
bool comp(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first == b.first) {
return (a.second > b.second);
}
return (a.first < b.first);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t;
cin >> t;
while (t--) {
long long n, a[200005], k = 1, f = 0;
vector<long long> p;
cin >> n;
input(a, n);
map<long long, long long> mp, s, s2, np;
for (long long i = 0; i < n; i++) {
mp[a[i]]++;
}
for (auto i : mp) {
if (i.first != k) {
f = 1;
break;
}
k++;
if (i.second > 2) {
f = 1;
break;
}
if (i.second == 2) {
p.push_back(i.first);
s[i.first] = 1;
s2[i.first] = 1;
}
np[i.first] = 1;
}
long long ln = p.size();
k = 1;
sort(p.begin(), p.end());
for (long long i = 0; i < ln; i++) {
if (p[i] != k) {
f = 1;
break;
}
k++;
}
if (f == 1) {
cout << "0\n";
continue;
}
long long lm = p[n - 1], l1 = -1, l2 = -1;
f = 0;
for (long long i = 0; i < n; i++) {
if (s[a[i]] == 0) {
f++;
break;
}
s.erase(a[i]);
if (s.empty()) {
l1 = i + 1;
break;
}
}
long long h = 0;
if (l1 != -1) {
f = 0;
for (long long i = l1; i < n; i++) {
if (np[a[i]] == 0) {
f++;
break;
}
np.erase(a[i]);
if (np.empty()) {
h = 1;
break;
}
}
}
if (h == 0) l1 = -1;
for (long long i = n - 1; i >= 0; i--) {
if (s2[a[i]] == 0) {
f++;
}
s2.erase(a[i]);
if (s2.empty()) {
l2 = i;
break;
}
}
np.clear();
for (auto i : mp) {
np[i.first] = 1;
}
h = 0;
if (l2 != -1) {
f = 0;
for (long long i = l2 - 1; i >= 0; i--) {
if (np[a[i]] == 0) {
f++;
break;
}
np.erase(a[i]);
if (np.empty()) {
h = 1;
break;
}
}
}
if (h == 0) l2 = -1;
if (l1 == -1 && l2 == -1) {
cout << "0\n";
} else if (l1 == -1 || l1 == l2) {
cout << "1\n";
cout << l2 << " " << n - l2 << "\n";
} else if (l2 == -1) {
cout << "1\n";
cout << l1 << " " << n - l1 << "\n";
} else {
cout << "2\n";
cout << l1 << " " << n - l1 << "\n";
cout << l2 << " " << n - l2 << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
long long powermod(long long _a, long long _b, long long _m) {
long long _r = 1;
while (_b) {
if (_b % 2 == 1) _r = (_r * _a) % _m;
_b /= 2;
_a = (_a * _a) % _m;
}
return _r;
}
using namespace std;
template <typename T>
void pr(const T& t) {
cout << t << "\n";
}
template <typename T, typename U, typename... ARGS>
void pr(const T& t, const U& u, const ARGS&... args) {
cout << t << " ";
pr(u, args...);
}
bool solve(vector<long long>& arr, long long a, long long b) {
long long i = 0;
vector<long long> v;
while (a--) {
v.push_back(arr[i]);
i++;
}
sort(v.begin(), v.end());
for (long long i = 0; i < v.size(); ++i)
if (v[i] != i + 1) return false;
v.clear();
while (b--) {
v.push_back(arr[i]);
i++;
}
sort(v.begin(), v.end());
for (long long i = 0; i < v.size(); ++i)
if (v[i] != i + 1) return false;
return true;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
;
long long tt;
cin >> tt;
while (tt--) {
long long n;
cin >> n;
;
long long maxx = 0;
vector<long long> arr(n);
map<long long, long long> mp;
bool flag = true;
for (long long i = 0; i < n; ++i) {
cin >> arr[i];
;
maxx = max(maxx, arr[i]);
mp[arr[i]]++;
}
bool allow = true;
long long j = maxx;
for (int i = 1; i <= maxx; i++) {
if (mp[i] > 2)
flag = false;
else if (mp[i] == 2 && allow)
continue;
else if (mp[i] == 2)
flag = false;
else if (mp[i] == 1) {
if (allow) j = i - 1;
allow = false;
} else
flag = false;
}
vector<pair<long long, long long> > ans;
if (j == 0) flag = false;
if (flag && solve(arr, j, maxx)) {
ans.push_back({j, maxx});
}
if (flag && solve(arr, maxx, j) && maxx != j) {
ans.push_back({maxx, j});
}
pr(ans.size());
for (long long i = 0; i < ans.size(); ++i) pr(ans[i].first, ans[i].second);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int T;
cin >> T;
while (T != 0) {
long long int n, i;
cin >> n;
long long int A[n];
long long int B[200001];
long long int C[200001];
long long int m, f;
long long int o, t;
long long int w, z;
set<long long int> perm;
set<long long int> cern;
memset(B, 0, 200001);
memset(C, 0, 200001);
for (i = 0; i < n; i += 1) {
cin >> A[i];
B[A[i]] += 1;
}
m = 0;
f = 1;
for (i = 0; i < n; i += 1) {
if (A[i] > m) m = A[i];
}
o = 0;
t = 0;
for (i = 1; i <= m; i += 1) {
if (B[i] != 1 && B[i] != 2) {
f = 0;
} else {
if (B[i] == 1) o++;
if (B[i] == 2) t++;
}
}
if (f == 0) {
cout << "0"
<< "\n";
} else {
set<long long int>::iterator ps;
set<long long int>::iterator it;
long long int c;
w = 0;
z = 0;
c = 0;
long long int l;
l = n - 1;
vector<long long int> As;
vector<long long int> Bs;
for (i = 0; i < n; i += 1) {
cern.insert(A[i]);
}
for (i = 0; i < l; i += 1) {
perm.insert(A[i]);
B[A[i]] -= 1;
C[A[i]] += 1;
if (B[A[i]] == 1) {
t--;
o++;
}
if (B[A[i]] == 0) {
cern.erase(A[i]);
o--;
}
if (C[A[i]] == 1) {
w++;
}
if (C[A[i]] == 2) {
w--;
z++;
}
ps = perm.end();
it = cern.end();
ps--;
it--;
if (*ps == perm.size() && *it == cern.size() && t == 0 && z == 0) {
As.push_back(*ps);
Bs.push_back(*it);
c += 1;
}
}
cout << c << "\n";
for (i = 0; i < As.size(); i += 1) {
cout << As[i] << " " << Bs[i] << "\n";
}
}
T -= 1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int t;
int n, m;
int a[maxn];
int main() {
scanf("%d", &t);
int o = 1;
while (t--) {
bool vis1[maxn] = {0}, vis2[maxn] = {0};
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", a + i);
int mx1 = 0, len1 = 0;
int mx2 = 0, len2 = 0;
map<int, int> mp1, mp2;
mp1.clear();
mp2.clear();
for (int i = 1; i <= n; ++i) {
if (vis1[a[i]])
break;
else {
vis1[a[i]] = 1;
++len1;
mx1 = max(mx1, a[i]);
if (mx1 == len1) mp1[len1]++;
}
}
for (int i = n; i >= 1; --i) {
if (vis2[a[i]])
break;
else {
vis2[a[i]] = 1;
++len2;
mx2 = max(mx2, a[i]);
if (mx2 == len2) mp2[len2]++;
}
}
int ans = 0;
vector<int> v;
v.clear();
for (auto i : mp1) {
int j = i.first;
if (mp2.count(n - j)) {
v.push_back(j);
}
}
printf("%d\n", v.size());
for (int i : v) {
printf("%d %d\n", i, n - i);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long arr[N];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
std::vector<long long> arr(n + 1);
std::vector<long long> left_candidates(n + 1);
std::vector<long long> right_candidates(n + 1);
set<long long> s1, s2;
for (long long i = 1; i <= n; i++) {
cin >> arr[i];
s1.insert(arr[i]);
if (s1.size() == i && *s1.rbegin() == i) {
left_candidates[i] = 1;
}
}
for (long long i = n; i >= 1; i--) {
s2.insert(arr[i]);
if (s2.size() == (n - i + 1) && *s2.rbegin() == (n - i + 1)) {
right_candidates[i] = 1;
}
}
std::vector<long long> ans;
for (long long i = 1; i < n; i++) {
if (left_candidates[i] && right_candidates[i + 1]) {
ans.push_back(i);
}
}
cout << ans.size() << "\n";
if (ans.size()) {
for (auto i : ans) {
cout << i << " " << n - i << "\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long double pi = 3.1415926535897932384626433;
const long long inf = 1e18;
bool isprime(long long n) {
for (long long i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
long long factorial(long long n) {
return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
long long power(long long x, long long y) {
long long res = 1;
x = x % mod;
while (y > 0) {
if (y & 1) res = ((res % mod) * (x % mod)) % mod;
y = y >> 1;
x = ((x % mod) * (x % mod)) % mod;
}
return res;
}
long long gcd(long long a, long long b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); }
long long max(long long a, long long b) {
long long sol = a > b ? a : b;
return sol;
}
long long min(long long a, long long b) {
long long sol = a < b ? a : b;
return sol;
}
long long modular(long long a, long long b, char c) {
if (c == '+') return ((a % mod) + (b % mod)) % mod;
if (c == '-') return ((a % mod) - (b % mod)) % mod;
if (c == '*') return ((a % mod) * (b % mod)) % mod;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
map<long long, long long> mp1, mp2;
set<long long> s, d;
vector<long long> v(n);
vector<pair<long long, long long>> ans;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
v[i] = a;
s.insert(a);
auto it = s.end();
it--;
long long k = *it;
if (s.size() == k and s.size() == i + 1) mp1[(i + 1)]++;
}
for (long long i = n - 1; i >= 0; i--) {
d.insert(v[i]);
auto it = d.end();
it--;
long long k = *it;
if (d.size() == k and d.size() == n - i) mp2[n - i]++;
}
for (auto it : mp1) {
if (mp2[n - it.first]) ans.push_back({it.first, n - it.first});
}
cout << ans.size() << "\n";
for (auto y : ans) cout << y.first << " " << y.second << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline void ioThings() {
ios::sync_with_stdio(0);
cin.tie(0);
}
using ll = long long;
using vi = vector<int>;
using si = set<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
int main() {
ioThings();
int tcs;
if (cin >> tcs)
for (int tc = 0; tc < tcs; tc++) {
int n;
cin >> n;
vi a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vi v1, v2, a1(n + 1), a2(n + 1);
int mx1 = 0, mx2 = 0;
a1[0] = 1, a2[0] = 1;
for (int i = 0; i < n - 1; i++) {
if (a1[a[i]]) break;
a1[a[i]]++;
mx1 = max(mx1, a[i]);
if (mx1 == i + 1) v1.push_back(mx1);
}
for (int i = 0; i < n - 1; i++) {
if (a2[a[n - i - 1]]) break;
a2[a[n - i - 1]]++;
mx2 = max(mx2, a[n - i - 1]);
if (mx2 == i + 1) v2.push_back(mx2);
}
vii pairs;
int ai = 0, bi = (int)v2.size() - 1;
while (ai < (int)v1.size() && bi >= 0) {
if (v1[ai] + v2[bi] == n) {
pairs.push_back({v1[ai], v2[bi]});
ai++, bi--;
} else if (v1[ai] + v2[bi] > n)
bi--;
else
ai++;
}
cout << (int)pairs.size() << '\n';
for (ii z : pairs) cout << z.first << ' ' << z.second << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, ct, ans1, a[200005], vis[200005];
bool fg, vis2[200005];
int rd() {
int x = 0, tp = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') tp = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x * 10 + c - '0');
c = getchar();
}
return x * tp;
}
int main() {
int T = rd();
while (T--) {
n = rd();
fg = ans1 = 0;
for (int i = 1; i <= n; i++) {
a[i] = rd(), vis[a[i]]++;
if (a[i] > n || a[i] == 0) fg = 1;
}
int now = 1, res = n, mx;
while (vis[now] == 2) now++;
if (vis[now] > 2 || fg) {
printf("0\n");
for (int i = 1; i <= n; i++) vis[a[i]] = 0;
continue;
}
ct = now - 1;
res -= 2 * (now - 1);
for (; now <= n; now++) {
if (vis[now] != 1) break;
res--;
}
if (res > 0) {
printf("0\n");
for (int i = 1; i <= n; i++) vis[a[i]] = 0;
continue;
}
res = 0, mx = 0;
for (int i = 1; i <= ct; i++) {
mx = max(mx, a[i]);
if (vis2[a[i]] || mx > ct) {
fg = 1;
break;
}
vis2[a[i]] = 1;
}
if (!fg) res++, ans1 = ct;
for (int i = 1; i <= ct; i++) vis2[a[i]] = 0;
fg = 0, mx = 0;
for (int i = 1; i <= n - ct; i++) {
mx = max(mx, a[i]);
if (vis2[a[i]] || mx > n - ct) {
fg = 1;
break;
}
vis2[a[i]] = 1;
}
if (!fg) res++, ans1 = n - ct;
if (!res || ct == n || ct == 0) {
printf("0\n");
} else if (res == 1 || ans1 == n - ans1) {
printf("1\n%d %d\n", ans1, n - ans1);
} else if (res == 2) {
printf("2\n%d %d\n%d %d\n", ans1, n - ans1, n - ans1, ans1);
}
for (int i = 1; i <= n; i++) vis[a[i]] = vis2[a[i]] = 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long vis[200005], cnt[200005], arr[200005];
void solve() {
long long i, j, k, l, m, n, x, sz = 0, flag = 1, mx = 0;
cin >> n;
for (i = 0; i <= n; i++) vis[i] = cnt[i] = 0;
for (i = 0; i < n; i++) {
cin >> arr[i];
cnt[arr[i]]++;
if (cnt[arr[i]] == 2) sz = max(sz, arr[i]);
mx = max(mx, arr[i]);
if (cnt[arr[i]] == 3) flag = 0;
}
vector<long long> ans;
if (sz + mx != n) flag = 0;
if (!flag) {
cout << 0 << endl;
return;
}
for (i = 0; i < sz; i++) {
vis[arr[i]] = 1;
}
flag = 1;
for (i = 1; i <= sz; i++) {
if (vis[i])
continue;
else
flag = 0;
}
if (flag) ans.push_back(sz);
flag = 1;
if (sz != mx) {
for (i = 0; i <= mx; i++) vis[i] = 0;
for (i = 0; i < mx; i++) {
vis[arr[i]] = 1;
}
for (i = 1; i <= mx; i++)
if (!vis[i]) flag = 0;
if (flag) ans.push_back(mx);
}
cout << ans.size() << endl;
for (i = 0; i < ans.size(); i++) {
cout << ans[i] << ' ' << n - ans[i] << endl;
}
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long t;
t = 1;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[n];
int max_val = -1;
for (int i = 0; i < n; i++) {
cin >> arr[i];
max_val = max(max_val, arr[i]);
}
int l1 = max_val;
int l2 = n - max_val;
bool case1 = true;
multiset<int> a, b;
for (int i = 0; i < l1; i++) {
a.insert(arr[i]);
}
for (int i = l1; i < n; i++) {
b.insert(arr[i]);
}
for (int i = 1; i <= l1; i++) {
if (a.count(i) != 1) {
case1 = false;
break;
}
}
for (int i = 1; i <= l2; i++) {
if (b.count(i) != 1) {
case1 = false;
break;
}
}
bool case2 = true;
multiset<int> c, d;
for (int i = 0; i < l2; i++) {
c.insert(arr[i]);
}
for (int i = l2; i < n; i++) {
d.insert(arr[i]);
}
for (int i = 1; i <= l2; i++) {
if (c.count(i) != 1) {
case2 = false;
break;
}
}
for (int i = 1; i <= l1; i++) {
if (d.count(i) != 1) {
case2 = false;
break;
}
}
if (case1 && case2) {
if (l1 == n - l1) {
cout << 1 << '\n';
cout << l1 << " " << l1 << "\n";
} else {
cout << 2 << "\n";
cout << l1 << " " << n - l1 << "\n";
cout << n - l1 << " " << l1 << '\n';
}
} else if (case1) {
cout << 1 << "\n";
cout << l1 << " " << n - l1 << "\n";
} else if (case2) {
cout << 1 << "\n";
cout << n - l1 << " " << l1 << "\n";
} else {
cout << 0 << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int NUM = 2e5 + 5;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int num_tests = 1;
cin >> num_tests;
while (num_tests-- > 0) {
long long int n;
cin >> n;
vector<long long int> a(n);
for (long long int i = 0; i < n; i++) cin >> a[i];
long long int mx = *max_element(a.begin(), a.end());
long long int mn = n - mx;
long long int ans = 0;
map<long long int, long long int> one, two;
for (long long int i = 0; i < mn; i++) one[a[i]] = 1;
for (long long int i = mn; i < n; i++) two[a[i]] = 1;
bool ok = 1;
for (long long int i = 1; i < mn + 1; i++)
if (!one[i]) {
ok = 0;
break;
}
for (long long int i = 1; i < mx + 1; i++)
if (!two[i]) {
ok = 0;
break;
}
bool ok2 = 1;
one.clear();
two.clear();
for (long long int i = 0; i < mx; i++) one[a[i]] = 1;
for (long long int i = mx; i < n; i++) two[a[i]] = 1;
for (long long int i = 1; i < mx + 1; i++)
if (!one[i]) {
ok2 = 0;
break;
}
for (long long int i = 1; i < mn + 1; i++)
if (!two[i]) {
ok2 = 0;
break;
}
if (!ok && !ok2)
cout << 0 << "\n";
else if (ok && ok2) {
if (mx != n - mx)
cout << 2 << "\n"
<< mx << " " << n - mx << "\n"
<< n - mx << " " << mx << "\n";
else
cout << 1 << "\n" << mx << " " << n - mx << "\n";
} else if (!ok2)
cout << 1 << "\n" << mn << " " << mx << "\n";
else if (ok2)
cout << 1 << "\n" << mx << " " << mn << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; ++i) cin >> arr[i];
int pre[n], post[n];
int mx = INT_MIN;
for (int i = 0; i < n; ++i) pre[i] = max(arr[i], mx), mx = pre[i];
mx = INT_MIN;
for (int i = n - 1; i >= 0; --i) post[i] = max(arr[i], mx), mx = post[i];
set<int> s, temp;
int bp;
for (int i = n - 1; i >= 0; --i) {
if (temp.find(arr[i]) != temp.end()) {
bp = i;
break;
}
temp.insert(arr[i]);
}
int ans = 0;
vector<int> v;
for (int i = 0; i < n; ++i) {
if (s.find(arr[i]) == s.end()) {
if (pre[i] == i + 1 && i + 1 > bp && post[i + 1] == n - i - 1) {
++ans;
v.push_back(i + 1);
v.push_back(n - i - 1);
}
} else
break;
s.insert(arr[i]);
}
cout << ans << "\n";
if (ans) {
for (int i = 0; i < v.size(); i += 2)
cout << v[i] << " " << v[i + 1] << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long inf = 1e18;
const long long mxn = 1e7;
bool prime[mxn + 1];
long long power(long long x, unsigned long long y) {
long long res = 1;
while (y > 0) {
if (y & 1) res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
signed main() {
long long t = 1;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[n + 1];
for (long long i = 1; i <= n; i++) cin >> a[i];
;
long long mx = a[1];
for (long long i = 2; i <= n; i++)
if (mx < a[i]) mx = a[i];
long long mn = n - mx;
long long b[n + 1], c[n + 1];
for (long long i = 1; i <= n; i++) {
b[i] = a[i];
c[i] = a[i];
}
sort(b + 1, b + mx + 1);
sort(b + mx + 1, b + n + 1);
sort(c + 1, c + mn + 1);
sort(c + mn + 1, c + n + 1);
bool b1 = 0, b2 = 0, c1 = 0, c2 = 0;
for (long long i = 1; i <= mx; i++) {
if (b[i] != i) {
b1 = 1;
break;
}
}
for (long long i = mx + 1; i <= n; i++) {
if (b[i] != (i - mx)) {
b2 = 1;
break;
}
}
for (long long i = 1; i <= mn; i++) {
if (c[i] != i) {
c1 = 1;
break;
}
}
for (long long i = mn + 1; i <= n; i++) {
if (c[i] != (i - mn)) {
c2 = 1;
break;
}
}
long long cnt = 0;
bool cnt1;
if (b1 == 0 && b2 == 0) {
cnt++;
cnt1 = 0;
}
if (c1 == 0 && c2 == 0) {
cnt++;
cnt1 = 1;
}
if (cnt == 0) {
cout << 0 << endl;
} else if (cnt == 1) {
if (cnt1) {
cout << 1 << endl;
cout << mn << " " << mx << endl;
} else {
cout << 1 << endl;
cout << mx << " " << mn << endl;
}
} else if (cnt == 2 && mx == mn) {
cout << 1 << endl;
cout << mx << " " << mn << endl;
} else {
cout << 2 << endl;
cout << mn << " " << mx << endl;
cout << mx << " " << mn << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n, mx = 0;
cin >> n;
vector<long long> v(n);
for (long long i = 0; i < n; i++) {
cin >> v[i];
mx = max(mx, v[i]);
}
vector<long long> r1, r2, s1, s2, p1, p2;
for (long long i = 0; i < mx; i++) {
r1.push_back(v[i]);
}
for (long long i = mx; i < n; i++) {
r2.push_back(v[i]);
}
bool fg1 = true, fg2 = true;
sort(r1.begin(), r1.end());
for (long long i = 0, j = 1; i < r1.size(); i++, j++) {
if (r1[i] != j) {
fg1 = false;
break;
}
}
sort(r2.begin(), r2.end());
for (long long i = 0, j = 1; i < r2.size(); i++, j++) {
if (r2[i] != j) {
fg2 = false;
break;
}
}
bool fg3 = true, fg4 = true;
for (long long i = 0; i < (n - mx); i++) {
s1.push_back(v[i]);
}
for (long long i = n - mx; i < n; i++) {
s2.push_back(v[i]);
}
sort(s1.begin(), s1.end());
for (long long i = 0, j = 1; i < s1.size(); i++, j++) {
if (s1[i] != j) {
fg3 = false;
break;
}
}
sort(s2.begin(), s2.end());
for (long long i = 0, j = 1; i < s2.size(); i++, j++) {
if (s2[i] != j) {
fg4 = false;
break;
}
}
vector<pair<long long, long long> > ans;
if (fg1 && fg2) ans.push_back({mx, n - mx});
if (fg3 && fg4) {
if (mx != n - mx) ans.push_back({n - mx, mx});
}
if (ans.size() == 0) {
cout << 0 << endl;
continue;
} else {
cout << ans.size() << endl;
for (long long i = 0; i < ans.size(); i++) {
cout << ans[i].first << " " << ans[i].second << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[200010];
int an[200010], kr;
int main() {
int t;
cin >> t;
while (t--) {
kr = 0;
int n;
cin >> n;
int d[200010] = {0}, a[200010] = {0};
int ma = 0, mm = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
ma = max(ma, ++d[arr[i]]);
mm = max(mm, arr[i]);
if (ma == 1 && mm == i + 1) {
a[i] = 1;
}
}
int dd[200010] = {0};
ma = 0;
mm = 0;
for (int i = n - 1; i > 0; i--) {
ma = max(ma, ++dd[arr[i]]);
mm = max(mm, arr[i]);
if (ma == 1 && n - i == mm && a[i - 1]) {
an[kr++] = i;
}
}
cout << kr << endl;
for (int i = 0; i < kr; i++) {
cout << an[i] << " " << n - an[i] << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc;
cin >> tc;
while (tc--) {
int n, mx = 0, mn;
cin >> n;
vector<int> v(n);
for (int &vi : v) {
cin >> vi;
mx = max(mx, vi);
}
set<ii> ans;
mn = n - mx;
vector<bool> sL(mn + 1, false), sR(mx + 1, false);
bool can = true;
for (int i = 0; i < n; ++i) {
if (i < mn) {
if (v[i] > mn) {
can = false;
break;
} else if (sL[v[i]]) {
can = false;
break;
}
sL[v[i]] = true;
} else {
if (sR[v[i]]) {
can = false;
break;
}
sR[v[i]] = true;
}
}
if (can && mn) ans.insert({mn, mx});
vector<bool> SL(mx + 1, false), SR(mn + 1, false);
can = true;
for (int i = 0; i < n; ++i) {
if (i >= mx) {
if (v[i] > mn) {
can = false;
break;
} else if (SR[v[i]]) {
can = false;
break;
}
SR[v[i]] = true;
} else {
if (SL[v[i]]) {
can = false;
break;
}
SL[v[i]] = true;
}
}
if (can && mn) ans.insert({mx, mn});
cout << ans.size() << "\n";
for (const auto &x : ans) cout << x.first << " " << x.second << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int t, a[200005] = {}, b[200005] = {}, c[200005] = {};
cin >> t;
while (t--) {
int n;
vector<pair<int, int> > z;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) b[i] = c[i] = 0;
int l = n + 1, r = 0;
for (int i = 1; i <= n; i++) {
if (b[a[i]]) break;
l = min(l, a[i]);
r = max(r, a[i]);
if (l == 1 && r == i) c[i] = 1;
b[a[i]] = 1;
}
for (int i = 1; i <= n; i++) b[i] = 0;
l = n + 1, r = 0;
for (int i = n; i; i--) {
if (b[a[i]]) break;
l = min(l, a[i]);
r = max(r, a[i]);
if (l == 1 && r == n - i + 1 && c[i - 1]) z.push_back({i - 1, n - i + 1});
b[a[i]] = 1;
}
cout << z.size() << '\n';
for (pair<int, int> i : z) cout << i.first << ' ' << i.second << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 2e9;
const long long INF = 8e18;
const long long maxn = 2e5 + 5;
long long a[maxn], num[maxn], num2[maxn], sum[maxn];
inline void init(long long n) {
for (long long i = 0; i < n + 5; ++i) num[i] = num2[i] = sum[i] = 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
init(n);
bool ok = 1;
long long cnt = 0, cnt2 = 0;
for (long long i = 1; i <= n; ++i) {
cin >> a[i];
++num[a[i]];
if (num[a[i]] == 1)
++cnt;
else
--cnt, ++cnt2;
sum[i] = sum[i - 1] + a[i];
if (num[a[i]] > 2) ok = 0;
}
if (!ok) {
cout << 0 << '\n';
continue;
}
long long now = 0;
vector<long long> res;
for (long long i = 1; i <= n; ++i) {
++num2[a[i]];
if (num2[a[i]] == 1)
++now;
else
break;
if (num[a[i]] == 2)
--cnt2, ++cnt;
else
--cnt;
--num[a[i]];
if (cnt2 == 0) {
long long p1 = (1 + i) * i / 2;
long long p2 = (1 + n - i) * (n - i) / 2;
if (sum[i] == p1 && sum[n] - sum[i] == p2) res.push_back(i);
}
}
cout << res.size() << '\n';
for (auto x : res) cout << x << ' ' << n - x << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 11;
int a[N];
bool pref[N], suf[N];
void doo() {
int n;
cin >> n;
fill(pref, pref + n, 0);
fill(suf, suf + n, 0);
set<int> st;
for (int i = 1; i <= n - 1; i++) st.insert(i);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
auto it = st.find(a[i]);
if (it == st.end()) {
pref[i] = 0;
continue;
}
st.erase(it);
if (st.empty()) {
pref[i] = 1;
continue;
}
if (*st.begin() > i + 1) pref[i] = 1;
}
st = {};
for (int i = 1; i <= n - 1; i++) st.insert(i);
for (int i = n - 1; i >= 0; i--) {
auto it = st.find(a[i]);
if (it == st.end()) {
suf[i] = 0;
continue;
}
st.erase(it);
if (st.empty()) {
suf[i] = 1;
continue;
}
if (*st.begin() > n - i) suf[i] = 1;
}
int ans = 0;
for (int i = 0; i < n - 1; i++) ans += (pref[i] && suf[i + 1]);
cout << ans << '\n';
for (int i = 0; i < n - 1; i++)
if (pref[i] && suf[i + 1]) cout << i + 1 << " " << n - i - 1 << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int tt;
cin >> tt;
while (tt--) doo();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
int64_t t = 1;
cin >> t;
while (t--) {
int64_t n;
cin >> n;
vector<int64_t> a(n);
map<int64_t, int64_t> mp;
int64_t poora = 0;
for (int64_t i = 0; i < n; i++) {
cin >> a[i];
poora += a[i];
mp[a[i]]++;
}
vector<pair<int64_t, int64_t> > vec;
int64_t sum = 0;
for (int64_t i = 0; i < n - 1; i++) {
sum += a[i];
int64_t x = i + 1;
int64_t y = n - x;
if (sum == (x * (x + 1) / 2) and (poora - sum) == (y * (y + 1) / 2)) {
vec.push_back({x, y});
}
}
int64_t flag = 0;
for (auto it : vec) {
map<int64_t, int64_t> tp = mp;
for (int64_t i = 1; i <= it.first; i++) {
if (tp.find(i) == tp.end()) {
flag++;
break;
}
tp[i]--;
}
for (int64_t i = 1; i <= it.second; i++) {
if (tp.find(i) == tp.end()) {
flag++;
break;
}
if (tp[i] != 1) {
flag++;
break;
}
}
}
if (flag) {
cout << 0 << endl;
continue;
}
cout << vec.size() << endl;
for (auto it : vec) {
cout << it.first << " " << it.second << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long n, mxm = INT_MIN, mnm = 1;
cin >> n;
unordered_map<long long, long long> m, m2;
vector<long long> xxx(n), l(n, 0), r(n, 0);
for (long long j = 0; j < n; j++) {
cin >> xxx[j];
}
for (long long j = 0; j < n; j++) {
mxm = max(mxm, xxx[j]);
if (m.find(xxx[j]) == m.end()) {
m[xxx[j]] = 1;
if (mxm - mnm + 1 == m.size()) {
l[j] = m.size();
}
} else {
break;
}
}
mnm = 1, mxm = INT_MIN;
for (long long j = n - 1; j >= 0; j--) {
mxm = max(mxm, xxx[j]);
if (m2.find(xxx[j]) == m2.end()) {
m2[xxx[j]] = 1;
if (mxm - mnm + 1 == m2.size()) {
r[j] = m2.size();
}
} else {
break;
}
}
long long count = 0;
for (long long j = 0; j < n - 1; j++) {
if ((l[j] != 0) && (r[j + 1] != 0)) {
count++;
}
}
cout << count << "\n";
for (long long j = 0; j < n - 1; j++) {
if ((l[j] != 0) && (r[j + 1] != 0)) {
cout << l[j] << " " << r[j + 1] << "\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> mapp;
const int MAXN = 200010;
struct node {
int from, to;
};
vector<node> ans;
int a[MAXN];
int tag[MAXN];
int main() {
int T;
scanf("%d", &T);
while (T--) {
int n;
scanf("%d", &n);
mapp.clear();
ans.clear();
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) tag[i] = 0;
int maxn = 0;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (mapp[a[i]] == NULL)
mapp[a[i]] = 1;
else
break;
maxn = max(a[i], maxn);
cnt++;
if (cnt == maxn) tag[i + 1] = maxn;
}
maxn = 0;
cnt = 0;
mapp.clear();
for (int i = n; i >= 1; i--) {
if (mapp[a[i]] == NULL)
mapp[a[i]] = 1;
else
break;
maxn = max(a[i], maxn);
cnt++;
if (cnt == maxn && tag[i]) ans.push_back({tag[i], maxn});
}
printf("%d\n", ans.size());
for (auto it : ans) {
printf("%d %d\n", it.from, it.to);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[200000];
int perm1 = 0;
int perm2 = 0;
int N;
vector<int> ans;
int freq[200000];
bool done[200000];
void check(int perm) {
if (perm == 0 || N - perm == 0) return;
fill_n(done, N, 0);
long long sum = 0;
for (int i = 0; i < perm; i++) {
sum += arr[i];
if (done[arr[i] - 1]) return;
done[arr[i] - 1] = true;
}
if (sum == (long long)perm * (perm + 1) / 2) ans.push_back(perm);
}
bool good(int perm) {
int m = min(perm, N - perm);
for (int i = 0; i < m; i++) {
if (freq[i] != 2) return false;
}
int M = max(perm, N - perm);
for (int i = m; i < M; i++) {
if (freq[i] != 1) return false;
}
return true;
}
int process() {
ans.clear();
cin >> N;
fill_n(freq, N, 0);
perm1 = 0;
for (int i = 0; i < N; i++) {
cin >> arr[i];
freq[arr[i] - 1]++;
perm1 = max(perm1, arr[i]);
}
if (!good(perm1)) {
cout << 0 << endl;
return 0;
}
perm2 = N - perm1;
check(perm1);
if (perm1 != perm2) check(perm2);
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " " << (N - ans[i]) << endl;
}
return 0;
}
int main() {
int T;
cin >> T;
for (int i = 0; i < T; i++) {
process();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> s;
int t, n, a[200020], cnt, d[200020], e[200020];
int main() {
for (scanf("%d", &t); t--; s.clear(), cnt = 0) {
scanf("%d", &n);
for (int i = 0; i < n; i++) d[i] = e[i] = 0;
for (int i = 0; i < n; i++) scanf("%d", a + i);
for (int i = 0; i < n; i++) {
if (s.count(a[i])) break;
s.insert(a[i]);
while (s.count(cnt + 1)) cnt++;
if (s.size() == cnt) d[i] = 1;
}
s.clear(), cnt = 0;
for (int i = n - 1; i >= 0; i--) {
if (s.count(a[i])) break;
s.insert(a[i]);
while (s.count(cnt + 1)) cnt++;
if (s.size() == cnt) e[i] = 1;
}
vector<int> v;
for (int i = 0; i < n - 1; i++) {
if (d[i] && e[i + 1]) v.push_back(i + 1);
}
printf("%d\n", v.size());
for (int x : v) printf("%d %d\n", x, n - x);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e18 + 7;
const int N = 1e7;
bool isper(int *a, int n, int i) {
bool f1 = 1, f2 = 1, flag1[i + 1], flag2[n - i + 1];
memset(flag1, 0, sizeof flag1);
memset(flag2, 0, sizeof flag2);
for (int k = 0; k < i; k++)
if (a[k] <= i) flag1[a[k]] = 1;
for (int k = 1; k <= i; k++)
if (!flag1[k]) f1 = 0;
for (int k = i; k < n; k++)
if (a[k] <= n - i) flag2[a[k]] = 1;
for (int k = 1; k <= n - i; k++)
if (!flag2[k]) f2 = 0;
if (f1 && f2) return true;
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int m = 0;
int a[n];
for (int i = 0; i < n; ++i) cin >> a[i], m = max(m, a[i]);
set<pair<int, int> > res;
if (isper(a, n, m)) res.insert({m, n - m});
if (isper(a, n, n - m)) res.insert({n - m, m});
cout << res.size() << '\n';
for (auto i : res) cout << i.first << ' ' << i.second << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, t, a[200005], l, r, sum, cnt, ans[200005], aux[200005], ma;
const int SIZE = 200000;
bool used[SIZE];
bool good(long long p[], int n) {
for (int i = 1; i <= n; i++) used[i] = false;
for (int i = 0; i < n; i++) used[p[i]] = true;
for (int i = 1; i <= n; i++) {
if (used[i] == false) return false;
}
return true;
}
int main() {
cin >> t;
for (int j = 0; j < t; j++) {
ma = 0;
cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
ma = max(a[i], ma);
}
if (good(a, ma) && good(a + ma, n - ma)) {
ans[cnt] = ma;
cnt++;
}
if (ma * 2 != n && good(a, n - ma) && good(a + n - ma, ma)) {
ans[cnt] = n - ma;
cnt++;
}
cout << cnt << endl;
for (int i = 0; i < cnt; i++) {
cout << ans[i] << " " << n - ans[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long max_n = 2e5 + 5;
long long t, n, k;
long long a[max_n];
bool v[max_n + 1] = {false};
long long l[max_n] = {0}, r[max_n] = {0};
int main() {
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
k = 1;
for (int i = 0; i < n; ++i) {
v[a[i]] = true;
while (v[k]) ++k;
l[i] = k - 1;
}
for (int i = 1; i <= n; ++i) v[i] = false;
k = 1;
for (int i = n - 1; i >= 0; --i) {
v[a[i]] = true;
while (v[k]) ++k;
r[i] = k - 1;
}
vector<long long> l1;
l1.clear();
for (int i = 0; i < n - 1; ++i) {
if (l[i] == (i + 1) and r[i + 1] == (n - i - 1)) l1.push_back(i + 1);
}
cout << l1.size() << endl;
for (int i = 0; i < l1.size(); ++i)
cout << l1[i] << " " << (n - l1[i]) << endl;
for (int i = 0; i < n; ++i) {
l[i] = 0;
r[i] = 0;
v[i + 1] = false;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar();
} while ('0' <= ch && ch <= '9');
t *= f;
}
const int N = 2e5 + 10;
int t, n, a[N];
int ok[N], cnt[N];
vector<int> res;
int main() {
read(t);
while (t--) {
read(n);
int mn = n + 1, mx = 0, flag = 1;
for (int i = 1; i <= n; i++) cnt[i] = 0;
for (int i = 1; i <= n; i++) {
read(a[i]);
mn = min(mn, a[i]);
mx = max(mx, a[i]);
cnt[a[i]]++;
if (cnt[a[i]] > 1) flag = 0;
if (mn = 1 && mx == i && flag)
ok[i] = 1;
else
ok[i] = 0;
}
for (int i = 1; i <= n; i++) cnt[i] = 0;
mn = n + 1, mx = 0, flag = 1;
res.clear();
for (int i = n; i >= 2; i--) {
mn = min(mn, a[i]);
mx = max(mx, a[i]);
cnt[a[i]]++;
if (cnt[a[i]] > 1) flag = 0;
if (mn == 1 && mx == n - i + 1 && ok[i - 1] && flag) res.push_back(i - 1);
}
cout << res.size() << '\n';
for (int i = 0; i < res.size(); i++)
cout << res[i] << " " << n - res[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
using namespace std;
template <typename T>
void print(const vector<T> &x) {
int n = x.size();
for (int i = 0; i < (n); ++i) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T>
void print(const vector<vector<T>> &x) {
int n = x.size();
for (int i = 0; i < (n); ++i) {
for (int j = 0; j < (x[i].size()); ++j) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template <typename T>
void print(const vector<T> &x, int n) {
for (int i = 0; i < (n); ++i) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T>
void print(const vector<vector<T>> &x, int n, int m) {
for (int i = 0; i < (n); ++i) {
for (int j = 0; j < (m); ++j) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void input_init() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < (n); ++i) cin >> a[i];
vector<int> l(n, false), r(n, false);
set<int> sl, sr;
for (int i = 0; i < (n); ++i) {
sl.insert(a[i]);
if (sl.size() == i + 1 && *prev(sl.end()) == i + 1) l[i] = true;
}
for (int i = n - 1; i >= 0; --i) {
sr.insert(a[i]);
if (sr.size() == n - i && *prev(sr.end()) == n - i) r[i] = true;
}
vector<pair<long long, long long>> ans;
for (int i = 0; i < (n - 1); ++i) {
if (l[i] == true && r[i + 1] == true) {
int l1 = i + 1;
int l2 = n - i - 1;
ans.emplace_back(l1, l2);
}
}
cout << ans.size() << '\n';
for (auto &&e : ans) {
cout << e.first << ' ' << e.second << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> vec(n), formax(n), backmax(n), sum(n);
vector<long long> pee(n), aage(n);
set<long long> st;
long long totalsum = 0;
for (long long i = 0; i < n; i++) {
cin >> vec[i];
totalsum += vec[i];
}
aage[0] = 1;
st.insert(vec[0]);
sum[0] = vec[0];
formax[0] = vec[0];
backmax[n - 1] = vec[n - 1];
for (long long i = 1; i < n; i++) {
sum[i] = sum[i - 1] + vec[i];
formax[i] = max(formax[i - 1], vec[i]);
st.insert(vec[i]);
aage[i] = st.size();
}
st.clear();
st.insert(vec[n - 1]);
pee[n - 1] = 1;
for (long long i = n - 2; i >= 0; i--) {
backmax[i] = max(backmax[i + 1], vec[i]);
st.insert(vec[i]);
pee[i] = st.size();
}
long long total = 0;
vector<pair<long long, long long> > ans;
for (long long i = 0; i < (n - 1); i++) {
long long foras = ((i + 1) * (i + 2)) / 2;
long long len = n - i - 1;
long long backas = (len * (len + 1)) / 2;
if (foras == sum[i] && backas == (totalsum - sum[i]) &&
formax[i] == (i + 1) && backmax[i + 1] == len && aage[i] == (i + 1) &&
pee[i + 1] == len) {
ans.push_back(make_pair(i + 1, n - i - 1));
}
}
cout << ans.size() << endl;
for (long long i = 0; i < ans.size(); i++)
cout << ans[i].first << " " << ans[i].second << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int in(int &x, int &y, int &z) { return scanf("%d%d%d", &x, &y, &z); }
int in(long long &x, long long &y, long long &z) {
return scanf("%lld%lld%lld", &x, &y, &z);
}
int in(double &x, double &y, double &z) {
return scanf("%lf%lf%lf", &x, &y, &z);
}
int in(int &x, long long &y) { return scanf("%d%lld", &x, &y); }
int in(long long &x, int &y) { return scanf("%lld%d", &x, &y); }
int in(int &x, int &y) { return scanf("%d%d", &x, &y); }
int in(long long &x, long long &y) { return scanf("%lld%lld", &x, &y); }
int in(char a[], char b[]) { return scanf("%s%s", a, b); }
int in(double &x, double &y) { return scanf("%lf%lf", &x, &y); }
int in(char &c) { return scanf("%c", &c); }
int in(char s[]) { return scanf("%s", s); }
int in(int &x) { return scanf("%d", &x); }
int in(long long &x) { return scanf("%lld", &x); }
int in(double &x) { return scanf("%lf", &x); }
int in(pair<int, int> &p) { return scanf("%d%d", &p.first, &p.second); }
int in(pair<long long, long long> &p) {
return scanf("%lld%lld", &p.first, &p.second);
}
int in(pair<double, double> &p) { return scanf("%lf%lf", &p.first, &p.second); }
int in(long double &a) { return scanf("%Lf", &a); }
int in(int &x, int &y, int &z, int &k) {
return scanf("%d%d%d%d", &x, &y, &z, &k);
}
const int N = 3e5 + 10;
const int M = 1e3 + 10;
int a[N], l[N], r[N];
map<int, int> mp;
int main() {
int T;
in(T);
while (T--) {
int n;
in(n);
for (int i = 1; i <= n; i++) in(a[i]);
int mx = 0, c = 0;
for (int i = 1; i <= n; i++) {
mx = max(mx, a[i]);
if (mp[a[i]] == 0) mp[a[i]] = 1, c++;
if (i == c && c == mx) {
l[i] = mx;
}
}
mp.clear();
mx = 0;
c = 0;
for (int i = n; i >= 1; i--) {
mx = max(mx, a[i]);
if (mp[a[i]] == 0) mp[a[i]] = 1, c++;
if (n - i + 1 == c && c == mx) {
r[i] = mx;
}
}
vector<pair<int, int>> vc;
for (int i = 1; i < n; i++) {
if (l[i] && r[i + 1]) {
vc.push_back({l[i], r[i + 1]});
}
}
printf("%d\n", vc.size());
for (auto e : vc) {
printf("%d %d\n", e.first, e.second);
}
mp.clear();
for (int i = 1; i <= n; i++) l[i] = r[i] = 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool check(int n, vector<int>& v) {
sort(v.begin(), v.begin() + n);
for (int i = 0; i < n; ++i) {
if (v[i] != i + 1) return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
bool ok = true;
int n;
cin >> n;
vector<int> vec(n);
map<int, int> cnt;
for (int i = 0; i < n; ++i) {
cin >> vec[i];
cnt[vec[i]]++;
if (cnt[vec[i]] > 2) ok = false;
}
vector<int> idx;
vector<int> g1, g2;
for (auto& kv : cnt) {
if (kv.second == 1)
g1.push_back(kv.first);
else
g2.push_back(kv.first);
}
if (g1.size()) sort(g1.begin(), g1.end());
if (g2.size()) sort(g2.begin(), g2.end());
for (int i = 0; i < g2.size(); ++i) {
if (g2[i] != i + 1) {
ok = false;
break;
}
}
if (ok) {
idx.push_back(g2.size());
if (g1.size()) {
for (int i = 0; i < g1.size(); ++i) {
if (g1[i] != g2.size() + i + 1) {
ok = false;
break;
}
}
if (ok) idx.push_back(g2.size() + g1.size());
}
}
if (!ok) {
cout << 0 << '\n';
continue;
}
vector<int> an;
for (auto i : idx) {
if (check(i, vec)) {
an.push_back(i);
}
}
cout << an.size() << '\n';
for (auto sz : an) {
cout << sz << ' ' << n - sz << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200006] = {};
int b[200006] = {};
bool c[200006] = {};
void do_wwork() {
int n;
scanf("%d", &n);
memset(a, 0, (n + 5) * sizeof(int));
memset(b, 0, (n + 5) * sizeof(int));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] >= n) {
printf("0\n");
return;
}
b[a[i]]++;
}
int d = 0;
if (b[1] != 2) {
printf("0\n");
return;
}
for (int i = 1; i <= n; i++) {
if (b[i + 1] > b[i]) {
printf("0\n");
return;
}
if (b[i] == 2 && b[i + 1] < 2) {
d = i;
}
}
list<int> anss_list;
bool flag;
int k = 0;
flag = true;
memset(c, 0, (n + 5) * sizeof(bool));
for (int i = 1; i <= d; i++) {
if (c[a[i]] == true || a[i] > d) {
flag = 0;
break;
;
}
c[a[i]] = true;
}
memset(c, 0, (n + 5) * sizeof(bool));
for (int i = d + 1; i <= n; i++) {
if (c[a[i]] == true || a[i] > n - d) {
flag = 0;
break;
;
}
c[a[i]] = true;
}
if (flag) {
k++;
anss_list.push_back(d);
}
flag = true;
memset(c, 0, (n + 5) * sizeof(bool));
for (int i = 1; i <= n - d; i++) {
if (c[a[i]] == true || a[i] > n - d) {
flag = 0;
break;
;
}
c[a[i]] = true;
}
memset(c, 0, (n + 5) * sizeof(bool));
for (int i = n - d + 1; i <= n; i++) {
if (c[a[i]] == true || a[i] > d) {
flag = 0;
break;
;
}
c[a[i]] = true;
}
if (flag && d + d != n) {
k++;
anss_list.push_back(n - d);
}
printf("%d\n", k);
for (int v : anss_list) {
printf("%d %d\n", v, n - v);
}
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
do_wwork();
}
return 0;
}
|
#include <bits/stdc++.h>
int t, n, max;
std::vector<int> a;
bool isPermutation(const std::vector<int>& inp) {
std::vector<int> incp = inp;
std::sort(incp.begin(), incp.end(), std::greater<int>());
int last = 0;
while (!incp.empty() && last + 1 == incp.back()) {
incp.pop_back();
last++;
}
return incp.empty();
}
int main() {
std::cin >> t;
for (int i = 0; i < t; i++) {
a.clear();
max = 0;
std::cin >> n;
for (int j = 0; j < n; j++) {
int t;
std::cin >> t;
a.push_back(t);
if (t > max) {
max = t;
}
}
int count = 0;
std::vector<std::pair<int, int> > divs;
std::vector<int> lh, rh;
for (int j = 0; j < max; j++) {
lh.push_back(a[j]);
}
for (int j = max; j < a.size(); j++) {
rh.push_back(a[j]);
}
if (isPermutation(lh) && isPermutation(rh)) {
count += 1;
divs.emplace_back(max, n - max);
}
lh.clear();
rh.clear();
for (int j = 0; j < n - max; j++) {
lh.push_back(a[j]);
}
for (int j = n - max; j < a.size(); j++) {
rh.push_back(a[j]);
}
if (isPermutation(lh) && isPermutation(rh)) {
if (n - max != max) {
count += 1;
divs.emplace_back(n - max, max);
}
}
std::cerr << "===\\/" << std::endl;
std::cout << count << std::endl;
for (auto& div : divs) {
std::cout << div.first << " " << div.second << std::endl;
}
std::cerr << "===/\\" << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> lmex(n + 1, -1);
int m = 1;
unordered_map<int, bool> l;
for (int i = 1; i <= n; i++) {
if (l.find(a[i]) != l.end()) break;
l[a[i]] = true;
while (l.find(m) != l.end()) {
m++;
}
lmex[i] = m;
}
l.clear();
vector<int> rmex(n + 1, -1);
m = 1;
for (int i = n; i >= 1; i--) {
if (l.find(a[i]) != l.end()) break;
l[a[i]] = true;
while (l.find(m) != l.end()) m++;
rmex[i] = m;
}
vector<int> ans;
for (int i = 1; i <= n - 1; i++) {
int Lmex = lmex[i], Rmex = rmex[i + 1];
if (Lmex == -1) break;
if (Lmex - 1 == i && Rmex - 1 == n - i) ans.push_back(i);
}
cout << ans.size() << "\n";
for (auto i : ans) cout << i << " " << n - i << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
int t, n;
bool vis[200005];
long long a[200005];
long long sum[200005];
vector<int> ans;
int main() {
ios::sync_with_stdio(false);
cin >> t;
while (t--) {
sum[0] = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
}
ans.clear();
bool flag1 = 0, flag2 = 0;
for (long long i = 1; i < n; i++) {
long long temp = (1 + i) * i / 2;
long long temp2 = (1 + n - i) * (n - i) / 2;
if (sum[i] == temp && sum[n] - sum[i] == temp2) {
memset(vis, 0, sizeof(vis));
flag1 = flag2 = 0;
for (int j = 1; j <= i; j++) {
if (vis[a[j]] == 0)
vis[a[j]] = 1;
else {
flag1 = 1;
break;
}
}
if (flag1 == 0) {
for (int j = 1; j <= i; j++) {
if (vis[j] == 0) {
flag1 = 1;
break;
}
}
}
if (flag1 == 0) {
memset(vis, 0, sizeof(vis));
for (int j = i + 1; j <= n; j++) {
if (vis[a[j]] == 0)
vis[a[j]] = 1;
else {
flag2 = 1;
break;
}
}
if (flag2 == 0) {
for (int j = 1; j <= n - i; j++) {
if (vis[j] == 0) {
flag2 = 1;
break;
}
}
if (flag2 == 0) ans.push_back(i);
}
}
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " " << n - ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
set<long long> s, ex_s;
long long k = 0;
for (int i = 0; i < n; i++) {
if (s.find(v[i]) == s.end()) {
s.insert(v[i]);
k++;
} else
break;
}
for (int i = k; i < n; i++) {
ex_s.insert(v[i]);
}
set<long long> s1, ex_s1;
long long m = 0;
for (int i = n - 1; i >= 0; i--) {
if (s1.find(v[i]) == s1.end()) {
s1.insert(v[i]);
m++;
} else
break;
}
for (int i = 0; i < n - m; i++) {
ex_s1.insert(v[i]);
}
vector<long long> res;
if (s.size() == k && *(--s.end()) == k && ex_s.size() == n - k &&
*(--ex_s.end()) == n - k) {
res.push_back(k);
}
if (s1.size() == m && *(--s1.end()) == m && ex_s1.size() == n - m &&
*(--ex_s1.end()) == n - m && n - m != k) {
res.push_back(n - m);
}
cout << res.size() << "\n";
for (int i = 0; i < res.size(); i++) {
cout << res[i] << " " << n - res[i] << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x, i, t, a[200005], max2[200005], fr1[200005], fr2[200005], sol[200005];
void solve() {
int max1 = 0, pairs2 = 0;
int k = 0;
for (i = 1; i <= n; i++) max2[i] = fr1[i] = fr2[i] = 0;
int ok = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
fr2[a[i]]++;
if (fr2[i] == 3 && ok == 0) {
cout << "0\n";
ok = 1;
}
if (fr2[a[i]] == 2) pairs2++;
}
if (ok) return;
max2[n] = a[n];
for (i = n - 1; i >= 2; i--) max2[i] = max(max2[i + 1], a[i]);
for (i = 1; i < n; i++) {
max1 = max(max1, a[i]);
if (fr2[a[i]] == 2) pairs2--;
fr2[a[i]]--;
fr1[a[i]]++;
if (fr1[a[i]] == 2) break;
if (pairs2 == 0 && max1 == i && max2[i + 1] == n - i) sol[++k] = i;
}
cout << k << "\n";
while (k--) {
cout << sol[k + 1] << ' ' << n - sol[k + 1] << '\n';
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> t;
while (t--) {
cin >> n;
solve();
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.