problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02925 | C++ | Runtime Error | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
// #include "Ants.h"
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
typedef pair<int, int> P;
/****Union-Ford-Tree***/
int par[int(0x7ffffff)]; // Parent
int Rank[int(0x7ffffff)]; // Deep_of_the_Tree
// int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
// int n = 0;
// const ll mod = 1000000007;
// n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
// 木の根探し
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
// xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (Rank[x] < Rank[y]) {
par[x] = y;
} else {
par[y] = x;
if (Rank[x] == Rank[y])
Rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
/************************************************************************************
//*無向グラフのBELL_MAN_FORD;*//*
struct edge { int from, to, cost; };
edge es[10000];
int d[10000];
void shortest_path(int s) {
for (int i = 0; i < V; i++)d[i] = INF;
d[s] = 0;
while (true) {
bool update = false;
for (int i = 0; i < E*2; i++) {
edge e = es[i];
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
update = true;
}
}
if (!update)break;
}
}
int main() {
cin >> V >> E;
for (int i = 0; i < E*2; i = i+2) {
edge e;
cin >> e.from >> e.to >> e.cost;
es[i] = e;
swap(e.to, e.from);
es[i + 1] = e;
}
shortest_path(0);
cout << d[6] << endl;
}
*////////////////////////////////////////*
ll gcd(ll a, ll b) { // 最大公約数を求める
if (b == 0)
return a;
return gcd(b, a % b);
}
/*****************************************************************************/
// int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1};
// vector<int> G[10000];
// struct edge { int to, cost; };
// vector<edge>G[100000];
/**************/
/****
//priority_queue<int> //大きいものから順番に出てくる
//priority_queue<int,vector<int>,greater<int>>//小さいものから出てくる（順位キュー）
.top();
.pop();
.empty();
**/
// void solve();
// int V, E;
// void shortest_path(int);
/*
typedef long double ld;
typedef unsigned long long ull;
const int MX = 3007;
const int MAX_N = 1 << 17;
//セグメント木
int Q, dat[2 * MAX_N - 1];
//要素数で初期化
void rmq_init(int n_) {
Q = 1;
while (Q < n_)Q *= 2;
for (int i = 0; i < 2 * Q - 1; i++)dat[i] = INF;
}
//k番目をaに変更
void update(int k, int a) {
k += Q - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
//最小値探し(a,b,0,0,n)
int query(int a, int b, int k = 0, int l = 0, int r = Q) {
if (r <= a || b <= l)return INF;
if (a <= l && r <= b)return dat[k];
else {
int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
return min(vl, vr);
}
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0)return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1)res = res * x % mod;
//cout << res << endl;
return res;
}
ll power(ll x, ll purpose, ll mod = ll(1e18), ll n = 63) {
ll res = 1;
while (n > 0 && res < purpose) {
//cout << res << endl;
if (n & 1)res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
//vector<P> que;
typedef vector<ll> vec;
typedef vector<vec> mat;
const int M = 4;
//A*B Matrix
mat mul(mat& A, mat& B) {
mat C(A.size(), vec(B[0].size()));
for (int i = 0; i < A.size(); i++)for (int k = 0; k < B.size(); k++)
for (int j = 0; j < B[0].size(); j++)
C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % M;
return C;
}
//A^n 行列専用
mat pow(mat A, ll n) {
mat B(A.size(), vec(A.size()));
for (int i = 0; i < A.size(); i++)B[i][i] = 1;
while (n > 0) {
if (n & 1)B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
int IsPrime(ll num)
{
if (num < 2) return 1;
else if (num == 2) return 2;
else if (num % 2 == 0) return 2; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (ll i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
// 素数ではない
return i;
}
}
// 素数である
return 0;
}*/
/*
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)res.push_back(n / i);
}
}
return res;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll>res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)res[n] = 1;
return res;
}*/
int N, A[10000][10000];
int finder[10000][10000];
vector<int> G[100000];
bool visited[600000];
int d[600000];
int dfs(int s) {
if (visited[s])
return d[s];
visited[s] = true;
d[s] = -1;
int longest = 1;
for (int to : G[s]) {
int res = dfs(to);
if (res == -1)
return -1;
longest = max(longest, res + 1);
}
d[s] = longest;
return longest;
}
int toId(int i, int j) {
if (i > j)
swap(i, j);
return finder[i][j];
}
int main() {
cin >> N;
rep(i, N) rep(j, N - 1) {
cin >> A[i][j];
A[i][j]--;
}
int V = 0;
rep(i, N) {
rep(j, N) {
if (i < j) {
finder[i][j] = V++;
}
}
}
rep(i, N) {
rep(j, N - 2) {
int v = toId(i, A[i][j]);
int u = toId(i, A[i][j + 1]);
G[v].push_back(u);
}
}
int ans = 0;
for (int i = 0; i < V; i++) {
int res = dfs(i);
if (res == -1) {
cout << -1 << endl;
return 0;
}
ans = max(ans, res);
}
cout << ans << endl;
}
| // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
// #include "Ants.h"
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
typedef pair<int, int> P;
/****Union-Ford-Tree***/
int par[int(0x7ffffff)]; // Parent
int Rank[int(0x7ffffff)]; // Deep_of_the_Tree
// int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
// int n = 0;
// const ll mod = 1000000007;
// n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
// 木の根探し
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
// xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (Rank[x] < Rank[y]) {
par[x] = y;
} else {
par[y] = x;
if (Rank[x] == Rank[y])
Rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
/************************************************************************************
//*無向グラフのBELL_MAN_FORD;*//*
struct edge { int from, to, cost; };
edge es[10000];
int d[10000];
void shortest_path(int s) {
for (int i = 0; i < V; i++)d[i] = INF;
d[s] = 0;
while (true) {
bool update = false;
for (int i = 0; i < E*2; i++) {
edge e = es[i];
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
update = true;
}
}
if (!update)break;
}
}
int main() {
cin >> V >> E;
for (int i = 0; i < E*2; i = i+2) {
edge e;
cin >> e.from >> e.to >> e.cost;
es[i] = e;
swap(e.to, e.from);
es[i + 1] = e;
}
shortest_path(0);
cout << d[6] << endl;
}
*////////////////////////////////////////*
ll gcd(ll a, ll b) { // 最大公約数を求める
if (b == 0)
return a;
return gcd(b, a % b);
}
/*****************************************************************************/
// int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1};
// vector<int> G[10000];
// struct edge { int to, cost; };
// vector<edge>G[100000];
/**************/
/****
//priority_queue<int> //大きいものから順番に出てくる
//priority_queue<int,vector<int>,greater<int>>//小さいものから出てくる（順位キュー）
.top();
.pop();
.empty();
**/
// void solve();
// int V, E;
// void shortest_path(int);
/*
typedef long double ld;
typedef unsigned long long ull;
const int MX = 3007;
const int MAX_N = 1 << 17;
//セグメント木
int Q, dat[2 * MAX_N - 1];
//要素数で初期化
void rmq_init(int n_) {
Q = 1;
while (Q < n_)Q *= 2;
for (int i = 0; i < 2 * Q - 1; i++)dat[i] = INF;
}
//k番目をaに変更
void update(int k, int a) {
k += Q - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
//最小値探し(a,b,0,0,n)
int query(int a, int b, int k = 0, int l = 0, int r = Q) {
if (r <= a || b <= l)return INF;
if (a <= l && r <= b)return dat[k];
else {
int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
return min(vl, vr);
}
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0)return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1)res = res * x % mod;
//cout << res << endl;
return res;
}
ll power(ll x, ll purpose, ll mod = ll(1e18), ll n = 63) {
ll res = 1;
while (n > 0 && res < purpose) {
//cout << res << endl;
if (n & 1)res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
//vector<P> que;
typedef vector<ll> vec;
typedef vector<vec> mat;
const int M = 4;
//A*B Matrix
mat mul(mat& A, mat& B) {
mat C(A.size(), vec(B[0].size()));
for (int i = 0; i < A.size(); i++)for (int k = 0; k < B.size(); k++)
for (int j = 0; j < B[0].size(); j++)
C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % M;
return C;
}
//A^n 行列専用
mat pow(mat A, ll n) {
mat B(A.size(), vec(A.size()));
for (int i = 0; i < A.size(); i++)B[i][i] = 1;
while (n > 0) {
if (n & 1)B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
int IsPrime(ll num)
{
if (num < 2) return 1;
else if (num == 2) return 2;
else if (num % 2 == 0) return 2; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (ll i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
// 素数ではない
return i;
}
}
// 素数である
return 0;
}*/
/*
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)res.push_back(n / i);
}
}
return res;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll>res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)res[n] = 1;
return res;
}*/
int N, A[10005][10005];
int finder[10005][10005];
vector<int> G[600000];
bool visited[600000];
int d[600000];
int dfs(int s) {
if (visited[s])
return d[s];
visited[s] = true;
d[s] = -1;
int longest = 1;
for (int to : G[s]) {
int res = dfs(to);
if (res == -1)
return -1;
longest = max(longest, res + 1);
}
d[s] = longest;
return longest;
}
int toId(int i, int j) {
if (i > j)
swap(i, j);
return finder[i][j];
}
int main() {
cin >> N;
rep(i, N) rep(j, N - 1) {
cin >> A[i][j];
A[i][j]--;
}
int V = 0;
rep(i, N) {
rep(j, N) {
if (i < j) {
finder[i][j] = V++;
}
}
}
rep(i, N) {
rep(j, N - 2) {
int v = toId(i, A[i][j]);
int u = toId(i, A[i][j + 1]);
G[v].push_back(u);
}
}
int ans = 0;
for (int i = 0; i < V; i++) {
int res = dfs(i);
if (res == -1) {
cout << -1 << endl;
return 0;
}
ans = max(ans, res);
}
cout << ans << endl;
} | replace | 277 | 281 | 277 | 281 | -11 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
// #define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
queue<int> A[N];
rep(i, N) rep(j, N - 1) {
int B;
cin >> B;
A[i].push(B);
}
int ans = 0;
int used[N];
memset(used, 0, sizeof(used));
while (true) {
bool ok = false;
rep(j, N) {
if (A[j].front() - 1 >= 0 && A[A[j].front() - 1].front() == j + 1 &&
used[j] == 0 && used[A[j].front() - 1] == 0) {
used[j] = 1;
used[A[j].front() - 1] = 1;
A[A[j].front() - 1].pop();
A[j].pop();
ok = true;
}
}
if (!ok)
break;
rep(i, N) used[i] = 0;
ans++;
}
rep(i, N) {
if (A[i].size() != 0) {
cout << -1 << endl;
return 0;
}
}
cout << ans << '\n';
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
// #define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
queue<int> A[N];
rep(i, N) rep(j, N - 1) {
int B;
cin >> B;
A[i].push(B);
}
int ans = 0;
int used[N];
memset(used, 0, sizeof(used));
while (true) {
bool ok = false;
rep(j, N) {
if (A[j].front() - 1 >= 0 && A[A[j].front() - 1].front() == j + 1 &&
used[j] == 0 && used[A[j].front() - 1] == 0) {
used[j] = 1;
used[A[j].front() - 1] = 1;
A[A[j].front() - 1].pop();
A[j].pop();
ok = true;
}
}
if (!ok)
break;
rep(i, N) used[i] = 0;
ans++;
}
rep(i, N) {
if (A[i].size() != 0) {
cout << -1 << '\n';
return 0;
}
}
cout << ans << '\n';
}
| replace | 61 | 62 | 61 | 62 | TLE | |
p02925 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int N = 1e6 + 6;
int n, in[N], nxt[N][2], b[1001];
inline int idx(int a, int b) {
if (a > b)
swap(a, b);
return a * n + b;
}
int main() {
memset(nxt, -1, sizeof(nxt));
memset(in, 0, sizeof(nxt));
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
for (int j = 1; j < n; ++j) {
scanf("%d", b + j);
--b[j];
}
for (int j = 1; j < n - 1; ++j) {
int m = idx(i, b[j + 1]);
++in[m];
if (i < b[j])
nxt[i * n + b[j]][0] = m;
else
nxt[b[j] * n + i][1] = m;
}
for (int j = 0; j <= i; ++j)
in[i * n + j] = -1;
}
int cnt = 0, ans = 0;
queue<int> q;
for (int i = n * n - 1; ~i; --i)
if (in[i] == 0)
q.push(i);
while (q.size()) {
++ans;
int m = q.size();
cnt += m;
while (m--) {
int i = q.front();
q.pop();
if (~nxt[i][0] && 0 == --in[nxt[i][0]])
q.push(nxt[i][0]);
if (~nxt[i][1] && 0 == --in[nxt[i][1]])
q.push(nxt[i][1]);
}
}
if (cnt < n * (n - 1) / 2)
printf("-1\n");
else
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int N = 1e6 + 6;
int n, in[N], nxt[N][2], b[1001];
inline int idx(int a, int b) {
if (a > b)
swap(a, b);
return a * n + b;
}
int main() {
memset(nxt, -1, sizeof(nxt));
memset(in, 0, sizeof(in));
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
for (int j = 1; j < n; ++j) {
scanf("%d", b + j);
--b[j];
}
for (int j = 1; j < n - 1; ++j) {
int m = idx(i, b[j + 1]);
++in[m];
if (i < b[j])
nxt[i * n + b[j]][0] = m;
else
nxt[b[j] * n + i][1] = m;
}
for (int j = 0; j <= i; ++j)
in[i * n + j] = -1;
}
int cnt = 0, ans = 0;
queue<int> q;
for (int i = n * n - 1; ~i; --i)
if (in[i] == 0)
q.push(i);
while (q.size()) {
++ans;
int m = q.size();
cnt += m;
while (m--) {
int i = q.front();
q.pop();
if (~nxt[i][0] && 0 == --in[nxt[i][0]])
q.push(nxt[i][0]);
if (~nxt[i][1] && 0 == --in[nxt[i][1]])
q.push(nxt[i][1]);
}
}
if (cnt < n * (n - 1) / 2)
printf("-1\n");
else
printf("%d\n", ans);
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<vector<int>> edge(10000000, vector<int>());
vector<int> indeg(10000000, 0);
int n, a;
cin >> n;
for (int i = 1; i <= n; i++) {
int s, t;
for (int j = 0; j < n - 1; j++) {
cin >> a;
t = min(i, a) * 10000 + max(i, a);
if (j != 0) {
edge[s].push_back(t);
indeg[t]++;
}
s = t;
}
}
queue<int> qu;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (indeg[i * 10000 + j] == 0)
qu.push(i * 10000 + j);
}
}
int day = 1, match = 0;
vector<int> used(10000000, 0), zero(10000000, 0);
while (!qu.empty()) {
int tmp = qu.front();
qu.pop();
int x = tmp / 10000, y = tmp % 10000;
// cout << tmp << endl;
for (auto v : edge[tmp]) {
// cout << v << " " << indeg[v] << endl;
if (--indeg[v] == 0)
qu.push(v);
}
if (used[x] || used[y]) {
day++;
used = zero;
}
used[x] = used[y] = 1;
match++;
}
cout << ((match == n * (n - 1) / 2) ? day : -1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<vector<int>> edge(10000000, vector<int>());
vector<int> indeg(10000000, 0);
int n, a;
cin >> n;
for (int i = 1; i <= n; i++) {
int s, t;
for (int j = 0; j < n - 1; j++) {
cin >> a;
t = min(i, a) * 10000 + max(i, a);
if (j != 0) {
edge[s].push_back(t);
indeg[t]++;
}
s = t;
}
}
queue<int> qu;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (indeg[i * 10000 + j] == 0)
qu.push(i * 10000 + j);
}
}
int day = 1, match = 0;
vector<int> used(1001, 0), zero(1001, 0);
while (!qu.empty()) {
int tmp = qu.front();
qu.pop();
int x = tmp / 10000, y = tmp % 10000;
// cout << tmp << endl;
for (auto v : edge[tmp]) {
// cout << v << " " << indeg[v] << endl;
if (--indeg[v] == 0)
qu.push(v);
}
if (used[x] || used[y]) {
day++;
used = zero;
}
used[x] = used[y] = 1;
match++;
}
cout << ((match == n * (n - 1) / 2) ? day : -1) << endl;
return 0;
}
| replace | 38 | 39 | 38 | 39 | TLE | |
p02925 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
#define endl '\n';
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
vvi G(1000); // グラフ(リスト)
// トポロジカルソート
void rec(int v, vector<bool> &seen, vector<int> &order) {
seen[v] = true;
// cout<<v<<endl;
for (int i = 0; i < G[v].size(); i++) {
int next = G[v][i];
if (seen[next])
continue; // 既に訪問済みなら探索しない
rec(next, seen, order);
}
order.push_back(v);
}
vector<int> topo(int N) { // Nはノード数
// 探索
vector<bool> seen(N, 0); // 初期状態では全ノードが未訪問
vector<int> order; // トポロジカルソート順
for (int v = 0; v < N; ++v) {
if (seen[v])
continue; // 既に訪問済みなら探索しない
rec(v, seen, order);
}
reverse(order.begin(), order.end());
return order;
}
int main() {
int n;
cin >> n;
vvi a(n, vi(n, -1));
vvi v(n, vi(n - 1));
rep(i, n) rep(j, n - 1) {
cin >> v[i][j];
v[i][j]--;
}
int num = 0;
rep(i, n) {
rep(k, n - 1) {
int j = v[i][k];
if (a[i][j] == -1 && a[j][i] == -1) {
a[i][j] = num;
a[j][i] = num;
num++;
} else {
a[i][j] = max(a[i][j], a[j][i]);
a[j][i] = max(a[i][j], a[j][i]);
}
}
}
rep(i, n) {
rep(j, n - 1) { v[i][j] = a[i][v[i][j]]; }
}
rep(i, n) {
rep(j, n - 2) { G[v[i][j]].pb(v[i][j + 1]); }
}
vi tp = topo(num);
vi dp(num, 1);
vi use(num, false);
rep(i, num) {
use[tp[i]] = 1;
rep(j, G[tp[i]].size()) {
// cout<<i<<"->"<<G[tp[i]][j]<<endl;
if (use[G[tp[i]][j]]) {
fin(-1);
return 0;
}
chmax(dp[G[tp[i]][j]], dp[tp[i]] + 1);
}
}
int ans = 0;
rep(i, num) chmax(ans, dp[i]);
fin(ans);
// rep(i,n){
// rep(j,n-1)cout<<v[i][j]<<" ";
// cout<<endl;
// }
// cout<<endl;
// rep(i,n){
// rep(j,n)cout<<a[i][j]<<" ";
// cout<<endl;
// }
// rep(i,tp.size())cout<<tp[i]<<" ";
// cout<<endl;
// rep(i,num)cout<<i<<" : "<<dp[i]<<endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
#define endl '\n';
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
vvi G(1010101); // グラフ(リスト)
// トポロジカルソート
void rec(int v, vector<bool> &seen, vector<int> &order) {
seen[v] = true;
// cout<<v<<endl;
for (int i = 0; i < G[v].size(); i++) {
int next = G[v][i];
if (seen[next])
continue; // 既に訪問済みなら探索しない
rec(next, seen, order);
}
order.push_back(v);
}
vector<int> topo(int N) { // Nはノード数
// 探索
vector<bool> seen(N, 0); // 初期状態では全ノードが未訪問
vector<int> order; // トポロジカルソート順
for (int v = 0; v < N; ++v) {
if (seen[v])
continue; // 既に訪問済みなら探索しない
rec(v, seen, order);
}
reverse(order.begin(), order.end());
return order;
}
int main() {
int n;
cin >> n;
vvi a(n, vi(n, -1));
vvi v(n, vi(n - 1));
rep(i, n) rep(j, n - 1) {
cin >> v[i][j];
v[i][j]--;
}
int num = 0;
rep(i, n) {
rep(k, n - 1) {
int j = v[i][k];
if (a[i][j] == -1 && a[j][i] == -1) {
a[i][j] = num;
a[j][i] = num;
num++;
} else {
a[i][j] = max(a[i][j], a[j][i]);
a[j][i] = max(a[i][j], a[j][i]);
}
}
}
rep(i, n) {
rep(j, n - 1) { v[i][j] = a[i][v[i][j]]; }
}
rep(i, n) {
rep(j, n - 2) { G[v[i][j]].pb(v[i][j + 1]); }
}
vi tp = topo(num);
vi dp(num, 1);
vi use(num, false);
rep(i, num) {
use[tp[i]] = 1;
rep(j, G[tp[i]].size()) {
// cout<<i<<"->"<<G[tp[i]][j]<<endl;
if (use[G[tp[i]][j]]) {
fin(-1);
return 0;
}
chmax(dp[G[tp[i]][j]], dp[tp[i]] + 1);
}
}
int ans = 0;
rep(i, num) chmax(ans, dp[i]);
fin(ans);
// rep(i,n){
// rep(j,n-1)cout<<v[i][j]<<" ";
// cout<<endl;
// }
// cout<<endl;
// rep(i,n){
// rep(j,n)cout<<a[i][j]<<" ";
// cout<<endl;
// }
// rep(i,tp.size())cout<<tp[i]<<" ";
// cout<<endl;
// rep(i,num)cout<<i<<" : "<<dp[i]<<endl;
} | replace | 75 | 76 | 75 | 76 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define pi pair<int, int>
#define pl pair<long long, long long>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define en cout << endl // セミコロンつけろ
// #define MM 1000000000
// #define MOD MM+7
typedef long long ll;
const int MM = 1e9;
const int MOD = MM + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
// 'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
template <typename T> T GCD(T u, T v) { return v ? GCD(v, u % v) : u; }
template <typename T> T LCM(T x, T y) {
T gc = GCD(x, y);
return x * y / gc;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int a[1000][1000];
bool graph[1000][1000];
clock_t st = clock();
memset(graph, false, sizeof(graph));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> a[i][j];
a[i][j]--;
}
}
int in[1000];
fill(in, in + 1000, 0);
int day = 0;
int time = 0;
while (true) {
bool game = false; // 試合を行ったか
day++;
bool used[1000];
fill(used, used + 1000, false);
for (int i = 0; i < N; i++) {
int dest = a[i][in[i]];
if (in[i] >= N - 1)
continue;
if (graph[i][dest] == true || graph[dest][i] == true) {
// cout << "i : " << i << ", day = " << day << ", ";
// cout << "dest = " << dest << endl;
cout << -1 << endl;
return 0;
}
if (used[i] || used[dest])
continue;
// graph[i][a[i][in[i]]] = true;
// graph[a[i][in[i]]][i] = true;
// 目的地の目的地
int dest_of_dest = a[dest][in[dest]];
if (in[dest] >= N - 1)
continue;
if (dest_of_dest == i && used[i] == false && used[dest] == false) {
// cout << "day = " << day << ", i = " << i << ", dest = " << dest <<
// endl; cout << "";
used[i] = true;
used[dest] = true;
graph[i][dest] = true;
graph[dest][i] = true;
in[dest]++;
in[i]++;
game = true;
}
if ((clock() - st) / CLOCKS_PER_SEC >= 1.99) {
cout << N * (N - 1) / 2 << endl;
return 0;
}
}
bool flg = true;
for (int i = 0; i < N; i++) {
if (in[i] < N - 1)
flg = false;
}
if (flg)
break;
if (day >= 499500) {
cout << -1 << endl;
return 0;
}
if (!game) {
cout << -1 << endl;
return 0;
}
}
cout << day << endl;
}
| #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define pi pair<int, int>
#define pl pair<long long, long long>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define en cout << endl // セミコロンつけろ
// #define MM 1000000000
// #define MOD MM+7
typedef long long ll;
const int MM = 1e9;
const int MOD = MM + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
// 'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
template <typename T> T GCD(T u, T v) { return v ? GCD(v, u % v) : u; }
template <typename T> T LCM(T x, T y) {
T gc = GCD(x, y);
return x * y / gc;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int a[1000][1000];
bool graph[1000][1000];
clock_t st = clock();
memset(graph, false, sizeof(graph));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> a[i][j];
a[i][j]--;
}
}
int in[1000];
fill(in, in + 1000, 0);
int day = 0;
int time = 0;
while (true) {
bool game = false; // 試合を行ったか
day++;
bool used[1000];
fill(used, used + 1000, false);
for (int i = 0; i < N; i++) {
int dest = a[i][in[i]];
if (in[i] >= N - 1)
continue;
if (graph[i][dest] == true || graph[dest][i] == true) {
// cout << "i : " << i << ", day = " << day << ", ";
// cout << "dest = " << dest << endl;
cout << -1 << endl;
return 0;
}
if (used[i] || used[dest])
continue;
// graph[i][a[i][in[i]]] = true;
// graph[a[i][in[i]]][i] = true;
// 目的地の目的地
int dest_of_dest = a[dest][in[dest]];
if (in[dest] >= N - 1)
continue;
if (dest_of_dest == i && used[i] == false && used[dest] == false) {
// cout << "day = " << day << ", i = " << i << ", dest = " << dest <<
// endl; cout << "";
used[i] = true;
used[dest] = true;
graph[i][dest] = true;
graph[dest][i] = true;
in[dest]++;
in[i]++;
game = true;
}
if ((double)(clock() - st) / CLOCKS_PER_SEC >= 1.99) {
cout << N * (N - 1) / 2 << endl;
return 0;
}
}
bool flg = true;
for (int i = 0; i < N; i++) {
if (in[i] < N - 1)
flg = false;
}
if (flg)
break;
if (day >= 499500) {
cout << -1 << endl;
return 0;
}
if (!game) {
cout << -1 << endl;
return 0;
}
}
cout << day << endl;
}
| replace | 97 | 98 | 97 | 98 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
#define tii tuple<int, int, int>
#define Priq priority_queue<int, vi, greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll << 60)
signed main() {
int N;
cin >> N;
vector<vector<vector<pii>>> A(N, vector<vector<pii>>(N));
vii C(N, vi(N));
rep(i, 0, N) {
vi B(N - 1);
rep(j, 0, N - 1) cin >> B[j];
rep(j, 1, N - 1) {
int P = i, Q = B[j] - 1, R = B[j - 1] - 1, S = i;
if (P > Q)
swap(P, Q);
if (S > R)
swap(S, R);
A[S][R].pb(mp(P, Q));
C[P][Q]++;
}
}
stack<pii> Q;
rep(i, 0, N) {
rep(j, i + 1, N) {
if (C[i][j] == 0)
Q.push(mp(i, j));
}
}
vector<pii> D;
while (Q.size() > 0) {
int X = Q.top().first, Y = Q.top().second;
Q.pop();
D.pb(mp(X, Y));
rep(i, 0, A[X][Y].size()) {
int P = A[X][Y][i].first, R = A[X][Y][i].second;
C[P][R]--;
if (C[P][R] == 0)
Q.push(mp(P, R));
}
}
if (D.size() == N * (N - 1) / 2) {
vii dp(N, vi(N, 1));
rep(i, 0, D.size()) {
int X = D[i].first, Y = D[i].second;
rep(j, 0, A[X][Y].size()) {
int P = A[X][Y][i].first, R = A[X][Y][i].second;
dp[P][R] = max(dp[P][R], dp[X][Y] + 1);
}
}
int ans = 0;
rep(i, 0, N) { rep(j, 0, N) ans = max(ans, dp[i][j]); }
cout << ans << endl;
} else
cout << -1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
#define tii tuple<int, int, int>
#define Priq priority_queue<int, vi, greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll << 60)
signed main() {
int N;
cin >> N;
vector<vector<vector<pii>>> A(N, vector<vector<pii>>(N));
vii C(N, vi(N));
rep(i, 0, N) {
vi B(N - 1);
rep(j, 0, N - 1) cin >> B[j];
rep(j, 1, N - 1) {
int P = i, Q = B[j] - 1, R = B[j - 1] - 1, S = i;
if (P > Q)
swap(P, Q);
if (S > R)
swap(S, R);
A[S][R].pb(mp(P, Q));
C[P][Q]++;
}
}
stack<pii> Q;
rep(i, 0, N) {
rep(j, i + 1, N) {
if (C[i][j] == 0)
Q.push(mp(i, j));
}
}
vector<pii> D;
while (Q.size() > 0) {
int X = Q.top().first, Y = Q.top().second;
Q.pop();
D.pb(mp(X, Y));
rep(i, 0, A[X][Y].size()) {
int P = A[X][Y][i].first, R = A[X][Y][i].second;
C[P][R]--;
if (C[P][R] == 0)
Q.push(mp(P, R));
}
}
if (D.size() == N * (N - 1) / 2) {
vii dp(N, vi(N, 1));
rep(i, 0, D.size()) {
int X = D[i].first, Y = D[i].second;
rep(j, 0, A[X][Y].size()) {
int P = A[X][Y][j].first, R = A[X][Y][j].second;
dp[P][R] = max(dp[P][R], dp[X][Y] + 1);
}
}
int ans = 0;
rep(i, 0, N) { rep(j, 0, N) ans = max(ans, dp[i][j]); }
cout << ans << endl;
} else
cout << -1 << endl;
}
| replace | 60 | 61 | 60 | 61 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// chmax, chmin
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;
}
int dp[1000010];
int vis[1000010];
vector<int> es[1000010];
int dfs(int x) {
if (vis[x]) {
cout << -1 << endl;
exit(0);
}
if (x == 1000000)
return 0;
if (dp[x] != -1)
return dp[x];
vis[x] = true;
int ans = -1e9;
for (auto i : es[x]) {
ans = max(ans, dfs(i) + 1);
}
vis[x] = false;
return ans;
}
void solve(long long N, std::vector<std::deque<long long>> A) {
memset(dp, -1, sizeof(dp));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
A[i][j]--;
int I = A[i][j];
int J = i;
if (I > J)
swap(I, J);
A[i][j] = I * 1000 + J;
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 2; j++) {
es[A[i][j]].push_back(A[i][j + 1]);
}
es[A[i].back()].push_back(1000000);
}
int ans = 0;
for (int i = 0; i < N; i++) {
ans = max(ans, dfs(A[i][0]));
}
cout << ans << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<std::deque<long long>> A(N, std::deque<long long>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
scanf("%lld", &A[i][j]);
}
}
solve(N, std::move(A));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// chmax, chmin
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;
}
int dp[1000010];
int vis[1000010];
vector<int> es[1000010];
int dfs(int x) {
if (vis[x]) {
cout << -1 << endl;
exit(0);
}
if (x == 1000000)
return 0;
if (dp[x] != -1)
return dp[x];
vis[x] = true;
int ans = -1e9;
for (auto i : es[x]) {
ans = max(ans, dfs(i) + 1);
}
vis[x] = false;
return dp[x] = ans;
}
void solve(long long N, std::vector<std::deque<long long>> A) {
memset(dp, -1, sizeof(dp));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
A[i][j]--;
int I = A[i][j];
int J = i;
if (I > J)
swap(I, J);
A[i][j] = I * 1000 + J;
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 2; j++) {
es[A[i][j]].push_back(A[i][j + 1]);
}
es[A[i].back()].push_back(1000000);
}
int ans = 0;
for (int i = 0; i < N; i++) {
ans = max(ans, dfs(A[i][0]));
}
cout << ans << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<std::deque<long long>> A(N, std::deque<long long>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
scanf("%lld", &A[i][j]);
}
}
solve(N, std::move(A));
return 0;
}
| replace | 47 | 48 | 47 | 48 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
// #include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// namespace mp = boost::multiprecision;
using namespace std;
using ull = unsigned long long;
using ld = long double;
// using ll = boost::multiprecision::cpp_int;
using ll = long long;
#define FOR(i, N) for (ll i = 0; i < N; ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
// using int = ll;
ll gcd(ll m, ll n) {
if (n == 0)
return abs(m);
return (gcd(n, m % n));
}
void putYN(bool b) {
if (b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
void swap(ll &a, ll &b) {
ll tmp = a;
a = b;
b = tmp;
}
ll combi(ll n, ll k) {
ll r = 1, rr = 1;
for (ll i = 0; i < k; ++i) {
r *= (n - i);
rr *= (i + 1);
// r %= 1000000007;
// rr %= 1000000007;
}
r /= rr;
// r %= 1000000007;
return r;
}
int main() {
ll N;
cin >> N;
vector<vector<ll>> A(N, vector<ll>(N - 1));
vector<vector<ll>> B(N, vector<ll>(N));
FOR(i, N) {
FOR(j, N - 1) {
cin >> A[i][j];
A[i][j]--;
B[i][A[i][j]] = j;
// iが何番目に入っているかを調べる
}
}
vector<vector<ll>> D(N, vector<ll>(N - 1, -1));
// 最短日数
function<ll(ll, ll, ll)> f = [&](ll i, ll n,
ll ii) -> ll { // iがi番目の選手 nが見る番号
if (ii > N * (N + 1))
return -2;
if (n == -1)
return 0;
if (D[i][n] != -1)
return D[i][n];
ll a = A[i][n]; // もう一つの選手
ll an = B[a][i];
ll day1 = f(i, n - 1, ii + 1) + 1;
ll day2 = f(a, an - 1, ii + 1) + 1;
if (day1 == -1 || day2 == -1)
return -2;
if (day1 < day2)
day1 = day2;
D[i][n] = day1;
D[a][an] = day1;
return day1;
};
ll maxd = 0;
FOR(i, N) {
ll day = f(i, N - 2, 0);
if (day > maxd) {
maxd = day;
}
if (day == -2) {
cout << -1 << endl;
return 0;
}
}
cout << maxd << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
// #include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// namespace mp = boost::multiprecision;
using namespace std;
using ull = unsigned long long;
using ld = long double;
// using ll = boost::multiprecision::cpp_int;
using ll = long long;
#define FOR(i, N) for (ll i = 0; i < N; ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
// using int = ll;
ll gcd(ll m, ll n) {
if (n == 0)
return abs(m);
return (gcd(n, m % n));
}
void putYN(bool b) {
if (b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
void swap(ll &a, ll &b) {
ll tmp = a;
a = b;
b = tmp;
}
ll combi(ll n, ll k) {
ll r = 1, rr = 1;
for (ll i = 0; i < k; ++i) {
r *= (n - i);
rr *= (i + 1);
// r %= 1000000007;
// rr %= 1000000007;
}
r /= rr;
// r %= 1000000007;
return r;
}
int main() {
ll N;
cin >> N;
vector<vector<ll>> A(N, vector<ll>(N - 1));
vector<vector<ll>> B(N, vector<ll>(N));
FOR(i, N) {
FOR(j, N - 1) {
cin >> A[i][j];
A[i][j]--;
B[i][A[i][j]] = j;
// iが何番目に入っているかを調べる
}
}
vector<vector<ll>> D(N, vector<ll>(N - 1, -1));
// 最短日数
function<ll(ll, ll, ll)> f = [&](ll i, ll n,
ll ii) -> ll { // iがi番目の選手 nが見る番号
if (ii > N * (N + 1))
return -2;
if (n == -1)
return 0;
if (D[i][n] != -1)
return D[i][n];
ll a = A[i][n]; // もう一つの選手
ll an = B[a][i];
ll day1 = f(i, n - 1, ii + 1) + 1;
ll day2 = f(a, an - 1, ii + 1) + 1;
if (day1 == -1 || day2 == -1) {
day1 = -2;
day2 = -2;
}
if (day1 < day2)
day1 = day2;
D[i][n] = day1;
D[a][an] = day1;
return day1;
};
ll maxd = 0;
FOR(i, N) {
ll day = f(i, N - 2, 0);
if (day > maxd) {
maxd = day;
}
if (day == -2) {
cout << -1 << endl;
return 0;
}
}
cout << maxd << endl;
return 0;
}
| replace | 85 | 87 | 85 | 89 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define INPUT_INT(valName) \
int valName; \
cin >> valName
#define INPUT_LLINT(valName) \
long long int valName; \
cin >> valName;
#define INPUT_STR(valName) \
string valName; \
cin >> valName;
#define INPUT_LINE(valName) \
string valName; \
getline(cin, s);
#define INPUT_VECTOR_INT(valName, N) \
vector<int> valName(N); \
for (int i = 0; i < N; ++i) { \
cin >> valName[i]; \
}
#define INPUT_VECTOR_DOUBLE(valName, N) \
vector<double> valName(N); \
for (int i = 0; i < N; ++i) { \
cin >> valName[i]; \
}
#define OUTPUT(A) cout << (A) << endl;
#define OUTPUT2(A, B) cout << (A) << " " << (B) << endl;
#define OUTPUT3(A, B, C) cout << (A) << " " << (B) << " " << (C) << endl;
#define REP(valName, N) for (int valName = 0; valName < N; ++valName)
vector<string> split(const string &str, char delimiter) {
vector<string> ret;
string tmp = "";
for (auto c : str) {
if (c != delimiter) {
tmp.push_back(c);
} else {
ret.push_back(tmp);
tmp = "";
}
}
ret.push_back(tmp);
return ret;
}
template <typename T> void sortAsc(vector<T> &v) {
sort(v.begin(), v.end(), less<T>());
}
template <typename T> void sortDesc(vector<T> &v) {
sort(v.begin(), v.end(), greater<T>());
}
template <typename T> void insert(vector<T> &dest, const vector<T> &src) {
copy(src.begin(), src.end(), back_inserter(dest));
}
template <long long int MOD> long long int mod_inv(long long int a) {
long long b = MOD, u = 1, v = 0;
while (b) {
long long int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
template <long long int MOD>
long long int mod_add(long long int a, long long int b) {
return (a + b) % MOD;
}
template <long long int MOD>
long long int mod_sum(long long int a, long long int b) {
return (a - b) % MOD;
}
template <long long int MOD>
long long int mod_mul(long long int a, long long int b) {
return (a % MOD) * (b % MOD) % MOD;
}
template <long long int MOD>
long long int mod_mul(long long int a, long long int b, long long int c) {
return mod_mul<MOD>(a, mod_mul<MOD>(b, c));
}
template <long long int MOD>
long long int mod_div(long long int a, long long int b) {
return (a % MOD) * mod_inv<MOD>(b) % MOD;
}
//------------------------------------------------------------------------------------------------------------------------------
int f(vector<vector<int>> &A, vector<int> &consumed, int N) {
bool changed = false;
vector<int> consumedNext = consumed;
for (int i = 0; i < N - 1; ++i) {
for (int j = i + 1; j < N; ++j) {
if (A[i][consumed[i]] == A[j][consumed[j]]) {
++consumedNext[i];
++consumedNext[j];
changed = true;
}
}
}
consumed = consumedNext;
}
int main() {
INPUT_INT(N);
vector<vector<int>> A;
A.resize(N);
REP(i, N) {
A[i].resize(N - 1);
REP(j, N - 1) {
cin >> A[i][j];
A[i][j] -= 1;
}
}
vector<int> consumed(N, 0);
int day = 0;
vector<int> changedList(N, false);
while (true) {
bool changed = false;
memset(changedList.data(), 0, sizeof(int) * N);
for (int i = 0; i < N - 1; ++i) {
if (consumed[i] >= N - 1)
continue;
if (changedList[i])
continue;
int j = A[i][consumed[i]];
if (consumed[j] >= N - 1)
continue;
if (changedList[j])
continue;
if (A[j][consumed[j]] == i) {
++consumed[i];
++consumed[j];
changed = true;
changedList[i] = 1;
changedList[j] = 1;
}
}
if (!changed) {
break;
}
++day;
}
bool valid = true;
for (int i = 0; i < N; ++i) {
if (consumed[i] < N - 1) {
valid = false;
break;
}
}
if (valid) {
OUTPUT(day);
} else {
OUTPUT(-1);
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define INPUT_INT(valName) \
int valName; \
cin >> valName
#define INPUT_LLINT(valName) \
long long int valName; \
cin >> valName;
#define INPUT_STR(valName) \
string valName; \
cin >> valName;
#define INPUT_LINE(valName) \
string valName; \
getline(cin, s);
#define INPUT_VECTOR_INT(valName, N) \
vector<int> valName(N); \
for (int i = 0; i < N; ++i) { \
cin >> valName[i]; \
}
#define INPUT_VECTOR_DOUBLE(valName, N) \
vector<double> valName(N); \
for (int i = 0; i < N; ++i) { \
cin >> valName[i]; \
}
#define OUTPUT(A) cout << (A) << endl;
#define OUTPUT2(A, B) cout << (A) << " " << (B) << endl;
#define OUTPUT3(A, B, C) cout << (A) << " " << (B) << " " << (C) << endl;
#define REP(valName, N) for (int valName = 0; valName < N; ++valName)
vector<string> split(const string &str, char delimiter) {
vector<string> ret;
string tmp = "";
for (auto c : str) {
if (c != delimiter) {
tmp.push_back(c);
} else {
ret.push_back(tmp);
tmp = "";
}
}
ret.push_back(tmp);
return ret;
}
template <typename T> void sortAsc(vector<T> &v) {
sort(v.begin(), v.end(), less<T>());
}
template <typename T> void sortDesc(vector<T> &v) {
sort(v.begin(), v.end(), greater<T>());
}
template <typename T> void insert(vector<T> &dest, const vector<T> &src) {
copy(src.begin(), src.end(), back_inserter(dest));
}
template <long long int MOD> long long int mod_inv(long long int a) {
long long b = MOD, u = 1, v = 0;
while (b) {
long long int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
template <long long int MOD>
long long int mod_add(long long int a, long long int b) {
return (a + b) % MOD;
}
template <long long int MOD>
long long int mod_sum(long long int a, long long int b) {
return (a - b) % MOD;
}
template <long long int MOD>
long long int mod_mul(long long int a, long long int b) {
return (a % MOD) * (b % MOD) % MOD;
}
template <long long int MOD>
long long int mod_mul(long long int a, long long int b, long long int c) {
return mod_mul<MOD>(a, mod_mul<MOD>(b, c));
}
template <long long int MOD>
long long int mod_div(long long int a, long long int b) {
return (a % MOD) * mod_inv<MOD>(b) % MOD;
}
//------------------------------------------------------------------------------------------------------------------------------
int f(vector<vector<int>> &A, vector<int> &consumed, int N) {
bool changed = false;
vector<int> consumedNext = consumed;
for (int i = 0; i < N - 1; ++i) {
for (int j = i + 1; j < N; ++j) {
if (A[i][consumed[i]] == A[j][consumed[j]]) {
++consumedNext[i];
++consumedNext[j];
changed = true;
}
}
}
consumed = consumedNext;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
INPUT_INT(N);
vector<vector<int>> A;
A.resize(N);
REP(i, N) {
A[i].resize(N - 1);
REP(j, N - 1) {
cin >> A[i][j];
A[i][j] -= 1;
}
}
vector<int> consumed(N, 0);
int day = 0;
vector<int> changedList(N, false);
while (true) {
bool changed = false;
memset(changedList.data(), 0, sizeof(int) * N);
for (int i = 0; i < N - 1; ++i) {
if (consumed[i] >= N - 1)
continue;
if (changedList[i])
continue;
int j = A[i][consumed[i]];
if (consumed[j] >= N - 1)
continue;
if (changedList[j])
continue;
if (A[j][consumed[j]] == i) {
++consumed[i];
++consumed[j];
changed = true;
changedList[i] = 1;
changedList[j] = 1;
}
}
if (!changed) {
break;
}
++day;
}
bool valid = true;
for (int i = 0; i < N; ++i) {
if (consumed[i] < N - 1) {
valid = false;
break;
}
}
if (valid) {
OUTPUT(day);
} else {
OUTPUT(-1);
}
return 0;
} | insert | 124 | 124 | 124 | 126 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// 型alias
template <class T> using vec = vector<T>;
using vint = vec<int>;
using vvint = vec<vint>;
using str = string;
using mstr = map<str, int>;
using mchar = map<char, int>;
using mint = map<int, int>;
// alias
#define gcd __gcd
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
signed main() {
INCANT;
int n, res = 0, a;
cin >> n;
queue<int> q[1111];
rep(i, n) {
rep(j, n - 1) {
cin >> a;
a--;
q[i].push(a);
}
}
int tmp = n * (n - 1) / 2;
for (; tmp > 0; res++) {
bool flag = true;
bool used[1111] = {};
rep(i, n) {
if (q[i].empty()) {
continue;
}
int p = q[i].front();
if (!used[i] && !used[p] && q[p].front() == i) {
used[i] = used[p] = true;
q[i].pop();
q[p].pop();
tmp--;
flag = false;
}
}
if (flag) {
cout << -1;
return 0;
}
}
cout << res;
}
| #include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// 型alias
template <class T> using vec = vector<T>;
using vint = vec<int>;
using vvint = vec<vint>;
using str = string;
using mstr = map<str, int>;
using mchar = map<char, int>;
using mint = map<int, int>;
// alias
#define gcd __gcd
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
signed main() {
INCANT;
int n, res = 0, a;
cin >> n;
queue<int> q[1111];
rep(i, n) {
rep(j, n - 1) {
cin >> a;
a--;
q[i].push(a);
}
}
int tmp = n * (n - 1) / 2;
for (; tmp > 0; res++) {
bool flag = true;
bool used[1111] = {};
rep(i, n) {
if (q[i].empty()) {
continue;
}
while (1) {
int p = q[i].front();
if (!used[i] && !used[p] && q[p].front() == i) {
used[i] = used[p] = true;
q[i].pop();
q[p].pop();
tmp--;
flag = false;
} else {
break;
}
}
}
if (flag) {
cout << -1;
return 0;
}
}
cout << res;
}
| replace | 45 | 52 | 45 | 56 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define fs first
#define sc second
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
int N;
cin >> N;
int A[1010][1010];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
int a;
cin >> a;
a--;
A[i][j] = a;
}
}
vector<int> cur(N);
int cnt = 0;
while (1) {
bool nopair = true;
bool used[1010];
for (int i = 0; i < 1010; i++)
used[i] = false;
for (int i = 0; i < N; i++) {
if (cur[i] == N - 1)
continue;
int aite = A[i][cur[i]];
if (used[i] || used[aite])
continue;
if (i == A[aite][cur[aite]]) {
cur[i]++;
cur[aite]++;
used[i] = true;
used[aite] = true;
nopair = false;
}
}
if (nopair) {
cout << -1 << endl;
return 0;
}
cnt++;
bool allend = true;
for (int i = 0; i < N; i++) {
if (cur[i] != N - 1)
allend = false;
}
if (allend) {
cout << cnt << endl;
return 0;
}
}
return 0;
}
| #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define fs first
#define sc second
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int A[1010][1010];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
int a;
cin >> a;
a--;
A[i][j] = a;
}
}
vector<int> cur(N);
int cnt = 0;
while (1) {
bool nopair = true;
bool used[1010];
for (int i = 0; i < 1010; i++)
used[i] = false;
for (int i = 0; i < N; i++) {
if (cur[i] == N - 1)
continue;
int aite = A[i][cur[i]];
if (used[i] || used[aite])
continue;
if (i == A[aite][cur[aite]]) {
cur[i]++;
cur[aite]++;
used[i] = true;
used[aite] = true;
nopair = false;
}
}
if (nopair) {
cout << -1 << endl;
return 0;
}
cnt++;
bool allend = true;
for (int i = 0; i < N; i++) {
if (cur[i] != N - 1)
allend = false;
}
if (allend) {
cout << cnt << endl;
return 0;
}
}
return 0;
}
| replace | 24 | 26 | 24 | 26 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define fs first
#define sc second
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
int a;
cin >> a;
a--;
A[i][j] = a;
}
}
vector<int> cur(N);
int cnt = 0;
while (1) {
bool nopair = true;
bool used[1010] = {};
for (int i = 0; i < N; i++) {
if (cur[i] == N - 1)
continue;
int aite = A[i][cur[i]];
if (used[i] || used[aite])
continue;
if (i == A[aite][cur[aite]]) {
cur[i]++;
cur[aite]++;
used[i] = true;
used[aite] = true;
nopair = false;
}
}
if (nopair) {
cout << -1 << endl;
return 0;
}
cnt++;
bool allend = true;
for (int i = 0; i < N; i++) {
if (cur[i] != N - 1)
allend = false;
}
if (allend) {
cout << cnt << endl;
return 0;
}
}
return 0;
}
| #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define fs first
#define sc second
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
int N;
cin >> N;
int A[1010][1010];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
int a;
cin >> a;
a--;
A[i][j] = a;
}
}
vector<int> cur(N);
int cnt = 0;
while (1) {
bool nopair = true;
bool used[1010] = {};
for (int i = 0; i < N; i++) {
if (cur[i] == N - 1)
continue;
int aite = A[i][cur[i]];
if (used[i] || used[aite])
continue;
if (i == A[aite][cur[aite]]) {
cur[i]++;
cur[aite]++;
used[i] = true;
used[aite] = true;
nopair = false;
}
}
if (nopair) {
cout << -1 << endl;
return 0;
}
cnt++;
bool allend = true;
for (int i = 0; i < N; i++) {
if (cur[i] != N - 1)
allend = false;
}
if (allend) {
cout << cnt << endl;
return 0;
}
}
return 0;
}
| replace | 28 | 29 | 28 | 29 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<vector<int>> a(N, vector<int>(N - 1));
rep(i, N) {
rep(j, N - 1) {
cin >> a[i][j];
a[i][j]--;
}
reverse(a[i].begin(), a[i].end());
}
vector<P> q;
auto check = [&](int i) {
if (a[i].size() == 0)
return; // 対戦する試合がない場合
int j = a[i].back(); // 対戦相手を取得
if (a[j].size() == 0)
return; // 対戦相手の対戦がない場合
if (a[j].back() == i) { // i,jが対戦できるとき
P p(i, j);
if (p.second < p.first)
swap(p.first, p.second);
q.push_back(p);
}
};
rep(i, N) { check(i); }
int day = 0;
while (q.size() >= 0) {
day++;
// 重複を削除する
sort(q.begin(), q.end());
q.erase(unique(q.begin(), q.end()), q.end());
vector<P> prevQ;
swap(prevQ, q);
for (P p : prevQ) {
int i = p.first;
int j = p.second;
// 試合を消化
a[i].pop_back();
a[j].pop_back();
}
for (P p : prevQ) {
int i = p.first;
int j = p.second;
// 次の試合ができるかチェック
check(i);
check(j);
}
}
rep(i, N) {
if (a[i].size() != 0) { // 未消化の試合がある場合
puts("-1");
return 0;
}
}
cout << day << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<vector<int>> a(N, vector<int>(N - 1));
rep(i, N) {
rep(j, N - 1) {
cin >> a[i][j];
a[i][j]--;
}
reverse(a[i].begin(), a[i].end());
}
vector<P> q;
auto check = [&](int i) {
if (a[i].size() == 0)
return; // 対戦する試合がない場合
int j = a[i].back(); // 対戦相手を取得
if (a[j].size() == 0)
return; // 対戦相手の対戦がない場合
if (a[j].back() == i) { // i,jが対戦できるとき
P p(i, j);
if (p.second < p.first)
swap(p.first, p.second);
q.push_back(p);
}
};
rep(i, N) { check(i); }
int day = 0;
while (q.size() > 0) {
day++;
// 重複を削除する
sort(q.begin(), q.end());
q.erase(unique(q.begin(), q.end()), q.end());
vector<P> prevQ;
swap(prevQ, q);
for (P p : prevQ) {
int i = p.first;
int j = p.second;
// 試合を消化
a[i].pop_back();
a[j].pop_back();
}
for (P p : prevQ) {
int i = p.first;
int j = p.second;
// 次の試合ができるかチェック
check(i);
check(j);
}
}
rep(i, N) {
if (a[i].size() != 0) { // 未消化の試合がある場合
puts("-1");
return 0;
}
}
cout << day << endl;
}
| replace | 41 | 42 | 41 | 42 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, n;
cin >> N;
vector<queue<int>> stacks(N, queue<int>());
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> n;
stacks.at(i).push(n);
}
}
int count = 1;
int pop_count = 0;
stack<int> push_s;
set<int> need_check;
for (int i = 0; i < N; i++) {
need_check.insert(i);
}
while (true) {
set<int> need_check_more;
for (auto itr = need_check.begin(); itr != need_check.end(); itr++) {
int i = *itr;
if (stacks.at(i).size() == 0) {
continue;
}
n = stacks.at(i).front();
if (stacks.at(n - 1).front() == i + 1) {
if (need_check_more.count(i) == 0) {
push_s.push(i);
need_check_more.insert(i);
}
if (need_check_more.count(n - 1) == 0) {
push_s.push(n - 1);
need_check_more.insert(n - 1);
}
}
}
if (push_s.size() == 0) {
cout << -1;
return 0;
}
while (push_s.size() > 0) {
n = push_s.top();
push_s.pop();
stacks.at(n).pop();
pop_count++;
}
if (pop_count == N * (N - 1)) {
cout << count;
return 0;
}
count++;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, n;
cin >> N;
vector<queue<int>> stacks(N, queue<int>());
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> n;
stacks.at(i).push(n);
}
}
int count = 1;
int pop_count = 0;
stack<int> push_s;
set<int> need_check;
for (int i = 0; i < N; i++) {
need_check.insert(i);
}
while (true) {
set<int> need_check_more;
for (auto itr = need_check.begin(); itr != need_check.end(); itr++) {
int i = *itr;
if (stacks.at(i).size() == 0) {
continue;
}
n = stacks.at(i).front();
if (stacks.at(n - 1).front() == i + 1) {
if (need_check_more.count(i) == 0) {
push_s.push(i);
need_check_more.insert(i);
}
if (need_check_more.count(n - 1) == 0) {
push_s.push(n - 1);
need_check_more.insert(n - 1);
}
}
}
need_check = need_check_more;
if (push_s.size() == 0) {
cout << -1;
return 0;
}
while (push_s.size() > 0) {
n = push_s.top();
push_s.pop();
stacks.at(n).pop();
pop_count++;
}
if (pop_count == N * (N - 1)) {
cout << count;
return 0;
}
count++;
}
return 0;
} | insert | 40 | 40 | 40 | 41 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define F first
#define S second
#define rep(i, a, b) for (i = a; i < b; i++)
#define parr(a, n) \
for (ll it = 0; it < n; it++) \
cout << a[it] << " "; \
cout << endl;
#define pcont(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
#define ret(x) return cout << x, 0;
#define endl '\n'
/*constants*/
#define MAXN 1000005
#define PI 3.14159265358979323846
/*debug*/
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
using namespace std;
vll adj[MAXN];
ll vis[MAXN], dp[MAXN];
map<pair<ll, ll>, ll> mm;
bool isCycle(ll u) {
vis[u] = 1;
bool fl = false;
for (auto it : adj[u]) {
if (vis[it] == 0)
fl |= isCycle(it);
else if (vis[it] == 1)
return true;
}
vis[u] = 2;
return fl;
}
void dfs(ll u) {
vis[u] = 1;
dp[u] = 1;
for (auto it : adj[u]) {
if (!vis[it]) {
dfs(it);
}
dp[u] = max(dp[u], 1 + dp[it]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll i, j, n, m, k, cnt = 0, ans = 0, t = 1;
cin >> n;
rep(i, 1, n + 1) { rep(j, i + 1, n + 1) mm[mp(i, j)] = (++cnt); }
set<pair<ll, ll>> e;
rep(i, 1, n + 1) {
pll v;
rep(j, 0, n - 1) {
cin >> k;
v.pb(mp(min(i, k), max(i, k)));
}
rep(j, 0, v.size()) {
rep(k, j + 1, v.size()) if (!e.count(mp(mm[v[j]], mm[v[k]])))
adj[mm[v[j]]]
.pb(mm[v[k]]),
e.insert(mp(mm[v[j]], mm[v[k]]));
}
}
n = cnt;
rep(i, 1, n + 1) {
if (!vis[i] && isCycle(i))
ret(-1)
}
memset(vis, 0, sizeof(vis));
rep(i, 1, n + 1) {
if (!vis[i])
dfs(i);
}
ret(*max_element(dp + 1, dp + n + 1));
return 0;
} | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define F first
#define S second
#define rep(i, a, b) for (i = a; i < b; i++)
#define parr(a, n) \
for (ll it = 0; it < n; it++) \
cout << a[it] << " "; \
cout << endl;
#define pcont(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
#define ret(x) return cout << x, 0;
#define endl '\n'
/*constants*/
#define MAXN 1000005
#define PI 3.14159265358979323846
/*debug*/
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
using namespace std;
vll adj[MAXN];
ll vis[MAXN], dp[MAXN];
map<pair<ll, ll>, ll> mm;
bool isCycle(ll u) {
vis[u] = 1;
bool fl = false;
for (auto it : adj[u]) {
if (vis[it] == 0)
fl |= isCycle(it);
else if (vis[it] == 1)
return true;
}
vis[u] = 2;
return fl;
}
void dfs(ll u) {
vis[u] = 1;
dp[u] = 1;
for (auto it : adj[u]) {
if (!vis[it]) {
dfs(it);
}
dp[u] = max(dp[u], 1 + dp[it]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll i, j, n, m, k, cnt = 0, ans = 0, t = 1;
cin >> n;
rep(i, 1, n + 1) { rep(j, i + 1, n + 1) mm[mp(i, j)] = (++cnt); }
set<pair<ll, ll>> e;
rep(i, 1, n + 1) {
pll v;
rep(j, 0, n - 1) {
cin >> k;
v.pb(mp(min(i, k), max(i, k)));
}
rep(j, 0, v.size() - 1) { adj[mm[v[j]]].pb(mm[v[j + 1]]); }
}
n = cnt;
rep(i, 1, n + 1) {
if (!vis[i] && isCycle(i))
ret(-1)
}
memset(vis, 0, sizeof(vis));
rep(i, 1, n + 1) {
if (!vis[i])
dfs(i);
}
ret(*max_element(dp + 1, dp + n + 1));
return 0;
} | replace | 91 | 97 | 91 | 92 | TLE | |
p02925 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int n;
int a[1000][999];
int g[1000];
int check[1001];
int day;
int f;
int i, j;
int match;
int index;
scanf("%d", &n);
// プレイヤー番号は下駄をはかせて使う；
for (i = 1; i < n + 1; i++) {
g[i] = 0;
for (j = 0; j < n - 1; j++) {
scanf("%d", &a[i][j]);
}
}
f = 1;
day = 0;
while (f == 1) {
f = 0;
index = 0;
check[0] = -1;
for (i = 1; i < n + 1; i++) {
// g[i]がプレイヤーiの次のゲーム数
match = a[i][g[i]];
// 番号が大きい方が相手（＝初めての参照）
if (match > i) {
if (a[match][g[match]] == i) {
check[index] = i;
check[index + 1] = match;
check[index + 2] = -1; // 番兵更新
index += 2;
f = 1;
}
}
}
index = 0;
while (check[index] != -1) {
g[check[index]]++;
index++;
};
day++;
}
f = 0;
for (i = 1; i < n + 1; i++) {
if (g[i] != n - 1) {
f = 1;
}
}
if (f == 1) {
printf("-1\n");
} else {
printf("%d\n", day - 1);
}
return 0;
} | #include <stdio.h>
int main(void) {
int n;
int a[1001][1000];
int g[1001];
int check[1002];
int day;
int f;
int i, j;
int match;
int index;
scanf("%d", &n);
// プレイヤー番号は下駄をはかせて使う；
for (i = 1; i < n + 1; i++) {
g[i] = 0;
for (j = 0; j < n - 1; j++) {
scanf("%d", &a[i][j]);
}
}
f = 1;
day = 0;
while (f == 1) {
f = 0;
index = 0;
check[0] = -1;
for (i = 1; i < n + 1; i++) {
// g[i]がプレイヤーiの次のゲーム数
match = a[i][g[i]];
// 番号が大きい方が相手（＝初めての参照）
if (match > i) {
if (a[match][g[match]] == i) {
check[index] = i;
check[index + 1] = match;
check[index + 2] = -1; // 番兵更新
index += 2;
f = 1;
}
}
}
index = 0;
while (check[index] != -1) {
g[check[index]]++;
index++;
};
day++;
}
f = 0;
for (i = 1; i < n + 1; i++) {
if (g[i] != n - 1) {
f = 1;
}
}
if (f == 1) {
printf("-1\n");
} else {
printf("%d\n", day - 1);
}
return 0;
} | replace | 5 | 8 | 5 | 8 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, a[1005][1005], now[1005], ans = 0, tmp[1005], ok;
int read() {
int s = 0;
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
s = s * 10 + c - '0', c = getchar();
return s;
}
int main(void) {
n = read();
for (int i = 1; i <= n; i++) {
now[i] = 1;
tmp[i] = -1;
for (int j = 1; j < n; j++)
a[i][j] = read();
}
ok = n * (n - 1) / 2;
while (1) {
bool check = 0;
int p = 0;
for (int i = 1; i <= n; i++) {
int u = a[i][now[i]];
if (tmp[u] == ans || tmp[i] == ans)
continue;
if (a[u][now[u]] != i)
continue;
check = 1;
tmp[i] = ans;
tmp[u] = ans;
now[u]++;
now[i]++;
p += 2;
ok--;
if (n - p < 2)
break;
}
ans++;
if (ok == 0)
break;
if (check == 0 && ok != 0) {
printf("-1\n");
return 0;
}
}
printf("%d", ans);
} | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, a[10005][10005], now[10005], ans = 0, tmp[10005], ok;
int read() {
int s = 0;
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
s = s * 10 + c - '0', c = getchar();
return s;
}
int main(void) {
n = read();
for (int i = 1; i <= n; i++) {
now[i] = 1;
tmp[i] = -1;
for (int j = 1; j < n; j++)
a[i][j] = read();
}
ok = n * (n - 1) / 2;
while (1) {
bool check = 0;
int p = 0;
for (int i = 1; i <= n; i++) {
int u = a[i][now[i]];
if (tmp[u] == ans || tmp[i] == ans)
continue;
if (a[u][now[u]] != i)
continue;
check = 1;
tmp[i] = ans;
tmp[u] = ans;
now[u]++;
now[i]++;
p += 2;
ok--;
if (n - p < 2)
break;
}
ans++;
if (ok == 0)
break;
if (check == 0 && ok != 0) {
printf("-1\n");
return 0;
}
}
printf("%d", ans);
} | replace | 5 | 6 | 5 | 6 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, e) for (int i = s; i < e; i++)
#define print(i) cout << i << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
queue<int> que[n];
rep(i, n) {
rep(j, n - 1) {
int temp;
cin >> temp;
temp--;
que[i].push(temp);
}
}
int ans = 0;
bool flag;
list<int> li;
rep(i, n - 1) { li.push_back(i); }
list<int>::iterator itr;
vector<list<int>::iterator> vitr;
int cntcnt = 0;
bool bigflag = false;
while (true) {
ans++;
flag = false;
vector<int> vi, vto;
vitr.clear();
if (cntcnt++ > 200000) {
bigflag = true;
break;
}
for (itr = li.begin(); itr != li.end(); itr++) {
int i = *itr;
// cout << "i " << i << endl;
if (que[i].empty()) {
vitr.push_back(itr);
continue;
}
int to = que[i].front();
int from = que[to].front();
if (from == i && i < to) {
// cout << i << " " << to << endl;
vi.push_back(i);
vto.push_back(to);
// que[i].pop();
// que[to].pop();
flag = true;
}
}
for (auto x : vitr) {
li.erase(x);
}
rep(i, vi.size()) {
// cout << vi[i] << " " << vto[i] << endl;
que[vi[i]].pop();
que[vto[i]].pop();
}
if (li.empty()) {
flag = true;
break;
}
if (flag == false)
break;
if (bigflag == true)
break;
}
if (bigflag) {
cout << 499498;
} else {
cout << (flag ? ans - 1 : -1);
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, e) for (int i = s; i < e; i++)
#define print(i) cout << i << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
queue<int> que[n];
rep(i, n) {
rep(j, n - 1) {
int temp;
cin >> temp;
temp--;
que[i].push(temp);
}
}
int ans = 0;
bool flag;
list<int> li;
rep(i, n - 1) { li.push_back(i); }
list<int>::iterator itr;
vector<list<int>::iterator> vitr;
int cntcnt = 0;
bool bigflag = false;
while (true) {
ans++;
flag = false;
vector<int> vi, vto;
vitr.clear();
if (cntcnt++ > 200000) {
bigflag = true;
break;
}
for (itr = li.begin(); itr != li.end(); itr++) {
int i = *itr;
// cout << "i " << i << endl;
if (que[i].empty()) {
vitr.push_back(itr);
continue;
}
int to = que[i].front();
int from = que[to].front();
if (from == i && i < to) {
// cout << i << " " << to << endl;
vi.push_back(i);
vto.push_back(to);
// que[i].pop();
// que[to].pop();
flag = true;
}
}
for (auto x : vitr) {
li.erase(x);
}
rep(i, vi.size()) {
// cout << vi[i] << " " << vto[i] << endl;
que[vi[i]].pop();
que[vto[i]].pop();
}
if (li.empty()) {
flag = true;
break;
}
if (flag == false)
break;
if (bigflag == true)
break;
}
if (bigflag) {
cout << n * (n - 1) / 2;
} else {
cout << (flag ? ans - 1 : -1);
}
return 0;
} | replace | 99 | 100 | 99 | 100 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define COUTDOUBLE(d, i) cout << setprecision((i)) << (d) << endl;
#define VIN(v) \
for (int64_t i = 0; i < (v).size(); i++) { \
cin >> (v).at(i); \
}
#define MREP(i, m) \
for (auto i = (m).begin(); i != (m).end(); \
++i) // auto key = i->first;auto value = i->second;
using namespace std;
typedef int64_t I;
typedef pair<I, I> P;
typedef vector<I> V;
I MOD = pow(10, 9) + 7;
I MAX = LONG_MAX;
I MIN = LONG_MIN;
// 最大公約数
I gcd(I a, I b) { return b != 0 ? gcd(b, a % b) : a; }
// 最小公倍数
I lcm(I a, I b) { return a * b / gcd(a, b); }
int ctoi(char c) { return c - '0'; }
I a[1010][1010];
I c[1010]; // どこまで終わったか
int main() {
I n;
cin >> n;
REP(i, n + 1) {
if (i == 0)
continue;
REP(j, n) {
if (j == 0)
continue;
cin >> a[i][j];
}
}
I d = 1;
V l;
REP(i, n + 1) {
if (i == 0)
continue;
l.push_back(i);
}
while (true) {
V v;
bool chk = true;
REP(j, l.size()) {
I i = l.at(j);
if (i == a[a[i][c[i] + 1]][c[a[i][c[i] + 1]] + 1]) {
v.push_back(i);
v.push_back(a[i][c[i] + 1]);
chk = false;
}
}
if (chk) {
break;
}
map<I, I> mp;
REP(i, v.size()) {
if (mp[v.at(i)] != -1) {
c[v.at(i)]++;
mp[v.at(i)] = -1;
}
}
d++;
l = v;
}
REP(i, n + 1) {
if (i == 0)
continue;
if (c[i] != n - 1) {
cout << -1 << endl;
return 0;
}
}
cout << d - 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define COUTDOUBLE(d, i) cout << setprecision((i)) << (d) << endl;
#define VIN(v) \
for (int64_t i = 0; i < (v).size(); i++) { \
cin >> (v).at(i); \
}
#define MREP(i, m) \
for (auto i = (m).begin(); i != (m).end(); \
++i) // auto key = i->first;auto value = i->second;
using namespace std;
typedef int64_t I;
typedef pair<I, I> P;
typedef vector<I> V;
I MOD = pow(10, 9) + 7;
I MAX = LONG_MAX;
I MIN = LONG_MIN;
// 最大公約数
I gcd(I a, I b) { return b != 0 ? gcd(b, a % b) : a; }
// 最小公倍数
I lcm(I a, I b) { return a * b / gcd(a, b); }
int ctoi(char c) { return c - '0'; }
I a[1010][1010];
I c[1010]; // どこまで終わったか
int main() {
I n;
cin >> n;
REP(i, n + 1) {
if (i == 0)
continue;
REP(j, n) {
if (j == 0)
continue;
cin >> a[i][j];
}
}
I d = 1;
V l;
REP(i, n + 1) {
if (i == 0)
continue;
l.push_back(i);
}
while (true) {
V v;
bool chk = true;
REP(j, l.size()) {
I i = l.at(j);
if (i == a[a[i][c[i] + 1]][c[a[i][c[i] + 1]] + 1]) {
v.push_back(i);
v.push_back(a[i][c[i] + 1]);
chk = false;
}
}
if (chk) {
break;
}
SORT(v);
v.erase(unique(ALL(v)), v.end());
REP(i, v.size()) { c[v.at(i)]++; }
d++;
l = v;
}
REP(i, n + 1) {
if (i == 0)
continue;
if (c[i] != n - 1) {
cout << -1 << endl;
return 0;
}
}
cout << d - 1 << endl;
return 0;
}
| replace | 71 | 78 | 71 | 74 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n - 1));
vector<int> head(n);
rep(i, n) {
rep(j, n - 1) {
int x;
cin >> x;
x--;
a[i][j] = x;
}
}
int turn = 0;
vector<int> used(n, -1);
while (true) {
bool ng = true;
int empty_cnt = 0;
rep(i, n) {
if (head[i] == n - 1) {
empty_cnt++;
continue;
}
int j = a[i][head[i]];
if (used[i] == turn || used[j] == turn)
continue;
if (a[j][head[j]] == i) {
head[i]++;
head[j]++;
used[i] = used[j] = turn;
ng = false;
}
}
if (empty_cnt == n)
break;
if (ng) {
cout << -1 << endl;
return 0;
}
turn++;
}
cout << turn << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
int a[1010][1010] = {};
int head[1010] = {};
rep(i, n) {
rep(j, n - 1) {
int x;
cin >> x;
x--;
a[i][j] = x;
}
}
int turn = 0;
vector<int> used(n, -1);
while (true) {
bool ng = true;
int empty_cnt = 0;
rep(i, n) {
if (head[i] == n - 1) {
empty_cnt++;
continue;
}
int j = a[i][head[i]];
if (used[i] == turn || used[j] == turn)
continue;
if (a[j][head[j]] == i) {
head[i]++;
head[j]++;
used[i] = used[j] = turn;
ng = false;
}
}
if (empty_cnt == n)
break;
if (ng) {
cout << -1 << endl;
return 0;
}
turn++;
}
cout << turn << endl;
return 0;
}
| replace | 9 | 11 | 9 | 11 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define sc second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int i = a; i < n; i++)
#define r0 return 0;
#define endl '\n'
#define INF (int)1e15
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
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...);
}
int dp[1001][1000];
int a[1001][1000];
int ainv[1001][1001];
signed main() {
ios_base::sync_with_stdio(0);
int TESTS = 1;
cin.tie(0);
cout.tie(0);
// cin>>TESTS;
while (TESTS--) {
int n;
cin >> n;
rep(i, 1, n + 1) { rep(j, 1, n) cin >> a[i][j]; }
int cur[n + 1];
rep(i, 1, n + 1) cur[i] = 1;
int ans = 0;
while (1) {
int cnt = 0;
ans++;
bitset<1001> mark = 0;
rep(i, 1, n + 1) {
if (cur[i] == n || mark[i])
continue;
if (a[a[i][cur[i]]][cur[a[i][cur[i]]]] == i &&
mark[a[i][cur[i]]] == 0) {
cnt++;
mark[i] = 1;
mark[a[i][cur[i]]] = 1;
// trace(i,a[i][cur[i]],ans);
cur[a[i][cur[i]]]++;
cur[i]++;
}
}
if (cnt == 0) {
bool yes = 1;
rep(i, 1, n + 1) if (cur[i] != n) yes = 0;
if (yes == 0)
cout << -1;
else {
cout << ans - 1;
}
r0;
}
}
}
}
| #include <bits/stdc++.h>
// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define sc second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int i = a; i < n; i++)
#define r0 return 0;
#define endl '\n'
#define INF (int)1e15
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
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...);
}
int dp[1001][1000];
int a[1001][1000];
int ainv[1001][1001];
signed main() {
ios_base::sync_with_stdio(0);
int TESTS = 1;
cin.tie(0);
cout.tie(0);
// cin>>TESTS;
while (TESTS--) {
int n;
cin >> n;
rep(i, 1, n + 1) { rep(j, 1, n) cin >> a[i][j]; }
int cur[n + 1];
rep(i, 1, n + 1) cur[i] = 1;
int ans = 0;
while (1) {
int cnt = 0;
ans++;
bool mark[n + 1] = {};
rep(i, 1, n + 1) {
if (cur[i] == n || mark[i])
continue;
if (a[a[i][cur[i]]][cur[a[i][cur[i]]]] == i &&
mark[a[i][cur[i]]] == 0) {
cnt++;
mark[i] = 1;
mark[a[i][cur[i]]] = 1;
// trace(i,a[i][cur[i]],ans);
cur[a[i][cur[i]]]++;
cur[i]++;
}
}
if (cnt == 0) {
bool yes = 1;
rep(i, 1, n + 1) if (cur[i] != n) yes = 0;
if (yes == 0)
cout << -1;
else {
cout << ans - 1;
}
r0;
}
}
}
}
| replace | 49 | 50 | 49 | 50 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
int id[MAX_N][MAX_N];
int a[MAX_N][MAX_N];
vector<int> edge[MAX_V];
int toId(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
int depth[MAX_V];
int dfs(int v) {
depth[v] = 1;
for (int u : edge[v]) {
depth[v] = max(depth[v], dfs(u) + 1);
}
return depth[v];
}
int main() {
int n;
cin >> n;
int numV = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
id[i][j] = numV++;
}
}
vector<int> deg(numV, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
cin >> a[i][j];
a[i][j] = toId(i, a[i][j] - 1);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 2; j++) {
edge[a[i][j]].push_back(a[i][j + 1]);
deg[a[i][j + 1]]++;
}
}
// DAGかどうか判定
stack<int> st;
for (int i = 0; i < numV; i++) {
if (deg[i] == 0)
st.push(i);
}
int ans = 0;
while (!st.empty()) {
int i = st.top();
st.pop();
ans++;
for (int j : edge[i]) {
if (--deg[j] == 0) {
st.push(j);
}
}
}
if (ans != numV) {
cout << -1 << endl;
return 0;
}
ans = 0;
int tmp;
for (int i = 0; i < numV; i++) {
tmp = dfs(i);
if (tmp == -1) {
cout << -1 << endl;
return 0;
} else if (tmp > ans)
ans = tmp;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
int id[MAX_N][MAX_N];
int a[MAX_N][MAX_N];
vector<int> edge[MAX_V];
int toId(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
int depth[MAX_V];
int dfs(int v) {
if (depth[v] > 0)
return depth[v];
depth[v] = 1;
for (int u : edge[v]) {
depth[v] = max(depth[v], dfs(u) + 1);
}
return depth[v];
}
int main() {
int n;
cin >> n;
int numV = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
id[i][j] = numV++;
}
}
vector<int> deg(numV, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
cin >> a[i][j];
a[i][j] = toId(i, a[i][j] - 1);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 2; j++) {
edge[a[i][j]].push_back(a[i][j + 1]);
deg[a[i][j + 1]]++;
}
}
// DAGかどうか判定
stack<int> st;
for (int i = 0; i < numV; i++) {
if (deg[i] == 0)
st.push(i);
}
int ans = 0;
while (!st.empty()) {
int i = st.top();
st.pop();
ans++;
for (int j : edge[i]) {
if (--deg[j] == 0) {
st.push(j);
}
}
}
if (ans != numV) {
cout << -1 << endl;
return 0;
}
ans = 0;
int tmp;
for (int i = 0; i < numV; i++) {
tmp = dfs(i);
if (tmp == -1) {
cout << -1 << endl;
return 0;
} else if (tmp > ans)
ans = tmp;
}
cout << ans << endl;
return 0;
} | insert | 17 | 17 | 17 | 19 | TLE | |
p02925 | C++ | Time Limit Exceeded | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout << (x ? "Yes" : "No") << "\n"
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool palindrome(string s) {
bool flag = true;
rep(i, (ll)s.size()) if (s[i] != s[s.size() - 1 - i]) flag = false;
return flag;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll ans = 0;
while (n != 0)
ans += n % 10, n /= 10;
return ans;
}
ll Svec(vector<ll> v) {
ll n = 0;
rep(i, (ll)v.size()) n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
rep(i, (ll)s.size() - 1) {
if (s[i] == s[i + 1]) {
x++;
if (i == (ll)s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == (ll)s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s) {
string ans = "";
rep(i, s.size()) {
if ('a' <= s[i] && s[i] <= 'z')
ans += (char)s[i] - 32;
else
ans += s[i];
}
return ans;
}
string Tolower(string s) {
string ans = "";
rep(i, s.size()) {
if ('A' <= s[i] && s[i] <= 'Z')
ans += (char)s[i] + 32;
else
ans += s[i];
}
return ans;
}
void dis(vector<ll> v) { rep(i, v.size()) cout << v[i] << endl; }
void dis2(vector<vector<ll>> v) {
rep(i, v.size()) {
rep(j, v[0].size()) cout << v[i][j] << ' ';
cout << endl;
}
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
/* isPrime[1]=false; */
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
ll encode(ll i, ll j) {
if (i < j)
swap(i, j);
return i * (i - 1) / 2 + j + 1;
}
ll seen[2000000]; // 1:現在探索中のパスで行きがけ 2:探索後の頂点
ll d[2000000]; // d[i]:= 始点から i への距離
ll dfs(vector<vector<ll>> g, ll n) {
if (seen[n] == 2)
return d[n];
seen[n] = 1;
for (auto c : g[n]) {
if (seen[c] == 1) { // 閉路を検出
cout << -1 << endl;
exit(0);
}
chmax(d[n], dfs(g, c) + 1);
}
seen[n] = 2;
return d[n];
}
int main() {
ll n;
cin >> n;
vector<vector<ll>> g(n * (n - 1) / 2 + 1);
rep(i, n) {
ll now = 0;
rep(_, n - 1) {
ll j;
cin >> j;
j--;
ll next = encode(i, j);
g[now].push_back(next);
now = next;
}
}
cout << dfs(g, 0) << endl;
} | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout << (x ? "Yes" : "No") << "\n"
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool palindrome(string s) {
bool flag = true;
rep(i, (ll)s.size()) if (s[i] != s[s.size() - 1 - i]) flag = false;
return flag;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll ans = 0;
while (n != 0)
ans += n % 10, n /= 10;
return ans;
}
ll Svec(vector<ll> v) {
ll n = 0;
rep(i, (ll)v.size()) n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
rep(i, (ll)s.size() - 1) {
if (s[i] == s[i + 1]) {
x++;
if (i == (ll)s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == (ll)s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s) {
string ans = "";
rep(i, s.size()) {
if ('a' <= s[i] && s[i] <= 'z')
ans += (char)s[i] - 32;
else
ans += s[i];
}
return ans;
}
string Tolower(string s) {
string ans = "";
rep(i, s.size()) {
if ('A' <= s[i] && s[i] <= 'Z')
ans += (char)s[i] + 32;
else
ans += s[i];
}
return ans;
}
void dis(vector<ll> v) { rep(i, v.size()) cout << v[i] << endl; }
void dis2(vector<vector<ll>> v) {
rep(i, v.size()) {
rep(j, v[0].size()) cout << v[i][j] << ' ';
cout << endl;
}
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
/* isPrime[1]=false; */
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
ll encode(ll i, ll j) {
if (i < j)
swap(i, j);
return i * (i - 1) / 2 + j + 1;
}
ll seen[2000000]; // 1:現在探索中のパスで行きがけ 2:探索後の頂点
ll d[2000000]; // d[i]:= 始点から i への距離
ll dfs(vector<vector<ll>> &g, ll n) {
if (seen[n] == 2)
return d[n];
seen[n] = 1;
for (auto c : g[n]) {
if (seen[c] == 1) { // 閉路を検出
cout << -1 << endl;
exit(0);
}
chmax(d[n], dfs(g, c) + 1);
}
seen[n] = 2;
return d[n];
}
int main() {
ll n;
cin >> n;
vector<vector<ll>> g(n * (n - 1) / 2 + 1);
rep(i, n) {
ll now = 0;
rep(_, n - 1) {
ll j;
cin >> j;
j--;
ll next = encode(i, j);
g[now].push_back(next);
now = next;
}
}
cout << dfs(g, 0) << endl;
} | replace | 194 | 195 | 194 | 195 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define enter putchar('\n')
#define Mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll read() {
ll x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= (ch == '-'), ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return x = f ? -x : x;
}
inline void write(ll x) {
if (x == 0) {
putchar('0');
return;
}
if (x < 0) {
putchar('-');
x = -x;
}
static char s[23];
int l = 0;
while (x != 0)
s[l++] = x % 10 + 48, x /= 10;
while (l)
putchar(s[--l]);
}
template <class T, class U> inline void checkMax(T &x, U y) {
if (y > x)
x = y;
}
const int M = 1123456; // 2e5+5
int n;
vector<int> to[M];
int fa[M];
int inDg[M];
set<int> points;
int cnt = 0;
void dfs(int now) {
cnt++;
for (auto son : to[now]) {
inDg[son]--;
if (inDg[son] == 0) {
dfs(son);
}
}
}
int dp[M];
int dfs2(int now) {
if (dp[now] != -1)
return dp[now];
int tmp = 0;
for (auto son : to[now]) {
checkMax(tmp, dfs2(son) + 1);
}
return dp[now] = tmp;
}
void init() {
Mem(dp, -1);
n = read();
for (int i = 1; i <= n; ++i) {
int bf = 0;
points.insert(0);
for (int j = 1; j < n; ++j) {
int tmp1 = read();
int tmp2 = i;
if (tmp1 > tmp2)
swap(tmp1, tmp2);
int tmp = tmp1 * 999 + tmp2;
points.insert(tmp);
fa[tmp] = bf;
to[bf].emplace_back(tmp);
inDg[tmp]++;
bf = tmp;
}
}
dfs(0);
if (cnt < points.size()) {
puts("-1");
return;
}
write(dfs2(0)), enter;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
init();
return 0;
} | #include <bits/stdc++.h>
#define enter putchar('\n')
#define Mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll read() {
ll x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= (ch == '-'), ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return x = f ? -x : x;
}
inline void write(ll x) {
if (x == 0) {
putchar('0');
return;
}
if (x < 0) {
putchar('-');
x = -x;
}
static char s[23];
int l = 0;
while (x != 0)
s[l++] = x % 10 + 48, x /= 10;
while (l)
putchar(s[--l]);
}
template <class T, class U> inline void checkMax(T &x, U y) {
if (y > x)
x = y;
}
const int M = 1123456; // 2e5+5
int n;
vector<int> to[M];
int fa[M];
int inDg[M];
set<int> points;
int cnt = 0;
void dfs(int now) {
cnt++;
for (auto son : to[now]) {
inDg[son]--;
if (inDg[son] == 0) {
dfs(son);
}
}
}
int dp[M];
int dfs2(int now) {
if (dp[now] != -1)
return dp[now];
int tmp = 0;
for (auto son : to[now]) {
checkMax(tmp, dfs2(son) + 1);
}
return dp[now] = tmp;
}
void init() {
Mem(dp, -1);
n = read();
for (int i = 1; i <= n; ++i) {
int bf = 0;
points.insert(0);
for (int j = 1; j < n; ++j) {
int tmp1 = read();
int tmp2 = i;
if (tmp1 > tmp2)
swap(tmp1, tmp2);
int tmp = tmp1 * 999 + tmp2;
points.insert(tmp);
fa[tmp] = bf;
to[bf].emplace_back(tmp);
inDg[tmp]++;
bf = tmp;
}
}
dfs(0);
if (cnt < points.size()) {
puts("-1");
return;
}
write(dfs2(0)), enter;
}
int main() {
init();
return 0;
} | replace | 100 | 104 | 100 | 101 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reverse(x) reverse(all(x))
#define PQ priority_queue
#define NP(x) next_permutation(all(x))
#define M_PI 3.14159265358979323846
#define popcount __builtin_popcount
using namespace std;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef unsigned long long ull;
typedef vector<ull> vu;
typedef vector<vu> vvu;
typedef double dbl;
typedef vector<dbl> vd;
typedef vector<vd> vvd;
typedef string str;
typedef vector<str> vs;
typedef vector<vs> vvs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef map<int, int> mii;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef map<ll, ll> mll;
typedef pair<dbl, dbl> pdd;
typedef vector<pdd> vpdd;
typedef map<dbl, dbl> mdd;
typedef pair<str, str> pss;
typedef vector<pss> vpss;
typedef map<str, str> mss;
typedef pair<int, ll> pil;
typedef vector<pil> vpil;
typedef map<int, ll> mil;
typedef pair<ll, int> pli;
typedef vector<pli> vpli;
typedef map<ll, int> mli;
typedef pair<dbl, int> pdi;
typedef vector<pdi> vpdi;
typedef map<dbl, int> mdi;
template <typename T> vector<T> &operator<<(vector<T> &v, const T t) {
v.push_back(t);
return v;
}
template <typename T> multiset<T> &operator<<(multiset<T> &m, const T t) {
m.insert(t);
return m;
}
template <typename T> set<T> &operator<<(set<T> &s, const T t) {
s.insert(t);
return s;
}
template <typename T> stack<T> &operator<<(stack<T> &s, const T t) {
s.push(t);
return s;
}
template <typename T> stack<T> &operator>>(stack<T> &s, T &t) {
t = s.top();
s.pop();
return s;
}
template <typename T> queue<T> &operator<<(queue<T> &q, const T t) {
q.push(t);
return q;
}
template <typename T> queue<T> &operator>>(queue<T> &q, T &t) {
t = q.front();
q.pop();
return q;
}
template <typename T, typename U>
PQ<T, vector<T>, U> &operator<<(PQ<T, vector<T>, U> &q, const T t) {
q.push(t);
return q;
}
template <typename T, typename U>
PQ<T, vector<T>, U> &operator>>(PQ<T, vector<T>, U> &q, T &t) {
t = q.top();
q.pop();
return q;
}
template <typename T, typename U>
istream &operator>>(istream &s, pair<T, U> &p) {
return s >> p.first >> p.second;
}
istream &operator>>(istream &s, _Bit_reference b) {
int a;
s >> a;
assert(a == 0 || a == 1);
b = a;
return s;
}
template <typename T> istream &operator>>(istream &s, vector<T> &v) {
fr(i, v.size()) { s >> v[i]; }
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> p) {
return s << p.first << " " << p.second;
}
// template<typename T>ostream&operator<<(ostream&s,const vector<T>v){for(auto
// a:v){s<<a<<"\n";}return s;}
template <typename T> ostream &operator<<(ostream &s, const vector<T> v) {
fr(i, v.size()) { i ? s << " " << v[i] : s << v[i]; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const deque<T> d) {
fr(i, d.size()) { i ? s << " " << d[i] : s << d[i]; }
return s;
}
template <typename T> _Bit_reference operator&=(_Bit_reference b, T t) {
return b = b & t;
}
template <typename T> _Bit_reference operator^=(_Bit_reference b, T t) {
return b = b ^ t;
}
template <typename T> _Bit_reference operator|=(_Bit_reference b, T t) {
return b = b | t;
}
template <typename T, typename U>
pair<T, U> operator+(pair<T, U> a, pair<T, U> b) {
return {a.first + b.first, a.second + b.second};
}
template <typename T, typename U>
pair<T, U> operator-(pair<T, U> a, pair<T, U> b) {
return {a.first - b.first, a.second - b.second};
}
template <typename T, typename U>
pair<T, U> &operator+=(pair<T, U> &a, pair<T, U> b) {
return a = a + b;
}
template <typename T, typename U>
pair<T, U> &operator-=(pair<T, U> &a, pair<T, U> b) {
return a = a - b;
}
void print(void) { cout << "\n"; }
void Print(void) { cout << endl; }
template <typename T> void print(T t) { cout << t << "\n"; }
template <typename T> void Print(T t) { cout << t << endl; }
template <typename T, typename... U> void print(T &&t, U &&...u) {
cout << t << " ";
print(forward<U>(u)...);
}
template <typename T, typename... U> void Print(T &&t, U &&...u) {
cout << t << " ";
Print(forward<U>(u)...);
}
bool YN(bool b) {
print(b ? "YES" : "NO");
return b;
}
bool PI(bool b) {
print(b ? "POSSIBLE" : "IMPOSSIBLE");
return b;
}
bool Yn(bool b) {
print(b ? "Yes" : "No");
return b;
}
bool Pi(bool b) {
print(b ? "Possible" : "Impossible");
return b;
}
bool yn(bool b) {
print(b ? "yes" : "no");
return b;
}
bool pi(bool b) {
print(b ? "possible" : "impossible");
return b;
}
const int e5 = 1e5;
const int e9 = 1e9;
const int MD = 1e9 + 7;
const ll e18 = 1e18;
template <typename T> str to_string(const T &n) {
ostringstream s;
s << n;
return s.str();
}
template <typename T> T &chmax(T &a, T b) { return a = max(a, b); }
template <typename T> T &chmin(T &a, T b) { return a = min(a, b); }
template <typename T, typename U>
vector<pair<T, U>> dijkstra(const vector<vector<pair<T, U>>> &E, const U s,
const T inf) {
using P = pair<T, U>;
vector<P> d;
fr(i, E.size()) { d << P{inf, i}; }
PQ<P, vector<P>, greater<P>> pq;
pq << (d[s] = P{0, s});
while (pq.size()) {
P a = pq.top();
pq.pop();
U v = a.second;
if (d[v].first >= a.first) {
for (P e : E[v]) {
if (d[v].first + e.first < d[e.second].first) {
d[e.second] = P{d[v].first + e.first, v};
pq << P{d[v].first + e.first, e.second};
}
}
}
}
return d;
}
template <typename T, typename U>
map<U, pair<T, U>> dijkstra(map<U, vector<pair<T, U>>> E, const U s,
const T inf) {
using P = pair<T, U>;
map<U, P> d;
for (pair<U, vector<P>> e : E) {
d[e.first] = P{inf, e.first};
}
PQ<P, vector<P>, greater<P>> pq;
pq << (d[s] = P{0, s});
while (pq.size()) {
P a = pq.top();
pq.pop();
U v = a.second;
if (d[v].first >= a.first) {
for (P e : E[v]) {
if (d[v].first + e.first < d[e.second].first) {
d[e.second] = P{d[v].first + e.first, v};
pq << P{d[v].first + e.first, e.second};
}
}
}
}
return d;
}
ll maxflow(vector<mil> &E, int s, int t) {
ll z = 0;
vi b(E.size(), -1);
for (int i = 0;; ++i) {
static auto dfs = [&](int v, ll f, auto &dfs) -> ll {
if (v == t)
return f;
b[v] = i;
for (auto &p : E[v]) {
if (b[p.first] < i && p.second) {
if (ll r = dfs(p.first, min(f, p.second), dfs)) {
p.second -= r;
E[p.first][v] += r;
return r;
}
}
}
return 0;
};
ll x = dfs(s, ll(1e18), dfs);
z += x;
if (x == 0)
return z;
}
}
template <typename T> T distsq(pair<T, T> a, pair<T, T> b) {
return (a.first - b.first) * (a.first - b.first) +
(a.second - b.second) * (a.second - b.second);
}
template <typename T> T max(const vector<T> a) {
assert(a.size());
T m = a[0];
for (T e : a) {
m = max(m, e);
}
return m;
}
template <typename T> T min(const vector<T> a) {
assert(a.size());
T m = a[0];
for (T e : a) {
m = min(m, e);
}
return m;
}
template <typename T> T gcd(const T a, const T b) {
return a ? gcd(b % a, a) : b;
}
template <typename T> T gcd(const vector<T> a) {
T g = a[0];
for (T e : a) {
g = gcd(g, e);
}
return g;
}
template <typename T> vector<T> LIS(const vector<T> A) {
vector<T> B;
for (T a : A) {
auto it = lower_bound(all(B), a);
if (it == B.end()) {
B << a;
} else {
*it = a;
}
}
return B;
}
template <typename T> vector<T> LCS(vector<T> A, vector<T> B) {
int N = A.size(), M = B.size();
vector<vector<pair<int, pii>>> d(N + 1, vector<pair<int, pii>>(M + 1));
fr(i, N) {
fr(j, M) {
if (A[i] == B[j]) {
d[i + 1][j + 1] = {d[i][j].first + 1, {i, j}};
} else {
d[i + 1][j + 1] = max(d[i][j + 1], d[i + 1][j]);
}
}
}
vector<T> r;
for (pii p = {N, M}; d[p.first][p.second].first;
p = d[p.first][p.second].second) {
r << A[d[p.first][p.second].second.first];
}
Reverse(r);
return r;
}
str LCS(str S, str T) {
vector<char> s =
LCS(vector<char>(S.begin(), S.end()), vector<char>(T.begin(), T.end()));
return str(s.begin(), s.end());
}
template <typename T> vector<pair<T, T>> ConvexHull(vector<pair<T, T>> V) {
if (V.size() <= 3) {
return V;
}
Sort(V);
rf(i, V.size() - 1) V << V[i];
vector<pair<T, T>> r;
for (pair<T, T> p : V) {
int s = r.size();
while (s >= 2 &&
(p.second - r[s - 1].second) * (p.first - r[s - 2].first) <
(p.second - r[s - 2].second) * (p.first - r[s - 1].first)) {
r.pop_back();
--s;
}
r << p;
}
r.pop_back();
return r;
}
class UnionFind {
vi p, s;
void extend(int N) {
foor(i, p.size(), N) {
p << i;
s << 1;
}
}
public:
UnionFind(void) {}
UnionFind(int N) { extend(N - 1); }
int find(int i) {
extend(i);
return p[i] = p[i] == i ? i : find(p[i]);
}
void unite(int a, int b) {
extend(a);
extend(b);
if ((a = find(a)) != (b = find(b))) {
if (s[a] > s[b]) {
swap(a, b);
}
s[b] += s[a];
p[a] = b;
}
}
void unite(pii p) { return unite(p.first, p.second); }
bool same(int a, int b) {
extend(a);
extend(b);
return find(a) == find(b);
}
bool same(pii p) { return same(p.first, p.second); }
int size(int x) {
extend(x);
return s[find(x)];
}
};
ll MST(vector<pair<ll, pii>> &E) {
Sort(E);
UnionFind uf;
ll z = 0;
for (auto &e : E) {
if (!uf.same(e.second)) {
z += e.first;
uf.unite(e.second);
}
}
return z;
}
ll strmod(const str &s, const int m) {
ll x = 0;
fr(i, s.size()) { x = (x * 10 + s[i] - 48) % m; }
return x;
}
vvl mul(const vvl &A, const vvl &B, const int m) {
vvl C;
fr(y, A.size()) { C << vl(B[y].size()); }
fr(y, C.size()) {
fr(x, C[y].size()) {
fr(i, A[0].size()) { (C[y][x] += A[y][i] * B[i][x]) %= m; }
}
}
return C;
}
vvl pow(const vvl &A, const ll n, const int m) {
vvl B;
fr(y, A.size()) { B << vl(A.size()); }
if (n == 0) {
fr(i, B.size()) { B[i][i] = 1; }
}
elsif(n % 2) { B = mul(A, pow(A, n - 1, m), m); }
else {
vvl C = pow(A, n / 2, m);
B = mul(C, C, m);
}
return B;
}
ll pow(const ll a, const ll n, const int m) {
ll t;
return n ? (n & 1 ? a >= 0 ? a % m : (m - (-a % m)) % m : 1) *
(t = pow(a, n >> 1, m), t * t % m) % m
: !!a;
}
ll inv(const ll x, const int p) {
assert(x != 0);
return pow(x, p - 2, p);
}
ll inv(const ll x) { return inv(x, MD); }
vpll fact(const int n, const int p) {
assert(n < p);
vpll v(n + 1);
v[0].first = 1;
foor(i, 1, n) { v[i].first = v[i - 1].first * i % p; }
v[n].second = inv(v[n].first, p);
roof(i, n, 1) { v[i - 1].second = v[i].second * i % p; }
return v;
}
class Combination {
const vpll f;
const int M;
public:
Combination(int n, int m) : f(fact(n, m)), M(m) {}
Combination(int n) : Combination(n, MD) {}
ll P(int n, int k) {
return n < 0 || k < 0 || n < k ? 0ll : f[n].first * f[n - k].second % M;
}
ll C(int n, int k) { return k < 0 ? 0 : P(n, k) * f[k].second % M; }
ll H(int n, int k) { return n == 0 && k == 0 ? 1ll : C(n + k - 1, k); }
ll F(int n) { return n < 0 ? 0 : f[n].first; }
};
ll C2(const int n) { return (ll)n * ~-n / 2; }
ll sum(const vi a) {
ll s = 0;
for (int e : a) {
s += e;
}
return s;
}
ll sum(const vl a) {
ll s = 0;
for (ll e : a) {
s += e;
}
return s;
}
template <typename T> int MSB(T N) {
int r = -1;
for (; N > 0; N /= 2) {
++r;
}
return r;
}
template <typename T> class SegmentTree {
vector<T> S;
T (*const op)(T a, T b);
const T zero;
const int B;
public:
SegmentTree(int N, T (*f)(T a, T b), const T zero)
: S(1 << MSB(N - 1) + 2, zero), op(f), zero(zero),
B(1 << MSB(N - 1) + 1) {}
SegmentTree(vector<T> v, T (*f)(T a, T b), const T zero)
: SegmentTree(v.size(), f, zero) {
fr(i, v.size()) { S[S.size() / 2 + i] = v[i]; }
roof(i, S.size() / 2 - 1, 1) { S[i] = op(S[i * 2], S[i * 2 + 1]); }
}
T calc(int l, int r) {
l += B;
r += B;
if (l > r) {
return zero;
}
if (l == r) {
return S[l];
}
T L = S[l], R = S[r];
for (; l / 2 < r / 2; l /= 2, r /= 2) {
if (l % 2 == 0) {
L = op(L, S[l + 1]);
}
if (r % 2 == 1) {
R = op(S[r - 1], R);
}
}
return op(L, R);
}
void replace(int i, T x) {
for (S[i += B] = x; i != 1; i /= 2) {
if (i % 2) {
S[i / 2] = op(S[i - 1], S[i]);
} else {
S[i / 2] = op(S[i], S[i + 1]);
}
}
}
void add(int i, T x) { replace(i, op(S[B + i], x)); }
T top() { return S[1]; }
T get(int i) { return S[i + B]; }
};
ll BITsum(vl &B, int i) {
ll z = 0;
while (i > 0) {
z += B[i];
i -= i & -i;
}
return z;
}
void BITadd(vl &B, int i, ll x) {
while (i < B.size()) {
B[i] += x;
i += i & -i;
}
}
ll fib(const ll n, const int m) {
ll a, b, c, d, A, B, C, D;
a = 1;
b = 0;
c = 0;
d = 1;
rf(i, 63) {
A = a * a + b * c;
B = a * b + b * d;
C = c * a + d * c;
D = c * b + d * d;
if (n >> i & 1) {
a = A;
b = B;
c = C;
d = D;
A = a + b;
B = a;
C = c + d;
D = c;
}
a = A % m;
b = B % m;
c = C % m;
d = D % m;
}
return b;
}
vi primes(int n) {
vb b(n + 1);
vi p;
foor(i, 2, n) {
if (!b[i]) {
p << i;
for (int j = 2 * i; j <= n; j += i) {
b[j] = true;
}
}
}
return p;
}
vb isprime(const int n) {
vb v(n + 1, true);
v[0] = v[1] = false;
foor(i, 2, n) {
if (v[i]) {
for (int j = 2 * i; j <= n; j += i) {
v[j] = false;
}
}
}
return v;
}
class LCA {
vvi par;
vi dep;
public:
LCA(vvi &E, int root) : par(MSB(E.size()) + 1, vi(E.size())), dep(E.size()) {
function<void(int, int)> dfs = [&](int i, int p) {
for (int j : E[i])
if (j != p) {
par[0][j] = i;
dep[j] = dep[i] + 1;
dfs(j, i);
}
};
par[0][root] = root;
dfs(root, root);
fr(i, par.size() - 1) {
fr(j, par[0].size()) { par[i + 1][j] = par[i][par[i][j]]; }
}
}
int operator()(int a, int b) {
if (dep[a] > dep[b])
swap(a, b);
for (int t = dep[b] - dep[a], i = 0; t; t >>= 1, ++i) {
if (t & 1) {
b = par[i][b];
}
}
if (a == b)
return a;
rf(i, par.size()) {
if (par[i][a] != par[i][b]) {
a = par[i][a];
b = par[i][b];
}
}
return par[0][a];
}
};
vpii factor(int N) {
vpii r;
for (int i = 2; i * i <= N; ++i) {
if (N % i == 0) {
r << pii{i, 0};
while (N % i == 0) {
N /= i;
++r.back().second;
}
}
}
if (N > 1) {
r << pii{N, 1};
}
return r;
}
vl divisors(ll n) {
vl r;
ll m = sqrt(n);
foor(i, 1, m) if (n % i == 0) r << ll(i);
rf(i, r.size() - (m * m == n)) r << n / r[i];
return r;
}
vi SuffixArray(str S) {
int N = S.size();
vi rank(N + 1), tmp(N + 1), sa(N + 1);
fr(i, N) {
sa[i] = i;
rank[i] = S[i];
}
sa[N] = N;
rank[N] = -1;
int k;
auto cmp = [&](int &a, int &b) -> bool {
if (rank[a] != rank[b])
return rank[a] < rank[b];
return (a + k <= N ? rank[a + k] : -1) < (b + k <= N ? rank[b + k] : -1);
};
for (k = 1; k <= N; k *= 2) {
sort(all(sa), cmp);
tmp[sa[0]] = 0;
foor(i, 1, N) { tmp[sa[i]] = tmp[sa[i - 1]] + cmp(sa[i - 1], sa[i]); }
rank = tmp;
}
return sa;
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vvi A(N, vi(N - 1));
cin >> A;
fr(i, N) fr(j, N - 1)-- A[i][j];
vi I(N);
int T = N * (N - 1) / 2;
vi v(N);
fr(i, N) v[i] = i;
fr(i, e9) {
vb b(N);
vi v2;
bool bb = false;
for (int j : v)
if (!b[j] && I[j] < N - 1) {
int k = A[j][I[j]];
if (!b[k] && A[k][I[k]] == j) {
b[j] = b[k] = true;
++I[j];
++I[k];
bb = true;
--T;
v2 << j << k;
}
}
v2 = v;
if (T == 0) {
print(i + 1);
return 0;
}
if (!bb) {
print(-1);
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reverse(x) reverse(all(x))
#define PQ priority_queue
#define NP(x) next_permutation(all(x))
#define M_PI 3.14159265358979323846
#define popcount __builtin_popcount
using namespace std;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef unsigned long long ull;
typedef vector<ull> vu;
typedef vector<vu> vvu;
typedef double dbl;
typedef vector<dbl> vd;
typedef vector<vd> vvd;
typedef string str;
typedef vector<str> vs;
typedef vector<vs> vvs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef map<int, int> mii;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef map<ll, ll> mll;
typedef pair<dbl, dbl> pdd;
typedef vector<pdd> vpdd;
typedef map<dbl, dbl> mdd;
typedef pair<str, str> pss;
typedef vector<pss> vpss;
typedef map<str, str> mss;
typedef pair<int, ll> pil;
typedef vector<pil> vpil;
typedef map<int, ll> mil;
typedef pair<ll, int> pli;
typedef vector<pli> vpli;
typedef map<ll, int> mli;
typedef pair<dbl, int> pdi;
typedef vector<pdi> vpdi;
typedef map<dbl, int> mdi;
template <typename T> vector<T> &operator<<(vector<T> &v, const T t) {
v.push_back(t);
return v;
}
template <typename T> multiset<T> &operator<<(multiset<T> &m, const T t) {
m.insert(t);
return m;
}
template <typename T> set<T> &operator<<(set<T> &s, const T t) {
s.insert(t);
return s;
}
template <typename T> stack<T> &operator<<(stack<T> &s, const T t) {
s.push(t);
return s;
}
template <typename T> stack<T> &operator>>(stack<T> &s, T &t) {
t = s.top();
s.pop();
return s;
}
template <typename T> queue<T> &operator<<(queue<T> &q, const T t) {
q.push(t);
return q;
}
template <typename T> queue<T> &operator>>(queue<T> &q, T &t) {
t = q.front();
q.pop();
return q;
}
template <typename T, typename U>
PQ<T, vector<T>, U> &operator<<(PQ<T, vector<T>, U> &q, const T t) {
q.push(t);
return q;
}
template <typename T, typename U>
PQ<T, vector<T>, U> &operator>>(PQ<T, vector<T>, U> &q, T &t) {
t = q.top();
q.pop();
return q;
}
template <typename T, typename U>
istream &operator>>(istream &s, pair<T, U> &p) {
return s >> p.first >> p.second;
}
istream &operator>>(istream &s, _Bit_reference b) {
int a;
s >> a;
assert(a == 0 || a == 1);
b = a;
return s;
}
template <typename T> istream &operator>>(istream &s, vector<T> &v) {
fr(i, v.size()) { s >> v[i]; }
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> p) {
return s << p.first << " " << p.second;
}
// template<typename T>ostream&operator<<(ostream&s,const vector<T>v){for(auto
// a:v){s<<a<<"\n";}return s;}
template <typename T> ostream &operator<<(ostream &s, const vector<T> v) {
fr(i, v.size()) { i ? s << " " << v[i] : s << v[i]; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const deque<T> d) {
fr(i, d.size()) { i ? s << " " << d[i] : s << d[i]; }
return s;
}
template <typename T> _Bit_reference operator&=(_Bit_reference b, T t) {
return b = b & t;
}
template <typename T> _Bit_reference operator^=(_Bit_reference b, T t) {
return b = b ^ t;
}
template <typename T> _Bit_reference operator|=(_Bit_reference b, T t) {
return b = b | t;
}
template <typename T, typename U>
pair<T, U> operator+(pair<T, U> a, pair<T, U> b) {
return {a.first + b.first, a.second + b.second};
}
template <typename T, typename U>
pair<T, U> operator-(pair<T, U> a, pair<T, U> b) {
return {a.first - b.first, a.second - b.second};
}
template <typename T, typename U>
pair<T, U> &operator+=(pair<T, U> &a, pair<T, U> b) {
return a = a + b;
}
template <typename T, typename U>
pair<T, U> &operator-=(pair<T, U> &a, pair<T, U> b) {
return a = a - b;
}
void print(void) { cout << "\n"; }
void Print(void) { cout << endl; }
template <typename T> void print(T t) { cout << t << "\n"; }
template <typename T> void Print(T t) { cout << t << endl; }
template <typename T, typename... U> void print(T &&t, U &&...u) {
cout << t << " ";
print(forward<U>(u)...);
}
template <typename T, typename... U> void Print(T &&t, U &&...u) {
cout << t << " ";
Print(forward<U>(u)...);
}
bool YN(bool b) {
print(b ? "YES" : "NO");
return b;
}
bool PI(bool b) {
print(b ? "POSSIBLE" : "IMPOSSIBLE");
return b;
}
bool Yn(bool b) {
print(b ? "Yes" : "No");
return b;
}
bool Pi(bool b) {
print(b ? "Possible" : "Impossible");
return b;
}
bool yn(bool b) {
print(b ? "yes" : "no");
return b;
}
bool pi(bool b) {
print(b ? "possible" : "impossible");
return b;
}
const int e5 = 1e5;
const int e9 = 1e9;
const int MD = 1e9 + 7;
const ll e18 = 1e18;
template <typename T> str to_string(const T &n) {
ostringstream s;
s << n;
return s.str();
}
template <typename T> T &chmax(T &a, T b) { return a = max(a, b); }
template <typename T> T &chmin(T &a, T b) { return a = min(a, b); }
template <typename T, typename U>
vector<pair<T, U>> dijkstra(const vector<vector<pair<T, U>>> &E, const U s,
const T inf) {
using P = pair<T, U>;
vector<P> d;
fr(i, E.size()) { d << P{inf, i}; }
PQ<P, vector<P>, greater<P>> pq;
pq << (d[s] = P{0, s});
while (pq.size()) {
P a = pq.top();
pq.pop();
U v = a.second;
if (d[v].first >= a.first) {
for (P e : E[v]) {
if (d[v].first + e.first < d[e.second].first) {
d[e.second] = P{d[v].first + e.first, v};
pq << P{d[v].first + e.first, e.second};
}
}
}
}
return d;
}
template <typename T, typename U>
map<U, pair<T, U>> dijkstra(map<U, vector<pair<T, U>>> E, const U s,
const T inf) {
using P = pair<T, U>;
map<U, P> d;
for (pair<U, vector<P>> e : E) {
d[e.first] = P{inf, e.first};
}
PQ<P, vector<P>, greater<P>> pq;
pq << (d[s] = P{0, s});
while (pq.size()) {
P a = pq.top();
pq.pop();
U v = a.second;
if (d[v].first >= a.first) {
for (P e : E[v]) {
if (d[v].first + e.first < d[e.second].first) {
d[e.second] = P{d[v].first + e.first, v};
pq << P{d[v].first + e.first, e.second};
}
}
}
}
return d;
}
ll maxflow(vector<mil> &E, int s, int t) {
ll z = 0;
vi b(E.size(), -1);
for (int i = 0;; ++i) {
static auto dfs = [&](int v, ll f, auto &dfs) -> ll {
if (v == t)
return f;
b[v] = i;
for (auto &p : E[v]) {
if (b[p.first] < i && p.second) {
if (ll r = dfs(p.first, min(f, p.second), dfs)) {
p.second -= r;
E[p.first][v] += r;
return r;
}
}
}
return 0;
};
ll x = dfs(s, ll(1e18), dfs);
z += x;
if (x == 0)
return z;
}
}
template <typename T> T distsq(pair<T, T> a, pair<T, T> b) {
return (a.first - b.first) * (a.first - b.first) +
(a.second - b.second) * (a.second - b.second);
}
template <typename T> T max(const vector<T> a) {
assert(a.size());
T m = a[0];
for (T e : a) {
m = max(m, e);
}
return m;
}
template <typename T> T min(const vector<T> a) {
assert(a.size());
T m = a[0];
for (T e : a) {
m = min(m, e);
}
return m;
}
template <typename T> T gcd(const T a, const T b) {
return a ? gcd(b % a, a) : b;
}
template <typename T> T gcd(const vector<T> a) {
T g = a[0];
for (T e : a) {
g = gcd(g, e);
}
return g;
}
template <typename T> vector<T> LIS(const vector<T> A) {
vector<T> B;
for (T a : A) {
auto it = lower_bound(all(B), a);
if (it == B.end()) {
B << a;
} else {
*it = a;
}
}
return B;
}
template <typename T> vector<T> LCS(vector<T> A, vector<T> B) {
int N = A.size(), M = B.size();
vector<vector<pair<int, pii>>> d(N + 1, vector<pair<int, pii>>(M + 1));
fr(i, N) {
fr(j, M) {
if (A[i] == B[j]) {
d[i + 1][j + 1] = {d[i][j].first + 1, {i, j}};
} else {
d[i + 1][j + 1] = max(d[i][j + 1], d[i + 1][j]);
}
}
}
vector<T> r;
for (pii p = {N, M}; d[p.first][p.second].first;
p = d[p.first][p.second].second) {
r << A[d[p.first][p.second].second.first];
}
Reverse(r);
return r;
}
str LCS(str S, str T) {
vector<char> s =
LCS(vector<char>(S.begin(), S.end()), vector<char>(T.begin(), T.end()));
return str(s.begin(), s.end());
}
template <typename T> vector<pair<T, T>> ConvexHull(vector<pair<T, T>> V) {
if (V.size() <= 3) {
return V;
}
Sort(V);
rf(i, V.size() - 1) V << V[i];
vector<pair<T, T>> r;
for (pair<T, T> p : V) {
int s = r.size();
while (s >= 2 &&
(p.second - r[s - 1].second) * (p.first - r[s - 2].first) <
(p.second - r[s - 2].second) * (p.first - r[s - 1].first)) {
r.pop_back();
--s;
}
r << p;
}
r.pop_back();
return r;
}
class UnionFind {
vi p, s;
void extend(int N) {
foor(i, p.size(), N) {
p << i;
s << 1;
}
}
public:
UnionFind(void) {}
UnionFind(int N) { extend(N - 1); }
int find(int i) {
extend(i);
return p[i] = p[i] == i ? i : find(p[i]);
}
void unite(int a, int b) {
extend(a);
extend(b);
if ((a = find(a)) != (b = find(b))) {
if (s[a] > s[b]) {
swap(a, b);
}
s[b] += s[a];
p[a] = b;
}
}
void unite(pii p) { return unite(p.first, p.second); }
bool same(int a, int b) {
extend(a);
extend(b);
return find(a) == find(b);
}
bool same(pii p) { return same(p.first, p.second); }
int size(int x) {
extend(x);
return s[find(x)];
}
};
ll MST(vector<pair<ll, pii>> &E) {
Sort(E);
UnionFind uf;
ll z = 0;
for (auto &e : E) {
if (!uf.same(e.second)) {
z += e.first;
uf.unite(e.second);
}
}
return z;
}
ll strmod(const str &s, const int m) {
ll x = 0;
fr(i, s.size()) { x = (x * 10 + s[i] - 48) % m; }
return x;
}
vvl mul(const vvl &A, const vvl &B, const int m) {
vvl C;
fr(y, A.size()) { C << vl(B[y].size()); }
fr(y, C.size()) {
fr(x, C[y].size()) {
fr(i, A[0].size()) { (C[y][x] += A[y][i] * B[i][x]) %= m; }
}
}
return C;
}
vvl pow(const vvl &A, const ll n, const int m) {
vvl B;
fr(y, A.size()) { B << vl(A.size()); }
if (n == 0) {
fr(i, B.size()) { B[i][i] = 1; }
}
elsif(n % 2) { B = mul(A, pow(A, n - 1, m), m); }
else {
vvl C = pow(A, n / 2, m);
B = mul(C, C, m);
}
return B;
}
ll pow(const ll a, const ll n, const int m) {
ll t;
return n ? (n & 1 ? a >= 0 ? a % m : (m - (-a % m)) % m : 1) *
(t = pow(a, n >> 1, m), t * t % m) % m
: !!a;
}
ll inv(const ll x, const int p) {
assert(x != 0);
return pow(x, p - 2, p);
}
ll inv(const ll x) { return inv(x, MD); }
vpll fact(const int n, const int p) {
assert(n < p);
vpll v(n + 1);
v[0].first = 1;
foor(i, 1, n) { v[i].first = v[i - 1].first * i % p; }
v[n].second = inv(v[n].first, p);
roof(i, n, 1) { v[i - 1].second = v[i].second * i % p; }
return v;
}
class Combination {
const vpll f;
const int M;
public:
Combination(int n, int m) : f(fact(n, m)), M(m) {}
Combination(int n) : Combination(n, MD) {}
ll P(int n, int k) {
return n < 0 || k < 0 || n < k ? 0ll : f[n].first * f[n - k].second % M;
}
ll C(int n, int k) { return k < 0 ? 0 : P(n, k) * f[k].second % M; }
ll H(int n, int k) { return n == 0 && k == 0 ? 1ll : C(n + k - 1, k); }
ll F(int n) { return n < 0 ? 0 : f[n].first; }
};
ll C2(const int n) { return (ll)n * ~-n / 2; }
ll sum(const vi a) {
ll s = 0;
for (int e : a) {
s += e;
}
return s;
}
ll sum(const vl a) {
ll s = 0;
for (ll e : a) {
s += e;
}
return s;
}
template <typename T> int MSB(T N) {
int r = -1;
for (; N > 0; N /= 2) {
++r;
}
return r;
}
template <typename T> class SegmentTree {
vector<T> S;
T (*const op)(T a, T b);
const T zero;
const int B;
public:
SegmentTree(int N, T (*f)(T a, T b), const T zero)
: S(1 << MSB(N - 1) + 2, zero), op(f), zero(zero),
B(1 << MSB(N - 1) + 1) {}
SegmentTree(vector<T> v, T (*f)(T a, T b), const T zero)
: SegmentTree(v.size(), f, zero) {
fr(i, v.size()) { S[S.size() / 2 + i] = v[i]; }
roof(i, S.size() / 2 - 1, 1) { S[i] = op(S[i * 2], S[i * 2 + 1]); }
}
T calc(int l, int r) {
l += B;
r += B;
if (l > r) {
return zero;
}
if (l == r) {
return S[l];
}
T L = S[l], R = S[r];
for (; l / 2 < r / 2; l /= 2, r /= 2) {
if (l % 2 == 0) {
L = op(L, S[l + 1]);
}
if (r % 2 == 1) {
R = op(S[r - 1], R);
}
}
return op(L, R);
}
void replace(int i, T x) {
for (S[i += B] = x; i != 1; i /= 2) {
if (i % 2) {
S[i / 2] = op(S[i - 1], S[i]);
} else {
S[i / 2] = op(S[i], S[i + 1]);
}
}
}
void add(int i, T x) { replace(i, op(S[B + i], x)); }
T top() { return S[1]; }
T get(int i) { return S[i + B]; }
};
ll BITsum(vl &B, int i) {
ll z = 0;
while (i > 0) {
z += B[i];
i -= i & -i;
}
return z;
}
void BITadd(vl &B, int i, ll x) {
while (i < B.size()) {
B[i] += x;
i += i & -i;
}
}
ll fib(const ll n, const int m) {
ll a, b, c, d, A, B, C, D;
a = 1;
b = 0;
c = 0;
d = 1;
rf(i, 63) {
A = a * a + b * c;
B = a * b + b * d;
C = c * a + d * c;
D = c * b + d * d;
if (n >> i & 1) {
a = A;
b = B;
c = C;
d = D;
A = a + b;
B = a;
C = c + d;
D = c;
}
a = A % m;
b = B % m;
c = C % m;
d = D % m;
}
return b;
}
vi primes(int n) {
vb b(n + 1);
vi p;
foor(i, 2, n) {
if (!b[i]) {
p << i;
for (int j = 2 * i; j <= n; j += i) {
b[j] = true;
}
}
}
return p;
}
vb isprime(const int n) {
vb v(n + 1, true);
v[0] = v[1] = false;
foor(i, 2, n) {
if (v[i]) {
for (int j = 2 * i; j <= n; j += i) {
v[j] = false;
}
}
}
return v;
}
class LCA {
vvi par;
vi dep;
public:
LCA(vvi &E, int root) : par(MSB(E.size()) + 1, vi(E.size())), dep(E.size()) {
function<void(int, int)> dfs = [&](int i, int p) {
for (int j : E[i])
if (j != p) {
par[0][j] = i;
dep[j] = dep[i] + 1;
dfs(j, i);
}
};
par[0][root] = root;
dfs(root, root);
fr(i, par.size() - 1) {
fr(j, par[0].size()) { par[i + 1][j] = par[i][par[i][j]]; }
}
}
int operator()(int a, int b) {
if (dep[a] > dep[b])
swap(a, b);
for (int t = dep[b] - dep[a], i = 0; t; t >>= 1, ++i) {
if (t & 1) {
b = par[i][b];
}
}
if (a == b)
return a;
rf(i, par.size()) {
if (par[i][a] != par[i][b]) {
a = par[i][a];
b = par[i][b];
}
}
return par[0][a];
}
};
vpii factor(int N) {
vpii r;
for (int i = 2; i * i <= N; ++i) {
if (N % i == 0) {
r << pii{i, 0};
while (N % i == 0) {
N /= i;
++r.back().second;
}
}
}
if (N > 1) {
r << pii{N, 1};
}
return r;
}
vl divisors(ll n) {
vl r;
ll m = sqrt(n);
foor(i, 1, m) if (n % i == 0) r << ll(i);
rf(i, r.size() - (m * m == n)) r << n / r[i];
return r;
}
vi SuffixArray(str S) {
int N = S.size();
vi rank(N + 1), tmp(N + 1), sa(N + 1);
fr(i, N) {
sa[i] = i;
rank[i] = S[i];
}
sa[N] = N;
rank[N] = -1;
int k;
auto cmp = [&](int &a, int &b) -> bool {
if (rank[a] != rank[b])
return rank[a] < rank[b];
return (a + k <= N ? rank[a + k] : -1) < (b + k <= N ? rank[b + k] : -1);
};
for (k = 1; k <= N; k *= 2) {
sort(all(sa), cmp);
tmp[sa[0]] = 0;
foor(i, 1, N) { tmp[sa[i]] = tmp[sa[i - 1]] + cmp(sa[i - 1], sa[i]); }
rank = tmp;
}
return sa;
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vvi A(N, vi(N - 1));
cin >> A;
fr(i, N) fr(j, N - 1)-- A[i][j];
vi I(N);
int T = N * (N - 1) / 2;
vi v(N);
fr(i, N) v[i] = i;
fr(i, e9) {
vb b(N);
vi v2;
bool bb = false;
for (int j : v)
if (!b[j] && I[j] < N - 1) {
int k = A[j][I[j]];
if (!b[k] && A[k][I[k]] == j) {
b[j] = b[k] = true;
++I[j];
++I[k];
bb = true;
--T;
v2 << j << k;
}
}
v = v2;
if (T == 0) {
print(i + 1);
return 0;
}
if (!bb) {
print(-1);
return 0;
}
}
return 0;
}
| replace | 717 | 718 | 717 | 718 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef int64_t Int;
typedef pair<int, int> P;
int N;
vector<deque<int>> A(N);
vector<P> match;
// kさんが試合をできればmatchに代入する
void check(int i) {
if (A[i].size() == 0)
return;
int j = A[i].front();
if (A[j].front() == i) {
if (i > j)
swap(i, j);
match.push_back(P(i, j));
}
}
int main() {
cin >> N;
rep(i, N) rep(j, N - 1) {
int a;
cin >> a;
a--;
A[i].push_back(a);
}
rep(i, N) check(i);
int ans = 0;
while (!match.empty()) {
ans++;
sort(match.begin(), match.end());
match.erase(unique(match.begin(), match.end()), match.end());
vector<P> prev_match;
swap(prev_match, match);
for (P p : prev_match) {
int i = p.first, j = p.second;
A[i].pop_front();
A[j].pop_front();
}
for (P p : prev_match) {
int i = p.first, j = p.second;
check(i);
check(j);
}
}
rep(i, N) {
if (A[i].size() != 0) {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef int64_t Int;
typedef pair<int, int> P;
int N;
vector<deque<int>> A(1010);
vector<P> match;
// kさんが試合をできればmatchに代入する
void check(int i) {
if (A[i].size() == 0)
return;
int j = A[i].front();
if (A[j].front() == i) {
if (i > j)
swap(i, j);
match.push_back(P(i, j));
}
}
int main() {
cin >> N;
rep(i, N) rep(j, N - 1) {
int a;
cin >> a;
a--;
A[i].push_back(a);
}
rep(i, N) check(i);
int ans = 0;
while (!match.empty()) {
ans++;
sort(match.begin(), match.end());
match.erase(unique(match.begin(), match.end()), match.end());
vector<P> prev_match;
swap(prev_match, match);
for (P p : prev_match) {
int i = p.first, j = p.second;
A[i].pop_front();
A[j].pop_front();
}
for (P p : prev_match) {
int i = p.first, j = p.second;
check(i);
check(j);
}
}
rep(i, N) {
if (A[i].size() != 0) {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
} | replace | 7 | 8 | 7 | 8 | -11 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
template <typename T> void print(const T &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
}
int main() {
int n;
cin >> n;
vector<queue<int>> A(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
int a;
cin >> a;
--a;
A[i].push(a);
}
}
// 処理が終了するまで繰り返す
set<int> lst;
set<int> empty_index;
// １回目の試合について確認する
for (int i = 0; i < n; i++) {
if (lst.count(i)) {
continue;
}
int a = i;
int b = A[i].front();
if (A[b].front() == i && !lst.count(b)) {
lst.insert(a);
lst.insert(b);
// 一致するものの先頭を削除する
A[a].pop();
A[b].pop();
if (A[a].empty())
empty_index.insert(a);
if (A[b].empty())
empty_index.insert(b);
// cout << a << ':' << b << endl;
}
}
int cnt = 1;
// ２回目の試合以降について確認する
while (true) {
if (empty_index.size() == n) {
cout << cnt << endl;
return 0;
}
// cout << "===" << endl;
set<int> this_game;
for (int i = 0; i < n; i++) {
// このラウンドで既に試合をした，もしくは試合が残っていない場合
if (this_game.count(i) || A[i].empty()) {
continue;
}
int a = i;
int b = A[i].front();
if (A[b].front() == i && !this_game.count(b)) {
this_game.insert(a);
this_game.insert(b);
// 一致するものの先頭を削除する
A[a].pop();
A[b].pop();
if (A[a].empty()) {
empty_index.insert(a);
}
if (A[b].empty()) {
empty_index.insert(b);
}
// cout << a << ':' << b << endl;
}
}
if (this_game.size() == 0) {
cout << -1 << endl;
return 0;
}
++cnt;
lst = this_game;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
template <typename T> void print(const T &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
}
int main() {
int n;
cin >> n;
vector<queue<int>> A(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
int a;
cin >> a;
--a;
A[i].push(a);
}
}
// 処理が終了するまで繰り返す
set<int> lst;
set<int> empty_index;
// １回目の試合について確認する
for (int i = 0; i < n; i++) {
if (lst.count(i)) {
continue;
}
int a = i;
int b = A[i].front();
if (A[b].front() == i && !lst.count(b)) {
lst.insert(a);
lst.insert(b);
// 一致するものの先頭を削除する
A[a].pop();
A[b].pop();
if (A[a].empty())
empty_index.insert(a);
if (A[b].empty())
empty_index.insert(b);
// cout << a << ':' << b << endl;
}
}
int cnt = 1;
// ２回目の試合以降について確認する
while (true) {
if (empty_index.size() == n) {
cout << cnt << endl;
return 0;
}
// cout << "===" << endl;
set<int> this_game;
for (int i : lst) {
// このラウンドで既に試合をした，もしくは試合が残っていない場合
if (this_game.count(i) || A[i].empty()) {
continue;
}
int a = i;
int b = A[i].front();
if (A[b].front() == i && !this_game.count(b)) {
this_game.insert(a);
this_game.insert(b);
// 一致するものの先頭を削除する
A[a].pop();
A[b].pop();
if (A[a].empty()) {
empty_index.insert(a);
}
if (A[b].empty()) {
empty_index.insert(b);
}
// cout << a << ':' << b << endl;
}
}
if (this_game.size() == 0) {
cout << -1 << endl;
return 0;
}
++cnt;
lst = this_game;
}
}
| replace | 63 | 64 | 63 | 64 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
static const int MAXN = 1e+3;
static const int MAXV = MAXN * (MAXN - 1) / 2;
int mat[MAXN][MAXN], dp[MAXV];
vector<int> adj[MAXN];
bool visited[MAXV], calculated[MAXV];
// max length of path from s
int dfs(int u) {
if (visited[u]) {
if (!calculated[u])
return -1;
return dp[u];
}
visited[u] = true;
dp[u] = 1;
for (int v : adj[u]) {
int res = dfs(v);
if (res == -1)
return -1;
dp[u] = max(dp[u], res + 1);
}
calculated[u] = true;
return dp[u];
}
int main() {
int n;
cin >> n;
int cnt = 0, v = n * (n - 1) / 2;
rep(i, n) for (int j = i + 1; j < n; j++) {
mat[i][j] = mat[j][i] = cnt;
cnt++;
}
int a, prev_a;
rep(i, n) {
scanf("%d", &prev_a);
prev_a--;
rep(_, n - 2) {
scanf("%d", &a);
a--;
adj[mat[i][prev_a]].push_back(mat[i][a]);
prev_a = a;
}
}
rep(i, v) {
visited[i] = calculated[i] = false;
dp[i] = 0;
}
int ans = 0;
rep(i, v) {
int res = dfs(i);
if (res == -1) {
ans = -1;
break;
}
ans = max(ans, res);
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
static const int MAXN = 1e+3;
static const int MAXV = MAXN * (MAXN - 1) / 2;
int mat[MAXN][MAXN], dp[MAXV];
vector<int> adj[MAXV];
bool visited[MAXV], calculated[MAXV];
// max length of path from s
int dfs(int u) {
if (visited[u]) {
if (!calculated[u])
return -1;
return dp[u];
}
visited[u] = true;
dp[u] = 1;
for (int v : adj[u]) {
int res = dfs(v);
if (res == -1)
return -1;
dp[u] = max(dp[u], res + 1);
}
calculated[u] = true;
return dp[u];
}
int main() {
int n;
cin >> n;
int cnt = 0, v = n * (n - 1) / 2;
rep(i, n) for (int j = i + 1; j < n; j++) {
mat[i][j] = mat[j][i] = cnt;
cnt++;
}
int a, prev_a;
rep(i, n) {
scanf("%d", &prev_a);
prev_a--;
rep(_, n - 2) {
scanf("%d", &a);
a--;
adj[mat[i][prev_a]].push_back(mat[i][a]);
prev_a = a;
}
}
rep(i, v) {
visited[i] = calculated[i] = false;
dp[i] = 0;
}
int ans = 0;
rep(i, v) {
int res = dfs(i);
if (res == -1) {
ans = -1;
break;
}
ans = max(ans, res);
}
cout << ans << "\n";
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
#define DBG(fmt, ...)
#endif
const ll LLINF = (1LL << 60);
const int INF = (1LL << 30);
const double DINF = std::numeric_limits<double>::infinity();
const int MOD = 1000000007;
#define MAX_N 100010
int N;
vector<vector<int>> A;
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> N;
A.assign(N, vector<int>(N, 0));
REP(i, N) {
REP(j, N - 1) {
cin >> A[i][j];
A[i][j]--;
}
}
// 各 A がどれだけ進んでいるか
vector<int> prog(N, 0);
// 最後までたどり着いたものの数
int cnt = 0;
vector<int> check;
REP(i, N) { check.push_back(i); }
int ans = 0;
bool isChange = true;
while (isChange) {
isChange = false;
ans++;
vector<int> node_to(N, -1); // i の指し先
vector<int> next_check;
for (auto &i : check) {
if (prog[i] >= N - 1) {
continue;
}
node_to[i] = A[i][prog[i]];
if (node_to[node_to[i]] == i) {
prog[i]++;
if (prog[i] >= N - 1) {
cnt++;
}
prog[node_to[i]]++;
if (prog[node_to[i]] >= N - 1) {
cnt++;
}
node_to[node_to[i]] = -1;
node_to[i] = -1;
isChange = true;
}
}
for (auto &i : check) {
if (prog[i] >= N - 1) {
continue;
}
next_check.push_back(i);
}
check.clear();
copy(next_check.begin(), next_check.end(), back_inserter(check));
}
ans--;
if (cnt < N) {
ans = -1;
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
#define DBG(fmt, ...)
#endif
const ll LLINF = (1LL << 60);
const int INF = (1LL << 30);
const double DINF = std::numeric_limits<double>::infinity();
const int MOD = 1000000007;
#define MAX_N 100010
int N;
vector<vector<int>> A;
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> N;
A.assign(N, vector<int>(N, 0));
REP(i, N) {
REP(j, N - 1) {
cin >> A[i][j];
A[i][j]--;
}
}
// 各 A がどれだけ進んでいるか
vector<int> prog(N, 0);
// 最後までたどり着いたものの数
int cnt = 0;
vector<int> check;
REP(i, N) { check.push_back(i); }
int ans = 0;
bool isChange = true;
while (isChange) {
isChange = false;
ans++;
vector<int> node_to(N, -1); // i の指し先
vector<int> next_check;
for (auto &i : check) {
if (prog[i] >= N - 1) {
continue;
}
node_to[i] = A[i][prog[i]];
if (node_to[node_to[i]] == i) {
prog[i]++;
if (prog[i] >= N - 1) {
cnt++;
}
prog[node_to[i]]++;
if (prog[node_to[i]] >= N - 1) {
cnt++;
}
node_to[node_to[i]] = -1;
node_to[i] = -1;
isChange = true;
}
}
for (auto &i : check) {
if (prog[i] >= N - 1) {
continue;
}
next_check.push_back(i);
}
check.clear();
copy(next_check.begin(), next_check.end(), back_inserter(check));
if (ans > 100000) {
printf("%lld\n", N * (N - 1) / 2);
return 0;
}
}
ans--;
if (cnt < N) {
ans = -1;
}
printf("%lld\n", ans);
return 0;
}
| insert | 85 | 85 | 85 | 90 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << first << ',' << second << ')'
ll MOD = 1000000007;
ll INF = 214748364700000000;
long double EPS = 1e-11;
long double PI = 3.141592653589793238;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<pair<ll, ll>>>;
ll A[1010][1010];
ll p[1010];
bool done[1010];
int main() {
ll N;
cin >> N;
rep(i, N) rep(j, N - 1) {
cin >> A[i][j];
A[i][j]--;
}
ll ans = 0, cnt = 0;
rep(i, N * (N - 1) / 2) {
ans++;
bool update = 1;
fill(done, done + 1000, true);
rep(j, N - 1) FOR(k, j + 1, N) {
if (A[j][p[j]] == k && A[k][p[k]] == j && done[j] && done[k]) {
p[j]++;
p[k]++;
done[j] = 0;
done[k] = 0;
cnt++;
update = 0;
}
}
/*rep(j,N) cout << p[j] << ' ';
cout << endl;*/
if (i > 50000) {
cout << N * (N - 1) / 2 << endl;
return 0;
}
if (cnt == N * (N - 1) / 2)
break;
if (update) {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << first << ',' << second << ')'
ll MOD = 1000000007;
ll INF = 214748364700000000;
long double EPS = 1e-11;
long double PI = 3.141592653589793238;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<pair<ll, ll>>>;
ll A[1010][1010];
ll p[1010];
bool done[1010];
int main() {
ll N;
cin >> N;
rep(i, N) rep(j, N - 1) {
cin >> A[i][j];
A[i][j]--;
}
ll ans = 0, cnt = 0;
rep(i, N * (N - 1) / 2) {
ans++;
bool update = 1;
fill(done, done + 1000, true);
rep(j, N - 1) FOR(k, j + 1, N) {
if (A[j][p[j]] == k && A[k][p[k]] == j && done[j] && done[k]) {
p[j]++;
p[k]++;
done[j] = 0;
done[k] = 0;
cnt++;
update = 0;
}
}
/*rep(j,N) cout << p[j] << ' ';
cout << endl;*/
if (i > 4000) {
cout << N * (N - 1) / 2 << endl;
return 0;
}
if (cnt == N * (N - 1) / 2)
break;
if (update) {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
}
| replace | 47 | 48 | 47 | 48 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
vector<queue<int>> q(n + 1);
int a;
REP(i, n) {
REP(j, n - 1) {
cin >> a;
q[i + 1].push(a);
}
}
VI t(n + 1, 0);
int i, flaga, flagb;
for (i = 0; 1; i++) {
flaga = 0;
flagb = 0;
for (int j = 1; j <= n; j++) {
if (!q[j].empty()) {
flaga = 1;
if (t[j] != 1 && t[q[j].front()] != 1) {
if (q[q[j].front()].front() == j) {
// cout << j << ' ' << q[j].front() << ' ' << i << '\n';
flagb = 1;
t[j] = 1;
t[q[j].front()] = 1;
q[q[j].front()].pop();
q[j].pop();
}
}
}
}
REP(i, n)
t[i + 1] = 0;
if (flaga == 0)
break;
else if (flagb == 0) {
i = -1;
break;
}
}
cout << i;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
vector<queue<int>> q(n + 1);
int a;
REP(i, n) {
REP(j, n - 1) {
cin >> a;
q[i + 1].push(a);
}
}
VI t(n + 1, 0);
int i, flaga, flagb;
for (i = 0; 1; i++) {
flaga = 0;
flagb = 0;
for (int j = n; j >= 1; j--) {
if (!q[j].empty()) {
flaga = 1;
if (t[j] != 1 && t[q[j].front()] != 1) {
if (q[q[j].front()].front() == j) {
// cout << j << ' ' << q[j].front() << ' ' << i << '\n';
flagb = 1;
t[j] = 1;
t[q[j].front()] = 1;
q[q[j].front()].pop();
q[j].pop();
}
}
}
}
REP(i, n)
t[i + 1] = 0;
if (flaga == 0)
break;
else if (flagb == 0) {
i = -1;
break;
}
}
cout << i;
} | replace | 26 | 27 | 26 | 27 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll divceil(ll A, ll B) { return (A + (B - 1)) / B; }
ll myctoi(char C) { return C - '0'; }
char myitoc(ll N) { return '0' + N; }
#define FINALANS(A) \
{ \
cout << (A) << '\n'; \
exit(0); \
}
int main() {
clock_t start = clock();
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
int a;
scanf("%d", &a);
A.at(i).at(j) = a - 1;
}
}
vector<int> B(N, 0);
for (int ans = 1;; ans++) {
if (clock_t() / 1000 >= 1800)
FINALANS(-1);
vector<bool> visited(N, false);
bool ng = true;
for (int i = 0; i < N; i++) {
if (visited.at(i))
continue;
if (B.at(i) == N - 1)
continue;
int x = A.at(i).at(B.at(i));
if (visited.at(x))
continue;
if (B.at(x) == N - 1)
continue;
int y = A.at(x).at(B.at(x));
if (i == y) {
B.at(i)++;
B.at(x)++;
visited.at(i) = true;
visited.at(x) = true;
ng = false;
}
}
if (ng)
FINALANS(-1);
bool ok = true;
for (int i = 0; i < N; i++) {
if (B.at(i) < N - 1) {
ok = false;
break;
}
}
if (ok)
FINALANS(ans);
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll divceil(ll A, ll B) { return (A + (B - 1)) / B; }
ll myctoi(char C) { return C - '0'; }
char myitoc(ll N) { return '0' + N; }
#define FINALANS(A) \
{ \
cout << (A) << '\n'; \
exit(0); \
}
int main() {
clock_t start = clock();
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
int a;
scanf("%d", &a);
A.at(i).at(j) = a - 1;
}
}
vector<int> B(N, 0);
for (int ans = 1;; ans++) {
if (clock() / 1000 >= 1900)
FINALANS(N * (N - 1) / 2);
vector<bool> visited(N, false);
bool ng = true;
for (int i = 0; i < N; i++) {
if (visited.at(i))
continue;
if (B.at(i) == N - 1)
continue;
int x = A.at(i).at(B.at(i));
if (visited.at(x))
continue;
if (B.at(x) == N - 1)
continue;
int y = A.at(x).at(B.at(x));
if (i == y) {
B.at(i)++;
B.at(x)++;
visited.at(i) = true;
visited.at(x) = true;
ng = false;
}
}
if (ng)
FINALANS(-1);
bool ok = true;
for (int i = 0; i < N; i++) {
if (B.at(i) < N - 1) {
ok = false;
break;
}
}
if (ok)
FINALANS(ans);
}
} | replace | 47 | 49 | 47 | 49 | TLE | |
p02925 | C++ | Time Limit Exceeded | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define pb(n) push_back(n)
#define endl '\n'
#define debug(x) cout << #x << " = " << (x) << endl
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int ii = 0; ii < (V).size(); ii++) { \
cin >> (V).at(ii); \
}
#define OUT(n) cout << n << endl
#define OUT2(n1, n2) cout << n1 << " " << n2 << endl
#define OUT3(n1, n2, n3) cout << n1 << " " << n2 << " " << n3 << endl
#define VOUT(V) \
REP(ii, (V).size()) { cout << (V)[ii] << " "; } \
cout << endl;
#define VOUT2(V) \
REP(jj, (V).size()) { VOUT(V[jj]) }
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = numeric_limits<ll>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
ll n, m, k, ans, sum, cnt = 0;
string s;
char c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vector<deque<ll>> a(n, deque<ll>(n - 1));
FOR(i, 0, n) { VIN(a[i]); }
unordered_set<ll> yesterday;
FOR(i, 0, n) yesterday.insert(i);
while (true) {
bool updated = false;
unordered_set<ll> done;
for (auto itr = yesterday.begin(); itr != yesterday.end(); ++itr) {
// FOR(i,0,n) {
ll i = *itr;
if (a[i].empty())
continue;
if (done.find(i) != done.end())
continue;
ll aite = a[i].front() - 1;
if (done.find(aite) != done.end())
continue;
if (a[aite].front() == i + 1) {
a[i].pop_front();
a[aite].pop_front();
done.insert(i);
done.insert(aite);
updated = true;
}
}
// VOUT2(a);
unordered_set<ll> yesterday(done);
ans++;
if (!updated)
break;
}
bool flg = true;
FOR(i, 0, n) {
if (!a[i].empty()) {
flg = false;
break;
}
}
if (flg)
OUT(ans - 1);
else
OUT(-1);
}
| #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define pb(n) push_back(n)
#define endl '\n'
#define debug(x) cout << #x << " = " << (x) << endl
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define VIN(V) \
for (int ii = 0; ii < (V).size(); ii++) { \
cin >> (V).at(ii); \
}
#define OUT(n) cout << n << endl
#define OUT2(n1, n2) cout << n1 << " " << n2 << endl
#define OUT3(n1, n2, n3) cout << n1 << " " << n2 << " " << n3 << endl
#define VOUT(V) \
REP(ii, (V).size()) { cout << (V)[ii] << " "; } \
cout << endl;
#define VOUT2(V) \
REP(jj, (V).size()) { VOUT(V[jj]) }
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = numeric_limits<ll>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
ll n, m, k, ans, sum, cnt = 0;
string s;
char c;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vector<deque<ll>> a(n, deque<ll>(n - 1));
FOR(i, 0, n) { VIN(a[i]); }
unordered_set<ll> yesterday;
FOR(i, 0, n) yesterday.insert(i);
while (true) {
bool updated = false;
unordered_set<ll> done;
for (auto itr = yesterday.begin(); itr != yesterday.end(); ++itr) {
// FOR(i,0,n) {
ll i = *itr;
if (a[i].empty())
continue;
if (done.find(i) != done.end())
continue;
ll aite = a[i].front() - 1;
if (done.find(aite) != done.end())
continue;
if (a[aite].front() == i + 1) {
a[i].pop_front();
a[aite].pop_front();
done.insert(i);
done.insert(aite);
updated = true;
}
}
// VOUT2(a);
yesterday = done;
ans++;
if (!updated)
break;
}
bool flg = true;
FOR(i, 0, n) {
if (!a[i].empty()) {
flg = false;
break;
}
}
if (flg)
OUT(ans - 1);
else
OUT(-1);
}
| replace | 79 | 80 | 79 | 80 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define dom 998244353
#define all(c) begin(c), end(c)
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
#define long long long
#define List vector
#define var auto
#define Count size()
#define Length size()
int dd[] = {0, 1, 0, -1, 0}; // →↓←↑
int A[1024][1024];
int B[1024];
bool U[1024];
void solve() {
int N;
cin >> N;
var A = vector<vector<int>>(N, vector<int>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> A[i][j];
A[i][j]--;
}
}
int okcnt = 0;
int cnt = 0;
while (okcnt < N) {
rep(i, N) U[i] = false;
bool flag = false;
for (int i = 0; i < N; i++) {
if (U[i])
continue;
if (B[i] == N - 1)
continue;
int rival = A[i][B[i]];
if (U[rival])
continue;
if (A[rival][B[rival]] == i) {
U[i] = true;
U[rival] = true;
flag = true;
B[i]++;
B[rival]++;
if (B[rival] == N - 1)
okcnt++;
if (B[i] == N - 1)
okcnt++;
}
}
if (!flag) {
cout << ("-1") << endl;
return;
}
cnt++;
}
cout << (cnt) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define dom 998244353
#define all(c) begin(c), end(c)
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
#define long long long
#define List vector
#define var auto
#define Count size()
#define Length size()
int dd[] = {0, 1, 0, -1, 0}; // →↓←↑
int A[1024][1024];
int B[1024];
bool U[1024];
void solve() {
int N;
cin >> N;
var A = vector<vector<int>>(N, vector<int>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> A[i][j];
A[i][j]--;
}
}
int okcnt = 0;
int cnt = 0;
while (okcnt < N) {
if (cnt > N * (N - 1) / 2) {
cout << ("-1") << endl;
return;
}
rep(i, N) U[i] = false;
bool flag = false;
for (int i = 0; i < N; i++) {
if (U[i])
continue;
if (B[i] == N - 1)
continue;
int rival = A[i][B[i]];
if (U[rival])
continue;
if (A[rival][B[rival]] == i) {
U[i] = true;
U[rival] = true;
flag = true;
B[i]++;
B[rival]++;
if (B[rival] == N - 1)
okcnt++;
if (B[i] == N - 1)
okcnt++;
}
}
if (!flag) {
cout << ("-1") << endl;
return;
}
cnt++;
}
cout << (cnt) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| insert | 46 | 46 | 46 | 50 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n - 1));
rep(i, n) {
rep(j, n - 1) {
cin >> a[i][j];
a[i][j]--;
}
reverse(a[i].begin(), a[i].end());
}
vector<P> q;
auto check = [&](int i) {
if (a[i].size() == 0)
return;
int j = a[i].back();
if (a[j].size() == 0)
return;
if (a[j].back() == i) {
P p(i, j);
if (p.second < p.first)
swap(p.first, p.second);
q.push_back(p);
}
};
rep(i, n) { check(i); }
int day = 0;
while (q.size() > 0) {
day++;
sort(q.begin(), q.end());
q.erase(unique(q.begin(), q.end()), q.end());
vector<P> prevQ;
for (P p : prevQ) {
int i = p.first, j = p.second;
a[i].pop_back();
a[j].pop_back();
}
for (P p : prevQ) {
int i = p.first, j = p.second;
check(i);
check(j);
}
}
rep(i, n) {
if (a[i].size() != 0) {
puts("-1");
return 0;
}
}
cout << day << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n - 1));
rep(i, n) {
rep(j, n - 1) {
cin >> a[i][j];
a[i][j]--;
}
reverse(a[i].begin(), a[i].end());
}
vector<P> q;
auto check = [&](int i) {
if (a[i].size() == 0)
return;
int j = a[i].back();
if (a[j].size() == 0)
return;
if (a[j].back() == i) {
P p(i, j);
if (p.second < p.first)
swap(p.first, p.second);
q.push_back(p);
}
};
rep(i, n) { check(i); }
int day = 0;
while (q.size() > 0) {
day++;
sort(q.begin(), q.end());
q.erase(unique(q.begin(), q.end()), q.end());
vector<P> prevQ;
swap(prevQ, q);
for (P p : prevQ) {
int i = p.first, j = p.second;
a[i].pop_back();
a[j].pop_back();
}
for (P p : prevQ) {
int i = p.first, j = p.second;
check(i);
check(j);
}
}
rep(i, n) {
if (a[i].size() != 0) {
puts("-1");
return 0;
}
}
cout << day << endl;
return 0;
}
| insert | 38 | 38 | 38 | 39 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> A[i][j];
A[i][j]--;
}
}
vector<int> cnt(N, 0);
int ans = 0;
time_t s, t;
time(&s);
while (1) {
ans++;
int flag2 = 0;
time(&t);
if (t - s > 1) {
cout << N * (N - 1) / 2 << endl;
return 0;
}
vector<int> used(N, 0);
for (int i = 0; i < N; i++) {
int ind = A[i][cnt[i]];
if (used[i] == 1 || used[ind] == 1 || cnt[i] == N - 1)
continue;
if (A[ind][cnt[ind]] == i) {
cnt[i]++;
cnt[ind]++;
used[i] = 1;
used[ind] = 1;
flag2 = 1;
}
}
if (flag2 == 0) {
cout << -1 << endl;
return 0;
}
int flag = 0;
for (int i = 0; i < N; i++) {
if (cnt[i] != N - 1)
flag = 1;
}
if (flag == 0)
break;
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> A[i][j];
A[i][j]--;
}
}
vector<int> cnt(N, 0);
int ans = 0;
time_t s, t;
time(&s);
while (1) {
ans++;
int flag2 = 0;
time(&t);
if (t - s > 0) {
cout << N * (N - 1) / 2 << endl;
return 0;
}
vector<int> used(N, 0);
for (int i = 0; i < N; i++) {
int ind = A[i][cnt[i]];
if (used[i] == 1 || used[ind] == 1 || cnt[i] == N - 1)
continue;
if (A[ind][cnt[ind]] == i) {
cnt[i]++;
cnt[ind]++;
used[i] = 1;
used[ind] = 1;
flag2 = 1;
}
}
if (flag2 == 0) {
cout << -1 << endl;
return 0;
}
int flag = 0;
for (int i = 0; i < N; i++) {
if (cnt[i] != N - 1)
flag = 1;
}
if (flag == 0)
break;
}
cout << ans << endl;
} | replace | 23 | 24 | 23 | 24 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define radrad(a) 180.0 * a / M_PI
#define pow(x) x *x
#define ll long long
static const int MAX = 100010;
static const ll INFTY = 1e12;
static const int NUMMAX = 300;
int change(int N, int a, int b) {
int ans = 0;
int tmp;
if (a > b)
swap(a, b);
tmp = a - 1;
REP(i, tmp) {
N--;
ans += N;
}
return ans + (b - a - 1);
}
int toposort(int N, vector<int> G[MAX], int h[MAX]) {
// 入次数が0の頂点の集合
stack<int> st;
int ansans = 0;
int dp[MAX] = {
0,
};
// 入次数が0の頂点であればstに追加
REP(i, N) if (h[i] == 0) st.push(i);
// ソートされた後のグラフ
vector<int> ans;
// stがなくなるまでループ
while (st.size()) {
// stの集合のから一つ取り出す
int i = st.top();
st.pop();
ans.push_back(i);
for (auto &j : G[i]) {
// 隣接する頂点の入次数をマイナス1
h[j]--;
dp[j] = max(dp[j], dp[i] + 1);
ansans = max(ansans, dp[j]);
// これによって入次数が0になればstに追加
if (h[j] == 0)
st.push(j);
}
}
if (ans.size() != N) {
ansans = -2;
}
return ansans;
}
int main() {
// int M[MAX][MAX] = {0,};
int hash;
int tmpi, tmpj;
int maehash;
int N;
int hyouN;
vector<int> G[MAX];
// 頂点の入次数を管理
int h[MAX] = {
0,
};
int ans;
cin >> N;
REP(i, N) {
tmpi = i + 1;
REP(j, N - 1) {
cin >> tmpj;
hash = change(N, tmpi, tmpj);
if (j != 0) {
// if(M[maehash][hash] == 0){
// M[maehash][hash] = 1;
G[maehash].push_back(hash);
h[hash]++;
// }
}
maehash = hash;
}
}
hyouN = 1;
for (int i = 2; i < N; i++) {
hyouN += i;
}
ans = toposort(hyouN, G, h);
cout << ans + 1 << endl;
return 0;
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/ | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define radrad(a) 180.0 * a / M_PI
#define pow(x) x *x
#define ll long long
static const int MAX = 1000010;
static const ll INFTY = 1e12;
static const int NUMMAX = 300;
int change(int N, int a, int b) {
int ans = 0;
int tmp;
if (a > b)
swap(a, b);
tmp = a - 1;
REP(i, tmp) {
N--;
ans += N;
}
return ans + (b - a - 1);
}
int toposort(int N, vector<int> G[MAX], int h[MAX]) {
// 入次数が0の頂点の集合
stack<int> st;
int ansans = 0;
int dp[MAX] = {
0,
};
// 入次数が0の頂点であればstに追加
REP(i, N) if (h[i] == 0) st.push(i);
// ソートされた後のグラフ
vector<int> ans;
// stがなくなるまでループ
while (st.size()) {
// stの集合のから一つ取り出す
int i = st.top();
st.pop();
ans.push_back(i);
for (auto &j : G[i]) {
// 隣接する頂点の入次数をマイナス1
h[j]--;
dp[j] = max(dp[j], dp[i] + 1);
ansans = max(ansans, dp[j]);
// これによって入次数が0になればstに追加
if (h[j] == 0)
st.push(j);
}
}
if (ans.size() != N) {
ansans = -2;
}
return ansans;
}
int main() {
// int M[MAX][MAX] = {0,};
int hash;
int tmpi, tmpj;
int maehash;
int N;
int hyouN;
vector<int> G[MAX];
// 頂点の入次数を管理
int h[MAX] = {
0,
};
int ans;
cin >> N;
REP(i, N) {
tmpi = i + 1;
REP(j, N - 1) {
cin >> tmpj;
hash = change(N, tmpi, tmpj);
if (j != 0) {
// if(M[maehash][hash] == 0){
// M[maehash][hash] = 1;
G[maehash].push_back(hash);
h[hash]++;
// }
}
maehash = hash;
}
}
hyouN = 1;
for (int i = 2; i < N; i++) {
hyouN += i;
}
ans = toposort(hyouN, G, h);
cout << ans + 1 << endl;
return 0;
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/ | replace | 7 | 8 | 7 | 8 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
queue<int> a[1001];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j < n; j++) {
int x;
cin >> x;
a[i].push(x);
}
}
int sc = n * (n - 1) / 2;
// cout<<sc<<endl;
int cnt = 0;
while (sc > 0) {
// cout<<sc<<endl;
vector<int> temp;
for (int i = 1; i <= n; i++) {
// int t=a[i].front();
if (a[a[i].front()].front() == i && i < a[i].front()) {
// cout<<i<<" "<<a[i][0]<<endl;
temp.push_back(i);
temp.push_back(a[i].front());
}
}
if (temp.size() == 0) {
cout << -1;
return 0;
}
// cout<<"fdf"<<endl;
cnt++;
for (int i = 0; i < temp.size(); i++) {
a[temp[i]].pop();
}
sc -= (temp.size() / 2);
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
queue<int> a[1001];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j < n; j++) {
int x;
cin >> x;
a[i].push(x);
}
}
int sc = n * (n - 1) / 2;
// cout<<sc<<endl;
int cnt = 0;
while (sc > 0) {
// cout<<sc<<endl;
vector<int> temp;
for (int i = 1; i <= n; i++) {
// int t=a[i].front();
if (a[a[i].front()].front() == i && i < a[i].front()) {
// cout<<i<<" "<<a[i][0]<<endl;
temp.push_back(i);
temp.push_back(a[i].front());
continue;
}
}
if (temp.size() == 0) {
cout << -1;
return 0;
}
// cout<<"fdf"<<endl;
cnt++;
for (int i = 0; i < temp.size(); i++) {
a[temp[i]].pop();
}
sc -= (temp.size() / 2);
}
cout << cnt << endl;
}
| insert | 27 | 27 | 27 | 28 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define loop(n) \
for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); \
ngtkana_is_genius++)
#define rep(i, begin, end) for (int i = int(begin); i < int(end); i++)
#define lint long long
auto cmn = [](auto &a, auto b) {
if (a > b) {
a = b;
return true;
}
return false;
};
auto cmx = [](auto &a, auto b) {
if (a < b) {
a = b;
return true;
}
return false;
};
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
std::cerr << " " << head;
debug_impl(tail...);
}
#define debug(...) \
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
std::cerr << std::noboolalpha;
template <typename T> auto make_vector_impl(size_t sz, T t) {
return std::vector<T>(sz, t);
}
template <size_t N, typename T, typename U,
std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz, U u) {
return make_vector_impl(sz, T(u));
}
template <size_t N, typename T,
std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz) {
return std::vector<T>(sz);
}
template <size_t N, typename T, typename... Args,
std::enable_if_t<N != 1, std::nullptr_t> = nullptr>
auto make_vector(size_t a, Args... args) {
return make_vector_impl(a, make_vector<N - 1, T>(args...));
}
template <typename T, typename Size_t> auto &at(T &t, Size_t i) {
return t.at(i);
}
template <typename T, typename Size_t, typename... Args>
auto &at(T &t, Size_t i, Args... args) {
return at(t.at(i), args...);
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &pair) {
return os << "(" << pair.first << "," << pair.second << ")";
}
template <typename T, typename U>
std::istream &operator>>(std::iostream &is, std::pair<T, U> &pair) {
return is >> pair.first >> pair.second;
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
auto n = v.size();
os << "{";
for (size_t i = 0; i < n; i++)
os << (i > 0 ? "," : "") << v[i];
return os << "}";
}
template <typename T> class fixed_point : T {
public:
explicit constexpr fixed_point(T &&t) noexcept : T(std::forward<T>(t)) {}
template <typename... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return T::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename T>
static inline constexpr decltype(auto) fix(T &&t) noexcept {
return fixed_point<T>{std::forward<T>(t)};
}
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
int n;
std::cin >> n;
auto N = n * (n - 1) / 2;
std::vector<std::pair<int, int>> table(N);
auto encode = [&](int i, int j) {
if (i < j)
std::swap(i, j);
return i * (i - 1) / 2 + j;
};
auto list = make_vector<2, int>(n, n - 1);
rep(i, 0, n) {
rep(j, 0, n) {
if (i == j)
continue;
auto code = encode(i, j);
if (i > j)
table.at(code) = {i, j};
int x;
std::cin >> x;
x--;
at(list, i, j - (i < j)) = encode(i, x);
}
}
auto graph = make_vector<2, int>(N, 0);
for (auto const &v : list) {
rep(j, 0, n - 2) { graph.at(v.at(j)).push_back(v.at(j + 1)); }
}
auto err = [&] {
std::cout << -1 << std::endl;
exit(0);
};
std::vector<int> dp(N, 0);
std::vector<int> ckd(N, 0);
auto cal = fix([&](auto f, int crr) -> int {
ckd.at(crr) = 1;
for (auto nxt : graph.at(crr)) {
if (ckd.at(nxt) == 1)
err();
cmx(dp.at(crr), f(nxt) + 1);
}
ckd.at(crr) = 2;
return dp.at(crr);
});
rep(i, 0, N) {
if (ckd.at(i) == 0)
cal(i);
}
auto ret = *max_element(dp.begin(), dp.end()) + 1;
std::cout << ret << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#define loop(n) \
for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); \
ngtkana_is_genius++)
#define rep(i, begin, end) for (int i = int(begin); i < int(end); i++)
#define lint long long
auto cmn = [](auto &a, auto b) {
if (a > b) {
a = b;
return true;
}
return false;
};
auto cmx = [](auto &a, auto b) {
if (a < b) {
a = b;
return true;
}
return false;
};
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
std::cerr << " " << head;
debug_impl(tail...);
}
#define debug(...) \
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
std::cerr << std::noboolalpha;
template <typename T> auto make_vector_impl(size_t sz, T t) {
return std::vector<T>(sz, t);
}
template <size_t N, typename T, typename U,
std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz, U u) {
return make_vector_impl(sz, T(u));
}
template <size_t N, typename T,
std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz) {
return std::vector<T>(sz);
}
template <size_t N, typename T, typename... Args,
std::enable_if_t<N != 1, std::nullptr_t> = nullptr>
auto make_vector(size_t a, Args... args) {
return make_vector_impl(a, make_vector<N - 1, T>(args...));
}
template <typename T, typename Size_t> auto &at(T &t, Size_t i) {
return t.at(i);
}
template <typename T, typename Size_t, typename... Args>
auto &at(T &t, Size_t i, Args... args) {
return at(t.at(i), args...);
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &pair) {
return os << "(" << pair.first << "," << pair.second << ")";
}
template <typename T, typename U>
std::istream &operator>>(std::iostream &is, std::pair<T, U> &pair) {
return is >> pair.first >> pair.second;
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
auto n = v.size();
os << "{";
for (size_t i = 0; i < n; i++)
os << (i > 0 ? "," : "") << v[i];
return os << "}";
}
template <typename T> class fixed_point : T {
public:
explicit constexpr fixed_point(T &&t) noexcept : T(std::forward<T>(t)) {}
template <typename... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return T::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename T>
static inline constexpr decltype(auto) fix(T &&t) noexcept {
return fixed_point<T>{std::forward<T>(t)};
}
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
int n;
std::cin >> n;
auto N = n * (n - 1) / 2;
std::vector<std::pair<int, int>> table(N);
auto encode = [&](int i, int j) {
if (i < j)
std::swap(i, j);
return i * (i - 1) / 2 + j;
};
auto list = make_vector<2, int>(n, n - 1);
rep(i, 0, n) {
rep(j, 0, n) {
if (i == j)
continue;
auto code = encode(i, j);
if (i > j)
table.at(code) = {i, j};
int x;
std::cin >> x;
x--;
at(list, i, j - (i < j)) = encode(i, x);
}
}
auto graph = make_vector<2, int>(N, 0);
for (auto const &v : list) {
rep(j, 0, n - 2) { graph.at(v.at(j)).push_back(v.at(j + 1)); }
}
auto err = [&] {
std::cout << -1 << std::endl;
exit(0);
};
std::vector<int> dp(N, 0);
std::vector<int> ckd(N, 0);
auto cal = fix([&](auto f, int crr) -> int {
if (ckd.at(crr) == 2)
return dp.at(crr);
ckd.at(crr) = 1;
for (auto nxt : graph.at(crr)) {
if (ckd.at(nxt) == 1)
err();
cmx(dp.at(crr), f(nxt) + 1);
}
ckd.at(crr) = 2;
return dp.at(crr);
});
rep(i, 0, N) {
if (ckd.at(i) == 0)
cal(i);
}
auto ret = *max_element(dp.begin(), dp.end()) + 1;
std::cout << ret << std::endl;
return 0;
}
| insert | 138 | 138 | 138 | 140 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
int main() {
int n;
cin >> n;
vector<deque<int>> a(n);
REP(i, n) {
REP(j, n - 1) {
int aa;
cin >> aa;
a[i].push_back(aa - 1);
}
}
int ans = 0;
int aaaaa = n * (n - 1) / 2;
bool fffff = true;
for (;;) {
vector<bool> f(n, false);
bool comp = true;
bool all_f = true;
REP(j, n) {
if (a[j].empty())
continue;
comp = false;
int enemy = a[j].front();
int enemy_to_enemy = a[enemy].front();
if (f[enemy])
continue;
if (j != enemy_to_enemy)
continue;
f[j] = true;
f[enemy] = true;
all_f = false;
// cout << enemy << " " << enemy_to_enemy << endl;
}
if (comp)
break;
if (all_f) {
ans = -1;
break;
}
ans++;
int c = 0;
REP(i, n) {
if (f[i]) {
a[i].pop_front();
c++;
}
}
if (ans > 10000000) {
cout << aaaaa << endl;
return 0;
}
// cout << ans << endl;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
int main() {
int n;
cin >> n;
vector<deque<int>> a(n);
REP(i, n) {
REP(j, n - 1) {
int aa;
cin >> aa;
a[i].push_back(aa - 1);
}
}
int ans = 0;
int aaaaa = n * (n - 1) / 2;
bool fffff = true;
for (;;) {
vector<bool> f(n, false);
bool comp = true;
bool all_f = true;
REP(j, n) {
if (a[j].empty())
continue;
comp = false;
int enemy = a[j].front();
int enemy_to_enemy = a[enemy].front();
if (f[enemy])
continue;
if (j != enemy_to_enemy)
continue;
f[j] = true;
f[enemy] = true;
all_f = false;
// cout << enemy << " " << enemy_to_enemy << endl;
}
if (comp)
break;
if (all_f) {
ans = -1;
break;
}
ans++;
int c = 0;
REP(i, n) {
if (f[i]) {
a[i].pop_front();
c++;
}
}
if (ans > 100000) {
cout << aaaaa << endl;
return 0;
}
// cout << ans << endl;
}
cout << ans << endl;
return 0;
} | replace | 62 | 63 | 62 | 63 | TLE | |
p02925 | C++ | Runtime Error | // https://atcoder.jp/contests/abc139/tasks/abc139_e
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
// ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, t, cnt = 0;
cin >> n;
vector<queue<int>> q(n);
REP(i, n) REP(j, n - 1) {
cin >> t;
q[i].push(t - 1);
}
set<pii> st;
set<int> sl;
REP(i, n) sl.insert(i);
while (true) {
// 全てのキューが空なら終了
if (sl.size() == 0) {
break;
}
set<int> sk;
bool nfound = true;
// 前回更新したペアのみ
for (auto i : sl) {
pii p = {i, q[i].front()};
if (p.first > p.second) {
swap(p.first, p.second);
}
if (st.count(p) == 0) {
st.insert(p);
} else {
nfound = false;
q[p.first].pop();
q[p.second].pop();
sk.insert(p.first);
sk.insert(p.second);
}
}
if (nfound) {
cnt = -1;
break;
}
sl = sk;
cnt++;
}
cout << cnt << endl;
return 0;
}
| // https://atcoder.jp/contests/abc139/tasks/abc139_e
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
// ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, t, cnt = 0;
cin >> n;
vector<queue<int>> q(n);
REP(i, n) REP(j, n - 1) {
cin >> t;
q[i].push(t - 1);
}
set<pii> st;
set<int> sl;
REP(i, n) sl.insert(i);
while (true) {
// 全てのキューが空なら終了
if (sl.size() == 0) {
break;
}
set<int> sk;
bool nfound = true;
// 前回更新したペアのみ
for (auto i : sl) {
pii p = {i, q[i].front()};
if (p.first > p.second) {
swap(p.first, p.second);
}
if (st.count(p) == 0) {
st.insert(p);
} else {
nfound = false;
q[p.first].pop();
q[p.second].pop();
if (!q[p.first].empty()) {
sk.insert(p.first);
}
if (!q[p.second].empty()) {
sk.insert(p.second);
}
}
}
if (nfound) {
cnt = -1;
break;
}
sl = sk;
cnt++;
}
cout << cnt << endl;
return 0;
}
| replace | 49 | 51 | 49 | 55 | -11 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e3;
vector<vector<int>> G((MAX_N + 1) * (MAX_N + 1));
vector<int> dis(MAX_N, -1);
vector<bool> start(MAX_N, false);
vector<bool> done(MAX_N, false);
int dfs(int obj) {
if (start[obj]) {
if (!done[obj])
return -1;
return dis[obj];
} else {
start[obj] = true;
int k = 0;
for (int x : G[obj]) {
int l = dfs(x);
if (l == -1)
return -1;
else
k = max(k, l);
}
done[obj] = true;
dis[obj] = k + 1;
return dis[obj];
}
}
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
int a;
cin >> a;
int k = (max(a, i) - 1) * (max(a, i) - 2) / 2 + min(a, i);
for (int j = 0; j < N - 2; j++) {
int a;
cin >> a;
int l = (max(a, i) - 1) * (max(a, i) - 2) / 2 + min(a, i);
G[k].push_back(l);
k = l;
}
}
int k = 0;
for (int i = 1; i <= N * (N - 1) / 2; i++) {
if (dfs(i) == -1) {
k = -1;
break;
} else {
k = max(k, dfs(i));
}
}
cout << k << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000;
vector<vector<int>> G(MAX_N *(MAX_N - 1) / 2 + 1);
vector<int> dis(MAX_N *(MAX_N - 1) / 2 + 1, -1);
vector<bool> start(MAX_N *(MAX_N - 1) / 2 + 1, false);
vector<bool> done(MAX_N *(MAX_N - 1) / 2 + 1, false);
int dfs(int obj) {
if (start[obj]) {
if (!done[obj])
return -1;
return dis[obj];
} else {
start[obj] = true;
int k = 0;
for (int x : G[obj]) {
int l = dfs(x);
if (l == -1)
return -1;
else
k = max(k, l);
}
done[obj] = true;
dis[obj] = k + 1;
return dis[obj];
}
}
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
int a;
cin >> a;
int k = (max(a, i) - 1) * (max(a, i) - 2) / 2 + min(a, i);
for (int j = 0; j < N - 2; j++) {
int a;
cin >> a;
int l = (max(a, i) - 1) * (max(a, i) - 2) / 2 + min(a, i);
G[k].push_back(l);
k = l;
}
}
int k = 0;
for (int i = 1; i <= N * (N - 1) / 2; i++) {
if (dfs(i) == -1) {
k = -1;
break;
} else {
k = max(k, dfs(i));
}
}
cout << k << endl;
}
| replace | 3 | 8 | 3 | 8 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR_LT(i, beg, end) for (int i = beg; i < end; i++)
#define FOR_LE(i, beg, end) for (int i = beg; i <= end; i++)
#define FOR_DW(i, beg, end) for (int i = beg; end <= i; i--)
using namespace std;
bool is_finised(vector<int> &poss, int n) {
FOR_LT(i, 0, n) {
if (poss[i] != n - 1)
return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<vector<int>> as(n, vector<int>(n - 1));
FOR_LT(i, 0, n) {
FOR_LT(j, 0, n - 1) {
cin >> as[i][j];
as[i][j]--;
}
}
vector<int> poss(n);
int d = 0;
while (!is_finised(poss, n)) {
vector<bool> used(n);
bool has_pair = false;
FOR_LT(i, 0, n) {
if (poss[i] == n - 1)
continue;
if (used[i])
continue;
int c = as[i][poss[i]];
if (used[c])
continue;
if (as[c][poss[c]] == i) {
poss[i]++;
poss[c]++;
used[i] = true;
used[c] = true;
has_pair = true;
}
}
if (!has_pair) {
cout << -1 << endl;
return 0;
}
d++;
}
cout << d << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR_LT(i, beg, end) for (int i = beg; i < end; i++)
#define FOR_LE(i, beg, end) for (int i = beg; i <= end; i++)
#define FOR_DW(i, beg, end) for (int i = beg; end <= i; i--)
using namespace std;
bool is_finised(vector<int> &poss, int n) {
FOR_LT(i, 0, n) {
if (poss[i] != n - 1)
return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<vector<int>> as(n, vector<int>(n - 1));
FOR_LT(i, 0, n) {
FOR_LT(j, 0, n - 1) {
cin >> as[i][j];
as[i][j]--;
}
}
vector<int> poss(n);
int d = 0;
queue<pair<int, int>> pair;
{
vector<bool> used(n);
FOR_LT(i, 0, n) {
if (poss[i] == n - 1)
continue;
if (used[i])
continue;
int c = as[i][poss[i]];
if (used[c])
continue;
if (as[c][poss[c]] == i) {
pair.push({i, c});
used[i] = true;
used[c] = true;
}
}
}
int p = 0;
while (p != (n * (n - 1) / 2)) {
if (pair.empty()) {
cout << -1 << endl;
return 0;
}
queue<int> ps;
while (!pair.empty()) {
auto c = pair.front();
pair.pop();
p++;
poss[c.first]++;
poss[c.second]++;
ps.push(c.first);
ps.push(c.second);
}
vector<bool> used(n);
while (!ps.empty()) {
int i = ps.front();
ps.pop();
if (poss[i] == n - 1)
continue;
if (used[i])
continue;
int c = as[i][poss[i]];
if (used[c])
continue;
if (as[c][poss[c]] == i) {
pair.push({i, c});
used[i] = true;
used[c] = true;
}
}
d++;
}
while (!is_finised(poss, n)) {
vector<bool> used(n);
bool has_pair = false;
FOR_LT(i, 0, n) {
if (poss[i] == n - 1)
continue;
if (used[i])
continue;
int c = as[i][poss[i]];
if (used[c])
continue;
if (as[c][poss[c]] == i) {
poss[i]++;
poss[c]++;
used[i] = true;
used[c] = true;
has_pair = true;
}
}
if (!has_pair) {
cout << -1 << endl;
return 0;
}
d++;
}
cout << d << endl;
return 0;
} | insert | 54 | 54 | 54 | 118 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...) \
([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...) \
([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) cerr << a[_i][_j] << sp; \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) if (_i) cerr << sp << a[_i]; \
else cerr << a[_i]; \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i))
r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
signed main() {
ll N, X;
cin >> N;
deque<ll> A[N];
rep(i, N) rep(j, N - 1) cin >> X, A[i].push_back(X);
ll num = N * (N - 1) / 2, d = 0;
queue<ll> Q, Q2;
rep(i, N) Q.push(i);
while (Q.size()) {
map<ll, ll> B;
while (Q.size()) {
ll i = Q.front();
Q.pop();
if (A[i].size() and A[A[i].front() - 1].size() and B[i] == 0 and
B[A[i].front() - 1] == 0 and A[A[i].front() - 1].front() - 1 == i) {
B[i] = B[A[i].front() - 1] = 1;
num--;
if (A[i].size() > 1)
Q2.push(i);
if (A[A[i].front() - 1].size() > 1)
Q2.push(A[i].front() - 1);
A[A[i].front() - 1].pop_front();
A[i].pop_front();
}
}
d++;
Q = Q2;
}
if (num) {
cout << -1 << rt;
} else {
cout << d << rt;
}
}
// -g -D_GLIBCXX_DEBUG -fsanitize=undefined
| #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...) \
([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...) \
([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) cerr << a[_i][_j] << sp; \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) if (_i) cerr << sp << a[_i]; \
else cerr << a[_i]; \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i))
r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
signed main() {
ll N, X;
cin >> N;
deque<ll> A[N];
rep(i, N) rep(j, N - 1) cin >> X, A[i].push_back(X);
ll num = N * (N - 1) / 2, d = 0;
queue<ll> Q, Q2;
rep(i, N) Q.push(i);
while (Q.size()) {
map<ll, ll> B;
while (Q.size()) {
ll i = Q.front();
Q.pop();
if (A[i].size() and A[A[i].front() - 1].size() and B[i] == 0 and
B[A[i].front() - 1] == 0 and A[A[i].front() - 1].front() - 1 == i) {
B[i] = B[A[i].front() - 1] = 1;
num--;
if (A[i].size() > 1)
Q2.push(i);
if (A[A[i].front() - 1].size() > 1)
Q2.push(A[i].front() - 1);
A[A[i].front() - 1].pop_front();
A[i].pop_front();
}
}
d++;
move(Q) = move(Q2);
}
if (num) {
cout << -1 << rt;
} else {
cout << d << rt;
}
}
// -g -D_GLIBCXX_DEBUG -fsanitize=undefined
| replace | 151 | 152 | 151 | 152 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
typedef vector<ll> Edges;
typedef vector<Edges> Graph;
const ll V_MAX = 101010;
vector<ll> ts(V_MAX, -1);
int topologicalSort(Graph &G) {
ll V = G.size();
vector<ll> indeg(V, 0);
queue<ll> qu;
REP(i, V) {
REP(j, G[i].size()) { indeg[G[i][j]]++; }
}
REP(i, V) {
if (!indeg[i])
qu.push(i);
}
ll depth = 0;
while (!qu.empty()) {
ll s = qu.size();
REP(i, s) {
ll now = qu.front();
qu.pop();
ts[now] = depth;
REP(j, G[now].size()) {
ll next = G[now][j];
indeg[next]--;
if (!indeg[next])
qu.push(next);
}
}
depth++;
}
REP(i, V) {
if (ts[i] == -1)
return -1;
}
return depth;
}
struct battle {
ll x, y;
bool operator<(const battle &right) const {
return (x != right.x ? x < right.x : y < right.y);
}
};
vector<battle> id2b(1010101);
map<battle, ll> b2id;
ll V;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll now = 0;
REP(i, N) {
REP(j, N) {
if (i >= j)
continue;
battle b = {i, j};
id2b[now] = b;
now++;
}
}
V = N * (N - 1) / 2;
REP(i, V) { b2id[id2b[i]] = i; }
Graph G(V);
REP(i, N) {
vector<ll> tmp(N - 1);
REP(j, N - 1) cin >> tmp[j], tmp[j]--;
REP(j, N - 2) {
ll x1, y1, x2, y2;
x1 = i;
y1 = tmp[j];
x2 = i;
y2 = tmp[j + 1];
if (x1 > y1)
swap(x1, y1);
if (x2 > y2)
swap(x2, y2);
battle b1 = {x1, y1}, b2 = {x2, y2};
G[b2id[b1]].push_back(b2id[b2]);
}
}
int res = topologicalSort(G);
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
typedef vector<ll> Edges;
typedef vector<Edges> Graph;
const ll V_MAX = 1010101;
vector<ll> ts(V_MAX, -1);
int topologicalSort(Graph &G) {
ll V = G.size();
vector<ll> indeg(V, 0);
queue<ll> qu;
REP(i, V) {
REP(j, G[i].size()) { indeg[G[i][j]]++; }
}
REP(i, V) {
if (!indeg[i])
qu.push(i);
}
ll depth = 0;
while (!qu.empty()) {
ll s = qu.size();
REP(i, s) {
ll now = qu.front();
qu.pop();
ts[now] = depth;
REP(j, G[now].size()) {
ll next = G[now][j];
indeg[next]--;
if (!indeg[next])
qu.push(next);
}
}
depth++;
}
REP(i, V) {
if (ts[i] == -1)
return -1;
}
return depth;
}
struct battle {
ll x, y;
bool operator<(const battle &right) const {
return (x != right.x ? x < right.x : y < right.y);
}
};
vector<battle> id2b(1010101);
map<battle, ll> b2id;
ll V;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll now = 0;
REP(i, N) {
REP(j, N) {
if (i >= j)
continue;
battle b = {i, j};
id2b[now] = b;
now++;
}
}
V = N * (N - 1) / 2;
REP(i, V) { b2id[id2b[i]] = i; }
Graph G(V);
REP(i, N) {
vector<ll> tmp(N - 1);
REP(j, N - 1) cin >> tmp[j], tmp[j]--;
REP(j, N - 2) {
ll x1, y1, x2, y2;
x1 = i;
y1 = tmp[j];
x2 = i;
y2 = tmp[j + 1];
if (x1 > y1)
swap(x1, y1);
if (x2 > y2)
swap(x2, y2);
battle b1 = {x1, y1}, b2 = {x2, y2};
G[b2id[b1]].push_back(b2id[b2]);
}
}
int res = topologicalSort(G);
cout << res << endl;
return 0;
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define lfs << fixed << setprecision(10) <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define MP make_pair
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n - 1; i >= (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void pmod(ll &a, ll b, ll c) { a = (b + c) % MOD; }
void qmod(ll &a, ll b) { a = (a * b) % MOD; }
void qmod(ll &a, ll b, ll c) { a = (b * c) % MOD; }
ll median(ll a, ll b, ll c) {
return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool x) {
if (x)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void ans3(bool x) {
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
template <typename T1, typename T2> void ans(bool x, T1 y, T2 z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
template <typename T> void debug(vector<vector<T>> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
cout << v[i][0];
for (ll j = 1; j < w; j++)
cout spa v[i][j];
cout << endl;
}
};
void debug(vector<string> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++)
cout << v[i][j];
cout << endl;
}
};
template <typename T> void debug(vector<T> v, ll n) {
cout << v[0];
for (ll i = 1; i < n; i++)
cout spa v[i];
cout << endl;
};
template <typename T> vector<vector<T>> vec(ll x, ll y, T w) {
vector<vector<T>> v(x, vector<T>(y, w));
return v;
}
ll gcd(ll x, ll y) {
ll r;
while (y != 0 && (r = x % y) != 0) {
x = y;
y = r;
}
return y == 0 ? x : y;
}
template <typename T> void emp(map<T, ll> &m, T x) {
m.emplace(x, 0).first->second++;
}
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
ll res = 0, res1 = INF, res2 = -INF, buf = 0;
bool judge = true;
ll n;
cin >> n;
vector<queue<ll>> q(n);
rep(i, 0, n) {
rep(j, 0, n - 1) {
ll x;
cin >> x;
x--;
q[i].push(x);
}
}
queue<ll> a;
rep(i, 0, n) a.push(i);
a.push(-1);
ll cnt = 0;
vector<ll> t(n, -1);
while (!a.empty()) {
ll x = a.front();
if (x == -1) {
if (a.size() != 1)
a.push(-1);
cnt++;
a.pop();
} else {
ll y = -1;
if (!q[x].empty())
y = q[x].front();
ll z = -2;
if (y != -1 && !q[y].empty())
z = q[y].front();
if (x == z && t[x] != cnt && t[y] != cnt) {
q[x].pop();
q[y].pop();
t[x] = cnt;
t[y] = cnt;
if (!q[x].empty())
a.push(x);
if (!q[y].empty())
a.push(y);
} else if (x == z) {
a.push(x);
}
a.pop();
}
}
rep(i, 0, n) {
if (q[i].size() != 0)
judge = false;
}
if (judge)
cout << cnt << endl;
else
cout << -1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define lfs << fixed << setprecision(10) <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define MP make_pair
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n - 1; i >= (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void pmod(ll &a, ll b, ll c) { a = (b + c) % MOD; }
void qmod(ll &a, ll b) { a = (a * b) % MOD; }
void qmod(ll &a, ll b, ll c) { a = (b * c) % MOD; }
ll median(ll a, ll b, ll c) {
return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool x) {
if (x)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void ans3(bool x) {
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
template <typename T1, typename T2> void ans(bool x, T1 y, T2 z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
template <typename T> void debug(vector<vector<T>> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
cout << v[i][0];
for (ll j = 1; j < w; j++)
cout spa v[i][j];
cout << endl;
}
};
void debug(vector<string> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++)
cout << v[i][j];
cout << endl;
}
};
template <typename T> void debug(vector<T> v, ll n) {
cout << v[0];
for (ll i = 1; i < n; i++)
cout spa v[i];
cout << endl;
};
template <typename T> vector<vector<T>> vec(ll x, ll y, T w) {
vector<vector<T>> v(x, vector<T>(y, w));
return v;
}
ll gcd(ll x, ll y) {
ll r;
while (y != 0 && (r = x % y) != 0) {
x = y;
y = r;
}
return y == 0 ? x : y;
}
template <typename T> void emp(map<T, ll> &m, T x) {
m.emplace(x, 0).first->second++;
}
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
ll res = 0, res1 = INF, res2 = -INF, buf = 0;
bool judge = true;
ll n;
cin >> n;
vector<queue<ll>> q(n);
rep(i, 0, n) {
rep(j, 0, n - 1) {
ll x;
cin >> x;
x--;
q[i].push(x);
}
}
queue<ll> a;
rep(i, 0, n) a.push(i);
a.push(-1);
ll cnt = 0;
vector<ll> t(n, -1);
while (!a.empty()) {
ll x = a.front();
if (x == -1) {
if (a.size() != 1)
a.push(-1);
cnt++;
a.pop();
} else {
ll y = -1;
if (!q[x].empty())
y = q[x].front();
ll z = -2;
if (y != -1 && !q[y].empty())
z = q[y].front();
if (x == z && t[x] != cnt && t[y] != cnt) {
q[x].pop();
q[y].pop();
t[x] = cnt;
t[y] = cnt;
if (!q[x].empty())
a.push(x);
if (!q[y].empty())
a.push(y);
}
a.pop();
}
}
rep(i, 0, n) {
if (q[i].size() != 0)
judge = false;
}
if (judge)
cout << cnt << endl;
else
cout << -1 << endl;
return 0;
} | delete | 139 | 141 | 139 | 139 | TLE | |
p02925 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>;
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 7;
map<pair<int, int>, int> mp;
int cnt = 1;
int head[maxn];
int degree[maxn];
int visited[maxn];
struct node {
int u, v, next;
} e[maxn];
void addedge(int u, int v) {
e[cnt].u = u;
e[cnt].v = v;
e[cnt].next = head[u];
head[u] = cnt++;
}
int main() {
int n;
scanf("%d", &n);
int cnt1 = 1;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
mp[make_pair(i, j)] = cnt1++;
}
}
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
int flag = mp[make_pair(min(i, x), max(i, x))];
for (int j = 2; j <= n - 1; j++) {
int y;
scanf("%d", &y);
addedge(flag, mp[make_pair(min(i, y), max(i, y))]);
degree[mp[make_pair(min(i, y), max(i, y))]]++;
flag = mp[make_pair(min(i, y), max(i, y))];
}
}
queue<int> q;
for (int i = 1; i <= n * (n - 1) / 2; i++) {
if (degree[i] == 0) {
q.push(i);
}
}
int ans = 0;
while (!q.empty()) {
int sz = q.size();
for (int i = 1; i <= sz; i++) {
int x = q.front();
for (int j = head[x]; j != 0; j = e[j].next) {
int y = e[j].v;
degree[y]--;
if (degree[y] == 0) {
q.push(y);
}
}
visited[x] = 1;
q.pop();
}
ans++;
}
int flag = 1;
for (int i = 1; i <= n * (n - 1) / 2; i++) {
if (visited[i] == 0) {
flag = 0;
break;
}
}
if (flag) {
printf("%d\n", ans);
} else
printf("-1\n");
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>;
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
map<pair<int, int>, int> mp;
int cnt = 1;
int head[maxn];
int degree[maxn];
int visited[maxn];
struct node {
int u, v, next;
} e[maxn];
void addedge(int u, int v) {
e[cnt].u = u;
e[cnt].v = v;
e[cnt].next = head[u];
head[u] = cnt++;
}
int main() {
int n;
scanf("%d", &n);
int cnt1 = 1;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
mp[make_pair(i, j)] = cnt1++;
}
}
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
int flag = mp[make_pair(min(i, x), max(i, x))];
for (int j = 2; j <= n - 1; j++) {
int y;
scanf("%d", &y);
addedge(flag, mp[make_pair(min(i, y), max(i, y))]);
degree[mp[make_pair(min(i, y), max(i, y))]]++;
flag = mp[make_pair(min(i, y), max(i, y))];
}
}
queue<int> q;
for (int i = 1; i <= n * (n - 1) / 2; i++) {
if (degree[i] == 0) {
q.push(i);
}
}
int ans = 0;
while (!q.empty()) {
int sz = q.size();
for (int i = 1; i <= sz; i++) {
int x = q.front();
for (int j = head[x]; j != 0; j = e[j].next) {
int y = e[j].v;
degree[y]--;
if (degree[y] == 0) {
q.push(y);
}
}
visited[x] = 1;
q.pop();
}
ans++;
}
int flag = 1;
for (int i = 1; i <= n * (n - 1) / 2; i++) {
if (visited[i] == 0) {
flag = 0;
break;
}
}
if (flag) {
printf("%d\n", ans);
} else
printf("-1\n");
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define int long long int
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int N = 3e6 + 100;
vector<int> g[N];
vector<int> in[N];
ll ind[N];
ll dis[N];
ll dp(ll v) {
ll ma = 0;
for (int i = 0; i < in[v].size(); i++) {
ll u = in[v][i];
if (dis[u] > 1e9) {
dp(u);
}
ma = max(ma, dis[u] + 1);
}
dis[v] = ma;
}
int32_t main() {
sync;
ll n;
cin >> n;
for (int i = 1; i <= n; i++) {
ll x;
cin >> x;
ll z = i;
if (x < i) {
swap(x, z);
}
ll cnt = z * 1000 + x;
for (int j = 0; j < n - 2; j++) {
ll x;
cin >> x;
ll z = i;
if (x < i)
swap(x, z);
g[cnt].pb(z * 1000 + x);
in[z * 1000 + x].pb(cnt);
ind[z * 1000 + x]++;
cnt = z * 1000 + x;
}
}
memset(dis, 69, sizeof dis);
queue<int> q;
for (int i = 1; i < N; i++) {
if (ind[i] == 0) {
q.push(i);
dis[i] = 0;
}
}
while (q.size()) {
ll v = q.front();
q.pop();
for (int i = 0; i < g[v].size(); i++) {
ll u = g[v][i];
if (dis[u] > dis[v] + 1) {
dis[u] = dis[v] + 1;
q.push(u);
}
}
}
ll ma = 0;
for (int i = 1; i < N; i++) {
ma = max(ma, dis[i]);
}
if (ma > 1e9) {
cout << -1 << endl;
return 0;
}
memset(dis, 69, sizeof dis);
ma = 0;
for (int i = 1; i < N; i++) {
if (dis[i] > 1e9) {
dp(i);
ma = max(ma, dis[i]);
}
}
cout << ma + 1;
}
| #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define int long long int
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int N = 3e6 + 100;
vector<int> g[N];
vector<int> in[N];
ll ind[N];
ll dis[N];
ll dp(ll v) {
ll ma = 0;
for (int i = 0; i < in[v].size(); i++) {
ll u = in[v][i];
if (dis[u] > 1e9) {
dp(u);
}
ma = max(ma, dis[u] + 1);
}
dis[v] = ma;
}
int32_t main() {
sync;
ll n;
cin >> n;
for (int i = 1; i <= n; i++) {
ll x;
cin >> x;
ll z = i;
if (x < i) {
swap(x, z);
}
ll cnt = z * 1000 + x;
for (int j = 0; j < n - 2; j++) {
ll x;
cin >> x;
ll z = i;
if (x < i)
swap(x, z);
g[cnt].pb(z * 1000 + x);
in[z * 1000 + x].pb(cnt);
ind[z * 1000 + x]++;
cnt = z * 1000 + x;
}
}
memset(dis, 69, sizeof dis);
queue<int> q;
for (int i = 1; i < N; i++) {
if (ind[i] == 0) {
q.push(i);
dis[i] = 0;
}
}
while (q.size()) {
ll v = q.front();
q.pop();
for (int i = 0; i < g[v].size(); i++) {
ll u = g[v][i];
ind[u]--;
if (ind[u] == 0) {
dis[u] = 0;
q.push(u);
}
}
}
ll ma = 0;
for (int i = 1; i < N; i++) {
ma = max(ma, dis[i]);
}
if (ma > 1e9) {
cout << -1 << endl;
return 0;
}
memset(dis, 69, sizeof dis);
ma = 0;
for (int i = 1; i < N; i++) {
if (dis[i] > 1e9) {
dp(i);
ma = max(ma, dis[i]);
}
}
cout << ma + 1;
}
| replace | 72 | 74 | 72 | 75 | -11 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
template <typename T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MAX_N = 1005;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
vii G(MAX_N);
int id[MAX_N][MAX_N];
bool vis[MAX_V];
bool fin[MAX_V];
int dp[MAX_V];
int dfs(int v) {
if (vis[v]) {
if (!fin[v])
return -1;
else
return dp[v];
}
vis[v] = true;
dp[v] = 1;
for (auto &nv : G[v]) {
int res = dfs(nv);
if (res == -1)
return -1;
dp[v] = max(dp[v], res + 1);
}
fin[v] = true;
return dp[v];
}
int main() {
int n;
cin >> n;
vii a(n, vi(n - 1));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
cin >> a[i][j];
a[i][j]--;
}
}
int num = 0;
for (int i = 0; i < n - 1; i++)
for (int j = i + 1; j < n; j++)
id[i][j] = num++;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (i > a[i][j])
a[i][j] = id[a[i][j]][i];
else
a[i][j] = id[i][a[i][j]];
}
for (int j = 0; j < n - 2; j++) {
G[a[i][j]].push_back(a[i][j + 1]);
}
}
int ans = 0;
for (int i = 0; i < num; i++) {
int res = dfs(i);
if (res == -1) {
ans = -1;
break;
}
chmax(ans, res);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
template <typename T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MAX_N = 1005;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
vii G(MAX_V);
int id[MAX_N][MAX_N];
bool vis[MAX_V];
bool fin[MAX_V];
int dp[MAX_V];
int dfs(int v) {
if (vis[v]) {
if (!fin[v])
return -1;
else
return dp[v];
}
vis[v] = true;
dp[v] = 1;
for (auto &nv : G[v]) {
int res = dfs(nv);
if (res == -1)
return -1;
dp[v] = max(dp[v], res + 1);
}
fin[v] = true;
return dp[v];
}
int main() {
int n;
cin >> n;
vii a(n, vi(n - 1));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
cin >> a[i][j];
a[i][j]--;
}
}
int num = 0;
for (int i = 0; i < n - 1; i++)
for (int j = i + 1; j < n; j++)
id[i][j] = num++;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (i > a[i][j])
a[i][j] = id[a[i][j]][i];
else
a[i][j] = id[i][a[i][j]];
}
for (int j = 0; j < n - 2; j++) {
G[a[i][j]].push_back(a[i][j + 1]);
}
}
int ans = 0;
for (int i = 0; i < num; i++) {
int res = dfs(i);
if (res == -1) {
ans = -1;
break;
}
chmax(ans, res);
}
cout << ans << endl;
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
bool seen[2000000]{};
bool finished[2000000]{};
int d[2000000]{};
int dfs(const Graph &G, int now) {
if (seen[now] == true)
return d[now];
seen[now] = true;
for (auto e : G[now]) {
if (seen[e] && !finished[e]) {
cout << -1 << endl;
exit(0);
}
d[now] = max(d[now], dfs(G, e) + 1);
}
finished[now] = true;
return d[now];
}
int encode(int i, int j) {
if (i < j)
swap(i, j);
return 1000 * i + j;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
Graph G(N * (N - 1) / 2 + 1);
rep(i, N) {
int now = 0;
rep(j, N - 1) {
int k;
cin >> k;
--k;
int next = encode(i, k);
G[now].push_back(next);
now = next;
}
}
cout << dfs(G, 0) << endl;
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
bool seen[2000000]{};
bool finished[2000000]{};
int d[2000000]{};
int dfs(const Graph &G, int now) {
if (seen[now] == true)
return d[now];
seen[now] = true;
for (auto e : G[now]) {
if (seen[e] && !finished[e]) {
cout << -1 << endl;
exit(0);
}
d[now] = max(d[now], dfs(G, e) + 1);
}
finished[now] = true;
return d[now];
}
int encode(int i, int j) {
if (i < j)
swap(i, j);
return 1000 * i + j;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
Graph G(2000000);
rep(i, N) {
int now = 0;
rep(j, N - 1) {
int k;
cin >> k;
--k;
int next = encode(i, k);
G[now].push_back(next);
now = next;
}
}
cout << dfs(G, 0) << endl;
} | replace | 39 | 40 | 39 | 40 | 0 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 1001;
int n, A[M][M];
int id[M][M], tot;
vector<int> d[500001];
int dp[M], ans;
bool fl;
int dfs(int x) {
if (dp[x])
return dp[x];
int res = 0;
for (int i = 0; i < (int)d[x].size(); i++) {
int y = d[x][i];
res = max(res, dfs(y));
}
dp[x] = res + 1;
return dp[x];
}
int dfn[500001], ToT, low[500001], ins[500001], stk[500001], top;
void Tarjan(int x) {
dfn[x] = low[x] = ++ToT;
ins[x] = 1;
stk[++top] = x;
for (int i = 0; i < (int)d[x].size(); i++) {
int y = d[x][i];
if (!dfn[y]) {
Tarjan(y);
low[x] = min(low[x], low[y]);
} else if (ins[y])
low[x] = min(low[x], dfn[y]);
}
if (dfn[x] == low[x]) {
int e;
int cnt = 0;
do {
e = stk[top--];
ins[e] = 0;
cnt++;
} while (e != x);
if (cnt > 1)
fl = 1;
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j < n; j++)
scanf("%d", &A[i][j]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < i; j++)
id[i][j] = id[j][i] = ++tot;
}
for (int i = 1; i <= n; i++)
for (int j = 2; j < n; j++)
d[id[i][A[i][j - 1]]].push_back(id[i][A[i][j]]);
for (int i = 1; i <= tot; i++)
if (!dfn[i])
Tarjan(i);
if (fl) {
puts("-1");
return 0;
}
for (int i = 1; i <= tot; i++)
ans = max(ans, dfs(i));
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
const int M = 1001;
int n, A[M][M];
int id[M][M], tot;
vector<int> d[500001];
int dp[500001], ans;
bool fl;
int dfs(int x) {
if (dp[x])
return dp[x];
int res = 0;
for (int i = 0; i < (int)d[x].size(); i++) {
int y = d[x][i];
res = max(res, dfs(y));
}
dp[x] = res + 1;
return dp[x];
}
int dfn[500001], ToT, low[500001], ins[500001], stk[500001], top;
void Tarjan(int x) {
dfn[x] = low[x] = ++ToT;
ins[x] = 1;
stk[++top] = x;
for (int i = 0; i < (int)d[x].size(); i++) {
int y = d[x][i];
if (!dfn[y]) {
Tarjan(y);
low[x] = min(low[x], low[y]);
} else if (ins[y])
low[x] = min(low[x], dfn[y]);
}
if (dfn[x] == low[x]) {
int e;
int cnt = 0;
do {
e = stk[top--];
ins[e] = 0;
cnt++;
} while (e != x);
if (cnt > 1)
fl = 1;
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j < n; j++)
scanf("%d", &A[i][j]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < i; j++)
id[i][j] = id[j][i] = ++tot;
}
for (int i = 1; i <= n; i++)
for (int j = 2; j < n; j++)
d[id[i][A[i][j - 1]]].push_back(id[i][A[i][j]]);
for (int i = 1; i <= tot; i++)
if (!dfn[i])
Tarjan(i);
if (fl) {
puts("-1");
return 0;
}
for (int i = 1; i <= tot; i++)
ans = max(ans, dfs(i));
printf("%d\n", ans);
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define mod 1000000007;
int main() {
int n, a[1010][1010], now[1010];
cin >> n;
ll hoge = 0, en = (n * (n - 1)) / 2;
for (int i = 0; i < n; i++)
now[i] = n - 2;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
cin >> a[i][j];
}
}
int ans = 0;
bool flag[1010], cc[1010];
int last[1010];
for (int k = 0; k < n; k++)
cc[k] = 0;
for (int k = 0; k < n; k++)
last[k] = -1;
bool ff = 1;
while (1) {
ff = 1;
for (int i = 0; i < n; i++) {
if (last[i] == ans || cc[i])
continue;
for (int j = i + 1; j < n; j++) {
if (last[j] == ans || cc[j])
continue;
if (a[i][now[i]] == (j + 1) && a[j][now[j]] == (i + 1) &&
last[i] != ans && last[j] != ans) {
last[i] = ans;
last[j] = ans;
now[i]--;
now[j]--;
hoge++;
ff = 0;
if (now[i] == -1)
cc[i] = 1;
if (now[j] == -1)
cc[j] = 1;
}
}
}
ans++;
if (hoge == en) {
cout << ans << endl;
return 0;
}
if (ff)
break;
}
cout << -1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define mod 1000000007;
int main() {
int n, a[1010][1010], now[1010];
cin >> n;
ll hoge = 0, en = (n * (n - 1)) / 2;
for (int i = 0; i < n; i++)
now[i] = n - 2;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
cin >> a[i][j];
}
}
int ans = 0;
bool flag[1010], cc[1010];
int last[1010];
for (int k = 0; k < n; k++)
cc[k] = 0;
for (int k = 0; k < n; k++)
last[k] = -1;
bool ff = 1;
while (1) {
ff = 1;
for (int i = 0; i < n; i++) {
if (last[i] == ans || cc[i])
continue;
int j = a[i][now[i]] - 1;
if (a[i][now[i]] == (j + 1) && a[j][now[j]] == (i + 1) &&
last[i] != ans && last[j] != ans) {
last[i] = ans;
last[j] = ans;
now[i]--;
now[j]--;
hoge++;
ff = 0;
if (now[i] == -1)
cc[i] = 1;
if (now[j] == -1)
cc[j] = 1;
}
}
ans++;
if (hoge == en) {
cout << ans << endl;
return 0;
}
if (ff)
break;
}
cout << -1 << endl;
return 0;
} | replace | 36 | 52 | 36 | 49 | TLE | |
p02925 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
int n;
cin >> n;
int x;
vector<queue<int>> b(n);
rep(i, n) rep(j, n - 1) {
cin >> x;
x--;
b[i].emplace(x);
}
set<int> seen;
int ans = -1;
bool f = 1;
while (f) {
f = 0;
rep(i, n) {
if (b[i].empty())
continue;
int op = b[i].front();
if (seen.count(op) || seen.count(i))
continue;
if (b[op].front() != i)
continue;
f = 1;
b[i].pop();
b[op].pop();
seen.insert(op);
seen.insert(i);
}
ans++;
seen.clear();
}
rep(i, n) {
if (!b[i].empty()) {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
} /*
./problem.exe
*/ | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
int n;
cin >> n;
int x;
vector<queue<int>> b(n);
rep(i, n) rep(j, n - 1) {
cin >> x;
x--;
b[i].emplace(x);
}
set<int> seen;
int ans = -1;
bool f = 1;
while (f) {
f = 0;
rep(i, n) {
if (b[i].empty())
continue;
int op = b[i].front();
if (op < i)
continue;
if (seen.count(op) || seen.count(i))
continue;
if (b[op].front() != i)
continue;
f = 1;
b[i].pop();
b[op].pop();
seen.insert(op);
seen.insert(i);
}
ans++;
seen.clear();
}
rep(i, n) {
if (!b[i].empty()) {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
} /*
./problem.exe
*/ | insert | 46 | 46 | 46 | 48 | TLE | |
p02925 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// cout << fixed << setprecision(10);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
int x;
vector<queue<int>> b(n);
rep(i, n) rep(j, n - 1) {
cin >> x;
x--;
b[i].emplace(x);
}
unordered_set<int> seen;
int ans = -1;
bool f = 1;
while (f) {
f = 0;
rep(i, n) {
if (b[i].empty())
continue;
int op = b[i].front();
if (op < i)
continue;
if (seen.count(op) || seen.count(i))
continue;
if (b[op].front() != i)
continue;
f = 1;
b[i].pop();
b[op].pop();
seen.emplace(op);
seen.emplace(i);
}
ans++;
seen.clear();
}
rep(i, n) {
if (!b[i].empty()) {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
} /*
./problem.exe
*/
| // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// cout << fixed << setprecision(10);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
int x;
vector<queue<int>> b(n);
rep(i, n) rep(j, n - 1) {
cin >> x;
x--;
b[i].emplace(x);
}
set<int> seen;
int ans = -1;
bool f = 1;
while (f) {
f = 0;
rep(i, n) {
if (b[i].empty())
continue;
int op = b[i].front();
if (op < i)
continue;
if (seen.count(op) || seen.count(i))
continue;
if (b[op].front() != i)
continue;
f = 1;
b[i].pop();
b[op].pop();
seen.emplace(op);
seen.emplace(i);
}
ans++;
seen.clear();
}
rep(i, n) {
if (!b[i].empty()) {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
} /*
./problem.exe
*/
| replace | 37 | 38 | 37 | 38 | TLE | |
p02925 | C++ | Time Limit Exceeded | #define DEBUG 1
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll, ll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define INF 1111111111111111111LL
#define MOD 1000000007LL // 10**9 + 7
#define print(...) print_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << '(' << v.first << ", " << v.second << ')';
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << '(' << get<0>(v) << ", " << get<1>(v) << ", " << get<2>(v) << ')';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto 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) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
void Yes(void) { cout << "Yes" << '\n'; }
void No(void) { cout << "No" << '\n'; }
void YES(void) { cout << "YES" << '\n'; }
void NO(void) { cout << "NO" << '\n'; }
template <typename T> void chmax(T &a, const T &b) {
if (a < b) {
a = b;
}
}
template <typename T> void chmin(T &a, const T &b) {
if (a > b) {
a = b;
}
}
template <typename T> void vin(vector<T> &v, ll len) {
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
ll A[1001][1001];
ll c[2][1001];
void solve() {
ll ans = 0;
ll N;
cin >> N;
for1(h, N) {
for1(w, N - 1) {
ll a;
cin >> a;
A[h][w] = a - 1;
}
}
bool loop = true;
ll t0 = 1;
ll t1 = 0;
while (loop) {
loop = false;
t0 = 1 - t0;
t1 = 1 - t1;
for1(i, N) {
if (c[t0][i] == N - 1)
continue;
for2(j, i + 1, N) {
if (c[t0][j] == N - 1)
continue;
if (A[i][c[t0][i]] == j && A[j][c[t0][j]] == i) {
c[t1][i] = c[t0][i] + 1;
c[t1][j] = c[t0][j] + 1;
loop = true;
}
}
}
for1(i, N) { chmax(c[t1][i], c[t0][i]); }
if (loop) {
ans++;
}
}
for1(i, N) {
if (c[t1][i] < N - 1) {
print(-1);
return;
}
}
print(ans);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
solve();
}
| #define DEBUG 1
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll, ll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define INF 1111111111111111111LL
#define MOD 1000000007LL // 10**9 + 7
#define print(...) print_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << '(' << v.first << ", " << v.second << ')';
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << '(' << get<0>(v) << ", " << get<1>(v) << ", " << get<2>(v) << ')';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto 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) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
void Yes(void) { cout << "Yes" << '\n'; }
void No(void) { cout << "No" << '\n'; }
void YES(void) { cout << "YES" << '\n'; }
void NO(void) { cout << "NO" << '\n'; }
template <typename T> void chmax(T &a, const T &b) {
if (a < b) {
a = b;
}
}
template <typename T> void chmin(T &a, const T &b) {
if (a > b) {
a = b;
}
}
template <typename T> void vin(vector<T> &v, ll len) {
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
ll A[1001][1001];
ll c[2][1001];
void solve() {
ll ans = 0;
ll N;
cin >> N;
for1(h, N) {
for1(w, N - 1) {
ll a;
cin >> a;
A[h][w] = a - 1;
}
}
bool loop = true;
ll t0 = 1;
ll t1 = 0;
while (loop) {
loop = false;
t0 = 1 - t0;
t1 = 1 - t1;
for1(i, N) {
if (c[t0][i] == N - 1)
continue;
ll j = A[i][c[t0][i]];
if (c[t0][j] == N - 1)
continue;
if (A[j][c[t0][j]] == i) {
c[t1][i] = c[t0][i] + 1;
c[t1][j] = c[t0][j] + 1;
loop = true;
}
}
for1(i, N) { chmax(c[t1][i], c[t0][i]); }
if (loop) {
ans++;
}
}
for1(i, N) {
if (c[t1][i] < N - 1) {
print(-1);
return;
}
}
print(ans);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
solve();
}
| replace | 132 | 140 | 132 | 139 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Table = vector<vector<int>>;
const bool DEBUG = false;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
Table A(N, vector<int>(N - 1));
for (size_t i = 0; i < N; i++) {
for (size_t j = 0; j < N - 1; j++) {
cin >> A[i][j];
}
}
if (DEBUG) {
for (size_t i = 0; i < N; i++) {
for (size_t j = 0; j < N - 1; j++) {
cout << A[i][j] << ", ";
}
cout << endl;
}
}
int total = N * (N - 1);
int days = 0;
bool not_finished = true;
vector<int> matched;
while (not_finished) {
bool found = false;
matched.clear();
for (size_t i = 0; i < N; i++) {
// if (matched.find(i) != matched.end()) continue;
if (A[i].size() == 0)
continue;
int opponent = A[i][0] - 1;
if (DEBUG)
cout << i + 1 << " vs " << opponent + 1 << endl;
if (A[opponent].size() == 0) {
cout << "-1" << endl;
return 0;
}
if (i == A[opponent][0] - 1) {
if (DEBUG)
cout << "found" << endl;
found = true;
matched.push_back(i);
// matched.insert(i);
// matched.insert(opponent);
}
}
total -= matched.size();
for (auto &&player : matched)
A[player].erase(A[player].begin());
if (!found) {
cout << "-1" << endl;
return 0;
}
if (DEBUG)
cout << "total: " << total << endl;
not_finished = total > 0;
days++;
}
cout << days << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using Table = vector<vector<int>>;
const bool DEBUG = false;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
Table A(N, vector<int>(N - 1));
for (size_t i = 0; i < N; i++) {
for (size_t j = 0; j < N - 1; j++) {
cin >> A[i][j];
}
}
if (DEBUG) {
for (size_t i = 0; i < N; i++) {
for (size_t j = 0; j < N - 1; j++) {
cout << A[i][j] << ", ";
}
cout << endl;
}
}
int total = N * (N - 1);
int days = 0;
bool not_finished = true;
vector<int> matched;
while (not_finished) {
bool found = false;
matched.clear();
for (size_t i = 0; i < N; i++) {
// if (matched.find(i) != matched.end()) continue;
if (A[i].size() == 0)
continue;
int opponent = A[i][0] - 1;
if (DEBUG)
cout << i + 1 << " vs " << opponent + 1 << endl;
// if (A[opponent].size() == 0) {
// cout << "-1" << endl;
// return 0;
// }
if (i == A[opponent][0] - 1) {
if (DEBUG)
cout << "found" << endl;
found = true;
matched.push_back(i);
// matched.insert(i);
// matched.insert(opponent);
}
}
total -= matched.size();
for (auto &&player : matched)
A[player].erase(A[player].begin());
if (!found) {
cout << "-1" << endl;
return 0;
}
if (DEBUG)
cout << "total: " << total << endl;
not_finished = total > 0;
days++;
}
cout << days << endl;
return 0;
}
| replace | 39 | 43 | 39 | 43 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, start, end) for (ll i = start; i < end; ++i)
#define dwn(i, n) for (int i = n; i >= 0; --i)
#define dwn2(i, start, end) for (ll i = start; i >= end; --i)
#define pll pair<ll, ll>
#define mk(x, y) make_pair(x, y)
#define pdl pair<double, ll>
const ll N = 4e3 + 200;
const ll INF = 0x3f3f3f;
const ll mode = 1e9 + 7;
int v[N][N];
int main() {
ll n;
cin >> n;
rep2(i, 1, n + 1) {
rep2(j, 1, n) {
ll x;
scanf("%lld", &v[i][j]);
v[i][0] = 1;
}
}
int flag = 0;
ll sum = 0;
ll mx = n * (n - 1) / 2;
ll day = 0;
while (1) {
day++;
map<ll, ll> mp2;
int flag2 = 0;
rep2(i, 1, n + 1) {
ll k = v[i][0];
if (!mp2[i] && k != n) {
ll x = v[i][k];
ll k2 = v[x][0];
ll y = v[x][k2];
if (y == i && !mp2[x]) {
sum++;
flag2 = 1;
mp2[i] = 1;
mp2[x] = 1;
v[i][0]++;
v[x][0]++;
// cout<<i<<" "<<x<<" "<<day<<endl;
}
}
}
if (!flag2) {
flag = 1;
break;
}
if (sum == mx) {
break;
}
}
if (flag)
cout << "-1" << endl;
else
cout << day << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, start, end) for (ll i = start; i < end; ++i)
#define dwn(i, n) for (int i = n; i >= 0; --i)
#define dwn2(i, start, end) for (ll i = start; i >= end; --i)
#define pll pair<ll, ll>
#define mk(x, y) make_pair(x, y)
#define pdl pair<double, ll>
const ll N = 4e3 + 200;
const ll INF = 0x3f3f3f;
const ll mode = 1e9 + 7;
int v[N][N];
int main() {
ll n;
cin >> n;
rep2(i, 1, n + 1) {
rep2(j, 1, n) {
ll x;
scanf("%lld", &v[i][j]);
v[i][0] = 1;
}
}
int flag = 0;
ll sum = 0;
ll mx = n * (n - 1) / 2;
ll day = 0;
while (1) {
day++;
int mp2[N] = {0};
int flag2 = 0;
rep2(i, 1, n + 1) {
ll k = v[i][0];
if (!mp2[i] && k != n) {
ll x = v[i][k];
ll k2 = v[x][0];
ll y = v[x][k2];
if (y == i && !mp2[x]) {
sum++;
flag2 = 1;
mp2[i] = 1;
mp2[x] = 1;
v[i][0]++;
v[x][0]++;
// cout<<i<<" "<<x<<" "<<day<<endl;
}
}
}
if (!flag2) {
flag = 1;
break;
}
if (sum == mx) {
break;
}
}
if (flag)
cout << "-1" << endl;
else
cout << day << endl;
return 0;
}
| replace | 30 | 31 | 30 | 31 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
double PI = 3.1415926535897932;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
int n;
int a[1000][1000];
vector<int> e[1000000];
bool saw[1000000];
int cost[1000000];
bool dfs(int v) {
saw[v] = true;
int cnt = 0;
rep(i, e[v].size()) {
if (saw[e[v][i]] && cost[e[v][i]] == -1) {
return false;
}
if (saw[e[v][i]]) {
cnt = max(cnt, cost[e[v][i]]);
}
if (!dfs(e[v][i]))
return false;
cnt = max(cnt, cost[e[v][i]]);
}
cost[v] = cnt + 1;
return true;
}
int main() {
memset(cost, -1, sizeof(cost));
cin >> n;
rep(i, n) {
rep(j, n - 1) cin >> a[i][j];
rep(j, n - 1) a[i][j]--;
for (int j = 1; j < n - 1; j++) {
pi x = pi(i, a[i][j - 1]);
pi y = pi(i, a[i][j]);
if (x.second < x.first)
swap(x.first, x.second);
if (y.second < y.first)
swap(y.first, y.second);
e[x.first * 1000 + x.second].push_back(y.first * 1000 + y.second);
}
}
rep(j, n) {
for (int k = j + 1; k < n; k++) {
int id = j * 1000 + k;
if (saw[id])
continue;
if (!dfs(id)) {
cout << -1 << endl;
return 0;
}
}
}
int ans = 0;
rep(j, n) {
for (int k = j + 1; k < n; k++) {
int id = j * 1000 + k;
ans = max(ans, cost[id]);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
double PI = 3.1415926535897932;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
int n;
int a[1000][1000];
vector<int> e[1000000];
bool saw[1000000];
int cost[1000000];
bool dfs(int v) {
saw[v] = true;
int cnt = 0;
rep(i, e[v].size()) {
if (saw[e[v][i]] && cost[e[v][i]] == -1) {
return false;
}
if (saw[e[v][i]]) {
cnt = max(cnt, cost[e[v][i]]);
continue;
}
if (!dfs(e[v][i]))
return false;
cnt = max(cnt, cost[e[v][i]]);
}
cost[v] = cnt + 1;
return true;
}
int main() {
memset(cost, -1, sizeof(cost));
cin >> n;
rep(i, n) {
rep(j, n - 1) cin >> a[i][j];
rep(j, n - 1) a[i][j]--;
for (int j = 1; j < n - 1; j++) {
pi x = pi(i, a[i][j - 1]);
pi y = pi(i, a[i][j]);
if (x.second < x.first)
swap(x.first, x.second);
if (y.second < y.first)
swap(y.first, y.second);
e[x.first * 1000 + x.second].push_back(y.first * 1000 + y.second);
}
}
rep(j, n) {
for (int k = j + 1; k < n; k++) {
int id = j * 1000 + k;
if (saw[id])
continue;
if (!dfs(id)) {
cout << -1 << endl;
return 0;
}
}
}
int ans = 0;
rep(j, n) {
for (int k = j + 1; k < n; k++) {
int id = j * 1000 + k;
ans = max(ans, cost[id]);
}
}
cout << ans << endl;
} | insert | 36 | 36 | 36 | 37 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 1e3 + 3;
int n, a[M][M];
map<pair<int, int>, int> mp;
vector<int> adj[M];
int in[M * M], vis[M * M], ans;
int main() {
scanf("%d", &n);
int k = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
int x;
scanf("%d", &a[i][j]);
x = a[i][j];
int a = min(x - 1, i);
int b = max(x - 1, i);
if (mp[{a, b}] == 0) {
mp[{a, b}] = k;
k++;
}
}
for (int j = 1; j < n - 1; j++) {
adj[mp[{min(i, a[i][j - 1] - 1), max(i, a[i][j - 1] - 1)}]].push_back(
mp[{min(i, a[i][j] - 1), max(i, a[i][j] - 1)}]);
in[mp[{min(i, a[i][j] - 1), max(i, a[i][j] - 1)}]]++;
// cout << mp[{min(i, a[i][j-1]-1), max(i, a[i][j-1]-1)}] << ' '<<
// mp[{min(i, a[i][j]-1), max(i, a[i][j]-1)}] << endl;
}
}
vector<int> order;
queue<int> q;
for (int i = 1; i < k; ++i)
if (in[i] == 0) {
vis[i] = 1, q.push(i);
// cout << i << endl;
}
while (!q.empty()) {
int u = q.front();
q.pop();
order.push_back(u);
for (int i = 0; i < adj[u].size(); ++i) {
--in[adj[u][i]];
if (in[adj[u][i]] == 0) {
q.push(adj[u][i]);
vis[adj[u][i]] = vis[u] + 1;
ans = max(ans, vis[u] + 1);
}
}
}
if (order.size() != k - 1)
puts("-1");
else {
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int M = 1e3 + 3;
int n, a[M][M];
map<pair<int, int>, int> mp;
vector<int> adj[M * M];
int in[M * M], vis[M * M], ans = 1;
int main() {
scanf("%d", &n);
int k = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
int x;
scanf("%d", &a[i][j]);
x = a[i][j];
int a = min(x - 1, i);
int b = max(x - 1, i);
if (mp[{a, b}] == 0) {
mp[{a, b}] = k;
k++;
}
}
for (int j = 1; j < n - 1; j++) {
adj[mp[{min(i, a[i][j - 1] - 1), max(i, a[i][j - 1] - 1)}]].push_back(
mp[{min(i, a[i][j] - 1), max(i, a[i][j] - 1)}]);
in[mp[{min(i, a[i][j] - 1), max(i, a[i][j] - 1)}]]++;
// cout << mp[{min(i, a[i][j-1]-1), max(i, a[i][j-1]-1)}] << ' '<<
// mp[{min(i, a[i][j]-1), max(i, a[i][j]-1)}] << endl;
}
}
vector<int> order;
queue<int> q;
for (int i = 1; i < k; ++i)
if (in[i] == 0) {
vis[i] = 1, q.push(i);
// cout << i << endl;
}
while (!q.empty()) {
int u = q.front();
q.pop();
order.push_back(u);
for (int i = 0; i < adj[u].size(); ++i) {
--in[adj[u][i]];
if (in[adj[u][i]] == 0) {
q.push(adj[u][i]);
vis[adj[u][i]] = vis[u] + 1;
ans = max(ans, vis[u] + 1);
}
}
}
if (order.size() != k - 1)
puts("-1");
else {
cout << ans << endl;
}
} | replace | 7 | 9 | 7 | 9 | 0 | |
p02926 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldb = long double;
// BDD,ZDD,kdtree, bdtree,bicalc, bolonoy, doloney, tree,
// chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu, heirokenshutu,
// topologicalsort, kyourenketuseibun
#define REP(i, a, b) for (ll i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
#define MINS(a, b) a = min(a, (decltype(a))(b))
#define MAXS(a, b) a = max(a, (decltype(a))(b))
int main() {
ll N;
cin >> N;
vector<pair<ll, ll>> P(N);
REP(i, 0, N) { cin >> P[i].first >> P[i].second; }
sort(P.begin(), P.end(), [](const pair<ll, ll> &a, const pair<ll, ll> &b) {
return atan2l(a.second, a.first) < atan2(b.second, b.first);
});
ldb ans = 0;
REP(i, 0, N) {
REP(j, i, i + N) {
pair<ll, ll> p = {0, 0};
REP(k, i, j + 1) {
p.first += P[k % N].first;
p.second += P[k % N].second;
}
MAXS(ans, sqrtl(p.first * p.first + p.second * p.second));
}
}
printf("%.11Lf\n", ans);
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldb = long double;
// BDD,ZDD,kdtree, bdtree,bicalc, bolonoy, doloney, tree,
// chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu, heirokenshutu,
// topologicalsort, kyourenketuseibun
#define REP(i, a, b) for (ll i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
#define MINS(a, b) a = min(a, (decltype(a))(b))
#define MAXS(a, b) a = max(a, (decltype(a))(b))
int main() {
ll N;
cin >> N;
vector<pair<ll, ll>> P(N);
REP(i, 0, N) { cin >> P[i].first >> P[i].second; }
sort(P.begin(), P.end(), [](const pair<ll, ll> &a, const pair<ll, ll> &b) {
return atan2l(a.second, a.first) < atan2l(b.second, b.first);
});
ldb ans = 0;
REP(i, 0, N) {
REP(j, i, i + N) {
pair<ll, ll> p = {0, 0};
REP(k, i, j + 1) {
p.first += P[k % N].first;
p.second += P[k % N].second;
}
MAXS(ans, sqrtl(p.first * p.first + p.second * p.second));
}
}
printf("%.11Lf\n", ans);
return 0;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<pll> p(N);
REP(i, N) { cin >> p[i].first >> p[i].second; }
ll M = 10000000;
double kaku = 2 * M_PI / M;
double res = -1;
REP(i, M) {
double now = 0.01 + i * kaku;
double x = sin(now);
double y = cos(now);
double x_tmp = 0, y_tmp = 0;
// dump(now)
// dump(x)
// dump(y)
REP(j, N) {
if (p[j].first * x + p[j].second * y >= 0)
x_tmp += p[j].first, y_tmp += p[j].second;
}
res = max(res, sqrt(x_tmp * x_tmp + y_tmp * y_tmp));
// dump(res)
}
printf("%.10f\n", res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<pll> p(N);
REP(i, N) { cin >> p[i].first >> p[i].second; }
ll M = 5000000;
double kaku = 2 * M_PI / M;
double res = -1;
REP(i, M) {
double now = 0.01 + i * kaku;
double x = sin(now);
double y = cos(now);
double x_tmp = 0, y_tmp = 0;
// dump(now)
// dump(x)
// dump(y)
REP(j, N) {
if (p[j].first * x + p[j].second * y >= 0)
x_tmp += p[j].first, y_tmp += p[j].second;
}
res = max(res, sqrt(x_tmp * x_tmp + y_tmp * y_tmp));
// dump(res)
}
printf("%.10f\n", res);
return 0;
} | replace | 50 | 51 | 50 | 51 | TLE | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define X first
#define Y second
#define mp make_pair
#define pb pop_back
#define eb emplace_back
#define sz(v) (int)v.size()
using namespace std;
typedef long long LL;
typedef long double LD;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int MAX_N = 105;
int x[MAX_N], y[MAX_N];
void solve() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
}
vector<int> p(n);
iota(p.begin(), p.end(), 0);
LL ans = 0;
while (clock() / CLOCKS_PER_SEC < 1.8) {
shuffle(p.begin(), p.end(), rnd);
LL dist = 0;
pair<int, int> P = {0, 0};
for (auto &i : p) {
pair<int, int> newP = {P.X + x[i], P.Y + y[i]};
LL curr = 1LL * newP.X * newP.X + 1LL * newP.Y * newP.Y;
if (curr > dist) {
dist = curr;
P = newP;
}
}
ans = max(ans, dist);
}
cout << sqrt((LD)ans) << "\n";
}
signed main() {
// #define TASK ""
#if !defined(LOCAL) && defined(TASK)
freopen(TASK ".in", "r", stdin);
freopen(TASK ".out", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(20);
int tests = 1;
// cin >> tests;
while (tests--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
#define X first
#define Y second
#define mp make_pair
#define pb pop_back
#define eb emplace_back
#define sz(v) (int)v.size()
using namespace std;
typedef long long LL;
typedef long double LD;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int MAX_N = 105;
int x[MAX_N], y[MAX_N];
void solve() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
}
vector<int> p(n);
iota(p.begin(), p.end(), 0);
LL ans = 0;
while (clock() / CLOCKS_PER_SEC < 1.5) {
shuffle(p.begin(), p.end(), rnd);
LL dist = 0;
pair<int, int> P = {0, 0};
for (auto &i : p) {
pair<int, int> newP = {P.X + x[i], P.Y + y[i]};
LL curr = 1LL * newP.X * newP.X + 1LL * newP.Y * newP.Y;
if (curr > dist) {
dist = curr;
P = newP;
}
}
ans = max(ans, dist);
}
cout << sqrt((LD)ans) << "\n";
}
signed main() {
// #define TASK ""
#if !defined(LOCAL) && defined(TASK)
freopen(TASK ".in", "r", stdin);
freopen(TASK ".out", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(20);
int tests = 1;
// cin >> tests;
while (tests--) {
solve();
}
return 0;
} | replace | 29 | 30 | 29 | 30 | TLE | |
p02926 | C++ | Runtime Error | #ifndef OUUAN
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#endif
#include <bits/stdc++.h>
#define int LoveLive
// #define FAST_IOSTREAM 1
#define For(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define FOR(i, r, l) for (int i = (r), i##end = (l); i >= i##end; --i)
#define SON(i, u) for (int i = head[u]; i; i = nxt[i])
#define ms(a, x) memset(a, x, sizeof(a))
#define fi first
#define se second
#define pb emplace_back
#define pq priority_queue
#define isinf(x) (x >= INF ? -1 : x)
#define y1 why_is_there_a_function_called_y1
#define DEBUG(x) cerr << (#x) << ":" << x << endl
using namespace std;
typedef long long LoveLive;
typedef pair<int, int> pii;
typedef vector<int> vi;
#ifdef int
const int INF = 0x3f3f3f3f3f3f3f3fll;
#else
const int INF = 0x3f3f3f3f;
#endif
const double eps = 1e-9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int randint(int l, int r) {
int out = rng() % (r - l + 1) + l;
return out >= l ? out : out + r - l + 1;
}
#ifdef FAST_IOSTREAM
#define br cout << '\n'
#define sp cout << ' '
long long read() {
long long x;
cin >> x;
return x;
}
template <typename T> void read(T &x) { cin >> x; }
template <typename T> void write(const T &x) { cout << x; }
#else
#define br putchar('\n')
#define sp putchar(' ')
template <typename T>
typename enable_if<!is_integral<T>::value, void>::type read(T &x) {
cin >> x;
}
long long read() {
char c;
long long out = 0, f = 1;
for (c = getchar(); !isdigit(c) && c != '-'; c = getchar())
;
if (c == '-') {
f = -1;
c = getchar();
}
for (; isdigit(c); c = getchar())
out = (out << 3) + (out << 1) + c - '0';
return out * f;
}
template <typename T>
typename enable_if<is_integral<T>::value, T>::type read(T &x) {
char c;
T f = 1;
x = 0;
for (c = getchar(); !isdigit(c) && c != '-'; c = getchar())
;
if (c == '-') {
f = -1;
c = getchar();
}
for (; isdigit(c); c = getchar())
x = (x << 3) + (x << 1) + c - '0';
return x *= f;
}
char read(char &x) {
for (x = getchar(); isspace(x); x = getchar())
;
return x;
}
double read(double &x) {
scanf("%lf", &x);
return x;
}
template <typename T>
typename enable_if<!is_integral<T>::value, void>::type write(const T &x) {
cout << x;
}
template <typename T>
typename enable_if<is_integral<T>::value, void>::type write(const T &x) {
if (x < 0) {
putchar('-');
write(-x);
return;
}
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
void write(const char &x) { putchar(x); }
void write(const double &x) { printf("%.10lf", x); }
#endif
template <typename T, typename... Args> void read(T &x, Args &...args) {
read(x);
read(args...);
}
template <
typename OutputIt,
typename = typename enable_if<
is_same<output_iterator_tag,
typename iterator_traits<OutputIt>::iterator_category>::value ||
(is_base_of<forward_iterator_tag, typename iterator_traits<OutputIt>::
iterator_category>::value &&
!is_const<OutputIt>::value)>::type>
void read(OutputIt __first, OutputIt __last) {
for (; __first != __last; ++__first)
read(*__first);
}
template <
typename InputIt,
typename = typename enable_if<is_base_of<
input_iterator_tag,
typename iterator_traits<InputIt>::iterator_category>::value>::type>
void wts(InputIt __first, InputIt __last) {
bool isFirst = true;
for (; __first != __last; ++__first) {
if (isFirst)
isFirst = false;
else
sp;
write(*__first);
}
br;
}
template <
typename InputIt,
typename = typename enable_if<is_base_of<
input_iterator_tag,
typename iterator_traits<InputIt>::iterator_category>::value>::type>
void wtb(InputIt __first, InputIt __last) {
for (; __first != __last; ++__first) {
write(*__first);
br;
}
}
template <typename T> void wts(const T &x) {
write(x);
sp;
}
template <typename T> void wtb(const T &x) {
write(x);
br;
}
template <typename T> void wte(const T &x) {
write(x);
exit(0);
}
template <typename T, typename... Args> void wts(const T &x, Args... args) {
wts(x);
wts(args...);
}
template <typename T, typename... Args> void wtb(const T &x, Args... args) {
wts(x);
wtb(args...);
}
template <typename T, typename... Args> void wte(const T &x, Args... args) {
wts(x);
wte(args...);
}
template <typename T> inline bool up(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool dn(T &x, const T &y) {
return y < x ? x = y, 1 : 0;
}
const int N = 500010;
const int mod = 1000000007;
int n;
double ans;
struct Vector {
int x, y;
int cj(const Vector &b) const { return x * b.y - y * b.x; }
int xx() const {
if (x == 0 && y == 0)
return -1;
if (x > 0 && y == 0)
return 0;
if (x > 0 && y > 0)
return 1;
if (x == 0 && y > 0)
return 2;
if (x < 0 && y > 0)
return 3;
if (x < 0 && y == 0)
return 4;
if (x < 0 && y < 0)
return 5;
if (x == 0 && y < 0)
return 6;
if (x > 0 && y < 0)
return 7;
}
bool operator<(const Vector &b) const {
if (xx() < b.xx())
return true;
return cj(b) > 0;
}
} a[N];
signed main() {
#ifdef FAST_IOSTREAM
cin.sync_with_stdio(false);
cin.tie(0);
#endif
read(n);
For(i, 1, n) read(a[i].x, a[i].y);
sort(a + 1, a + n + 1);
For(i, 1, n) a[i + n] = a[i];
int x = 0, y = 0, r = 0;
for (int l = 1; l <= n; ++l) {
ans = max(ans, sqrt(x * x + y * y));
while (r < l + n - 1 &&
(a[l].cj(a[r + 1]) > 0 ||
a[l].cj(a[r + 1]) == 0 && (a[l].x > 0) == (a[r + 1].x > 0))) {
x += a[++r].x;
y += a[r].y;
ans = max(ans, sqrt(x * x + y * y));
}
x -= a[l].x;
y -= a[l].y;
}
printf("%.20lf", ans);
return 0;
}
| #ifndef OUUAN
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#endif
#include <bits/stdc++.h>
#define int LoveLive
// #define FAST_IOSTREAM 1
#define For(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define FOR(i, r, l) for (int i = (r), i##end = (l); i >= i##end; --i)
#define SON(i, u) for (int i = head[u]; i; i = nxt[i])
#define ms(a, x) memset(a, x, sizeof(a))
#define fi first
#define se second
#define pb emplace_back
#define pq priority_queue
#define isinf(x) (x >= INF ? -1 : x)
#define y1 why_is_there_a_function_called_y1
#define DEBUG(x) cerr << (#x) << ":" << x << endl
using namespace std;
typedef long long LoveLive;
typedef pair<int, int> pii;
typedef vector<int> vi;
#ifdef int
const int INF = 0x3f3f3f3f3f3f3f3fll;
#else
const int INF = 0x3f3f3f3f;
#endif
const double eps = 1e-9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int randint(int l, int r) {
int out = rng() % (r - l + 1) + l;
return out >= l ? out : out + r - l + 1;
}
#ifdef FAST_IOSTREAM
#define br cout << '\n'
#define sp cout << ' '
long long read() {
long long x;
cin >> x;
return x;
}
template <typename T> void read(T &x) { cin >> x; }
template <typename T> void write(const T &x) { cout << x; }
#else
#define br putchar('\n')
#define sp putchar(' ')
template <typename T>
typename enable_if<!is_integral<T>::value, void>::type read(T &x) {
cin >> x;
}
long long read() {
char c;
long long out = 0, f = 1;
for (c = getchar(); !isdigit(c) && c != '-'; c = getchar())
;
if (c == '-') {
f = -1;
c = getchar();
}
for (; isdigit(c); c = getchar())
out = (out << 3) + (out << 1) + c - '0';
return out * f;
}
template <typename T>
typename enable_if<is_integral<T>::value, T>::type read(T &x) {
char c;
T f = 1;
x = 0;
for (c = getchar(); !isdigit(c) && c != '-'; c = getchar())
;
if (c == '-') {
f = -1;
c = getchar();
}
for (; isdigit(c); c = getchar())
x = (x << 3) + (x << 1) + c - '0';
return x *= f;
}
char read(char &x) {
for (x = getchar(); isspace(x); x = getchar())
;
return x;
}
double read(double &x) {
scanf("%lf", &x);
return x;
}
template <typename T>
typename enable_if<!is_integral<T>::value, void>::type write(const T &x) {
cout << x;
}
template <typename T>
typename enable_if<is_integral<T>::value, void>::type write(const T &x) {
if (x < 0) {
putchar('-');
write(-x);
return;
}
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
void write(const char &x) { putchar(x); }
void write(const double &x) { printf("%.10lf", x); }
#endif
template <typename T, typename... Args> void read(T &x, Args &...args) {
read(x);
read(args...);
}
template <
typename OutputIt,
typename = typename enable_if<
is_same<output_iterator_tag,
typename iterator_traits<OutputIt>::iterator_category>::value ||
(is_base_of<forward_iterator_tag, typename iterator_traits<OutputIt>::
iterator_category>::value &&
!is_const<OutputIt>::value)>::type>
void read(OutputIt __first, OutputIt __last) {
for (; __first != __last; ++__first)
read(*__first);
}
template <
typename InputIt,
typename = typename enable_if<is_base_of<
input_iterator_tag,
typename iterator_traits<InputIt>::iterator_category>::value>::type>
void wts(InputIt __first, InputIt __last) {
bool isFirst = true;
for (; __first != __last; ++__first) {
if (isFirst)
isFirst = false;
else
sp;
write(*__first);
}
br;
}
template <
typename InputIt,
typename = typename enable_if<is_base_of<
input_iterator_tag,
typename iterator_traits<InputIt>::iterator_category>::value>::type>
void wtb(InputIt __first, InputIt __last) {
for (; __first != __last; ++__first) {
write(*__first);
br;
}
}
template <typename T> void wts(const T &x) {
write(x);
sp;
}
template <typename T> void wtb(const T &x) {
write(x);
br;
}
template <typename T> void wte(const T &x) {
write(x);
exit(0);
}
template <typename T, typename... Args> void wts(const T &x, Args... args) {
wts(x);
wts(args...);
}
template <typename T, typename... Args> void wtb(const T &x, Args... args) {
wts(x);
wtb(args...);
}
template <typename T, typename... Args> void wte(const T &x, Args... args) {
wts(x);
wte(args...);
}
template <typename T> inline bool up(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool dn(T &x, const T &y) {
return y < x ? x = y, 1 : 0;
}
const int N = 500010;
const int mod = 1000000007;
int n;
double ans;
struct Vector {
int x, y;
int cj(const Vector &b) const { return x * b.y - y * b.x; }
int xx() const {
if (x == 0 && y == 0)
return -1;
if (x > 0 && y == 0)
return 0;
if (x > 0 && y > 0)
return 1;
if (x == 0 && y > 0)
return 2;
if (x < 0 && y > 0)
return 3;
if (x < 0 && y == 0)
return 4;
if (x < 0 && y < 0)
return 5;
if (x == 0 && y < 0)
return 6;
if (x > 0 && y < 0)
return 7;
}
bool operator<(const Vector &b) const {
if (xx() == b.xx())
return cj(b) > 0;
;
return xx() < b.xx();
}
} a[N];
signed main() {
#ifdef FAST_IOSTREAM
cin.sync_with_stdio(false);
cin.tie(0);
#endif
read(n);
For(i, 1, n) read(a[i].x, a[i].y);
sort(a + 1, a + n + 1);
For(i, 1, n) a[i + n] = a[i];
int x = 0, y = 0, r = 0;
for (int l = 1; l <= n; ++l) {
ans = max(ans, sqrt(x * x + y * y));
while (r < l + n - 1 &&
(a[l].cj(a[r + 1]) > 0 ||
a[l].cj(a[r + 1]) == 0 && (a[l].x > 0) == (a[r + 1].x > 0))) {
x += a[++r].x;
y += a[r].y;
ans = max(ans, sqrt(x * x + y * y));
}
x -= a[l].x;
y -= a[l].y;
}
printf("%.20lf", ans);
return 0;
}
| replace | 210 | 213 | 210 | 214 | 0 | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(), greater<long long>());
#define ALL(X) (X).begin(), (X).end()
#define INF 99999999
#define M_PI 3.14159265358979323846
#define MOD 1000000007
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 0};
int dy[] = {0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const map<T, S> p) {
for (auto el : p)
os << "[" << el.first << " " << el.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
os << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
struct point {
double x, y;
complex<double> z;
double theta;
point(double x = 0, double y = 0) : x(x), y(y) {
complex<double> w(x, y);
z = w;
calc_theta();
}
void calc_theta() { theta = arg(z); }
double dist() { return sqrt(x * x + y * y); }
double dist2() { return (x * x + y * y); }
point operator+=(const point &a) {
x += a.x;
y += a.y;
return *this;
}
};
int N;
vector<point> X;
void input() {
fast_io();
#ifdef __LOCAL
fs::path p = __FILE__;
fs::path input, output;
input = output = p.parent_path();
input += string("/input/") + string(p.stem()) + string(".txt");
output += string("/output/") + string(p.stem()) + string(".txt");
freopen(input.c_str(), "r", stdin);
freopen(output.c_str(), "w", stdout);
#endif
cin >> N;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
X.emplace_back(x, y);
}
}
double diff_theta(double a, double b) {
if (a * b >= 0)
return abs(a - b);
else {
if (b < 0)
swap(a, b);
return min(b - a, 2 * M_PI - b + a);
}
}
double eps = 1e-9;
void solve() {
double ans = 0;
auto cmp = [&](point a, point b) { return a.theta < b.theta; };
sort(X.begin(), X.end(), cmp);
for (int i = 0; i < N; i++) {
point z;
for (int j = i; j < N; j++) {
if (diff_theta(X[i].theta, X[j].theta) < M_PI) {
z += X[j];
if (j == N - 1)
j = 0;
} else
break;
}
ans = max(ans, z.dist2());
}
// for (int i = -180000; i <= 180000; i++)
// {
// double arg = (double)i/360000*M_PI;
// point po;
// for(auto p:X) {
// if(diff_theta(arg,p.theta)<M_PI_2-eps) {po+=p;}
// }
// ans = max(ans,po.dist2());
// }
cout << setprecision(12) << sqrt(ans) << endl;
}
int main() {
input();
solve();
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(), greater<long long>());
#define ALL(X) (X).begin(), (X).end()
#define INF 99999999
#define M_PI 3.14159265358979323846
#define MOD 1000000007
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 0};
int dy[] = {0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const map<T, S> p) {
for (auto el : p)
os << "[" << el.first << " " << el.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
os << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
struct point {
double x, y;
complex<double> z;
double theta;
point(double x = 0, double y = 0) : x(x), y(y) {
complex<double> w(x, y);
z = w;
calc_theta();
}
void calc_theta() { theta = arg(z); }
double dist() { return sqrt(x * x + y * y); }
double dist2() { return (x * x + y * y); }
point operator+=(const point &a) {
x += a.x;
y += a.y;
return *this;
}
};
int N;
vector<point> X;
void input() {
fast_io();
#ifdef __LOCAL
fs::path p = __FILE__;
fs::path input, output;
input = output = p.parent_path();
input += string("/input/") + string(p.stem()) + string(".txt");
output += string("/output/") + string(p.stem()) + string(".txt");
freopen(input.c_str(), "r", stdin);
freopen(output.c_str(), "w", stdout);
#endif
cin >> N;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
X.emplace_back(x, y);
}
}
double diff_theta(double a, double b) {
if (a * b >= 0)
return abs(a - b);
else {
if (b < 0)
swap(a, b);
return min(b - a, 2 * M_PI - b + a);
}
}
double eps = 1e-9;
void solve() {
double ans = 0;
auto cmp = [&](point a, point b) { return a.theta < b.theta; };
sort(X.begin(), X.end(), cmp);
for (int i = 0; i < N; i++) {
point z;
for (int j = i; j < 2 * N; j++) {
point tmp = z;
tmp += X[j % N];
if (tmp.dist2() >= z.dist2())
z = tmp;
else
break;
if (j == (N + i - 1))
break;
}
ans = max(ans, z.dist2());
}
// for (int i = -180000; i <= 180000; i++)
// {
// double arg = (double)i/360000*M_PI;
// point po;
// for(auto p:X) {
// if(diff_theta(arg,p.theta)<M_PI_2-eps) {po+=p;}
// }
// ans = max(ans,po.dist2());
// }
cout << setprecision(12) << sqrt(ans) << endl;
}
int main() {
input();
solve();
return 0;
}
| replace | 142 | 148 | 142 | 150 | TLE | |
p02926 | C++ | Runtime Error | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline ll read() {
ll x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >= '0') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return w == 1 ? x : -x;
}
ll n, ans;
struct node {
ll x, y;
} p[maxn];
inline bool cmp(node a, node b) {
ll x = a.x * b.y - a.y * b.x;
if (x >= 0)
return true;
return false;
}
inline ll wk(int x, int y) {
ll tx = 0, ty = 0;
for (int i = x; i <= y; i++)
tx += p[i].x, ty += p[i].y;
return tx * tx + ty * ty;
}
int main() {
n = read();
for (int i = 1; i <= n; i++)
p[i].x = read(), p[i].y = read();
sort(p + 1, p + n + 1, cmp);
// for(int i=1;i<=n;i++) cout<<p[i].x<<" "<<p[i].y<<endl;
for (int i = 1; i <= n; i++)
p[i + n] = p[i];
for (int i = 1; i <= n; i++)
for (int j = i; j <= i + n - 1; j++)
ans = max(ans, wk(i, j));
printf("%.10lf", sqrt(ans));
return 0;
}
| #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline ll read() {
ll x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >= '0') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return w == 1 ? x : -x;
}
ll n, ans;
struct node {
ll x, y;
} p[maxn];
inline bool cmp(node a, node b) { return atan2(a.y, a.x) < atan2(b.y, b.x); }
inline ll wk(int x, int y) {
ll tx = 0, ty = 0;
for (int i = x; i <= y; i++)
tx += p[i].x, ty += p[i].y;
return tx * tx + ty * ty;
}
int main() {
n = read();
for (int i = 1; i <= n; i++)
p[i].x = read(), p[i].y = read();
sort(p + 1, p + n + 1, cmp);
// for(int i=1;i<=n;i++) cout<<p[i].x<<" "<<p[i].y<<endl;
for (int i = 1; i <= n; i++)
p[i + n] = p[i];
for (int i = 1; i <= n; i++)
for (int j = i; j <= i + n - 1; j++)
ans = max(ans, wk(i, j));
printf("%.10lf", sqrt(ans));
return 0;
} | replace | 28 | 34 | 28 | 29 | 0 | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MOD = 1e9 + 7;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (int i = (l); i < (r); i++)
#define reper(i, l, r) for (int i = (r)-1; i >= (l); i--)
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
//-----------------------------------------------------------//
long double sq(ll x, ll y) { return x * x + y * y; }
int main() {
init();
int N;
cin >> N;
vector<ll> x(N), y(N);
rep(i, N) cin >> x[i] >> y[i];
vector<ll> ivec(N);
iota(all(ivec), 0);
sort(all(ivec),
[&](ll i, ll j) { return atan2(y[i], x[i]) < atan2(y[j], x[j]); });
ivec.resize(2 * N);
copy(all(ivec), ivec.begin() + N);
long double ans = 0, tmp = 0, tans = 0;
ll tx, ty;
rep(i, N) {
tx = 0;
ty = 0;
tans = 0;
rep(j, N) {
tx += x[ivec[i + j]];
ty += y[ivec[i + j]];
tmp = sq(tx, ty);
if (tmp > tans) {
tans = tmp;
ans = max(ans, tans);
} else {
tx -= x[ivec[i + j]];
ty -= y[ivec[i + j]];
}
}
}
cout << sqrt(ans) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MOD = 1e9 + 7;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (int i = (l); i < (r); i++)
#define reper(i, l, r) for (int i = (r)-1; i >= (l); i--)
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
//-----------------------------------------------------------//
long double sq(ll x, ll y) { return x * x + y * y; }
int main() {
init();
int N;
cin >> N;
vector<ll> x(N), y(N);
rep(i, N) cin >> x[i] >> y[i];
vector<ll> ivec(N);
iota(all(ivec), 0);
sort(all(ivec),
[&](ll i, ll j) { return atan2(y[i], x[i]) < atan2(y[j], x[j]); });
rep(i, N) ivec.eb(ivec[i]);
long double ans = 0, tmp = 0, tans = 0;
ll tx, ty;
rep(i, N) {
tx = 0;
ty = 0;
tans = 0;
rep(j, N) {
tx += x[ivec[i + j]];
ty += y[ivec[i + j]];
tmp = sq(tx, ty);
if (tmp > tans) {
tans = tmp;
ans = max(ans, tans);
} else {
tx -= x[ivec[i + j]];
ty -= y[ivec[i + j]];
}
}
}
cout << sqrt(ans) << endl;
return 0;
} | replace | 32 | 34 | 32 | 33 | 0 | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define Inf 0x3f3f3f3f
#define rg register
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 105;
inline int read() {
rg int res = 0, sign = 1;
rg char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
sign = -1;
ch = getchar();
}
do {
res = (res << 3) + (res << 1) + (ch ^ 48);
ch = getchar();
} while (isdigit(ch));
return res * sign;
}
int n, len;
ll ans;
struct str {
int x, y;
} v[Maxn];
ll dis(ll x, ll y) { return x * x + y * y; };
void Search2(rg int x, rg int cx, rg int cy) {
if (x > n) {
ans = max(ans, dis(cx, cy));
return;
}
Search2(x + 1, cx + v[x].x, cy + v[x].y);
Search2(x + 1, cx, cy);
}
void Search1(rg int x, rg int cx, rg int cy) {
if (x > len) {
rg ll tmp, res = dis(cx, cy);
for (int i = len + 1; i <= n - len; i++)
if ((tmp = dis(cx + v[i].x, cy + v[i].y)) > res) {
res = tmp;
cx += v[i].x;
cy += v[i].y;
}
Search2(n - len + 1, cx, cy);
return;
}
Search1(x + 1, cx + v[x].x, cy + v[x].y);
Search1(x + 1, cx, cy);
}
int main() {
rg ll tmp;
cin >> n;
len = n <= 30 ? n / 2 : 10;
for (int i = 1; i <= n; i++) {
v[i].x = read();
v[i].y = read();
}
for (rg int t = 1; t <= 100; t++) {
random_shuffle(v + 1, v + n + 1);
Search1(1, 0, 0);
}
printf("%.10f\n", sqrt(ans));
return 0;
}
| #include <bits/stdc++.h>
#define Inf 0x3f3f3f3f
#define rg register
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 105;
inline int read() {
rg int res = 0, sign = 1;
rg char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
sign = -1;
ch = getchar();
}
do {
res = (res << 3) + (res << 1) + (ch ^ 48);
ch = getchar();
} while (isdigit(ch));
return res * sign;
}
int n, len;
ll ans;
struct str {
int x, y;
} v[Maxn];
ll dis(ll x, ll y) { return x * x + y * y; };
void Search2(rg int x, rg int cx, rg int cy) {
if (x > n) {
ans = max(ans, dis(cx, cy));
return;
}
Search2(x + 1, cx + v[x].x, cy + v[x].y);
Search2(x + 1, cx, cy);
}
void Search1(rg int x, rg int cx, rg int cy) {
if (x > len) {
rg ll tmp, res = dis(cx, cy);
for (int i = len + 1; i <= n - len; i++)
if ((tmp = dis(cx + v[i].x, cy + v[i].y)) > res) {
res = tmp;
cx += v[i].x;
cy += v[i].y;
}
Search2(n - len + 1, cx, cy);
return;
}
Search1(x + 1, cx + v[x].x, cy + v[x].y);
Search1(x + 1, cx, cy);
}
int main() {
rg ll tmp;
cin >> n;
len = (n <= 20) ? n / 2 : 10;
for (int i = 1; i <= n; i++) {
v[i].x = read();
v[i].y = read();
}
for (rg int t = 1; t <= 100; t++) {
random_shuffle(v + 1, v + n + 1);
Search1(1, 0, 0);
}
printf("%.10f\n", sqrt(ans));
return 0;
}
| replace | 54 | 55 | 54 | 55 | TLE | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct ele {
double x, y;
};
bool cmp(const ele &a, const ele &b) {
if (a.x < 0 && b.x < 0)
return cmp(b, a);
if (a.x < 0)
return false;
if (b.x < 0)
return true;
double ap, bp;
if (a.x == 0) {
if (a.y < 0) {
ap = INT_MIN;
} else {
ap = INT_MAX;
}
} else {
ap = a.y / a.x;
}
if (b.x == 0) {
if (b.y < 0) {
bp = INT_MIN;
} else {
bp = INT_MAX;
}
} else {
bp = b.y / b.x;
}
return ap < bp;
}
int main() {
int N;
cin >> N;
vector<ele> e;
int k = 0;
for (int i = 0; i < N; ++i) {
double x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
k++;
continue;
}
e.push_back({x, y});
}
N -= k;
if (N == 0) {
cout << 0 << "\n";
return 0;
}
sort(e.begin(), e.end(), cmp);
double ans = 0;
for (int i = 1; i <= N; ++i) {
for (int j = 0; j < N; ++j) {
double x = 0, y = 0;
for (int k = 0; k < i; ++k) {
int id = (k + j) % N;
x += e[id].x;
y += e[id].y;
}
double temp = sqrt(x * x + y * y);
ans = max(ans, temp);
}
}
cout << setprecision(30) << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct ele {
double x, y;
};
bool cmp(const ele &a, const ele &b) {
return atan2(a.x, a.y) < atan2(b.x, b.y);
}
int main() {
int N;
cin >> N;
vector<ele> e;
int k = 0;
for (int i = 0; i < N; ++i) {
double x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
k++;
continue;
}
e.push_back({x, y});
}
N -= k;
if (N == 0) {
cout << 0 << "\n";
return 0;
}
sort(e.begin(), e.end(), cmp);
double ans = 0;
for (int i = 1; i <= N; ++i) {
for (int j = 0; j < N; ++j) {
double x = 0, y = 0;
for (int k = 0; k < i; ++k) {
int id = (k + j) % N;
x += e[id].x;
y += e[id].y;
}
double temp = sqrt(x * x + y * y);
ans = max(ans, temp);
}
}
cout << setprecision(30) << ans;
return 0;
} | replace | 8 | 34 | 8 | 9 | TLE | |
p02926 | C++ | Time Limit Exceeded | // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
// 区間削除は出来ない
template <class T> struct my_pbds_tree {
set<T> s;
auto begin() { return s.begin(); }
auto end() { return s.end(); }
auto rbegin() { return s.rbegin(); }
auto rend() { return s.rend(); }
auto empty() { return s.empty(); }
auto size() { return s.size(); }
void clear() { s.clear(); }
template <class U> void insert(U v) { s.insert(v); }
template <class U> void operator+=(U v) { insert(v); }
template <class F> auto erase(F v) { return s.erase(v); }
template <class U> auto find(U v) { return s.find(v); }
template <class U> auto lower_bound(U v) { return s.lower_bound(v); }
template <class U> auto upper_bound(U v) { return s.upper_bound(v); }
auto find_by_order(ll k) {
auto it = s.begin();
for (ll i = 0; i < k; i++)
it++;
return it;
}
auto order_of_key(ll v) {
auto it = s.begin();
ll i = 0;
for (; it != s.end() && *it < v; i++)
it++;
return i;
}
};
#define pbds(T) my_pbds_tree<T>
#else
#define unordered_map __gnu_pbds::gp_hash_table
// find_by_order(k) k番目のイテレーター
// order_of_key(k) k以上が前から何番目か
#define pbds(U) \
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag, \
__gnu_pbds::tree_order_statistics_node_update>
#endif
struct xorshift {
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);
}
size_t operator()(std::pair<ll, ll> x) const {
ll v = ((x.first) << 32) | x.second;
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(v + FIXED_RANDOM);
}
};
template <class U, class L>
void operator+=(
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update> &s,
L v) {
s.insert(v);
}
// 衝突対策
#define ws wszzzz
template <class A, class B, class C> struct T2 {
A f;
B s;
C t;
T2() { f = 0, s = 0, t = 0; }
T2(A f, B s, C t) : f(f), s(s), t(t) {}
bool operator<(const T2 &r) const {
return f != r.f ? f < r.f
: s != r.s ? s < r.s
: t < r.t; /*return f != r.f ? f > r.f : s != r.s ?n s >
r.s : t > r.t; 大きい順 */
}
bool operator>(const T2 &r) const {
return f != r.f ? f > r.f
: s != r.s ? s > r.s
: t > r.t; /*return f != r.f ? f > r.f : s != r.s ? s >
r.s : t > r.t; 小さい順 */
}
bool operator==(const T2 &r) const {
return f == r.f && s == r.s && t == r.t;
}
bool operator!=(const T2 &r) const {
return f != r.f || s != r.s || t != r.t;
}
};
template <class A, class B, class C, class D> struct F2 {
A a;
B b;
C c;
D d;
F2() { a = 0, b = 0, c = 0, d = 0; }
F2(A a, B b, C c, D d) : a(a), b(b), c(c), d(d) {}
bool operator<(const F2 &r) const {
return a != r.a ? a < r.a
: b != r.b ? b < r.b
: c != r.c ? c < r.c
: d < r.d; /* return a != r.a ? a > r.a : b != r.b ? b
> r.b : c != r.c ? c > r.c : d > r.d;*/
}
bool operator>(const F2 &r) const {
return a != r.a ? a > r.a
: b != r.b ? b > r.b
: c != r.c ? c > r.c
: d > r.d; /* return a != r.a ? a < r.a : b != r.b
? b < r.b : c != r.c ? c < r.c : d < r.d;*/
}
bool operator==(const F2 &r) const {
return a == r.a && b == r.b && c == r.c && d == r.d;
}
bool operator!=(const F2 &r) const {
return a != r.a || b != r.b || c != r.c || d != r.d;
}
ll operator[](ll i) {
assert(i < 4);
return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;
}
};
typedef T2<ll, ll, ll> T;
typedef F2<ll, ll, ll, ll> F;
T mt(ll a, ll b, ll c) { return T(a, b, c); }
//@マクロ省略系 型,構造
#define double long double
#define ull unsigned long long
using dou = double;
using itn = int;
using str = string;
using bo = bool;
#define au auto
using P = pair<ll, ll>;
#define fi first
#define se second
#define beg begin
#define rbeg rbegin
#define con continue
#define bre break
#define brk break
#define is ==
#define el else
#define elf else if
#define wh while
#define upd update
#define maxq 1
#define minq -1
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MALLOC(type, len) (type *)malloc((len) * sizeof(type))
#define lam(right) [&](ll &p) { return p right; }
// マクロ省略系 コンテナ
using vi = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using vd = vector<double>;
using vc = vector<char>;
using vp = vector<P>;
using vt = vector<T>;
#define vec vector
#define o_vvt(o1, o2, o3, o4, name, ...) name
#define vvt0(t) vec<vec<t>>
#define vvt1(t, a) vec<vec<t>> a
#define vvt2(t, a, b) vec<vec<t>> a(b)
#define vvt3(t, a, b, c) vec<vec<t>> a(b, vec<t>(c))
#define vvt4(t, a, b, c, d) vec<vec<t>> a(b, vec<t>(c, d))
#define vvi(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(ll, __VA_ARGS__)
#define vvb(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(bool, __VA_ARGS__)
#define vvs(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(string, __VA_ARGS__)
#define vvd(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(double, __VA_ARGS__)
#define vvc(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(char, __VA_ARGS__)
#define vvp(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(P, __VA_ARGS__)
#define vvt(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(T, __VA_ARGS__)
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
#define vni(name, ...) auto name = make_v<ll>(__VA_ARGS__)
#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)
#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)
#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)
#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)
#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
#define tos to_string
using mapi = map<ll, ll>;
using mapp = map<P, ll>;
using mapd = map<dou, ll>;
using mapc = map<char, ll>;
using maps = map<str, ll>;
using seti = set<ll>;
using setd = set<dou>;
using setc = set<char>;
using sets = set<str>;
using qui = queue<ll>;
#define bset bitset
#define uset unordered_set
#define useti unordered_set<ll, ll, xorshift>
#define mset multiset
#define mseti multiset<ll>
#define umap unordered_map
#define umapi unordered_map<ll, ll, xorshift>
#define umapp unordered_map<P, ll, xorshift>
#define mmap multimap
template <class T> struct pq {
priority_queue<T, vector<T>, greater<T>> q; /*小さい順*/
T su = 0;
void clear() {
q = priority_queue<T, vector<T>, greater<T>>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
template <class T> struct pqg {
priority_queue<T> q; /*大きい順*/
T su = 0;
void clear() {
q = priority_queue<T>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
#define pqi pq<ll>
#define pqgi pqg<ll>
// マクロ 繰り返し
#define o_rep(o1, o2, o3, o4, name, ...) name
#define rep1(n) for (ll rep1i = 0, rep1lim = n; rep1i < rep1lim; ++rep1i)
#define rep2(i, n) for (ll i = 0, rep2lim = n; i < rep2lim; ++i)
#define rep3(i, m, n) for (ll i = m, rep3lim = n; i < rep3lim; ++i)
#define rep4(i, m, n, ad) for (ll i = m, rep4lim = n; i < rep4lim; i += ad)
#define rep(...) o_rep(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rer2(i, n) for (ll i = n; i >= 0; i--)
#define rer3(i, m, n) for (ll i = m, rer3lim = n; i >= rer3lim; i--)
#define rer4(i, m, n, dec) for (ll i = m, rer4lim = n; i >= rer4lim; i -= dec)
#define rer(...) o_rep(__VA_ARGS__, rer4, rer3, rer2, )(__VA_ARGS__)
#define reps2(i, j, n) \
for (ll i = 0, reps2lim = n; i < reps2lim; ++i) \
for (ll j = 0; j < reps2lim; ++j)
#define reps3(i, j, k, n) \
for (ll i = 0, reps3lim = n; i < reps3lim; ++i) \
for (ll j = 0; j < reps3lim; ++j) \
for (ll k = 0; k < reps3lim; ++k)
#define reps4(i, j, k, l, n) \
for (ll i = 0, reps4lim = n; i < reps4lim; ++i) \
for (ll j = 0; j < reps4lim; ++j) \
for (ll k = 0; k < reps4lim; ++k) \
for (ll l = 0; l < reps4lim; ++l)
#define o_reps(o1, o2, o3, o4, o5, name, ...) name
#define reps(...) o_reps(__VA_ARGS__, reps4, reps3, reps2, rep2, )(__VA_ARGS__)
#define repss(i, j, k, a, b, c) \
for (ll i = 0; i < a; ++i) \
for (ll j = 0; j < b; ++j) \
for (ll k = 0; k < c; ++k)
#define fora(a, b) for (auto &&a : b)
#define form(st, l, r) \
for (auto &&it = st.lower_bound(l); it != st.end() && (*it).fi < r; ++it)
#define forit(st, l, r) \
for (auto &&it = st.lower_bound(l); it != st.end() && (*it) < r;)
// マクロ 定数
#define k3 1010
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const ll inf = (ll)1e9 + 100;
const ll linf = (ll)1e18 + 100;
const char infc = '{';
const string infs = "{";
const double eps = 1e-9;
const double PI = 3.1415926535897932384626433832795029L;
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
// マクロ省略形 関数等
#define arsz(a) (sizeof(a) / sizeof(a[0]))
#define sz(a) ((ll)(a).size())
#define mp make_pair
#define pb pop_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr bool ev(ll a) { return !(a & 1); }
constexpr bool od(ll a) { return (a & 1); }
//@拡張系 こう出来るべきというもの
// 埋め込み 存在を意識せずに機能を増やされているもの
//@formatter:on
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
template <> class hash<std::pair<ll, ll>> {
public
: /*大きいllが渡されると、<<32でオーバーフローするがとりあえず問題ないと判断*/
size_t operator()(const std::pair<ll, ll> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
} // namespace std
//@formatter:off
// stream まとめ
istream &operator>>(istream &iss, P &a) {
iss >> a.first >> a.second;
return iss;
}
template <typename T> istream &operator>>(istream &iss, vector<T> &vec) {
for (T &x : vec)
iss >> x;
return iss;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> p) {
os << p.fi << " " << p.se << endl;
return os;
}
ostream &operator<<(ostream &os, T p) {
os << p.f << " " << p.s << " " << p.t;
return os;
}
ostream &operator<<(ostream &os, F p) {
os << p.a << " " << p.b << " " << p.c << " " << p.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (ll i = 0; i < vec.size(); ++i)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
for (ll i = 0; i < vec.size(); ++i) {
for (ll j = 0; j < vec[i].size(); ++j) {
os << vec[i][j] << " ";
}
os << endl;
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &m) {
for (auto &&v : m)
os << v;
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> s) {
fora(v, s) { os << v << " "; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> a) {
fora(v, a) os << v << " ";
return os;
}
template <typename W, typename H> void resize(vector<W> &vec, const H head) {
vec.resize(head);
}
template <typename W, typename H, typename... T>
void resize(vector<W> &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec)
resize(v, tail...);
}
template <typename T, typename F> bool all_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool all_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (!all_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool any_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool any_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (any_of2(v[i], f))
return true;
}
return false;
}
template <typename T, typename F> bool none_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool none_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (none_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool find_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll find_if2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (find_if2(v[i], f))
return i;
}
return sz(v);
}
template <typename T, typename F> bool rfind_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll rfind_if2(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (rfind_if2(v[i], f))
return i;
}
return -1;
}
template <class T> bool contains(string &s, const T &v) {
return s.find(v) != string::npos;
}
template <typename T> bool contains(vector<T> &v, const T &val) {
return std::find(v.begin(), v.end(), val) != v.end();
}
template <typename T, typename F> bool contains_if2(vector<T> &v, F f) {
return find_if(v.begin(), v.end(), f) != v.end();
}
template <typename T, typename F> ll count_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll count_if2(vector<T> &vec, F f) {
ll ret = 0;
fora(v, vec) ret += count_if2(v, f);
return ret;
}
template <typename T, typename F> void for_each2(T &v, F f) { f(v); }
template <typename T, typename F> void for_each2(vector<T> &vec, F f) {
fora(v, vec) for_each2(v, f);
}
template <typename W> ll count_od(vector<W> &a) {
return count_if2(a, [](ll v) { return v & 1; });
}
template <typename W> ll count_ev(vector<W> &a) {
return count_if2(a, [](ll v) { return !(v & 1); });
}
#define all_of(a, right) all_of2(a, lam(right))
#define any_of(a, right) any_of2(a, lam(right))
#define none_of(a, right) none_of2(a, lam(right))
#define find_if(a, right) find_if2(a, lam(right))
#define rfind_if(a, right) rfind_if2(a, lam(right))
#define contains_if(a, right) contains_if2(a, lam(right))
#define count_if(a, right) count_if2(a, lam(right))
#define for_each(a, right) \
do { \
fora(v, a) { v right; } \
} while (0)
template <class T, class U> void replace(vector<T> &a, T key, U v) {
replace(a.begin(), a.end(), key, v);
}
void replace(str &a, char key, str v) {
if (v == "")
a.erase(remove(all(a), key), a.end());
}
void replace(str &a, char key, char v) { replace(all(a), key, v); }
// keyと同じかどうか01で置き換える
template <class T, class U> void replace(vector<T> &a, U k) {
rep(i, sz(a)) a[i] = a[i] == k;
}
template <class T, class U> void replace(vector<vector<T>> &a, U k) {
rep(i, sz(a)) rep(j, sz(a[0])) a[i][j] = a[i][j] == k;
}
template <class T> void replace(T &a) { replace(a, '#'); }
void replace(str &a, str key, str v) {
stringstream t;
ll kn = sz(key);
std::string::size_type Pos(a.find(key));
ll l = 0;
while (Pos != std::string::npos) {
t << a.substr(l, Pos - l);
t << v;
l = Pos + kn;
Pos = a.find(key, Pos + kn);
}
t << a.substr(l, sz(a) - l);
a = t.str();
}
template <class T> bool includes(vector<T> &a, vector<T> &b) {
vi c = a;
vi d = b;
sort(all(c));
sort(all(d));
return includes(all(c), all(d));
}
template <class T> bool is_permutation(vector<T> &a, vector<T> &b) {
return is_permutation(all(a), all(b));
}
template <class T> bool next_permutation(vector<T> &a) {
return next_permutation(all(a));
}
void iota(vector<ll> &ve, ll s, ll n) {
ve.resize(n);
iota(all(ve), s);
}
vi iota(ll s, ll len) {
vi ve(len);
iota(all(ve), s);
return ve;
}
template <class A, class B> auto vtop(vector<A> &a, vector<B> &b) {
assert(sz(a) == sz(b)); /*stringを0で初期化できない */
vector<pair<A, B>> res;
rep(i, sz(a)) res.eb(a[i], b[i]);
return res;
}
template <class A, class B>
void ptov(vector<pair<A, B>> &p, vector<A> &a, vector<B> &b) {
a.resize(sz(p)), b.resize(sz(p));
rep(i, sz(p)) a[i] = p[i].fi, b[i] = p[i].se;
}
template <class A, class B, class C>
auto vtot(vector<A> &a, vector<B> &b, vector<C> &c) {
assert(sz(a) == sz(b) && sz(b) == sz(c));
vector<T2<A, B, C>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i]);
return res;
}
template <class A, class B, class C, class D>
auto vtof(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
assert(sz(a) == sz(b) && sz(b) == sz(c) && sz(c) == sz(d));
vector<F2<A, B, C, D>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i], d[i]);
return res;
}
enum pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd };
enum tcomparator {
fisiti,
fisitd,
fisdti,
fisdtd,
fdsiti,
fdsitd,
fdsdti,
fdsdtd,
fitisi,
fitisd,
fitdsi,
fitdsd,
fdtisi,
fdtisd,
fdtdsi,
fdtdsd,
sifiti,
sifitd,
sifdti,
sifdtd,
sdfiti,
sdfitd,
sdfdti,
sdfdtd,
sitifi,
sitifd,
sitdfi,
sitdfd,
sdtifi,
sdtifd,
sdtdfi,
sdfdfd,
tifisi,
tifisd,
tifdsi,
tifdsd,
tdfisi,
tdfisd,
tdfdsi,
tdfdsd,
tisifi,
tisifd,
tisdfi,
tisdfd,
tdsifi,
tdsifd,
tdsdfi,
tdsdfd
};
template <class A, class B> void sort(vector<pair<A, B>> &a, pcomparator type) {
typedef pair<A, B> U;
if (type == fisi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });
else if (type == fisd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });
else if (type == fdsi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });
else if (type == fdsd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });
else if (type == sifi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });
else if (type == sifd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });
else if (type == sdfi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });
else if (type == sdfd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });
};
template <class U> void sort(vector<U> &a, pcomparator type) {
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });
};
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, pcomparator type) {
typedef F2<A, B, C, D> U;
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b < r.b; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b > r.b; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b < r.b; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b > r.b; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a < r.a; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a > r.a; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a < r.a; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a > r.a; });
};
template <class U> void sort(vector<U> &a, tcomparator type) {
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
}
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, tcomparator type) {
typedef F2<A, B, C, D> U;
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
}
void sort(string &a) { sort(all(a)); }
template <class T> void sort(vector<T> &a) { sort(all(a)); }
// P l, P rで f(P) の形で渡す
template <class U, class F> void sort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) < f(r); });
};
template <class T> void rsort(vector<T> &a) { sort(all(a), greater<T>()); };
template <class U, class F> void rsort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) > f(r); });
};
// F = T<T>
// 例えばreturn p.fi + p.se;
template <class A, class B> void sortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
sort(c);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B, class F>
void sortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
sort(c, f);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B> void rsortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
rsort(c);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class F>
void rsortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
rsort(c, f);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class C>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
sort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
sort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
rsort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
rsort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class D>
void sortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
sort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
template <class A, class B, class C, class D>
void rsortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
rsort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
// sortindex 元のvectorはソートしない
template <class T> vi sorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind);
return ind;
} /*indexの分で型が変わるためpcomparatorが必要*/
template <class T> vi sorti(vector<T> &a, pcomparator f) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind, f);
return ind;
}
template <class T, class F> vi sorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) < f(a[y]); });
return ind;
}
template <class T> vi rsorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
rsortp(b, ind);
return ind;
}
template <class T, class F> vi rsorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) > f(a[y]); });
return ind;
}
template <class A, class B, class F>
vi sortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) < f(c[y]); });
return ind;
}
template <class A, class B>
vi sortpi(vector<A> &a, vector<B> &b, pcomparator f) {
vi ind = iota(0, sz(a));
auto c = a;
auto d = b;
sortt(c, d, ind, f);
return ind;
}
template <class A, class B> vi sortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fisi);
};
template <class A, class B, class F>
vi rsortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) > f(c[y]); });
return ind;
}
template <class A, class B> vi rsortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fdsd);
};
template <class A, class B, class C, class F>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) < f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, pcomparator f) {
vi ind = iota(0, sz(a));
auto d = vtof(a, b, c, ind);
sort(d, f);
rep(i, sz(a)) ind[i] = d[i].d;
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] < c[y];
else
return b[x] < b[y];
} else {
return a[x] < a[y];
}
});
return ind;
}
template <class A, class B, class C, class F>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) > f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] > c[y];
else
return b[x] > b[y];
} else {
return a[x] > a[y];
}
});
return ind;
}
template <class T> void sort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
sort(a[i]);
}
template <class T> void rsort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
rsort(a[i]);
}
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <typename W, typename T> void fill(W &xx, const T vall) { xx = vall; }
template <typename W, typename T> void fill(vector<W> &vecc, const T vall) {
for (auto &&vx : vecc)
fill(vx, vall);
}
template <typename W, typename T> void fill(vector<W> &xx, const T v, ll len) {
rep(i, len) xx[i] = v;
}
template <typename W, typename T>
void fill(vector<vector<W>> &xx, const T v, ll lh, ll lw) {
rep(i, lh) rep(j, lw) xx[i][j] = v;
}
template <class T, class U> void fill(vector<T> &a, U val, vi &ind) {
fora(v, ind) a[v] = val;
}
template <typename A, size_t N> A sum(A (&a)[N]) {
A res = 0;
rep(i, N) res += a[i];
return res;
}
template <typename A, size_t N, size_t O> A sum(A (&a)[N][O]) {
A res = 0;
rep(i, N) rep(j, O) res += a[i][j];
return res;
}
template <typename A, size_t N, size_t O, size_t P> A sum(A (&a)[N][O][P]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) res += a[i][j][k];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A sum(A (&a)[N][O][P][Q]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) res += a[i][j][k][l];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A sum(A (&a)[N][O][P][Q][R]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) res += a[i][j][k][l][m];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A sum(A (&a)[N][O][P][Q][R][S]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S) res +=
a[i][j][k][l][m][n];
return res;
}
//@汎用便利関数 入力
ll in() {
ll ret;
cin >> ret;
return ret;
}
string sin() {
string ret;
cin >> ret;
return ret;
}
template <class T> void in(T &head) { cin >> head; }
template <class T, class... U> void in(T &head, U &...tail) {
cin >> head;
in(tail...);
}
#define o_din(o1, o2, o3, o4, o5, o6, name, ...) name
#define din1(a) \
ll a; \
cin >> a
#define din2(a, b) \
ll a, b; \
cin >> a >> b
#define din3(a, b, c) \
ll a, b, c; \
cin >> a >> b >> c
#define din4(a, b, c, d) \
ll a, b, c, d; \
cin >> a >> b >> c >> d
#define din5(a, b, c, d, e) \
ll a, b, c, d, e; \
cin >> a >> b >> c >> d >> e
#define din6(a, b, c, d, e, f) \
ll a, b, c, d, e, f; \
cin >> a >> b >> c >> d >> e >> f
#define din(...) \
o_din(__VA_ARGS__, din6, din5, din4, din3, din2, din1)(__VA_ARGS__)
#define o_dind(o1, o2, o3, o4, name, ...) name
#define din1d(a) \
din1(a); \
a--
#define din2d(a, b) \
din2(a, b); \
a--, b--
#define din3d(a, b, c) \
din3(a, b, c); \
a--, b--, c--
#define din4d(a, b, c, d) \
din4(a, b, c, d); \
a--, b--, c--, d--
#define dind(...) o_dind(__VA_ARGS__, din4d, din3d, din2d, din1d)(__VA_ARGS__)
template <class T> void out2(T &&head) { cout << head; }
template <class T, class... U> void out2(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
}
template <class T, class... U> void out(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
cout << "" << endl;
}
template <class T> void out(T &&head) { cout << head << endl; }
void out() { cout << "" << endl; }
#ifdef _DEBUG
template <class T> string out_m(vector<T> &a, ll W = inf) {
stringstream ss;
if (W == inf)
W = min(sz(a), 12ll);
if (sz(a) == 0)
return ss.str();
rep(i, W) { ss << a[i] << " "; }
ss << "" << endl;
return ss.str();
}
template <class T>
string out_m(vector<vector<T>> &a, ll H = inf, ll W = inf, int key = -1) {
H = min({H, sz(a), 12ll});
W = min({W, sz(a[0]), 12ll});
stringstream ss;
ss << endl;
if (key == -1)
ss << " *|";
else
ss << " " << key << "|";
rep(w, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 4 + 3) ss << "_";
ss << "" << endl;
rep(h, H) {
ss << std::right << std::setw(2) << h << "|";
rep(w, min(sz(a[h]), 12ll)) {
if (a[h][w] == linf)
ss << " e"
<< " ";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
ss << endl;
return ss.str();
}
/*@formatter:off*/
template <class T>
string out_m(vector<vector<vector<T>>> &a, ll H = inf, ll W = inf, ll U = inf) {
stringstream ss;
if (H == inf)
H = 5;
H = min(H, sz(a));
rep(i, H) {
ss << endl;
ss << out_m(a[i], W, U, i);
}
ss << endl;
return ss.str();
}
string out_m(int a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> string out_m(T &a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> void outv(vector<T> &a, ll W = inf) {
cout << out_m(a, W) << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
cout << out_m(a, H, W, key) << endl;
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
cout << out_m(a, H, W, U) << endl;
}
#else
template <class T> void outv(vector<T> &a, ll W = inf) {
rep(i, min(W, sz(a))) { cout << a[i] << " "; }
cout << "" << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
rep(i, min(H, sz(a))) { outv(a[i], W); }
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
;
}
#endif
template <class T> void outl(vector<T> &a, int n = inf) {
rep(i, min(n, sz(a))) cout << a[i] << endl;
}
template <class T> void na(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i];
}
#define dna(a, n) \
vi a(n); \
rep(dnai, n) cin >> a[dnai];
template <class T> void nao(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1];
}
template <class T> void naod(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1], a[i + 1]--;
}
template <class T> void nad(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i], a[i]--;
}
template <class T, class U> void na2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i];
}
#define dna2(a, b, n) \
vi a(n), b(n); \
rep(dna2i, n) cin >> a[dna2i] >> b[dna2i];
template <class T, class U> void nao2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n + 1);
b.resize(n + 1);
a[0] = b[0] = 0;
rep(i, n) cin >> a[i + 1] >> b[i + 1];
}
#define dna2d(a, b, n) \
vi a(n), b(n); \
rep(dna2di, n) { \
cin >> a[dna2di] >> b[dna2di]; \
a[dna2di]--, b[dna2di]--; \
}
template <class T, class U> void na2d(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i], a[i]--, b[i]--;
}
template <class T, class U, class W>
void na3(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i];
}
#define dna3(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3i, n) cin >> a[dna3i] >> b[dna3i] >> c[dna3i];
template <class T, class U, class W>
void na3d(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i], a[i]--, b[i]--, c[i]--;
}
#define dna3d(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3di, n) { \
cin >> a[dna3di] >> b[dna3di] >> c[dna3di]; \
a[dna3di]--, b[dna3di]--, c[dna3di]--; \
}
template <class T, class U, class W, class X>
void na4(vector<T> &a, vector<U> &b, vector<W> &c, vector<X> &d, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
d.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i];
}
#define dna4(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i];
#define dna4d(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i], \
--a[dna4i], --b[dna4i], --c[dna4i], --d[dna4i];
#define nt(a, h, w) \
resize(a, h, w); \
rep(nthi, h) rep(ntwi, w) cin >> a[nthi][ntwi];
#define ntd(a, h, w) \
resize(a, h, w); \
rep(ntdhi, h) rep(ntdwi, w) cin >> a[ntdhi][ntdwi], a[ntdhi][ntdwi]--;
#define ntp(a, h, w) \
resize(a, h + 2, w + 2); \
fill(a, '#'); \
rep(ntphi, 1, h + 1) rep(ntpwi, 1, w + 1) cin >> a[ntphi][ntpwi];
// デバッグ
#define sp << " " <<
#define debugName(VariableName) #VariableName
#define deb1(x) debugName(x) << " = " << out_m(x)
#define deb2(x, ...) deb1(x) << ", " << deb1(__VA_ARGS__)
#define deb3(x, ...) deb1(x) << ", " << deb2(__VA_ARGS__)
#define deb4(x, ...) deb1(x) << ", " << deb3(__VA_ARGS__)
#define deb5(x, ...) deb1(x) << ", " << deb4(__VA_ARGS__)
#define deb6(x, ...) deb1(x) << ", " << deb5(__VA_ARGS__)
#define deb7(x, ...) deb1(x) << ", " << deb6(__VA_ARGS__)
#define deb8(x, ...) deb1(x) << ", " << deb7(__VA_ARGS__)
#define deb9(x, ...) deb1(x) << ", " << deb8(__VA_ARGS__)
#define deb10(x, ...) deb1(x) << ", " << deb9(__VA_ARGS__)
#define o_ebug(o1, o2, o3, o4, o5, o6, o7, o8, o9, o10, name, ...) name
#ifdef _DEBUG
#define deb(...) \
cerr << o_ebug(__VA_ARGS__, deb10, deb9, deb8, deb7, deb6, deb5, deb4, deb3, \
deb2, deb1)(__VA_ARGS__) \
<< endl
#else
#define deb(...) ;
#endif
#define debugline(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
//@formatter:off
// よく使うクラス、構造体
struct unionfind {
vector<ll> par;
vector<ll> siz;
vector<ll> es;
ll n, trees; // 連結グループの数(親の種類)
unionfind(ll n) : n(n), trees(n) {
par.resize(n);
siz.resize(n);
es.resize(n);
for (ll i = 0; i < n; i++) {
par[i] = i;
siz[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
es[x]++;
if (x == y)
return false;
if (siz[x] > siz[y])
swap(x, y);
trees--;
par[x] = y;
siz[y] += siz[x];
es[y] += es[x];
return true;
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
ll esize(ll x) { return es[root(x)]; }
vi sizes() {
vi cou(n);
vi ret;
ret.reserve(n);
rep(i, n) { cou[root(i)]++; }
rep(i, n) {
if (cou[i])
ret.push_back(cou[i]);
}
return ret;
}
// つながりを無向グラフと見なし、xが閉路に含まれるか判定
bool close(ll x) { return esize(x) >= size(x); }
vec<vi> sets() {
vi ind(n, -1);
ll i = 0;
vvi(res, trees);
rep(j, n) {
ll r = root(j);
if (ind[r] == -1)
ind[r] = i++;
res[ind[r]].push_back(j);
}
rep(i, trees) {
ll r = root(res[i][0]);
if (res[i][0] == r)
continue;
rep(j, 1, sz(res[i])) {
if (res[i][j] == r) {
swap(res[i][0], res[i][j]);
break;
}
}
}
return res;
}
}; //@formatter:off
using bll = __int128;
using u32 = unsigned;
using u64 = unsigned long long;
using u128 = __uint128_t;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
ll len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
//__int128 toi128(string &s) { __int128 ret = 0; for (ll i = 0; i <
//s.length(); ++i) if ('0' <= s[i] && s[i] <= '9') ret = 10 *
//ret + s[i] - '0'; return ret;}
// エラー
void ole() {
#ifdef _DEBUG
debugline("ole");
exit(0);
#endif
string a = "a";
rep(i, 30) a += a;
rep(i, 1 << 17) cout << a << endl;
cout << "OLE 出力長制限超過" << endl;
exit(0);
}
void re() {
assert(0 == 1);
exit(0);
}
void tle() {
while (inf)
cout << inf << endl;
}
// 便利関数
// テスト用
char ranc() { return (char)('a' + rand() % 26); }
ll rand(ll min, ll max) {
assert(min <= max);
if (min >= 0 && max >= 0) {
return rand() % (max + 1 - min) + min;
} else if (max < 0) {
return -rand(-max, -min);
} else {
if (rand() % 2) {
return rand(0, max);
} else {
return -rand(0, -min);
}
}
}
vi ranv(ll n, ll min, ll max) {
vi v(n);
rep(i, n) v[i] = rand(min, max);
return v;
}
str ransu(ll n) {
str s;
rep(i, n) s += (char)rand('A', 'Z');
return s;
}
str ransl(ll n) {
str s;
rep(i, n) s += (char)rand('a', 'z');
return s;
}
// 単調増加
vi ranvinc(ll n, ll min, ll max) {
vi v(n);
bool bad = 1;
while (bad) {
bad = 0;
v.resize(n);
rep(i, n) {
if (i && min > max - v[i - 1]) {
bad = 1;
break;
}
if (i)
v[i] = v[i - 1] + rand(min, max - v[i - 1]);
else
v[i] = rand(min, max);
}
}
return v;
}
// 便利 汎用
void ranvlr(ll n, ll min, ll max, vi &l, vi &r) {
l.resize(n);
r.resize(n);
rep(i, n) {
l[i] = rand(min, max);
r[i] = l[i] + rand(0, max - l[i]);
}
}
vp run_length(vi &a) {
vp ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
vector<pair<char, ll>> run_length(string &a) {
vector<pair<char, ll>> ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
template <class F> ll mgr(ll ok, ll ng, F f) {
if (ok < ng)
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
if (f(mid))
ok = mid;
else
ng = mid;
}
else
while (ok - ng > 1) {
ll mid = (ok + ng) / 2;
if (f(mid))
ok = mid;
else
ng = mid;
}
return ok;
}
// strを整数として比較
string smax(str &a, str b) {
if (sz(a) < sz(b)) {
return b;
} else if (sz(a) > sz(b)) {
return a;
} else if (a < b)
return b;
else
return a;
}
// strを整数として比較
string smin(str &a, str b) {
if (sz(a) > sz(b)) {
return b;
} else if (sz(a) < sz(b)) {
return a;
} else if (a > b)
return b;
else
return a;
}
template <typename W, typename T> ll find(vector<W> &a, const T key) {
rep(i, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename W, typename T> P find(vector<vector<W>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return mp(i, j);
return mp(-1, -1);
}
template <typename W, typename U>
T find(vector<vector<vector<W>>> &a, const U key) {
rep(i, sz(a)) rep(j, sz(a[0]))
rep(k, sz(a[0][0])) if (a[i][j][k] == key) return mt(i, j, k);
return mt(-1, -1, -1);
}
template <typename W, typename T> ll count2(W &a, const T k) { return a == k; }
template <typename W, typename T> ll count2(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
template <typename W, typename T> ll count(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
ll count(str &a, str k) {
ll ret = 0, len = k.length();
auto pos = a.find(k);
while (pos != string::npos)
pos = a.find(k, pos + len), ++ret;
return ret;
}
vi count(str &a) {
vi cou(26);
char c = 'a';
if ('A' <= a[0] && a[0] <= 'Z')
c = 'A';
rep(i, sz(a))++ cou[a[i] - c];
return cou;
}
#define couif count_if
// algorythm
ll rev(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
template <class T> void rev(vector<T> &a) { reverse(all(a)); }
template <class U> void rev(vector<vector<U>> &a) {
vector<vector<U>> b(sz(a[0]), vector<U>(sz(a)));
rep(h, sz(a)) rep(w, sz(a[0])) b[w][h] = a[h][w];
a = b;
}
void rev(string &a) { reverse(all(a)); }
constexpr ll p10[] = {1,
10,
100,
1000,
10000,
100000,
1000000,
10000000,
100000000,
1000000000,
10000000000ll,
100000000000ll,
1000000000000ll,
10000000000000ll,
100000000000000ll,
1000000000000000ll,
10000000000000000ll,
100000000000000000ll,
1000000000000000000ll};
ll get(ll a, ll keta) { return (a / (ll)pow(10, keta)) % 10; }
ll keta(ll v) {
if (v < p10[9]) {
if (v < p10[4]) {
if (v < p10[2]) {
if (v < p10[1])
return 1;
else
return 2;
} else {
if (v < p10[3])
return 3;
else
return 4;
}
} else {
if (v < p10[7]) {
if (v < p10[5])
return 5;
else if (v < p10[6])
return 6;
else
return 7;
} else {
if (v < p10[8])
return 8;
else
return 9;
}
}
} else {
if (v < p10[13]) {
if (v < p10[11]) {
if (v < p10[10])
return 10;
else
return 11;
} else {
if (v < p10[12])
return 12;
else
return 13;
}
} else {
if (v < p10[15]) {
if (v < p10[14])
return 14;
else if (v < p10[15])
return 15;
else
return 16;
} else {
if (v < p10[17])
return 17;
else
return 18;
}
}
}
}
ll dsum(ll v, ll sin = 10) {
ll ret = 0;
for (; v; v /= sin)
ret += v % sin;
return ret;
}
struct sint {
ll v;
sint(ll v) : v(v) {}
operator ll() { return v; }
// 下からi番目
ll operator[](ll i) { return (v / p10[i]) % 10; }
ll back(ll i) { return operator[](i); }
// 上からi番目
ll top(ll i) {
ll len = keta(v);
return operator[](len - 1 - i);
}
// 先頭からi番目にセット
ll settop(ll i, ll k) {
ll len = keta(v);
return set(len - 1 - i, k);
}
ll set(ll i, ll k) {
if (i < 0)
return settop(abs(i) - 1, k);
return v += p10[i] * (k - (v / p10[i]) % 10);
}
ll add(ll i, ll k = 1) { return v += p10[i] * k; }
ll addtop(ll i, ll k = 1) { return v += p10[keta(v) - i - 1] * k; }
ll dec(ll i, ll k = 1) { return v -= p10[i] * k; }
ll dectop(ll i, ll k = 1) { return v -= p10[keta(v) - i - 1] * k; }
#define op(t, o) \
template <class T> t operator o(T r) { return v o r; }
op(ll, +=);
op(ll, -=);
op(ll, *=);
op(ll, /=);
op(ll, %=);
op(ll, +);
op(ll, -);
op(ll, *);
op(ll, /);
op(ll, %);
op(bool, ==);
op(bool, !=);
op(bool, <);
op(bool, <=);
op(bool, >);
op(bool, >=);
#undef op
template <class T> ll operator<<=(T r) { return v *= p10[r]; }
template <class T> ll operator<<(T r) { return v * p10[r]; }
template <class T> ll operator>>=(T r) { return v /= p10[r]; }
template <class T> ll operator>>(T r) { return v / p10[r]; }
};
ll mask10(ll v) { return p10[v] - 1; }
// 変換系
template <class T> auto keys(T &a) {
vector<decltype((a.begin())->fi)> res;
for (auto &&k : a)
res.push_back(k.fi);
return res;
}
template <class T> auto values(T &a) {
vector<decltype((a.begin())->se)> res;
for (auto &&k : a)
res.push_back(k.se);
return res;
}
template <class T, class U> bool chma(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class U> bool chma(const U &b) { return chma(ma, b); }
template <class T, class U> bool chmi(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class U> bool chmi(const U &b) { return chmi(mi, b); }
template <class T> T min(T a, signed b) { return a < b ? a : b; }
template <class T> T max(T a, signed b) { return a < b ? b : a; }
template <class T> T min(T a, T b, T c) {
return a >= b ? b >= c ? c : b : a >= c ? c : a;
}
template <class T> T max(T a, T b, T c) {
return a <= b ? b <= c ? c : b : a <= c ? c : a;
}
template <class T> T min(vector<T> &a) { return *min_element(all(a)); }
template <class T> T mini(vector<T> &a) {
return min_element(all(a)) - a.begin();
}
template <class T> T min(vector<T> &a, ll n) {
return *min_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T min(vector<T> &a, ll s, ll n) {
return *min_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a) { return *max_element(all(a)); }
template <class T, class U> T max(vector<T> &a, vector<U> &b) {
return max(*max_element(all(a)), *max_element(all(b)));
}
template <class T> T maxi(vector<T> &a) {
return max_element(all(a)) - a.begin();
}
template <class T> T max(vector<T> &a, ll n) {
return *max_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a, ll s, ll n) {
return *max_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <typename A, size_t N> A max(A (&a)[N]) {
A res = a[0];
rep(i, N) res = max(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A max(A (&a)[N][O]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A max(A (&a)[N][O][P][Q], const T &v) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A max(A (&a)[N][O][P][Q][R]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A max(A (&a)[N][O][P][Q][R][S]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N> A min(A (&a)[N]) {
A res = a[0];
rep(i, N) res = min(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A min(A (&a)[N][O]) {
A res = min(a[0]);
rep(i, N) res = min(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A min(A (&a)[N][O][P][Q], const T &v) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A min(A (&a)[N][O][P][Q][R]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A min(A (&a)[N][O][P][Q][R][S]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <class T> T sum(vector<T> &v, ll s, ll t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += v[i];
return ret;
}
template <class T> T sum(vector<T> &v, ll t = inf) { return sum(v, 0, t); }
template <class T> T sum(vector<vector<T>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<T>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<T>>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<vector<T>>>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> auto sum(priority_queue<T, vector<T>, greater<T>> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
template <class T> auto sum(priority_queue<T> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
// template<class T, class U, class... W> auto sumn(vector<T> &v, U head, W...
// tail) { auto ret = sum(v[0], tail...); rep(i, 1, min(sz(v), head))ret
// += sum(v[i], tail...); return ret;}
void clear(PQ &q) { q = PQ(); }
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> T *negarr(ll size) {
T *body = (T *)malloc((size * 2 + 1) * sizeof(T));
return body + size;
}
template <class T> T *negarr2(ll h, ll w) {
double **dummy1 = new double *[2 * h + 1];
double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];
dummy1[0] = dummy2 + w;
for (ll i = 1; i <= 2 * h + 1; ++i) {
dummy1[i] = dummy1[i - 1] + 2 * w + 1;
}
double **a = dummy1 + h;
return a;
}
// imoは0-indexed
// ruiは1-indexed
template <class T> vector<T> imo(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
// kと同じものの数
template <class T, class U> vi imo(vector<T> &a, U k) {
vector<T> ret = a;
rep(i, sz(ret)) ret[i] = a[i] == k;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
template <class T> vector<T> imox(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] ^= ret[i];
return ret;
}
// 漸化的に最小を持つ
template <class T> vector<T> imi(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chmi(ret[i + 1], ret[i]);
return ret;
}
template <class T> struct ruiC {
const vector<T> rui;
ruiC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruic ";
deb(l, r);
assert(0);
}
return rui[r] - rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> struct rruic {
const T *rrui;
rruic(T *ru) : rrui(ru) {}
T operator()(ll l, ll r) {
assert(l >= r);
return rrui[r] - rrui[l];
}
T operator[](ll i) { return rrui[i]; }
};
template <class T> ostream &operator<<(ostream &os, ruiC<T> a) {
fora(v, a.rui) os << v << " ";
return os;
}
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i];
return ret;
}
template <class T> ruiC<T> ruic(vector<T> &a) {
vector<T> ret = ruiv(a);
return ruiC<T>(ret);
}
vector<ll> ruiv(string &a) {
if (sz(a) == 0)
return vi(1);
ll dec = ('0' <= a[0] && a[0] <= '9') ? '0' : 0;
vector<ll> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i] - dec;
return ret;
}
ruiC<ll> ruic(string &a) {
vector<ll> ret = ruiv(a);
return ruiC<ll>(ret);
}
// kと同じものの数
template <class T, class U> vi ruiv(T &a, U k) {
vi ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + (a[i] == k);
return ret;
}
template <class T, class U> ruiC<ll> ruic(T &a, U k) {
vi ret = ruiv(a, k);
return ruiC<ll>(ret);
}
// xor
template <class T> struct ruixC {
const vector<T> rui;
ruixC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruiXc ";
deb(l, r);
assert(0);
}
return rui[r] ^ rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> vector<T> ruix(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] ^ a[i];
return ret;
}
template <class T> ruixC<ll> ruixc(vector<T> &a) {
vi ret = ruix(a);
return ruixC<ll>(ret);
}
template <class T> vector<T> ruim(vector<T> &a) {
vector<T> res(a.size() + 1, 1);
rep(i, a.size()) res[i + 1] = res[i] * a[i];
return res;
}
// 漸化的に最小を1indexで持つ
template <class T> vector<T> ruimi(vector<T> &a) {
ll n = sz(a);
vector<T> ret(n + 1);
rep(i, 1, n) {
ret[i] = a[i - 1];
chmi(ret[i + 1], ret[i]);
}
return ret;
}
// template<class T> T *rrui(vector<T> &a) {
// 右から左にかけての半開区間 (-1 n-1]
template <class T> rruic<T> rrui(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
rer(i, len - 1) res[i - 1] = res[i] + a[i];
return rruic<T>(res);
}
// 掛け算
template <class T> T *rruim(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
res[len - 1] = 1;
rer(i, len - 1) res[i - 1] = res[i] * a[i];
return res;
}
template <class T, class U> void inc(T &a, U v = 1) { a += v; }
template <class T, class U> void inc(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T, class U> void dec(T &a, U v = 1) { a -= v; }
template <class T, class U> void dec(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class U> void dec(string &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T> void dec(vector<T> &a) {
for (auto &u : a)
dec(u, 1);
}
template <class T, class U> void dec(vector<T> &a, vector<U> &b) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
}
template <class T, class U, class W>
void dec(vector<T> &a, vector<U> &b, vector<W> &c) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
for (auto &u : c)
dec(u, 1);
}
bool ins(ll h, ll w, ll H, ll W) { return h >= 0 && w >= 0 && h < H && w < W; }
bool ins(ll l, ll v, ll r) { return l <= v && v < r; }
template <class T> bool ins(vector<T> &a, ll i, ll j = 0) {
return ins(0, i, sz(a)) && ins(0, j, sz(a));
}
ll u(ll a) { return a < 0 ? 0 : a; }
template <class T> vector<T> u(const vector<T> &a) {
vector<T> ret = a;
fora(v, ret) v = u(v);
return ret;
}
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
// 添え字を返す
template <class F> ll goldd_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
ll minScore = MAX(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (minScore > score) {
minScore = score;
resIndex = i;
}
}
return resIndex;
}
template <class F> ll goldt_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
if (left > right) {
ll l = left;
left = right;
right = l;
}
ll maxScore = MIN(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (maxScore < score) {
maxScore = score;
resIndex = i;
}
}
return resIndex;
}
/*loopは200にすればおそらく大丈夫 余裕なら300に*/
template <class F> dou goldd_d(dou left, dou right, F calc, ll loop = 200) {
dou GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm); /*200にすればおそらく大丈夫*/ /*余裕なら300に*/
ll k = 141;
loop++;
while (--loop) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
template <class F> dou goldt_d(dou left, dou right, F calc, ll loop = 200) {
double GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm);
loop++;
while (--loop) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
// l ~ rを複数の区間に分割し、極致を与えるiを返す time-20 msまで探索
template <class F> ll goldd_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll mini = 0, minv = MAX(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldd_l(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F> ll goldt_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll maxi = 0, maxv = MIN(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldt_l(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class F>
dou goldd_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を持つ*/
auto lim = milliseconds(time - 20);
dou mini = 0, minv = MAX(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldd_d(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F>
dou goldt_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を残している*/
auto lim = milliseconds(time - 20);
dou maxi = 0, maxv = MIN(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldt_d(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, *max_element(all(a[i])));
return res;
}
constexpr bool bget(ll m, ll keta) { return (m >> keta) & 1; }
ll bget(ll m, ll keta, ll sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
ll bit(ll n) { return (1LL << (n)); }
ll bit(ll n, ll sinsuu) { return (ll)pow(sinsuu, n); }
ll mask(ll n) { return (1ll << n) - 1; }
#define bcou __builtin_popcountll
// 最下位ビット
ll lbit(ll n) { return n & -n; }
// 最上位ビット
ll hbit(ll n) {
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
n |= (n >> 32);
return n - (n >> 1);
}
ll hbitk(ll n) {
ll k = 0;
rer(i, 5) {
ll a = k + (1ll << i);
ll b = 1ll << a;
if (b <= n)
k += 1ll << i;
}
return k;
}
// 初期化は0を渡す
ll nextComb(ll &mask, ll n, ll r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; /*最下位の1*/
ll y = mask + x; /*連続した下の1を繰り上がらせる*/
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vi bitCombList(ll n, ll r) {
vi res;
ll m = 0;
while (nextComb(m, n, r)) {
res.push_back(m);
}
return res;
}
// masの立ってるindexを見る
#define forbit(i, mas) \
for (int forbitj = lbit(mas), forbitm = mas, i = log2(forbitj); forbitm; \
forbitm = forbitj ? forbitm ^ forbitj : 0, forbitj = lbit(forbitm), \
i = log2(forbitj))
char itoal(ll i) { return 'a' + i; }
char itoaL(ll i) { return 'A' + i; }
ll altoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a';
}
ll ctoi(char c) { return c - '0'; }
char itoc(ll i) { return i + '0'; }
ll vtoi(vi &v) {
ll res = 0;
if (sz(v) > 18) {
debugline("vtoi");
deb(sz(v));
ole();
}
rep(i, sz(v)) {
res *= 10;
res += v[i];
}
return res;
}
vi itov(ll i) {
vi res;
while (i) {
res.push_back(i % 10);
i /= 10;
}
rev(res);
return res;
}
vi stov(string &a) {
ll n = sz(a);
vi ret(n);
rep(i, n) { ret[i] = a[i] - '0'; }
return ret;
}
// 基準を満たさないものは0になる
vi stov(string &a, char one) {
ll n = sz(a);
vi ret(n);
rep(i, n) ret[i] = a[i] == one;
return ret;
}
vector<vector<ll>> ctoi(vector<vector<char>> s, char c) {
ll n = sz(s), m = sz(s[0]);
vector<vector<ll>> res(n, vector<ll>(m));
rep(i, n) rep(j, m) res[i][j] = s[i][j] == c;
return res;
}
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
//[i] := i番として圧縮されたものを返す
vi compress(vi &a) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, umap<ll, ll> &map) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
ll v = a[i];
a[i] = lower_bound(all(b), a[i]) - b.begin();
map[v] = a[i];
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r, vi &s) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
fora(v, s) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
for (ll i = 0; i < sz(s); ++i)
r[i] = lower_bound(all(b), s[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vi> &a) {
vi b;
fora(vv, a) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vv, a) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vector<vi>> &a) {
vi b;
fora(vvv, a) fora(vv, vvv) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vvv, a) fora(vv, vvv) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
void compress(ll a[], ll len) {
vi b;
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
// 要素が見つからなかったときに困る
#define binarySearch(a, v) (binary_search(all(a), v))
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define lowerBound(a, v) (*lower_bound(all(a), v))
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define upperBound(a, v) (*upper_bound(all(a), v))
#define rlowerIndex(a, v) (upper_bound(all(a), v) - a.begin() - 1)
#define rlowerBound(a, v) *(--(upper_bound(all(a), v)))
#define rupperIndex(a, v) (lower_bound(all(a), v) - a.begin() - 1)
#define rupperBound(a, v) *(--(lower_bound(all(a), v)))
#define next2(a) next(next(a))
#define prev2(a) prev(prev(a))
// 狭義の単調増加列 長さを返す
template <class T> int lis_up(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = lowerIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
template <class T> int lis_eq(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = upperIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
// iteratorを返す
// valueが1以上の物を返す 0は見つけ次第削除
// vを減らす場合 (*it).se--でいい
template <class T, class U, class V> auto lower_map(map<T, U> &m, V k) {
auto ret = m.lower_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
template <class T, class U, class V> auto upper_map(map<T, U> &m, V k) {
auto ret = m.upper_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
// 存在しなければエラー
template <class T, class U, class V> auto rlower_map(map<T, U> &m, V k) {
auto ret = upper_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T, class U, class V> auto rupper_map(map<T, U> &m, V k) {
auto ret = lower_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T> void fin(T s) { cout << s << endl, exit(0); }
// 便利 数学 math
ll mod(ll a, ll m) { return (a % m + m) % m; }
ll pow(ll a) { return a * a; };
ll fact(ll v) { return v <= 1 ? 1 : v * fact(v - 1); }
dou factd(int v) {
static vd fact(2, 1);
if (sz(fact) <= v) {
rep(i, sz(fact), v + 1) { fact.push_back(fact.back() * i); }
}
return fact[v];
}
ll comi(ll n, ll r) {
assert(n < 100);
static vvi(pas, 100, 100);
if (pas[0][0])
return pas[n][r];
pas[0][0] = 1;
rep(i, 1, 100) {
pas[i][0] = 1;
rep(j, 1, i + 1) pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];
}
return pas[n][r];
}
// double comd(ll n, ll r) { assert(n < 2020); static vvd(comb, 2020,
// 2020); if (comb[0][0] == 0) { comb[0][0] = 1; rep(i, 2000) {
// comb[i + 1][0] = 1; rep(j, 1, i + 2) { comb[i +
// 1][j] = comb[i][j] + comb[i][j - 1]; } } } return
// comb[n][r];}
double comd(int n, int r) {
if (r < 0 || r > n)
return 0;
return factd(n) / factd(n - r) / factd(r);
}
ll gcd(ll a, ll b) {
while (b)
a %= b, swap(a, b);
return abs(a);
}
ll gcd(vi b) {
ll res = b[0];
rep(i, 1, sz(b)) res = gcd(b[i], res);
return res;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll lcm(vi a) {
ll res = a[0];
rep(i, 1, sz(a)) res = lcm(a[i], res);
return res;
}
ll ceil(ll a, ll b) {
if (b == 0) {
debugline("ceil");
deb(a, b);
ole();
return -1;
} else if (a < 0) {
return 0;
} else {
return (a + b - 1) / b;
}
}
ll lower_remi__bx_a(ll kei, ll rem, ll x) {
if (rem >= x)
return 0;
return (x - rem + kei - 1) / kei;
}
ll lower_remv__bx_a(ll kei, ll rem, ll x) {
if (rem >= x)
return rem;
return (x - rem + kei - 1) / kei * kei + rem;
}
ll upper_remi__bx_a(ll kei, ll rem, ll x) {
if (rem > x)
return 0;
return (x - rem + kei) / kei;
}
ll upper_remv__bx_a(ll kei, ll rem, ll x) {
if (rem > x)
return rem;
return (x - rem + kei) / kei * kei + rem;
}
// v * v >= aとなる最小のvを返す
ll sqrt(ll a) {
if (a < 0) {
debugline("sqrt");
deb(a);
ole();
}
ll res = (ll)std::sqrt(a);
while (res * res < a)
++res;
return res;
}
double log(double e, double x) { return log(x) / log(e); }
ll sig(ll t) { return ((1 + t) * t) >> 1; }
ll sig(ll s, ll t) { return ((s + t) * (t - s + 1)) >> 1; }
// 機能拡張
template <class T, class U> void operator+=(pair<T, U> &a, pair<T, U> &b) {
a.fi += b.fi;
a.se += b.se;
}
template <class T, class U> pair<T, U> operator+(pair<T, U> &a, pair<T, U> &b) {
return pair<T, U>(a.fi + b.fi, a.se + b.se);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
lhs += to_string(rv);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
lhs += to_string(rv);
}
template <class T, class U> void operator+=(queue<T> &a, U v) { a.push(v); }
template <class T, class U> void operator+=(deque<T> &a, U v) {
a.push_back(v);
}
template <class T>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, vector<T> &v) {
fora(d, v) a.push(d);
return a;
}
template <class T, class U>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, U v) {
a.push(v);
return a;
}
template <class T, class U>
priority_queue<T> &operator+=(priority_queue<T> &a, U v) {
a.push(v);
return a;
}
template <class T> set<T> &operator+=(set<T> &a, vector<T> v) {
fora(d, v) a.insert(d);
return a;
}
template <class T, class U> auto operator+=(set<T> &a, U v) {
return a.insert(v);
}
template <class T, class U> auto operator-=(set<T> &a, U v) {
return a.erase(v);
}
template <class T, class U> auto operator+=(mset<T> &a, U v) {
return a.insert(v);
}
template <class T, class U>
set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U> vector<T> &operator+=(vector<T> &a, U v) {
a.push_back(v);
return a;
}
template <class T, class U> vector<T> operator+(const vector<T> &a, U v) {
vector<T> ret = a;
ret += v;
return ret;
}
template <class T, class U> vector<T> operator+(U v, const vector<T> &a) {
vector<T> ret = a;
ret.insert(ret.begin(), v);
return ret;
}
template <class T> vector<T> operator+(vector<T> a, vector<T> b) {
vector<T> ret;
ret = a;
fora(v, b) ret += v;
return ret;
}
template <class T> vector<T> &operator+=(vector<T> &a, vector<T> &b) {
fora(v, b) a += v;
return a;
}
template <class T> vector<T> &operator-=(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-=");
deb(a);
deb(b);
exit(0);
}
rep(i, sz(a)) a[i] -= b[i];
return a;
}
template <class T> vector<T> operator-(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-");
deb(a);
deb(b);
ole();
}
vector<T> res(sz(a));
rep(i, sz(a)) res[i] = a[i] - b[i];
return res;
}
template <class T, class U> vector<T> operator*(vector<T> &a, U b) {
vector<T> ret;
fora(v, a) ret += v * b;
return ret;
}
template <class T, class U> vector<T> operator/(vector<T> &a, U b) {
vector<T> ret;
fora(v, a) ret += v / b;
return ret;
}
template <class T, class U> vector<T> operator*=(vector<T> &a, U b) {
fora(v, a) v *= b;
return a;
}
template <class T, class U> vector<T> operator/=(vector<T> &a, U b) {
fora(v, a) v /= b;
return a;
}
template <typename T> void erase(vector<T> &v, unsigned ll i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned ll s, unsigned ll e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <class T, class U> void erase(map<T, U> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <class T> void erase(set<T> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <typename T> void erasen(vector<T> &v, unsigned ll s, unsigned ll n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, U t) {
v.insert(v.begin() + i, t);
}
template <typename T, typename U> void push_front(vector<T> &v, U t) {
v.insert(v.begin(), t);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T> void insert(set<T> &v, vector<T> list) {
for (auto &&va : list)
v.insert(va);
}
vector<string> split(const string a, const char deli) {
string b = a + deli;
ll l = 0, r = 0, n = b.size();
vector<string> res;
rep(i, n) {
if (b[i] == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
l = i + 1;
}
}
return res;
}
vector<string> split(const string a, const string deli) {
vector<string> res;
ll kn = sz(deli);
std::string::size_type Pos(a.find(deli));
ll l = 0;
while (Pos != std::string::npos) {
if (Pos - l)
res.push_back(a.substr(l, Pos - l));
l = Pos + kn;
Pos = a.find(deli, Pos + kn);
}
if (sz(a) - l)
res.push_back(a.substr(l, sz(a) - l));
return res;
}
void yn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Yn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void fyn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
exit(0);
}
void fYn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
exit(0);
}
void fYN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
exit(0);
}
void Possible(bool a) {
if (a)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
exit(0);
}
void POSSIBLE(bool a) {
if (a)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
exit(0);
}
template <typename T> class fixed_point : T {
public:
explicit constexpr fixed_point(T &&t) noexcept : T(std::forward<T>(t)) {}
template <typename... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return T::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename T>
static inline constexpr decltype(auto) fix(T &&t) noexcept {
return fixed_point<T>{std::forward<T>(t)};
}
//@formatter:off
template <typename T> T minv(T a, T m);
template <typename T> T minv(T a);
template <typename T> class Modular {
public:
using Type = typename decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template <typename U> Modular(const U &x) { value = normalize(x); }
template <typename U> static Type normalize(const U &x) {
Type v;
if (-mod() <= x && x < mod())
v = static_cast<Type>(x);
else
v = static_cast<Type>(x % mod());
if (v < 0)
v += mod();
return v;
}
const Type &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static Type mod() { return T::value; }
Modular &operator+=(const Modular &other) {
if ((value += other.value) >= mod())
value -= mod();
return *this;
}
Modular &operator-=(const Modular &other) {
if ((value -= other.value) < 0)
value += mod();
return *this;
}
template <typename U> Modular &operator+=(const U &other) {
return *this += Modular(other);
}
template <typename U> Modular &operator-=(const U &other) {
return *this -= Modular(other);
}
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(signed) {
Modular result(*this);
*this += 1;
return result;
}
Modular operator--(signed) {
Modular result(*this);
*this -= 1;
return result;
}
Modular operator-() const { return Modular(-value); }
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, signed>::value,
Modular>::type &
operator*=(const Modular &rhs) {
#ifdef _WIN32
uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x),
d, m;
asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(mod()));
value = m;
#else
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
#endif
return *this;
}
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value,
Modular>::type &
operator*=(const Modular &rhs) {
int64_t q =
static_cast<int64_t>(static_cast<double>(value) * rhs.value / mod());
value = normalize(value * rhs.value - q * mod());
return *this;
}
template <typename U = T>
typename enable_if<!is_integral<typename Modular<U>::Type>::value,
Modular>::type &
operator*=(const Modular &rhs) {
value = normalize(value * rhs.value);
return *this;
}
Modular &operator/=(const Modular &other) {
return *this *= Modular(minv(other.value));
}
template <typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &number);
operator int() { return value; }
private:
Type value;
};
template <typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) {
return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value < rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
constexpr signed MOD =
// 998244353;
1e9 + 7; // MOD
using mint = Modular<std::integral_constant<decay<decltype(MOD)>::type, MOD>>;
constexpr int mint_len = 1400001;
vi fac, finv, inv;
vi p2;
mint com(int n, int r) {
if (r < 0 || r > n)
return 0;
return mint(finv[r] * fac[n] % MOD * finv[n - r]);
}
mint pom(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return mint(fac[n] * finv[n - 1]);
}
mint npr(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return mint(fac[n] * finv[n - r]);
}
int nprin(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return fac[n] * finv[n - r] % MOD;
}
int icom(int n, int r) {
const int NUM_ = 1400001;
static ll fac[NUM_ + 1], finv[NUM_ + 1], inv[NUM_ + 1];
if (fac[0] == 0) {
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i <= NUM_; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
if (r < 0 || r > n)
return 0;
return ((finv[r] * fac[n] % MOD) * finv[n - r]) % MOD;
}
#define ncr com
#define ncri icom
// n個の場所にr個の物を置く
mint nhr(int n, int r) { return com(n + r - 1, r); }
mint hom(int n, int r) { return com(n + r - 1, r); }
int nhri(int n, int r) { return icom(n + r - 1, r); }
template <typename T> T minv(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> T minv(T a) {
if (a < mint_len)
return inv[a];
T u = 0, v = 1;
T m = MOD;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T, typename U>
Modular<T> mpow(const Modular<T> &a, const U &b) {
assert(b >= 0);
int x = a(), res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U, typename V>
mint mpow(const T a, const U b, const V m = MOD) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= m;
(x *= x) %= m;
p >>= 1;
}
return res;
}
template <typename T, typename U> mint mpow(const T a, const U b) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U, typename V>
int mpowi(const T &a, const U &b, const V &m = MOD) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= m;
(x *= x) %= m;
p >>= 1;
}
return res;
}
template <typename T> string to_string(const Modular<T> &number) {
return to_string(number());
}
string yuri(const mint &a) {
stringstream st;
rep(i, 300) {
rep(j, 300) {
if ((mint)i / j == a) {
st << i << " / " << j;
return st.str();
}
}
}
rep(i, 1000) {
rep(j, 1000) {
if ((mint)i / j == a) {
st << i << " / " << j;
return st.str();
}
}
}
return st.str();
}
template <typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {
stream << number();
#ifdef _DEBUG
// stream << " -> " << yuri(number);
#endif
return stream;
}
//@formatter:off
template <typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &number) {
typename common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
number.value = Modular<T>::normalize(x);
return stream;
}
using PM = pair<mint, mint>;
using vm = vector<mint>;
using mapm = map<int, mint>;
using umapm = umap<int, mint>;
#define vvm(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(mint, __VA_ARGS__)
#define vnm(name, ...) auto name = make_v<mint>(__VA_ARGS__)
struct setmod {
setmod() {
// p2.resize(mint_len);p2[0] = 1; for (int i = 1; i < mint_len; ++i)
// p2[i] = p2[i - 1] * 2 % MOD;
fac.resize(mint_len);
finv.resize(mint_len);
inv.resize(mint_len);
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i < mint_len; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i < mint_len; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
} setmodv;
//@formatter:on
// nhr n個の場所にr個の物を分ける
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} initonv; //@formatter:on
// gra mll pr
// 上下左右
const string udlr = "udlr";
string UDLR = "UDLR"; // x4と連動 UDLR.find('U') := x4[0]
// 右、上が正
constexpr ll y4[] = {1, -1, 0, 0};
constexpr ll x4[] = {0, 0, -1, 1};
constexpr ll y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
constexpr ll x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
ll n, m, k, d, H, W, x, y, z, q;
ll cou;
vi a, b, c;
// vvi (s, 0, 0);
vvc(ba, 0, 0);
vp p;
str s;
// 幾何ライブラリ
struct V { /*@formatter:off*/
double x, y;
V(double x = 0, double y = 0) : x(x), y(y) {}
V &operator+=(const V &v) {
x += v.x;
y += v.y;
return *this;
}
V operator+(const V &v) const { return V(*this) += v; }
V &operator-=(const V &v) {
x -= v.x;
y -= v.y;
return *this;
}
V operator-(const V &v) const { return V(*this) -= v; }
V &operator*=(double s) {
x *= s;
y *= s;
return *this;
}
V operator*(double s) const { return V(*this) *= s; }
V &operator/=(double s) {
x /= s;
y /= s;
return *this;
}
V operator/(double s) const { return V(*this) /= s; }
// 内積
double dot(const V &v) const { return x * v.x + y * v.y; }
// 外積
double cross(const V &v) const { return x * v.y - v.x * y; }
double norm2() const { return x * x + y * y; }
double norm() const { return sqrt(norm2()); }
// 象限
int ort() const {
if (abs(x) < eps && abs(y) < eps)
return 0;
if (y > 0)
return x > 0 ? 1 : 2;
else
return x < 0 ? 3 : 4;
}
bool operator<(const V &v) const {
int o = ort(), vo = v.ort();
if (o != vo)
return o < vo;
return cross(v) > 0;
}
};
istream &operator>>(istream &ist, V &v) {
ist >> v.x >> v.y;
return ist;
}
ostream &operator<<(ostream &os, const V &v) {
os << "(" << v.x << "," << v.y << ")";
return os;
} /*@formatter:on*/
using dots = vector<V>;
double cross(const V &p, const V &q) { return p.x * q.y - p.y * q.x; }
// 一直線上の3点を含めない
vector<V> convexhull(vector<V> &ps) {
int n = (int)ps.size();
if (n <= 2) {
return ps;
}
vector<V> res(2 * n);
std::sort(ps.begin(), ps.end(), [&](V &l, V &r) {
if (l.x != r.x)
return l.x < r.x;
else
return l.y < r.y;
});
int k = 0;
for (int i = 0; i < n; ++i) {
if (k >= 2) {
while (cross(res[k - 1] - res[k - 2], ps[i] - res[k - 2]) < eps) {
--k;
if (k < 2)
break;
}
}
res[k] = ps[i];
++k;
}
int t = k + 1;
for (int i = n - 2; i >= 0; --i) {
if (k >= t) {
while (cross(res[k - 1] - res[k - 2], ps[i] - res[k - 2]) < eps) {
--k;
if (k < t)
break;
}
}
res[k] = ps[i];
++k;
}
res.resize(k - 1);
return res;
}
// 一直線上の3点を含める
vector<V> convexhull_line(vector<V> &ps) {
int n = (int)ps.size();
if (n <= 2) {
return ps;
}
vector<V> res(2 * n);
std::sort(ps.begin(), ps.end(), [&](V &l, V &r) {
if (l.x != r.x)
return l.x < r.x;
else
return l.y < r.y;
});
int k = 0;
for (int i = 0; i < n; ++i) {
if (k >= 2) {
while (cross(res[k - 1] - res[k - 2], ps[i] - res[k - 2]) < -eps) {
--k;
if (k < 2)
break;
}
}
res[k] = ps[i];
++k;
}
int t = k + 1;
for (int i = n - 2; i >= 0; --i) {
if (k >= t) {
while (cross(res[k - 1] - res[k - 2], ps[i] - res[k - 2]) < -eps) {
--k;
if (k < t)
break;
}
}
res[k] = ps[i];
++k;
}
res.resize(k - 1);
return res;
}
void solve() {
in(n);
dots ps;
na(ps, n);
dots sot{(0, 0)};
rep(i, n) {
int len = sz(sot);
rep(j, len) { sot += sot[j] + ps[i]; }
sot = convexhull_line(sot);
}
dou res = 0;
fora(v, sot) { chma(res, v.norm()); }
cout << res << endl;
}
auto my(ll n, vi &a) { return 0; }
auto sister(ll n, vi &a) {
ll ret = 0;
return ret;
}
signed main() {
solve();
#define arg n, a
#ifdef _DEBUG
bool bad = 0;
for (ll i = 0, ok = 1; i < k5 && ok; ++i) {
ll n = rand(1, 8);
vi a = ranv(n, 1, 10);
auto myres = my(arg);
auto res = sister(arg);
ok = myres == res;
if (!ok) {
out(arg);
cerr << "AC : " << res << endl;
cerr << "MY : " << myres << endl;
bad = 1;
break;
}
}
if (!bad) {
// cout << "完璧 : solveを書き直そう" << endl;
// cout << " : そして、solve()を呼び出すのだ" << endl;
// cout << " : cin>>n; na(a,n);も忘れるな" << endl;
}
#endif
return 0;
};
| // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
// 区間削除は出来ない
template <class T> struct my_pbds_tree {
set<T> s;
auto begin() { return s.begin(); }
auto end() { return s.end(); }
auto rbegin() { return s.rbegin(); }
auto rend() { return s.rend(); }
auto empty() { return s.empty(); }
auto size() { return s.size(); }
void clear() { s.clear(); }
template <class U> void insert(U v) { s.insert(v); }
template <class U> void operator+=(U v) { insert(v); }
template <class F> auto erase(F v) { return s.erase(v); }
template <class U> auto find(U v) { return s.find(v); }
template <class U> auto lower_bound(U v) { return s.lower_bound(v); }
template <class U> auto upper_bound(U v) { return s.upper_bound(v); }
auto find_by_order(ll k) {
auto it = s.begin();
for (ll i = 0; i < k; i++)
it++;
return it;
}
auto order_of_key(ll v) {
auto it = s.begin();
ll i = 0;
for (; it != s.end() && *it < v; i++)
it++;
return i;
}
};
#define pbds(T) my_pbds_tree<T>
#else
#define unordered_map __gnu_pbds::gp_hash_table
// find_by_order(k) k番目のイテレーター
// order_of_key(k) k以上が前から何番目か
#define pbds(U) \
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag, \
__gnu_pbds::tree_order_statistics_node_update>
#endif
struct xorshift {
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);
}
size_t operator()(std::pair<ll, ll> x) const {
ll v = ((x.first) << 32) | x.second;
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(v + FIXED_RANDOM);
}
};
template <class U, class L>
void operator+=(
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update> &s,
L v) {
s.insert(v);
}
// 衝突対策
#define ws wszzzz
template <class A, class B, class C> struct T2 {
A f;
B s;
C t;
T2() { f = 0, s = 0, t = 0; }
T2(A f, B s, C t) : f(f), s(s), t(t) {}
bool operator<(const T2 &r) const {
return f != r.f ? f < r.f
: s != r.s ? s < r.s
: t < r.t; /*return f != r.f ? f > r.f : s != r.s ?n s >
r.s : t > r.t; 大きい順 */
}
bool operator>(const T2 &r) const {
return f != r.f ? f > r.f
: s != r.s ? s > r.s
: t > r.t; /*return f != r.f ? f > r.f : s != r.s ? s >
r.s : t > r.t; 小さい順 */
}
bool operator==(const T2 &r) const {
return f == r.f && s == r.s && t == r.t;
}
bool operator!=(const T2 &r) const {
return f != r.f || s != r.s || t != r.t;
}
};
template <class A, class B, class C, class D> struct F2 {
A a;
B b;
C c;
D d;
F2() { a = 0, b = 0, c = 0, d = 0; }
F2(A a, B b, C c, D d) : a(a), b(b), c(c), d(d) {}
bool operator<(const F2 &r) const {
return a != r.a ? a < r.a
: b != r.b ? b < r.b
: c != r.c ? c < r.c
: d < r.d; /* return a != r.a ? a > r.a : b != r.b ? b
> r.b : c != r.c ? c > r.c : d > r.d;*/
}
bool operator>(const F2 &r) const {
return a != r.a ? a > r.a
: b != r.b ? b > r.b
: c != r.c ? c > r.c
: d > r.d; /* return a != r.a ? a < r.a : b != r.b
? b < r.b : c != r.c ? c < r.c : d < r.d;*/
}
bool operator==(const F2 &r) const {
return a == r.a && b == r.b && c == r.c && d == r.d;
}
bool operator!=(const F2 &r) const {
return a != r.a || b != r.b || c != r.c || d != r.d;
}
ll operator[](ll i) {
assert(i < 4);
return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;
}
};
typedef T2<ll, ll, ll> T;
typedef F2<ll, ll, ll, ll> F;
T mt(ll a, ll b, ll c) { return T(a, b, c); }
//@マクロ省略系 型,構造
#define double long double
#define ull unsigned long long
using dou = double;
using itn = int;
using str = string;
using bo = bool;
#define au auto
using P = pair<ll, ll>;
#define fi first
#define se second
#define beg begin
#define rbeg rbegin
#define con continue
#define bre break
#define brk break
#define is ==
#define el else
#define elf else if
#define wh while
#define upd update
#define maxq 1
#define minq -1
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MALLOC(type, len) (type *)malloc((len) * sizeof(type))
#define lam(right) [&](ll &p) { return p right; }
// マクロ省略系 コンテナ
using vi = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using vd = vector<double>;
using vc = vector<char>;
using vp = vector<P>;
using vt = vector<T>;
#define vec vector
#define o_vvt(o1, o2, o3, o4, name, ...) name
#define vvt0(t) vec<vec<t>>
#define vvt1(t, a) vec<vec<t>> a
#define vvt2(t, a, b) vec<vec<t>> a(b)
#define vvt3(t, a, b, c) vec<vec<t>> a(b, vec<t>(c))
#define vvt4(t, a, b, c, d) vec<vec<t>> a(b, vec<t>(c, d))
#define vvi(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(ll, __VA_ARGS__)
#define vvb(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(bool, __VA_ARGS__)
#define vvs(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(string, __VA_ARGS__)
#define vvd(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(double, __VA_ARGS__)
#define vvc(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(char, __VA_ARGS__)
#define vvp(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(P, __VA_ARGS__)
#define vvt(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(T, __VA_ARGS__)
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
#define vni(name, ...) auto name = make_v<ll>(__VA_ARGS__)
#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)
#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)
#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)
#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)
#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
#define tos to_string
using mapi = map<ll, ll>;
using mapp = map<P, ll>;
using mapd = map<dou, ll>;
using mapc = map<char, ll>;
using maps = map<str, ll>;
using seti = set<ll>;
using setd = set<dou>;
using setc = set<char>;
using sets = set<str>;
using qui = queue<ll>;
#define bset bitset
#define uset unordered_set
#define useti unordered_set<ll, ll, xorshift>
#define mset multiset
#define mseti multiset<ll>
#define umap unordered_map
#define umapi unordered_map<ll, ll, xorshift>
#define umapp unordered_map<P, ll, xorshift>
#define mmap multimap
template <class T> struct pq {
priority_queue<T, vector<T>, greater<T>> q; /*小さい順*/
T su = 0;
void clear() {
q = priority_queue<T, vector<T>, greater<T>>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
template <class T> struct pqg {
priority_queue<T> q; /*大きい順*/
T su = 0;
void clear() {
q = priority_queue<T>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
#define pqi pq<ll>
#define pqgi pqg<ll>
// マクロ 繰り返し
#define o_rep(o1, o2, o3, o4, name, ...) name
#define rep1(n) for (ll rep1i = 0, rep1lim = n; rep1i < rep1lim; ++rep1i)
#define rep2(i, n) for (ll i = 0, rep2lim = n; i < rep2lim; ++i)
#define rep3(i, m, n) for (ll i = m, rep3lim = n; i < rep3lim; ++i)
#define rep4(i, m, n, ad) for (ll i = m, rep4lim = n; i < rep4lim; i += ad)
#define rep(...) o_rep(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rer2(i, n) for (ll i = n; i >= 0; i--)
#define rer3(i, m, n) for (ll i = m, rer3lim = n; i >= rer3lim; i--)
#define rer4(i, m, n, dec) for (ll i = m, rer4lim = n; i >= rer4lim; i -= dec)
#define rer(...) o_rep(__VA_ARGS__, rer4, rer3, rer2, )(__VA_ARGS__)
#define reps2(i, j, n) \
for (ll i = 0, reps2lim = n; i < reps2lim; ++i) \
for (ll j = 0; j < reps2lim; ++j)
#define reps3(i, j, k, n) \
for (ll i = 0, reps3lim = n; i < reps3lim; ++i) \
for (ll j = 0; j < reps3lim; ++j) \
for (ll k = 0; k < reps3lim; ++k)
#define reps4(i, j, k, l, n) \
for (ll i = 0, reps4lim = n; i < reps4lim; ++i) \
for (ll j = 0; j < reps4lim; ++j) \
for (ll k = 0; k < reps4lim; ++k) \
for (ll l = 0; l < reps4lim; ++l)
#define o_reps(o1, o2, o3, o4, o5, name, ...) name
#define reps(...) o_reps(__VA_ARGS__, reps4, reps3, reps2, rep2, )(__VA_ARGS__)
#define repss(i, j, k, a, b, c) \
for (ll i = 0; i < a; ++i) \
for (ll j = 0; j < b; ++j) \
for (ll k = 0; k < c; ++k)
#define fora(a, b) for (auto &&a : b)
#define form(st, l, r) \
for (auto &&it = st.lower_bound(l); it != st.end() && (*it).fi < r; ++it)
#define forit(st, l, r) \
for (auto &&it = st.lower_bound(l); it != st.end() && (*it) < r;)
// マクロ 定数
#define k3 1010
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const ll inf = (ll)1e9 + 100;
const ll linf = (ll)1e18 + 100;
const char infc = '{';
const string infs = "{";
const double eps = 1e-9;
const double PI = 3.1415926535897932384626433832795029L;
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
// マクロ省略形 関数等
#define arsz(a) (sizeof(a) / sizeof(a[0]))
#define sz(a) ((ll)(a).size())
#define mp make_pair
#define pb pop_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr bool ev(ll a) { return !(a & 1); }
constexpr bool od(ll a) { return (a & 1); }
//@拡張系 こう出来るべきというもの
// 埋め込み 存在を意識せずに機能を増やされているもの
//@formatter:on
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
template <> class hash<std::pair<ll, ll>> {
public
: /*大きいllが渡されると、<<32でオーバーフローするがとりあえず問題ないと判断*/
size_t operator()(const std::pair<ll, ll> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
} // namespace std
//@formatter:off
// stream まとめ
istream &operator>>(istream &iss, P &a) {
iss >> a.first >> a.second;
return iss;
}
template <typename T> istream &operator>>(istream &iss, vector<T> &vec) {
for (T &x : vec)
iss >> x;
return iss;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> p) {
os << p.fi << " " << p.se << endl;
return os;
}
ostream &operator<<(ostream &os, T p) {
os << p.f << " " << p.s << " " << p.t;
return os;
}
ostream &operator<<(ostream &os, F p) {
os << p.a << " " << p.b << " " << p.c << " " << p.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (ll i = 0; i < vec.size(); ++i)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
for (ll i = 0; i < vec.size(); ++i) {
for (ll j = 0; j < vec[i].size(); ++j) {
os << vec[i][j] << " ";
}
os << endl;
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &m) {
for (auto &&v : m)
os << v;
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> s) {
fora(v, s) { os << v << " "; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> a) {
fora(v, a) os << v << " ";
return os;
}
template <typename W, typename H> void resize(vector<W> &vec, const H head) {
vec.resize(head);
}
template <typename W, typename H, typename... T>
void resize(vector<W> &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec)
resize(v, tail...);
}
template <typename T, typename F> bool all_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool all_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (!all_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool any_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool any_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (any_of2(v[i], f))
return true;
}
return false;
}
template <typename T, typename F> bool none_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool none_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (none_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool find_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll find_if2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (find_if2(v[i], f))
return i;
}
return sz(v);
}
template <typename T, typename F> bool rfind_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll rfind_if2(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (rfind_if2(v[i], f))
return i;
}
return -1;
}
template <class T> bool contains(string &s, const T &v) {
return s.find(v) != string::npos;
}
template <typename T> bool contains(vector<T> &v, const T &val) {
return std::find(v.begin(), v.end(), val) != v.end();
}
template <typename T, typename F> bool contains_if2(vector<T> &v, F f) {
return find_if(v.begin(), v.end(), f) != v.end();
}
template <typename T, typename F> ll count_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll count_if2(vector<T> &vec, F f) {
ll ret = 0;
fora(v, vec) ret += count_if2(v, f);
return ret;
}
template <typename T, typename F> void for_each2(T &v, F f) { f(v); }
template <typename T, typename F> void for_each2(vector<T> &vec, F f) {
fora(v, vec) for_each2(v, f);
}
template <typename W> ll count_od(vector<W> &a) {
return count_if2(a, [](ll v) { return v & 1; });
}
template <typename W> ll count_ev(vector<W> &a) {
return count_if2(a, [](ll v) { return !(v & 1); });
}
#define all_of(a, right) all_of2(a, lam(right))
#define any_of(a, right) any_of2(a, lam(right))
#define none_of(a, right) none_of2(a, lam(right))
#define find_if(a, right) find_if2(a, lam(right))
#define rfind_if(a, right) rfind_if2(a, lam(right))
#define contains_if(a, right) contains_if2(a, lam(right))
#define count_if(a, right) count_if2(a, lam(right))
#define for_each(a, right) \
do { \
fora(v, a) { v right; } \
} while (0)
template <class T, class U> void replace(vector<T> &a, T key, U v) {
replace(a.begin(), a.end(), key, v);
}
void replace(str &a, char key, str v) {
if (v == "")
a.erase(remove(all(a), key), a.end());
}
void replace(str &a, char key, char v) { replace(all(a), key, v); }
// keyと同じかどうか01で置き換える
template <class T, class U> void replace(vector<T> &a, U k) {
rep(i, sz(a)) a[i] = a[i] == k;
}
template <class T, class U> void replace(vector<vector<T>> &a, U k) {
rep(i, sz(a)) rep(j, sz(a[0])) a[i][j] = a[i][j] == k;
}
template <class T> void replace(T &a) { replace(a, '#'); }
void replace(str &a, str key, str v) {
stringstream t;
ll kn = sz(key);
std::string::size_type Pos(a.find(key));
ll l = 0;
while (Pos != std::string::npos) {
t << a.substr(l, Pos - l);
t << v;
l = Pos + kn;
Pos = a.find(key, Pos + kn);
}
t << a.substr(l, sz(a) - l);
a = t.str();
}
template <class T> bool includes(vector<T> &a, vector<T> &b) {
vi c = a;
vi d = b;
sort(all(c));
sort(all(d));
return includes(all(c), all(d));
}
template <class T> bool is_permutation(vector<T> &a, vector<T> &b) {
return is_permutation(all(a), all(b));
}
template <class T> bool next_permutation(vector<T> &a) {
return next_permutation(all(a));
}
void iota(vector<ll> &ve, ll s, ll n) {
ve.resize(n);
iota(all(ve), s);
}
vi iota(ll s, ll len) {
vi ve(len);
iota(all(ve), s);
return ve;
}
template <class A, class B> auto vtop(vector<A> &a, vector<B> &b) {
assert(sz(a) == sz(b)); /*stringを0で初期化できない */
vector<pair<A, B>> res;
rep(i, sz(a)) res.eb(a[i], b[i]);
return res;
}
template <class A, class B>
void ptov(vector<pair<A, B>> &p, vector<A> &a, vector<B> &b) {
a.resize(sz(p)), b.resize(sz(p));
rep(i, sz(p)) a[i] = p[i].fi, b[i] = p[i].se;
}
template <class A, class B, class C>
auto vtot(vector<A> &a, vector<B> &b, vector<C> &c) {
assert(sz(a) == sz(b) && sz(b) == sz(c));
vector<T2<A, B, C>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i]);
return res;
}
template <class A, class B, class C, class D>
auto vtof(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
assert(sz(a) == sz(b) && sz(b) == sz(c) && sz(c) == sz(d));
vector<F2<A, B, C, D>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i], d[i]);
return res;
}
enum pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd };
enum tcomparator {
fisiti,
fisitd,
fisdti,
fisdtd,
fdsiti,
fdsitd,
fdsdti,
fdsdtd,
fitisi,
fitisd,
fitdsi,
fitdsd,
fdtisi,
fdtisd,
fdtdsi,
fdtdsd,
sifiti,
sifitd,
sifdti,
sifdtd,
sdfiti,
sdfitd,
sdfdti,
sdfdtd,
sitifi,
sitifd,
sitdfi,
sitdfd,
sdtifi,
sdtifd,
sdtdfi,
sdfdfd,
tifisi,
tifisd,
tifdsi,
tifdsd,
tdfisi,
tdfisd,
tdfdsi,
tdfdsd,
tisifi,
tisifd,
tisdfi,
tisdfd,
tdsifi,
tdsifd,
tdsdfi,
tdsdfd
};
template <class A, class B> void sort(vector<pair<A, B>> &a, pcomparator type) {
typedef pair<A, B> U;
if (type == fisi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });
else if (type == fisd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });
else if (type == fdsi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });
else if (type == fdsd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });
else if (type == sifi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });
else if (type == sifd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });
else if (type == sdfi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });
else if (type == sdfd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });
};
template <class U> void sort(vector<U> &a, pcomparator type) {
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });
};
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, pcomparator type) {
typedef F2<A, B, C, D> U;
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b < r.b; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b > r.b; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b < r.b; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b > r.b; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a < r.a; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a > r.a; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a < r.a; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a > r.a; });
};
template <class U> void sort(vector<U> &a, tcomparator type) {
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
}
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, tcomparator type) {
typedef F2<A, B, C, D> U;
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
}
void sort(string &a) { sort(all(a)); }
template <class T> void sort(vector<T> &a) { sort(all(a)); }
// P l, P rで f(P) の形で渡す
template <class U, class F> void sort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) < f(r); });
};
template <class T> void rsort(vector<T> &a) { sort(all(a), greater<T>()); };
template <class U, class F> void rsort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) > f(r); });
};
// F = T<T>
// 例えばreturn p.fi + p.se;
template <class A, class B> void sortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
sort(c);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B, class F>
void sortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
sort(c, f);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B> void rsortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
rsort(c);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class F>
void rsortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
rsort(c, f);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class C>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
sort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
sort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
rsort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
rsort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class D>
void sortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
sort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
template <class A, class B, class C, class D>
void rsortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
rsort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
// sortindex 元のvectorはソートしない
template <class T> vi sorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind);
return ind;
} /*indexの分で型が変わるためpcomparatorが必要*/
template <class T> vi sorti(vector<T> &a, pcomparator f) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind, f);
return ind;
}
template <class T, class F> vi sorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) < f(a[y]); });
return ind;
}
template <class T> vi rsorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
rsortp(b, ind);
return ind;
}
template <class T, class F> vi rsorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) > f(a[y]); });
return ind;
}
template <class A, class B, class F>
vi sortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) < f(c[y]); });
return ind;
}
template <class A, class B>
vi sortpi(vector<A> &a, vector<B> &b, pcomparator f) {
vi ind = iota(0, sz(a));
auto c = a;
auto d = b;
sortt(c, d, ind, f);
return ind;
}
template <class A, class B> vi sortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fisi);
};
template <class A, class B, class F>
vi rsortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) > f(c[y]); });
return ind;
}
template <class A, class B> vi rsortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fdsd);
};
template <class A, class B, class C, class F>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) < f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, pcomparator f) {
vi ind = iota(0, sz(a));
auto d = vtof(a, b, c, ind);
sort(d, f);
rep(i, sz(a)) ind[i] = d[i].d;
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] < c[y];
else
return b[x] < b[y];
} else {
return a[x] < a[y];
}
});
return ind;
}
template <class A, class B, class C, class F>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) > f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] > c[y];
else
return b[x] > b[y];
} else {
return a[x] > a[y];
}
});
return ind;
}
template <class T> void sort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
sort(a[i]);
}
template <class T> void rsort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
rsort(a[i]);
}
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <typename W, typename T> void fill(W &xx, const T vall) { xx = vall; }
template <typename W, typename T> void fill(vector<W> &vecc, const T vall) {
for (auto &&vx : vecc)
fill(vx, vall);
}
template <typename W, typename T> void fill(vector<W> &xx, const T v, ll len) {
rep(i, len) xx[i] = v;
}
template <typename W, typename T>
void fill(vector<vector<W>> &xx, const T v, ll lh, ll lw) {
rep(i, lh) rep(j, lw) xx[i][j] = v;
}
template <class T, class U> void fill(vector<T> &a, U val, vi &ind) {
fora(v, ind) a[v] = val;
}
template <typename A, size_t N> A sum(A (&a)[N]) {
A res = 0;
rep(i, N) res += a[i];
return res;
}
template <typename A, size_t N, size_t O> A sum(A (&a)[N][O]) {
A res = 0;
rep(i, N) rep(j, O) res += a[i][j];
return res;
}
template <typename A, size_t N, size_t O, size_t P> A sum(A (&a)[N][O][P]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) res += a[i][j][k];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A sum(A (&a)[N][O][P][Q]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) res += a[i][j][k][l];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A sum(A (&a)[N][O][P][Q][R]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) res += a[i][j][k][l][m];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A sum(A (&a)[N][O][P][Q][R][S]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S) res +=
a[i][j][k][l][m][n];
return res;
}
//@汎用便利関数 入力
ll in() {
ll ret;
cin >> ret;
return ret;
}
string sin() {
string ret;
cin >> ret;
return ret;
}
template <class T> void in(T &head) { cin >> head; }
template <class T, class... U> void in(T &head, U &...tail) {
cin >> head;
in(tail...);
}
#define o_din(o1, o2, o3, o4, o5, o6, name, ...) name
#define din1(a) \
ll a; \
cin >> a
#define din2(a, b) \
ll a, b; \
cin >> a >> b
#define din3(a, b, c) \
ll a, b, c; \
cin >> a >> b >> c
#define din4(a, b, c, d) \
ll a, b, c, d; \
cin >> a >> b >> c >> d
#define din5(a, b, c, d, e) \
ll a, b, c, d, e; \
cin >> a >> b >> c >> d >> e
#define din6(a, b, c, d, e, f) \
ll a, b, c, d, e, f; \
cin >> a >> b >> c >> d >> e >> f
#define din(...) \
o_din(__VA_ARGS__, din6, din5, din4, din3, din2, din1)(__VA_ARGS__)
#define o_dind(o1, o2, o3, o4, name, ...) name
#define din1d(a) \
din1(a); \
a--
#define din2d(a, b) \
din2(a, b); \
a--, b--
#define din3d(a, b, c) \
din3(a, b, c); \
a--, b--, c--
#define din4d(a, b, c, d) \
din4(a, b, c, d); \
a--, b--, c--, d--
#define dind(...) o_dind(__VA_ARGS__, din4d, din3d, din2d, din1d)(__VA_ARGS__)
template <class T> void out2(T &&head) { cout << head; }
template <class T, class... U> void out2(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
}
template <class T, class... U> void out(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
cout << "" << endl;
}
template <class T> void out(T &&head) { cout << head << endl; }
void out() { cout << "" << endl; }
#ifdef _DEBUG
template <class T> string out_m(vector<T> &a, ll W = inf) {
stringstream ss;
if (W == inf)
W = min(sz(a), 12ll);
if (sz(a) == 0)
return ss.str();
rep(i, W) { ss << a[i] << " "; }
ss << "" << endl;
return ss.str();
}
template <class T>
string out_m(vector<vector<T>> &a, ll H = inf, ll W = inf, int key = -1) {
H = min({H, sz(a), 12ll});
W = min({W, sz(a[0]), 12ll});
stringstream ss;
ss << endl;
if (key == -1)
ss << " *|";
else
ss << " " << key << "|";
rep(w, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 4 + 3) ss << "_";
ss << "" << endl;
rep(h, H) {
ss << std::right << std::setw(2) << h << "|";
rep(w, min(sz(a[h]), 12ll)) {
if (a[h][w] == linf)
ss << " e"
<< " ";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
ss << endl;
return ss.str();
}
/*@formatter:off*/
template <class T>
string out_m(vector<vector<vector<T>>> &a, ll H = inf, ll W = inf, ll U = inf) {
stringstream ss;
if (H == inf)
H = 5;
H = min(H, sz(a));
rep(i, H) {
ss << endl;
ss << out_m(a[i], W, U, i);
}
ss << endl;
return ss.str();
}
string out_m(int a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> string out_m(T &a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> void outv(vector<T> &a, ll W = inf) {
cout << out_m(a, W) << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
cout << out_m(a, H, W, key) << endl;
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
cout << out_m(a, H, W, U) << endl;
}
#else
template <class T> void outv(vector<T> &a, ll W = inf) {
rep(i, min(W, sz(a))) { cout << a[i] << " "; }
cout << "" << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
rep(i, min(H, sz(a))) { outv(a[i], W); }
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
;
}
#endif
template <class T> void outl(vector<T> &a, int n = inf) {
rep(i, min(n, sz(a))) cout << a[i] << endl;
}
template <class T> void na(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i];
}
#define dna(a, n) \
vi a(n); \
rep(dnai, n) cin >> a[dnai];
template <class T> void nao(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1];
}
template <class T> void naod(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1], a[i + 1]--;
}
template <class T> void nad(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i], a[i]--;
}
template <class T, class U> void na2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i];
}
#define dna2(a, b, n) \
vi a(n), b(n); \
rep(dna2i, n) cin >> a[dna2i] >> b[dna2i];
template <class T, class U> void nao2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n + 1);
b.resize(n + 1);
a[0] = b[0] = 0;
rep(i, n) cin >> a[i + 1] >> b[i + 1];
}
#define dna2d(a, b, n) \
vi a(n), b(n); \
rep(dna2di, n) { \
cin >> a[dna2di] >> b[dna2di]; \
a[dna2di]--, b[dna2di]--; \
}
template <class T, class U> void na2d(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i], a[i]--, b[i]--;
}
template <class T, class U, class W>
void na3(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i];
}
#define dna3(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3i, n) cin >> a[dna3i] >> b[dna3i] >> c[dna3i];
template <class T, class U, class W>
void na3d(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i], a[i]--, b[i]--, c[i]--;
}
#define dna3d(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3di, n) { \
cin >> a[dna3di] >> b[dna3di] >> c[dna3di]; \
a[dna3di]--, b[dna3di]--, c[dna3di]--; \
}
template <class T, class U, class W, class X>
void na4(vector<T> &a, vector<U> &b, vector<W> &c, vector<X> &d, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
d.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i];
}
#define dna4(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i];
#define dna4d(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i], \
--a[dna4i], --b[dna4i], --c[dna4i], --d[dna4i];
#define nt(a, h, w) \
resize(a, h, w); \
rep(nthi, h) rep(ntwi, w) cin >> a[nthi][ntwi];
#define ntd(a, h, w) \
resize(a, h, w); \
rep(ntdhi, h) rep(ntdwi, w) cin >> a[ntdhi][ntdwi], a[ntdhi][ntdwi]--;
#define ntp(a, h, w) \
resize(a, h + 2, w + 2); \
fill(a, '#'); \
rep(ntphi, 1, h + 1) rep(ntpwi, 1, w + 1) cin >> a[ntphi][ntpwi];
// デバッグ
#define sp << " " <<
#define debugName(VariableName) #VariableName
#define deb1(x) debugName(x) << " = " << out_m(x)
#define deb2(x, ...) deb1(x) << ", " << deb1(__VA_ARGS__)
#define deb3(x, ...) deb1(x) << ", " << deb2(__VA_ARGS__)
#define deb4(x, ...) deb1(x) << ", " << deb3(__VA_ARGS__)
#define deb5(x, ...) deb1(x) << ", " << deb4(__VA_ARGS__)
#define deb6(x, ...) deb1(x) << ", " << deb5(__VA_ARGS__)
#define deb7(x, ...) deb1(x) << ", " << deb6(__VA_ARGS__)
#define deb8(x, ...) deb1(x) << ", " << deb7(__VA_ARGS__)
#define deb9(x, ...) deb1(x) << ", " << deb8(__VA_ARGS__)
#define deb10(x, ...) deb1(x) << ", " << deb9(__VA_ARGS__)
#define o_ebug(o1, o2, o3, o4, o5, o6, o7, o8, o9, o10, name, ...) name
#ifdef _DEBUG
#define deb(...) \
cerr << o_ebug(__VA_ARGS__, deb10, deb9, deb8, deb7, deb6, deb5, deb4, deb3, \
deb2, deb1)(__VA_ARGS__) \
<< endl
#else
#define deb(...) ;
#endif
#define debugline(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
//@formatter:off
// よく使うクラス、構造体
struct unionfind {
vector<ll> par;
vector<ll> siz;
vector<ll> es;
ll n, trees; // 連結グループの数(親の種類)
unionfind(ll n) : n(n), trees(n) {
par.resize(n);
siz.resize(n);
es.resize(n);
for (ll i = 0; i < n; i++) {
par[i] = i;
siz[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
es[x]++;
if (x == y)
return false;
if (siz[x] > siz[y])
swap(x, y);
trees--;
par[x] = y;
siz[y] += siz[x];
es[y] += es[x];
return true;
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
ll esize(ll x) { return es[root(x)]; }
vi sizes() {
vi cou(n);
vi ret;
ret.reserve(n);
rep(i, n) { cou[root(i)]++; }
rep(i, n) {
if (cou[i])
ret.push_back(cou[i]);
}
return ret;
}
// つながりを無向グラフと見なし、xが閉路に含まれるか判定
bool close(ll x) { return esize(x) >= size(x); }
vec<vi> sets() {
vi ind(n, -1);
ll i = 0;
vvi(res, trees);
rep(j, n) {
ll r = root(j);
if (ind[r] == -1)
ind[r] = i++;
res[ind[r]].push_back(j);
}
rep(i, trees) {
ll r = root(res[i][0]);
if (res[i][0] == r)
continue;
rep(j, 1, sz(res[i])) {
if (res[i][j] == r) {
swap(res[i][0], res[i][j]);
break;
}
}
}
return res;
}
}; //@formatter:off
using bll = __int128;
using u32 = unsigned;
using u64 = unsigned long long;
using u128 = __uint128_t;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
ll len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
//__int128 toi128(string &s) { __int128 ret = 0; for (ll i = 0; i <
//s.length(); ++i) if ('0' <= s[i] && s[i] <= '9') ret = 10 *
//ret + s[i] - '0'; return ret;}
// エラー
void ole() {
#ifdef _DEBUG
debugline("ole");
exit(0);
#endif
string a = "a";
rep(i, 30) a += a;
rep(i, 1 << 17) cout << a << endl;
cout << "OLE 出力長制限超過" << endl;
exit(0);
}
void re() {
assert(0 == 1);
exit(0);
}
void tle() {
while (inf)
cout << inf << endl;
}
// 便利関数
// テスト用
char ranc() { return (char)('a' + rand() % 26); }
ll rand(ll min, ll max) {
assert(min <= max);
if (min >= 0 && max >= 0) {
return rand() % (max + 1 - min) + min;
} else if (max < 0) {
return -rand(-max, -min);
} else {
if (rand() % 2) {
return rand(0, max);
} else {
return -rand(0, -min);
}
}
}
vi ranv(ll n, ll min, ll max) {
vi v(n);
rep(i, n) v[i] = rand(min, max);
return v;
}
str ransu(ll n) {
str s;
rep(i, n) s += (char)rand('A', 'Z');
return s;
}
str ransl(ll n) {
str s;
rep(i, n) s += (char)rand('a', 'z');
return s;
}
// 単調増加
vi ranvinc(ll n, ll min, ll max) {
vi v(n);
bool bad = 1;
while (bad) {
bad = 0;
v.resize(n);
rep(i, n) {
if (i && min > max - v[i - 1]) {
bad = 1;
break;
}
if (i)
v[i] = v[i - 1] + rand(min, max - v[i - 1]);
else
v[i] = rand(min, max);
}
}
return v;
}
// 便利 汎用
void ranvlr(ll n, ll min, ll max, vi &l, vi &r) {
l.resize(n);
r.resize(n);
rep(i, n) {
l[i] = rand(min, max);
r[i] = l[i] + rand(0, max - l[i]);
}
}
vp run_length(vi &a) {
vp ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
vector<pair<char, ll>> run_length(string &a) {
vector<pair<char, ll>> ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
template <class F> ll mgr(ll ok, ll ng, F f) {
if (ok < ng)
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
if (f(mid))
ok = mid;
else
ng = mid;
}
else
while (ok - ng > 1) {
ll mid = (ok + ng) / 2;
if (f(mid))
ok = mid;
else
ng = mid;
}
return ok;
}
// strを整数として比較
string smax(str &a, str b) {
if (sz(a) < sz(b)) {
return b;
} else if (sz(a) > sz(b)) {
return a;
} else if (a < b)
return b;
else
return a;
}
// strを整数として比較
string smin(str &a, str b) {
if (sz(a) > sz(b)) {
return b;
} else if (sz(a) < sz(b)) {
return a;
} else if (a > b)
return b;
else
return a;
}
template <typename W, typename T> ll find(vector<W> &a, const T key) {
rep(i, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename W, typename T> P find(vector<vector<W>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return mp(i, j);
return mp(-1, -1);
}
template <typename W, typename U>
T find(vector<vector<vector<W>>> &a, const U key) {
rep(i, sz(a)) rep(j, sz(a[0]))
rep(k, sz(a[0][0])) if (a[i][j][k] == key) return mt(i, j, k);
return mt(-1, -1, -1);
}
template <typename W, typename T> ll count2(W &a, const T k) { return a == k; }
template <typename W, typename T> ll count2(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
template <typename W, typename T> ll count(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
ll count(str &a, str k) {
ll ret = 0, len = k.length();
auto pos = a.find(k);
while (pos != string::npos)
pos = a.find(k, pos + len), ++ret;
return ret;
}
vi count(str &a) {
vi cou(26);
char c = 'a';
if ('A' <= a[0] && a[0] <= 'Z')
c = 'A';
rep(i, sz(a))++ cou[a[i] - c];
return cou;
}
#define couif count_if
// algorythm
ll rev(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
template <class T> void rev(vector<T> &a) { reverse(all(a)); }
template <class U> void rev(vector<vector<U>> &a) {
vector<vector<U>> b(sz(a[0]), vector<U>(sz(a)));
rep(h, sz(a)) rep(w, sz(a[0])) b[w][h] = a[h][w];
a = b;
}
void rev(string &a) { reverse(all(a)); }
constexpr ll p10[] = {1,
10,
100,
1000,
10000,
100000,
1000000,
10000000,
100000000,
1000000000,
10000000000ll,
100000000000ll,
1000000000000ll,
10000000000000ll,
100000000000000ll,
1000000000000000ll,
10000000000000000ll,
100000000000000000ll,
1000000000000000000ll};
ll get(ll a, ll keta) { return (a / (ll)pow(10, keta)) % 10; }
ll keta(ll v) {
if (v < p10[9]) {
if (v < p10[4]) {
if (v < p10[2]) {
if (v < p10[1])
return 1;
else
return 2;
} else {
if (v < p10[3])
return 3;
else
return 4;
}
} else {
if (v < p10[7]) {
if (v < p10[5])
return 5;
else if (v < p10[6])
return 6;
else
return 7;
} else {
if (v < p10[8])
return 8;
else
return 9;
}
}
} else {
if (v < p10[13]) {
if (v < p10[11]) {
if (v < p10[10])
return 10;
else
return 11;
} else {
if (v < p10[12])
return 12;
else
return 13;
}
} else {
if (v < p10[15]) {
if (v < p10[14])
return 14;
else if (v < p10[15])
return 15;
else
return 16;
} else {
if (v < p10[17])
return 17;
else
return 18;
}
}
}
}
ll dsum(ll v, ll sin = 10) {
ll ret = 0;
for (; v; v /= sin)
ret += v % sin;
return ret;
}
struct sint {
ll v;
sint(ll v) : v(v) {}
operator ll() { return v; }
// 下からi番目
ll operator[](ll i) { return (v / p10[i]) % 10; }
ll back(ll i) { return operator[](i); }
// 上からi番目
ll top(ll i) {
ll len = keta(v);
return operator[](len - 1 - i);
}
// 先頭からi番目にセット
ll settop(ll i, ll k) {
ll len = keta(v);
return set(len - 1 - i, k);
}
ll set(ll i, ll k) {
if (i < 0)
return settop(abs(i) - 1, k);
return v += p10[i] * (k - (v / p10[i]) % 10);
}
ll add(ll i, ll k = 1) { return v += p10[i] * k; }
ll addtop(ll i, ll k = 1) { return v += p10[keta(v) - i - 1] * k; }
ll dec(ll i, ll k = 1) { return v -= p10[i] * k; }
ll dectop(ll i, ll k = 1) { return v -= p10[keta(v) - i - 1] * k; }
#define op(t, o) \
template <class T> t operator o(T r) { return v o r; }
op(ll, +=);
op(ll, -=);
op(ll, *=);
op(ll, /=);
op(ll, %=);
op(ll, +);
op(ll, -);
op(ll, *);
op(ll, /);
op(ll, %);
op(bool, ==);
op(bool, !=);
op(bool, <);
op(bool, <=);
op(bool, >);
op(bool, >=);
#undef op
template <class T> ll operator<<=(T r) { return v *= p10[r]; }
template <class T> ll operator<<(T r) { return v * p10[r]; }
template <class T> ll operator>>=(T r) { return v /= p10[r]; }
template <class T> ll operator>>(T r) { return v / p10[r]; }
};
ll mask10(ll v) { return p10[v] - 1; }
// 変換系
template <class T> auto keys(T &a) {
vector<decltype((a.begin())->fi)> res;
for (auto &&k : a)
res.push_back(k.fi);
return res;
}
template <class T> auto values(T &a) {
vector<decltype((a.begin())->se)> res;
for (auto &&k : a)
res.push_back(k.se);
return res;
}
template <class T, class U> bool chma(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class U> bool chma(const U &b) { return chma(ma, b); }
template <class T, class U> bool chmi(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class U> bool chmi(const U &b) { return chmi(mi, b); }
template <class T> T min(T a, signed b) { return a < b ? a : b; }
template <class T> T max(T a, signed b) { return a < b ? b : a; }
template <class T> T min(T a, T b, T c) {
return a >= b ? b >= c ? c : b : a >= c ? c : a;
}
template <class T> T max(T a, T b, T c) {
return a <= b ? b <= c ? c : b : a <= c ? c : a;
}
template <class T> T min(vector<T> &a) { return *min_element(all(a)); }
template <class T> T mini(vector<T> &a) {
return min_element(all(a)) - a.begin();
}
template <class T> T min(vector<T> &a, ll n) {
return *min_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T min(vector<T> &a, ll s, ll n) {
return *min_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a) { return *max_element(all(a)); }
template <class T, class U> T max(vector<T> &a, vector<U> &b) {
return max(*max_element(all(a)), *max_element(all(b)));
}
template <class T> T maxi(vector<T> &a) {
return max_element(all(a)) - a.begin();
}
template <class T> T max(vector<T> &a, ll n) {
return *max_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a, ll s, ll n) {
return *max_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <typename A, size_t N> A max(A (&a)[N]) {
A res = a[0];
rep(i, N) res = max(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A max(A (&a)[N][O]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A max(A (&a)[N][O][P][Q], const T &v) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A max(A (&a)[N][O][P][Q][R]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A max(A (&a)[N][O][P][Q][R][S]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N> A min(A (&a)[N]) {
A res = a[0];
rep(i, N) res = min(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A min(A (&a)[N][O]) {
A res = min(a[0]);
rep(i, N) res = min(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A min(A (&a)[N][O][P][Q], const T &v) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A min(A (&a)[N][O][P][Q][R]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A min(A (&a)[N][O][P][Q][R][S]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <class T> T sum(vector<T> &v, ll s, ll t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += v[i];
return ret;
}
template <class T> T sum(vector<T> &v, ll t = inf) { return sum(v, 0, t); }
template <class T> T sum(vector<vector<T>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<T>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<T>>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<vector<T>>>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> auto sum(priority_queue<T, vector<T>, greater<T>> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
template <class T> auto sum(priority_queue<T> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
// template<class T, class U, class... W> auto sumn(vector<T> &v, U head, W...
// tail) { auto ret = sum(v[0], tail...); rep(i, 1, min(sz(v), head))ret
// += sum(v[i], tail...); return ret;}
void clear(PQ &q) { q = PQ(); }
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> T *negarr(ll size) {
T *body = (T *)malloc((size * 2 + 1) * sizeof(T));
return body + size;
}
template <class T> T *negarr2(ll h, ll w) {
double **dummy1 = new double *[2 * h + 1];
double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];
dummy1[0] = dummy2 + w;
for (ll i = 1; i <= 2 * h + 1; ++i) {
dummy1[i] = dummy1[i - 1] + 2 * w + 1;
}
double **a = dummy1 + h;
return a;
}
// imoは0-indexed
// ruiは1-indexed
template <class T> vector<T> imo(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
// kと同じものの数
template <class T, class U> vi imo(vector<T> &a, U k) {
vector<T> ret = a;
rep(i, sz(ret)) ret[i] = a[i] == k;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
template <class T> vector<T> imox(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] ^= ret[i];
return ret;
}
// 漸化的に最小を持つ
template <class T> vector<T> imi(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chmi(ret[i + 1], ret[i]);
return ret;
}
template <class T> struct ruiC {
const vector<T> rui;
ruiC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruic ";
deb(l, r);
assert(0);
}
return rui[r] - rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> struct rruic {
const T *rrui;
rruic(T *ru) : rrui(ru) {}
T operator()(ll l, ll r) {
assert(l >= r);
return rrui[r] - rrui[l];
}
T operator[](ll i) { return rrui[i]; }
};
template <class T> ostream &operator<<(ostream &os, ruiC<T> a) {
fora(v, a.rui) os << v << " ";
return os;
}
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i];
return ret;
}
template <class T> ruiC<T> ruic(vector<T> &a) {
vector<T> ret = ruiv(a);
return ruiC<T>(ret);
}
vector<ll> ruiv(string &a) {
if (sz(a) == 0)
return vi(1);
ll dec = ('0' <= a[0] && a[0] <= '9') ? '0' : 0;
vector<ll> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i] - dec;
return ret;
}
ruiC<ll> ruic(string &a) {
vector<ll> ret = ruiv(a);
return ruiC<ll>(ret);
}
// kと同じものの数
template <class T, class U> vi ruiv(T &a, U k) {
vi ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + (a[i] == k);
return ret;
}
template <class T, class U> ruiC<ll> ruic(T &a, U k) {
vi ret = ruiv(a, k);
return ruiC<ll>(ret);
}
// xor
template <class T> struct ruixC {
const vector<T> rui;
ruixC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruiXc ";
deb(l, r);
assert(0);
}
return rui[r] ^ rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> vector<T> ruix(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] ^ a[i];
return ret;
}
template <class T> ruixC<ll> ruixc(vector<T> &a) {
vi ret = ruix(a);
return ruixC<ll>(ret);
}
template <class T> vector<T> ruim(vector<T> &a) {
vector<T> res(a.size() + 1, 1);
rep(i, a.size()) res[i + 1] = res[i] * a[i];
return res;
}
// 漸化的に最小を1indexで持つ
template <class T> vector<T> ruimi(vector<T> &a) {
ll n = sz(a);
vector<T> ret(n + 1);
rep(i, 1, n) {
ret[i] = a[i - 1];
chmi(ret[i + 1], ret[i]);
}
return ret;
}
// template<class T> T *rrui(vector<T> &a) {
// 右から左にかけての半開区間 (-1 n-1]
template <class T> rruic<T> rrui(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
rer(i, len - 1) res[i - 1] = res[i] + a[i];
return rruic<T>(res);
}
// 掛け算
template <class T> T *rruim(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
res[len - 1] = 1;
rer(i, len - 1) res[i - 1] = res[i] * a[i];
return res;
}
template <class T, class U> void inc(T &a, U v = 1) { a += v; }
template <class T, class U> void inc(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T, class U> void dec(T &a, U v = 1) { a -= v; }
template <class T, class U> void dec(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class U> void dec(string &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T> void dec(vector<T> &a) {
for (auto &u : a)
dec(u, 1);
}
template <class T, class U> void dec(vector<T> &a, vector<U> &b) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
}
template <class T, class U, class W>
void dec(vector<T> &a, vector<U> &b, vector<W> &c) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
for (auto &u : c)
dec(u, 1);
}
bool ins(ll h, ll w, ll H, ll W) { return h >= 0 && w >= 0 && h < H && w < W; }
bool ins(ll l, ll v, ll r) { return l <= v && v < r; }
template <class T> bool ins(vector<T> &a, ll i, ll j = 0) {
return ins(0, i, sz(a)) && ins(0, j, sz(a));
}
ll u(ll a) { return a < 0 ? 0 : a; }
template <class T> vector<T> u(const vector<T> &a) {
vector<T> ret = a;
fora(v, ret) v = u(v);
return ret;
}
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
// 添え字を返す
template <class F> ll goldd_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
ll minScore = MAX(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (minScore > score) {
minScore = score;
resIndex = i;
}
}
return resIndex;
}
template <class F> ll goldt_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
if (left > right) {
ll l = left;
left = right;
right = l;
}
ll maxScore = MIN(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (maxScore < score) {
maxScore = score;
resIndex = i;
}
}
return resIndex;
}
/*loopは200にすればおそらく大丈夫 余裕なら300に*/
template <class F> dou goldd_d(dou left, dou right, F calc, ll loop = 200) {
dou GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm); /*200にすればおそらく大丈夫*/ /*余裕なら300に*/
ll k = 141;
loop++;
while (--loop) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
template <class F> dou goldt_d(dou left, dou right, F calc, ll loop = 200) {
double GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm);
loop++;
while (--loop) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
// l ~ rを複数の区間に分割し、極致を与えるiを返す time-20 msまで探索
template <class F> ll goldd_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll mini = 0, minv = MAX(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldd_l(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F> ll goldt_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll maxi = 0, maxv = MIN(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldt_l(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class F>
dou goldd_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を持つ*/
auto lim = milliseconds(time - 20);
dou mini = 0, minv = MAX(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldd_d(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F>
dou goldt_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を残している*/
auto lim = milliseconds(time - 20);
dou maxi = 0, maxv = MIN(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldt_d(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, *max_element(all(a[i])));
return res;
}
constexpr bool bget(ll m, ll keta) { return (m >> keta) & 1; }
ll bget(ll m, ll keta, ll sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
ll bit(ll n) { return (1LL << (n)); }
ll bit(ll n, ll sinsuu) { return (ll)pow(sinsuu, n); }
ll mask(ll n) { return (1ll << n) - 1; }
#define bcou __builtin_popcountll
// 最下位ビット
ll lbit(ll n) { return n & -n; }
// 最上位ビット
ll hbit(ll n) {
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
n |= (n >> 32);
return n - (n >> 1);
}
ll hbitk(ll n) {
ll k = 0;
rer(i, 5) {
ll a = k + (1ll << i);
ll b = 1ll << a;
if (b <= n)
k += 1ll << i;
}
return k;
}
// 初期化は0を渡す
ll nextComb(ll &mask, ll n, ll r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; /*最下位の1*/
ll y = mask + x; /*連続した下の1を繰り上がらせる*/
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vi bitCombList(ll n, ll r) {
vi res;
ll m = 0;
while (nextComb(m, n, r)) {
res.push_back(m);
}
return res;
}
// masの立ってるindexを見る
#define forbit(i, mas) \
for (int forbitj = lbit(mas), forbitm = mas, i = log2(forbitj); forbitm; \
forbitm = forbitj ? forbitm ^ forbitj : 0, forbitj = lbit(forbitm), \
i = log2(forbitj))
char itoal(ll i) { return 'a' + i; }
char itoaL(ll i) { return 'A' + i; }
ll altoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a';
}
ll ctoi(char c) { return c - '0'; }
char itoc(ll i) { return i + '0'; }
ll vtoi(vi &v) {
ll res = 0;
if (sz(v) > 18) {
debugline("vtoi");
deb(sz(v));
ole();
}
rep(i, sz(v)) {
res *= 10;
res += v[i];
}
return res;
}
vi itov(ll i) {
vi res;
while (i) {
res.push_back(i % 10);
i /= 10;
}
rev(res);
return res;
}
vi stov(string &a) {
ll n = sz(a);
vi ret(n);
rep(i, n) { ret[i] = a[i] - '0'; }
return ret;
}
// 基準を満たさないものは0になる
vi stov(string &a, char one) {
ll n = sz(a);
vi ret(n);
rep(i, n) ret[i] = a[i] == one;
return ret;
}
vector<vector<ll>> ctoi(vector<vector<char>> s, char c) {
ll n = sz(s), m = sz(s[0]);
vector<vector<ll>> res(n, vector<ll>(m));
rep(i, n) rep(j, m) res[i][j] = s[i][j] == c;
return res;
}
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
//[i] := i番として圧縮されたものを返す
vi compress(vi &a) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, umap<ll, ll> &map) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
ll v = a[i];
a[i] = lower_bound(all(b), a[i]) - b.begin();
map[v] = a[i];
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r, vi &s) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
fora(v, s) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
for (ll i = 0; i < sz(s); ++i)
r[i] = lower_bound(all(b), s[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vi> &a) {
vi b;
fora(vv, a) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vv, a) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vector<vi>> &a) {
vi b;
fora(vvv, a) fora(vv, vvv) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vvv, a) fora(vv, vvv) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
void compress(ll a[], ll len) {
vi b;
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
// 要素が見つからなかったときに困る
#define binarySearch(a, v) (binary_search(all(a), v))
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define lowerBound(a, v) (*lower_bound(all(a), v))
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define upperBound(a, v) (*upper_bound(all(a), v))
#define rlowerIndex(a, v) (upper_bound(all(a), v) - a.begin() - 1)
#define rlowerBound(a, v) *(--(upper_bound(all(a), v)))
#define rupperIndex(a, v) (lower_bound(all(a), v) - a.begin() - 1)
#define rupperBound(a, v) *(--(lower_bound(all(a), v)))
#define next2(a) next(next(a))
#define prev2(a) prev(prev(a))
// 狭義の単調増加列 長さを返す
template <class T> int lis_up(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = lowerIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
template <class T> int lis_eq(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = upperIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
// iteratorを返す
// valueが1以上の物を返す 0は見つけ次第削除
// vを減らす場合 (*it).se--でいい
template <class T, class U, class V> auto lower_map(map<T, U> &m, V k) {
auto ret = m.lower_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
template <class T, class U, class V> auto upper_map(map<T, U> &m, V k) {
auto ret = m.upper_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
// 存在しなければエラー
template <class T, class U, class V> auto rlower_map(map<T, U> &m, V k) {
auto ret = upper_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T, class U, class V> auto rupper_map(map<T, U> &m, V k) {
auto ret = lower_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T> void fin(T s) { cout << s << endl, exit(0); }
// 便利 数学 math
ll mod(ll a, ll m) { return (a % m + m) % m; }
ll pow(ll a) { return a * a; };
ll fact(ll v) { return v <= 1 ? 1 : v * fact(v - 1); }
dou factd(int v) {
static vd fact(2, 1);
if (sz(fact) <= v) {
rep(i, sz(fact), v + 1) { fact.push_back(fact.back() * i); }
}
return fact[v];
}
ll comi(ll n, ll r) {
assert(n < 100);
static vvi(pas, 100, 100);
if (pas[0][0])
return pas[n][r];
pas[0][0] = 1;
rep(i, 1, 100) {
pas[i][0] = 1;
rep(j, 1, i + 1) pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];
}
return pas[n][r];
}
// double comd(ll n, ll r) { assert(n < 2020); static vvd(comb, 2020,
// 2020); if (comb[0][0] == 0) { comb[0][0] = 1; rep(i, 2000) {
// comb[i + 1][0] = 1; rep(j, 1, i + 2) { comb[i +
// 1][j] = comb[i][j] + comb[i][j - 1]; } } } return
// comb[n][r];}
double comd(int n, int r) {
if (r < 0 || r > n)
return 0;
return factd(n) / factd(n - r) / factd(r);
}
ll gcd(ll a, ll b) {
while (b)
a %= b, swap(a, b);
return abs(a);
}
ll gcd(vi b) {
ll res = b[0];
rep(i, 1, sz(b)) res = gcd(b[i], res);
return res;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll lcm(vi a) {
ll res = a[0];
rep(i, 1, sz(a)) res = lcm(a[i], res);
return res;
}
ll ceil(ll a, ll b) {
if (b == 0) {
debugline("ceil");
deb(a, b);
ole();
return -1;
} else if (a < 0) {
return 0;
} else {
return (a + b - 1) / b;
}
}
ll lower_remi__bx_a(ll kei, ll rem, ll x) {
if (rem >= x)
return 0;
return (x - rem + kei - 1) / kei;
}
ll lower_remv__bx_a(ll kei, ll rem, ll x) {
if (rem >= x)
return rem;
return (x - rem + kei - 1) / kei * kei + rem;
}
ll upper_remi__bx_a(ll kei, ll rem, ll x) {
if (rem > x)
return 0;
return (x - rem + kei) / kei;
}
ll upper_remv__bx_a(ll kei, ll rem, ll x) {
if (rem > x)
return rem;
return (x - rem + kei) / kei * kei + rem;
}
// v * v >= aとなる最小のvを返す
ll sqrt(ll a) {
if (a < 0) {
debugline("sqrt");
deb(a);
ole();
}
ll res = (ll)std::sqrt(a);
while (res * res < a)
++res;
return res;
}
double log(double e, double x) { return log(x) / log(e); }
ll sig(ll t) { return ((1 + t) * t) >> 1; }
ll sig(ll s, ll t) { return ((s + t) * (t - s + 1)) >> 1; }
// 機能拡張
template <class T, class U> void operator+=(pair<T, U> &a, pair<T, U> &b) {
a.fi += b.fi;
a.se += b.se;
}
template <class T, class U> pair<T, U> operator+(pair<T, U> &a, pair<T, U> &b) {
return pair<T, U>(a.fi + b.fi, a.se + b.se);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
lhs += to_string(rv);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
lhs += to_string(rv);
}
template <class T, class U> void operator+=(queue<T> &a, U v) { a.push(v); }
template <class T, class U> void operator+=(deque<T> &a, U v) {
a.push_back(v);
}
template <class T>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, vector<T> &v) {
fora(d, v) a.push(d);
return a;
}
template <class T, class U>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, U v) {
a.push(v);
return a;
}
template <class T, class U>
priority_queue<T> &operator+=(priority_queue<T> &a, U v) {
a.push(v);
return a;
}
template <class T> set<T> &operator+=(set<T> &a, vector<T> v) {
fora(d, v) a.insert(d);
return a;
}
template <class T, class U> auto operator+=(set<T> &a, U v) {
return a.insert(v);
}
template <class T, class U> auto operator-=(set<T> &a, U v) {
return a.erase(v);
}
template <class T, class U> auto operator+=(mset<T> &a, U v) {
return a.insert(v);
}
template <class T, class U>
set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U> vector<T> &operator+=(vector<T> &a, U v) {
a.push_back(v);
return a;
}
template <class T, class U> vector<T> operator+(const vector<T> &a, U v) {
vector<T> ret = a;
ret += v;
return ret;
}
template <class T, class U> vector<T> operator+(U v, const vector<T> &a) {
vector<T> ret = a;
ret.insert(ret.begin(), v);
return ret;
}
template <class T> vector<T> operator+(vector<T> a, vector<T> b) {
vector<T> ret;
ret = a;
fora(v, b) ret += v;
return ret;
}
template <class T> vector<T> &operator+=(vector<T> &a, vector<T> &b) {
fora(v, b) a += v;
return a;
}
template <class T> vector<T> &operator-=(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-=");
deb(a);
deb(b);
exit(0);
}
rep(i, sz(a)) a[i] -= b[i];
return a;
}
template <class T> vector<T> operator-(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-");
deb(a);
deb(b);
ole();
}
vector<T> res(sz(a));
rep(i, sz(a)) res[i] = a[i] - b[i];
return res;
}
template <class T, class U> vector<T> operator*(vector<T> &a, U b) {
vector<T> ret;
fora(v, a) ret += v * b;
return ret;
}
template <class T, class U> vector<T> operator/(vector<T> &a, U b) {
vector<T> ret;
fora(v, a) ret += v / b;
return ret;
}
template <class T, class U> vector<T> operator*=(vector<T> &a, U b) {
fora(v, a) v *= b;
return a;
}
template <class T, class U> vector<T> operator/=(vector<T> &a, U b) {
fora(v, a) v /= b;
return a;
}
template <typename T> void erase(vector<T> &v, unsigned ll i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned ll s, unsigned ll e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <class T, class U> void erase(map<T, U> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <class T> void erase(set<T> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <typename T> void erasen(vector<T> &v, unsigned ll s, unsigned ll n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, U t) {
v.insert(v.begin() + i, t);
}
template <typename T, typename U> void push_front(vector<T> &v, U t) {
v.insert(v.begin(), t);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T> void insert(set<T> &v, vector<T> list) {
for (auto &&va : list)
v.insert(va);
}
vector<string> split(const string a, const char deli) {
string b = a + deli;
ll l = 0, r = 0, n = b.size();
vector<string> res;
rep(i, n) {
if (b[i] == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
l = i + 1;
}
}
return res;
}
vector<string> split(const string a, const string deli) {
vector<string> res;
ll kn = sz(deli);
std::string::size_type Pos(a.find(deli));
ll l = 0;
while (Pos != std::string::npos) {
if (Pos - l)
res.push_back(a.substr(l, Pos - l));
l = Pos + kn;
Pos = a.find(deli, Pos + kn);
}
if (sz(a) - l)
res.push_back(a.substr(l, sz(a) - l));
return res;
}
void yn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Yn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void fyn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
exit(0);
}
void fYn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
exit(0);
}
void fYN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
exit(0);
}
void Possible(bool a) {
if (a)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
exit(0);
}
void POSSIBLE(bool a) {
if (a)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
exit(0);
}
template <typename T> class fixed_point : T {
public:
explicit constexpr fixed_point(T &&t) noexcept : T(std::forward<T>(t)) {}
template <typename... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return T::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename T>
static inline constexpr decltype(auto) fix(T &&t) noexcept {
return fixed_point<T>{std::forward<T>(t)};
}
//@formatter:off
template <typename T> T minv(T a, T m);
template <typename T> T minv(T a);
template <typename T> class Modular {
public:
using Type = typename decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template <typename U> Modular(const U &x) { value = normalize(x); }
template <typename U> static Type normalize(const U &x) {
Type v;
if (-mod() <= x && x < mod())
v = static_cast<Type>(x);
else
v = static_cast<Type>(x % mod());
if (v < 0)
v += mod();
return v;
}
const Type &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static Type mod() { return T::value; }
Modular &operator+=(const Modular &other) {
if ((value += other.value) >= mod())
value -= mod();
return *this;
}
Modular &operator-=(const Modular &other) {
if ((value -= other.value) < 0)
value += mod();
return *this;
}
template <typename U> Modular &operator+=(const U &other) {
return *this += Modular(other);
}
template <typename U> Modular &operator-=(const U &other) {
return *this -= Modular(other);
}
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(signed) {
Modular result(*this);
*this += 1;
return result;
}
Modular operator--(signed) {
Modular result(*this);
*this -= 1;
return result;
}
Modular operator-() const { return Modular(-value); }
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, signed>::value,
Modular>::type &
operator*=(const Modular &rhs) {
#ifdef _WIN32
uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x),
d, m;
asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(mod()));
value = m;
#else
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
#endif
return *this;
}
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value,
Modular>::type &
operator*=(const Modular &rhs) {
int64_t q =
static_cast<int64_t>(static_cast<double>(value) * rhs.value / mod());
value = normalize(value * rhs.value - q * mod());
return *this;
}
template <typename U = T>
typename enable_if<!is_integral<typename Modular<U>::Type>::value,
Modular>::type &
operator*=(const Modular &rhs) {
value = normalize(value * rhs.value);
return *this;
}
Modular &operator/=(const Modular &other) {
return *this *= Modular(minv(other.value));
}
template <typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &number);
operator int() { return value; }
private:
Type value;
};
template <typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) {
return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value < rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
constexpr signed MOD =
// 998244353;
1e9 + 7; // MOD
using mint = Modular<std::integral_constant<decay<decltype(MOD)>::type, MOD>>;
constexpr int mint_len = 1400001;
vi fac, finv, inv;
vi p2;
mint com(int n, int r) {
if (r < 0 || r > n)
return 0;
return mint(finv[r] * fac[n] % MOD * finv[n - r]);
}
mint pom(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return mint(fac[n] * finv[n - 1]);
}
mint npr(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return mint(fac[n] * finv[n - r]);
}
int nprin(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return fac[n] * finv[n - r] % MOD;
}
int icom(int n, int r) {
const int NUM_ = 1400001;
static ll fac[NUM_ + 1], finv[NUM_ + 1], inv[NUM_ + 1];
if (fac[0] == 0) {
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i <= NUM_; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
if (r < 0 || r > n)
return 0;
return ((finv[r] * fac[n] % MOD) * finv[n - r]) % MOD;
}
#define ncr com
#define ncri icom
// n個の場所にr個の物を置く
mint nhr(int n, int r) { return com(n + r - 1, r); }
mint hom(int n, int r) { return com(n + r - 1, r); }
int nhri(int n, int r) { return icom(n + r - 1, r); }
template <typename T> T minv(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> T minv(T a) {
if (a < mint_len)
return inv[a];
T u = 0, v = 1;
T m = MOD;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T, typename U>
Modular<T> mpow(const Modular<T> &a, const U &b) {
assert(b >= 0);
int x = a(), res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U, typename V>
mint mpow(const T a, const U b, const V m = MOD) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= m;
(x *= x) %= m;
p >>= 1;
}
return res;
}
template <typename T, typename U> mint mpow(const T a, const U b) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U, typename V>
int mpowi(const T &a, const U &b, const V &m = MOD) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= m;
(x *= x) %= m;
p >>= 1;
}
return res;
}
template <typename T> string to_string(const Modular<T> &number) {
return to_string(number());
}
string yuri(const mint &a) {
stringstream st;
rep(i, 300) {
rep(j, 300) {
if ((mint)i / j == a) {
st << i << " / " << j;
return st.str();
}
}
}
rep(i, 1000) {
rep(j, 1000) {
if ((mint)i / j == a) {
st << i << " / " << j;
return st.str();
}
}
}
return st.str();
}
template <typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {
stream << number();
#ifdef _DEBUG
// stream << " -> " << yuri(number);
#endif
return stream;
}
//@formatter:off
template <typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &number) {
typename common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
number.value = Modular<T>::normalize(x);
return stream;
}
using PM = pair<mint, mint>;
using vm = vector<mint>;
using mapm = map<int, mint>;
using umapm = umap<int, mint>;
#define vvm(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(mint, __VA_ARGS__)
#define vnm(name, ...) auto name = make_v<mint>(__VA_ARGS__)
struct setmod {
setmod() {
// p2.resize(mint_len);p2[0] = 1; for (int i = 1; i < mint_len; ++i)
// p2[i] = p2[i - 1] * 2 % MOD;
fac.resize(mint_len);
finv.resize(mint_len);
inv.resize(mint_len);
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i < mint_len; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i < mint_len; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
} setmodv;
//@formatter:on
// nhr n個の場所にr個の物を分ける
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} initonv; //@formatter:on
// gra mll pr
// 上下左右
const string udlr = "udlr";
string UDLR = "UDLR"; // x4と連動 UDLR.find('U') := x4[0]
// 右、上が正
constexpr ll y4[] = {1, -1, 0, 0};
constexpr ll x4[] = {0, 0, -1, 1};
constexpr ll y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
constexpr ll x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
ll n, m, k, d, H, W, x, y, z, q;
ll cou;
vi a, b, c;
// vvi (s, 0, 0);
vvc(ba, 0, 0);
vp p;
str s;
// 幾何ライブラリ
struct V { /*@formatter:off*/
double x, y;
V(double x = 0, double y = 0) : x(x), y(y) {}
V &operator+=(const V &v) {
x += v.x;
y += v.y;
return *this;
}
V operator+(const V &v) const { return V(*this) += v; }
V &operator-=(const V &v) {
x -= v.x;
y -= v.y;
return *this;
}
V operator-(const V &v) const { return V(*this) -= v; }
V &operator*=(double s) {
x *= s;
y *= s;
return *this;
}
V operator*(double s) const { return V(*this) *= s; }
V &operator/=(double s) {
x /= s;
y /= s;
return *this;
}
V operator/(double s) const { return V(*this) /= s; }
// 内積
double dot(const V &v) const { return x * v.x + y * v.y; }
// 外積
double cross(const V &v) const { return x * v.y - v.x * y; }
double norm2() const { return x * x + y * y; }
double norm() const { return sqrt(norm2()); }
// 象限
int ort() const {
if (abs(x) < eps && abs(y) < eps)
return 0;
if (y > 0)
return x > 0 ? 1 : 2;
else
return x < 0 ? 3 : 4;
}
bool operator<(const V &v) const {
int o = ort(), vo = v.ort();
if (o != vo)
return o < vo;
return cross(v) > 0;
}
};
istream &operator>>(istream &ist, V &v) {
ist >> v.x >> v.y;
return ist;
}
ostream &operator<<(ostream &os, const V &v) {
os << "(" << v.x << "," << v.y << ")";
return os;
} /*@formatter:on*/
using dots = vector<V>;
double cross(const V &p, const V &q) { return p.x * q.y - p.y * q.x; }
// 一直線上の3点を含めない
vector<V> convexhull(vector<V> &ps) {
int n = (int)ps.size();
if (n <= 2) {
return ps;
}
vector<V> res(2 * n);
std::sort(ps.begin(), ps.end(), [&](V &l, V &r) {
if (l.x != r.x)
return l.x < r.x;
else
return l.y < r.y;
});
int k = 0;
for (int i = 0; i < n; ++i) {
if (k >= 2) {
while (cross(res[k - 1] - res[k - 2], ps[i] - res[k - 2]) < eps) {
--k;
if (k < 2)
break;
}
}
res[k] = ps[i];
++k;
}
int t = k + 1;
for (int i = n - 2; i >= 0; --i) {
if (k >= t) {
while (cross(res[k - 1] - res[k - 2], ps[i] - res[k - 2]) < eps) {
--k;
if (k < t)
break;
}
}
res[k] = ps[i];
++k;
}
res.resize(k - 1);
return res;
}
// 一直線上の3点を含める
vector<V> convexhull_line(vector<V> &ps) {
int n = (int)ps.size();
if (n <= 2) {
return ps;
}
vector<V> res(2 * n);
std::sort(ps.begin(), ps.end(), [&](V &l, V &r) {
if (l.x != r.x)
return l.x < r.x;
else
return l.y < r.y;
});
int k = 0;
for (int i = 0; i < n; ++i) {
if (k >= 2) {
while (cross(res[k - 1] - res[k - 2], ps[i] - res[k - 2]) < -eps) {
--k;
if (k < 2)
break;
}
}
res[k] = ps[i];
++k;
}
int t = k + 1;
for (int i = n - 2; i >= 0; --i) {
if (k >= t) {
while (cross(res[k - 1] - res[k - 2], ps[i] - res[k - 2]) < -eps) {
--k;
if (k < t)
break;
}
}
res[k] = ps[i];
++k;
}
res.resize(k - 1);
return res;
}
void solve() {
in(n);
dots ps;
na(ps, n);
dots sot{(0, 0)};
rep(i, n) {
int len = sz(sot);
rep(j, len) { sot += sot[j] + ps[i]; }
sot = convexhull(sot);
}
dou res = 0;
fora(v, sot) { chma(res, v.norm()); }
cout << res << endl;
}
auto my(ll n, vi &a) { return 0; }
auto sister(ll n, vi &a) {
ll ret = 0;
return ret;
}
signed main() {
solve();
#define arg n, a
#ifdef _DEBUG
bool bad = 0;
for (ll i = 0, ok = 1; i < k5 && ok; ++i) {
ll n = rand(1, 8);
vi a = ranv(n, 1, 10);
auto myres = my(arg);
auto res = sister(arg);
ok = myres == res;
if (!ok) {
out(arg);
cerr << "AC : " << res << endl;
cerr << "MY : " << myres << endl;
bad = 1;
break;
}
}
if (!bad) {
// cout << "完璧 : solveを書き直そう" << endl;
// cout << " : そして、solve()を呼び出すのだ" << endl;
// cout << " : cin>>n; na(a,n);も忘れるな" << endl;
}
#endif
return 0;
};
| replace | 3,909 | 3,910 | 3,909 | 3,910 | TLE | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi first
#define se second
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll A, B, C, D, E, F, G, H, X, Y, Z, P, Q, M, N, T, R, K, W, L, ANS;
string S, S1, S2;
using p = pair<double, double>;
using p = pair<double, double>;
vector<p> V;
double dot(p a, p b) { return a.first * b.first + a.second * b.second; }
double norm(p a) { return sqrt(a.first * a.first + a.second * a.second); }
p operator+(p a, p b) { return p(a.first + b.first, a.second + b.second); }
p operator-(p a, p b) { return p(a.first - b.first, a.second - b.second); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) {
cin >> X >> Y;
if (X != 0 || Y != 0)
V.push_back({X, Y});
}
sort(all(V), [](auto const &A1, auto const &A2) {
return atan2(A1.second, A1.first) > atan2(A2.se, A2.fi);
});
p SUM = {0, 0};
rep(i, N) { SUM = SUM + V[i]; }
vector<p> RUISEKI;
p NOW = {0, 0};
RUISEKI.push_back(NOW);
rep(i, N) {
NOW = NOW + V[i];
RUISEKI.push_back(NOW);
}
double ANS = 0;
rep(i, N) {
rep(j, i + 1) {
ANS = max({norm(RUISEKI[i + 1] - RUISEKI[j]),
norm(SUM - (RUISEKI[i + 1] - RUISEKI[j])), ANS});
}
}
cout << setprecision(15) << ANS << endl;
} | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi first
#define se second
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll A, B, C, D, E, F, G, H, X, Y, Z, P, Q, M, N, T, R, K, W, L, ANS;
string S, S1, S2;
using p = pair<double, double>;
using p = pair<double, double>;
vector<p> V;
double dot(p a, p b) { return a.first * b.first + a.second * b.second; }
double norm(p a) { return sqrt(a.first * a.first + a.second * a.second); }
p operator+(p a, p b) { return p(a.first + b.first, a.second + b.second); }
p operator-(p a, p b) { return p(a.first - b.first, a.second - b.second); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) {
cin >> X >> Y;
if (X != 0 || Y != 0)
V.push_back({X, Y});
}
N = V.size();
sort(all(V), [](auto const &A1, auto const &A2) {
return atan2(A1.second, A1.first) > atan2(A2.se, A2.fi);
});
p SUM = {0, 0};
rep(i, N) { SUM = SUM + V[i]; }
vector<p> RUISEKI;
p NOW = {0, 0};
RUISEKI.push_back(NOW);
rep(i, N) {
NOW = NOW + V[i];
RUISEKI.push_back(NOW);
}
double ANS = 0;
rep(i, N) {
rep(j, i + 1) {
ANS = max({norm(RUISEKI[i + 1] - RUISEKI[j]),
norm(SUM - (RUISEKI[i + 1] - RUISEKI[j])), ANS});
}
}
cout << setprecision(15) << ANS << endl;
} | insert | 38 | 38 | 38 | 40 | 0 | |
p02926 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
ostream &operator<<(ostream &os, Pll &a) {
return os << a.first << " " << a.second;
}
template <class T> void debug(T &v) {
for (auto &x : v)
cout << x << endl;
cout << endl;
}
bool compAngle(Pll &a, Pll &b) {
if (a.second == 0) {
if (a.first > 0)
return true;
return b.second < 0;
}
if (b.second == 0) {
if (b.first > 0)
return false;
return a.second > 0;
}
if (a.second * b.second < 0)
return a.second > b.second;
return a.first * b.second > b.first * a.second;
}
ll norm2(ll &X, ll &Y) { return X * X + Y * Y; }
int main() {
int N;
cin >> N;
vector<Pll> vecs(N);
for (auto &v : vecs)
cin >> v.first >> v.second;
sort(vecs.begin(), vecs.end(), compAngle);
// debug(vecs);
vector<ll> sx(N + 1), sy(N + 1);
sx[0] = 0;
sy[0] = 0;
for (int i = 0; i < N; i++) {
sx[i + 1] = sx[i] + vecs[i].first;
sy[i + 1] = sy[i] + vecs[i].second;
}
ll ans = norm2(sx[N], sy[N]);
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
ll X = sx[j + 1] - sx[i];
ll Y = sy[j + 1] - sy[i];
ans = max(ans, norm2(X, Y));
X = sx[N] - X;
Y = sy[N] - Y;
ans = max(ans, norm2(X, Y));
}
}
cout << fixed << setprecision(20) << sqrt(ans) << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
ostream &operator<<(ostream &os, Pll &a) {
return os << a.first << " " << a.second;
}
template <class T> void debug(T &v) {
for (auto &x : v)
cout << x << endl;
cout << endl;
}
bool compAngle(Pll &a, Pll &b) {
return atan2(a.second, a.first) < atan2(b.second, b.first);
}
ll norm2(ll &X, ll &Y) { return X * X + Y * Y; }
int main() {
int N;
cin >> N;
vector<Pll> vecs(N);
for (auto &v : vecs)
cin >> v.first >> v.second;
sort(vecs.begin(), vecs.end(), compAngle);
// debug(vecs);
vector<ll> sx(N + 1), sy(N + 1);
sx[0] = 0;
sy[0] = 0;
for (int i = 0; i < N; i++) {
sx[i + 1] = sx[i] + vecs[i].first;
sy[i + 1] = sy[i] + vecs[i].second;
}
ll ans = norm2(sx[N], sy[N]);
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
ll X = sx[j + 1] - sx[i];
ll Y = sy[j + 1] - sy[i];
ans = max(ans, norm2(X, Y));
X = sx[N] - X;
Y = sy[N] - Y;
ans = max(ans, norm2(X, Y));
}
}
cout << fixed << setprecision(20) << sqrt(ans) << endl;
} | replace | 29 | 42 | 29 | 30 | TLE | |
p02926 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
//<editor-fold desc="definitions">
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n"
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using viii = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using vlll = vector<vector<vector<ll>>>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
ll mod = ll(1e9) + 7;
ll inf = ll(1e18);
void bl(bool b, ostream &out = cout) { out << (b ? "Yes" : "No") << endl; }
void bl2(bool b, ostream &out = cout) { out << (b ? "YES" : "NO") << endl; }
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
#define TO_STRING(varName) #varName
#include <iostream>
#include <map>
#include <vector>
using namespace std;
namespace dbg {
using ll = long long;
class Debug {
void prefix(string s) {
cout << "\033[7m\033[35m"
<< " DEBUG "
<< "\033[0m\033[35m"
<< " " << s << "\033[0m" << endl;
}
public:
Debug() {}
// vector d1
template <typename T> void print(vector<T> &vec);
// vector tuple
template <typename T1, typename T2>
void print(vector<pair<T1, T2>> &vec, int idx = 0);
// vector d2
template <typename T> void print(vector<vector<T>> &vec);
// vector d2
template <typename T> void print(vector<vector<vector<T>>> &vec);
// vector array d1
template <typename T> void print(T *arr, ll n);
// vector array d2
template <typename T> void print(T *arr, int n, int m);
// set
template <typename T> void print(set<T> &st);
// vector map or set
template <typename T> void print(T cont);
};
template <typename T> void Debug::print(vector<T> &vec) {
prefix("vector");
for (auto &v : vec)
cout << v << " ";
cout << endl;
}
template <typename T1, typename T2>
void Debug::print(vector<pair<T1, T2>> &vec, int idx) {
prefix("vector pair");
for (auto &v : vec)
cout << (!idx ? get<0>(v) : get<1>(v)) << " ";
cout << endl;
}
template <typename T> void Debug::print(vector<vector<T>> &vec) {
prefix("vector d2");
for (auto &vv : vec) {
for (auto &v : vv)
cout << v << " ";
cout << endl;
}
}
template <typename T> void Debug::print(vector<vector<vector<T>>> &vec) {
prefix("vector d3");
for (auto &vvv : vec) {
cout << "[";
for (int i = 0; i < vvv.size(); i++) {
if (i)
cout << " ";
for (int j = 0; j < vvv[i].size(); j++) {
if (j)
cout << " ";
cout << vvv[i][j];
}
if (i != vvv.size() - 1)
cout << endl;
}
cout << "]" << endl;
}
}
template <typename T> void Debug::print(T *arr, ll n) {
prefix("array");
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}
template <typename T> void Debug::print(T *arr, int n, int m) {
prefix("array d2");
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << arr[i][j] << " ";
}
cout << endl;
}
}
template <typename T> void Debug::print(set<T> &st) {
prefix("set");
for (auto &e : st)
cout << e << " ";
cout << endl;
}
template <typename T> void Debug::print(T cont) {
prefix("key value");
for (auto &e : cont)
cout << e.first << " : " << e.second << endl;
cout << endl;
}
} // namespace dbg
#endif // INCLUDE_DEBUG_HPP
dbg::Debug debug;
//</editor-fold>
class FEngines {
public:
void solve(std::istream &in, std::ostream &out) {
int n;
in >> n;
vector<ld> x(n), y(n);
vector<pair<ld, ld>> vp;
for (int i = 0; i < n; i++) {
in >> x[i] >> y[i];
if (x[i] == 0 && y[i] == 0)
continue;
vp.emplace_back(x[i], y[i]);
}
sort(vp.begin(), vp.end(), [&](pair<ld, ld> p1, pair<ld, ld> p2) {
return atan2(p1.second, p1.first) < atan2(p2.second, p2.first);
});
ld res = 0;
for (int i = 0; i < n; i++) {
ld xx = 0, yy = 0;
for (int j = 0; j < n; j++) {
auto p = vp[(i + j) % n];
xx += p.first;
yy += p.second;
chmax(res, sqrt(xx * xx + yy * yy));
}
}
out << fixed << setprecision(15) << res << enl;
}
};
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
FEngines solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
//<editor-fold desc="definitions">
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n"
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using viii = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using vlll = vector<vector<vector<ll>>>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
ll mod = ll(1e9) + 7;
ll inf = ll(1e18);
void bl(bool b, ostream &out = cout) { out << (b ? "Yes" : "No") << endl; }
void bl2(bool b, ostream &out = cout) { out << (b ? "YES" : "NO") << endl; }
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
#define TO_STRING(varName) #varName
#include <iostream>
#include <map>
#include <vector>
using namespace std;
namespace dbg {
using ll = long long;
class Debug {
void prefix(string s) {
cout << "\033[7m\033[35m"
<< " DEBUG "
<< "\033[0m\033[35m"
<< " " << s << "\033[0m" << endl;
}
public:
Debug() {}
// vector d1
template <typename T> void print(vector<T> &vec);
// vector tuple
template <typename T1, typename T2>
void print(vector<pair<T1, T2>> &vec, int idx = 0);
// vector d2
template <typename T> void print(vector<vector<T>> &vec);
// vector d2
template <typename T> void print(vector<vector<vector<T>>> &vec);
// vector array d1
template <typename T> void print(T *arr, ll n);
// vector array d2
template <typename T> void print(T *arr, int n, int m);
// set
template <typename T> void print(set<T> &st);
// vector map or set
template <typename T> void print(T cont);
};
template <typename T> void Debug::print(vector<T> &vec) {
prefix("vector");
for (auto &v : vec)
cout << v << " ";
cout << endl;
}
template <typename T1, typename T2>
void Debug::print(vector<pair<T1, T2>> &vec, int idx) {
prefix("vector pair");
for (auto &v : vec)
cout << (!idx ? get<0>(v) : get<1>(v)) << " ";
cout << endl;
}
template <typename T> void Debug::print(vector<vector<T>> &vec) {
prefix("vector d2");
for (auto &vv : vec) {
for (auto &v : vv)
cout << v << " ";
cout << endl;
}
}
template <typename T> void Debug::print(vector<vector<vector<T>>> &vec) {
prefix("vector d3");
for (auto &vvv : vec) {
cout << "[";
for (int i = 0; i < vvv.size(); i++) {
if (i)
cout << " ";
for (int j = 0; j < vvv[i].size(); j++) {
if (j)
cout << " ";
cout << vvv[i][j];
}
if (i != vvv.size() - 1)
cout << endl;
}
cout << "]" << endl;
}
}
template <typename T> void Debug::print(T *arr, ll n) {
prefix("array");
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}
template <typename T> void Debug::print(T *arr, int n, int m) {
prefix("array d2");
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << arr[i][j] << " ";
}
cout << endl;
}
}
template <typename T> void Debug::print(set<T> &st) {
prefix("set");
for (auto &e : st)
cout << e << " ";
cout << endl;
}
template <typename T> void Debug::print(T cont) {
prefix("key value");
for (auto &e : cont)
cout << e.first << " : " << e.second << endl;
cout << endl;
}
} // namespace dbg
#endif // INCLUDE_DEBUG_HPP
dbg::Debug debug;
//</editor-fold>
class FEngines {
public:
void solve(std::istream &in, std::ostream &out) {
int n;
in >> n;
vector<ld> x(n), y(n);
vector<pair<ld, ld>> vp;
for (int i = 0; i < n; i++) {
in >> x[i] >> y[i];
if (x[i] == 0 && y[i] == 0)
continue;
vp.emplace_back(x[i], y[i]);
}
sort(vp.begin(), vp.end(), [&](pair<ld, ld> p1, pair<ld, ld> p2) {
return atan2(p1.second, p1.first) < atan2(p2.second, p2.first);
});
n = vp.size();
ld res = 0;
for (int i = 0; i < n; i++) {
ld xx = 0, yy = 0;
for (int j = 0; j < n; j++) {
auto p = vp[(i + j) % n];
xx += p.first;
yy += p.second;
chmax(res, sqrt(xx * xx + yy * yy));
}
}
out << fixed << setprecision(15) << res << enl;
}
};
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
FEngines solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| insert | 195 | 195 | 195 | 196 | 0 | |
p02926 | C++ | Time Limit Exceeded | #if __has_include("../library/Basic/Debug.hpp")
#include "../library/Basic/Debug.hpp"
#else
/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <bitset>
#include <complex>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// others
#include <cassert>
#include <cstdint>
#include <ctime>
#include <functional>
#include <limits>
#include <random>
/* ----- Type Alias ----- */
using Bool = bool;
using Int = long long int;
using Real = long double;
using Char = char;
using String = std::string;
template <class T, class U> using Pair = std::pair<T, U>;
template <class... Ts> using Tuple = std::tuple<Ts...>;
template <class T> using Vector = std::vector<T>;
template <size_t N> using Bits = std::bitset<N>;
template <class T> using Queue = std::queue<T>;
template <class T> using Stack = std::stack<T>;
template <class T> using Deque = std::deque<T>;
template <class T> using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T> using Set = std::set<T>;
template <class T, class U> using Map = std::map<T, U>;
template <class T, class... Us> using Func = std::function<T(Us...)>;
template <class T> T genv(T v) { return v; }
template <class T, class... Ts> auto genv(size_t l, Ts... ts) {
return Vector<decltype(genv<T>(ts...))>(l, genv<T>(ts...));
}
template <class Cost = Int> struct Edge {
Int src, dst;
Cost cost;
Edge(Int src = -1, Int dst = -1, Cost cost = 1)
: src(src), dst(dst), cost(cost){};
bool operator<(const Edge<Cost> &e) const { return this->cost < e.cost; }
bool operator>(const Edge<Cost> &e) const { return this->cost > e.cost; }
};
template <class Cost = Int> using Edges = Vector<Edge<Cost>>;
template <class Cost = Int> using Graph = Vector<Vector<Edge<Cost>>>;
#endif
/* ----- Misc ----- */
void fastio() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
}
struct Fout {
Int precision;
Fout(Int precision) : precision(precision) {}
};
std::ostream &operator<<(std::ostream &os, const Fout &fio) {
os << std::fixed << std::setprecision(fio.precision);
return os;
}
/* ----- Constants ----- */
// constexpr Int INF = std::numeric_limits<Int>::max() / 3;
// constexpr Int MOD = 1000000007;
// constexpr Real PI = acos(-1);
constexpr Real EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));
using Point = std::complex<Real>;
using Segment = std::pair<Point, Point>;
using Polygon = std::vector<Point>;
template <class T> T sq(T x) { return x * x; }
Bool lt_complex(const Point &a, const Point &b) {
return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();
}
std::istream &operator>>(std::istream &is, Point &p) {
Real x, y;
is >> x >> y;
p = Point(x, y);
return is;
}
// 宇宙船演算子
Int compare(Real a, Real b) {
if (std::abs(a - b) < EPS)
return 0;
return a - b > 0 ? 1 : -1;
}
// outer product
Real cross(Point x, Point y) { return std::imag(std::conj(x) * (y)); }
Polygon convexhull(Polygon &g, Bool linearok) {
std::sort(g.begin(), g.end(), lt_complex);
Int N = g.size();
Polygon ret(N * 2);
Int k = 0;
for (Int i = 0; i < N; ++i) {
while (k >= 2 && compare(cross(ret[k - 1] - ret[k - 2], g[i] - ret[k - 2]),
0) < !linearok)
--k;
// linearokならcross = 0も回収する
ret[k++] = g[i];
}
Int t = k + 1;
for (Int i = N - 2; i >= 0; --i) {
while (k >= t && compare(cross(ret[k - 1] - ret[k - 2], g[i] - ret[k - 2]),
0) < !linearok)
--k;
ret[k++] = g[i];
}
// 先頭が被っているので除く
ret.resize(k - 1);
return ret;
}
int main() {
Int n;
std::cin >> n;
Polygon g;
g.push_back(Point(0, 0));
for (Int i = 0; i < n; ++i) {
Point p;
std::cin >> p;
Polygon h;
for (auto q : g)
h.push_back(p + q);
std::move(h.begin(), h.end(), std::back_inserter(g));
g = convexhull(g, true);
}
Real ans = 0;
for (auto p : g) {
ans = std::max(ans, std::abs(p));
}
std::cout << Fout(20) << ans << std::endl;
return 0;
}
| #if __has_include("../library/Basic/Debug.hpp")
#include "../library/Basic/Debug.hpp"
#else
/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <bitset>
#include <complex>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// others
#include <cassert>
#include <cstdint>
#include <ctime>
#include <functional>
#include <limits>
#include <random>
/* ----- Type Alias ----- */
using Bool = bool;
using Int = long long int;
using Real = long double;
using Char = char;
using String = std::string;
template <class T, class U> using Pair = std::pair<T, U>;
template <class... Ts> using Tuple = std::tuple<Ts...>;
template <class T> using Vector = std::vector<T>;
template <size_t N> using Bits = std::bitset<N>;
template <class T> using Queue = std::queue<T>;
template <class T> using Stack = std::stack<T>;
template <class T> using Deque = std::deque<T>;
template <class T> using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T> using Set = std::set<T>;
template <class T, class U> using Map = std::map<T, U>;
template <class T, class... Us> using Func = std::function<T(Us...)>;
template <class T> T genv(T v) { return v; }
template <class T, class... Ts> auto genv(size_t l, Ts... ts) {
return Vector<decltype(genv<T>(ts...))>(l, genv<T>(ts...));
}
template <class Cost = Int> struct Edge {
Int src, dst;
Cost cost;
Edge(Int src = -1, Int dst = -1, Cost cost = 1)
: src(src), dst(dst), cost(cost){};
bool operator<(const Edge<Cost> &e) const { return this->cost < e.cost; }
bool operator>(const Edge<Cost> &e) const { return this->cost > e.cost; }
};
template <class Cost = Int> using Edges = Vector<Edge<Cost>>;
template <class Cost = Int> using Graph = Vector<Vector<Edge<Cost>>>;
#endif
/* ----- Misc ----- */
void fastio() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
}
struct Fout {
Int precision;
Fout(Int precision) : precision(precision) {}
};
std::ostream &operator<<(std::ostream &os, const Fout &fio) {
os << std::fixed << std::setprecision(fio.precision);
return os;
}
/* ----- Constants ----- */
// constexpr Int INF = std::numeric_limits<Int>::max() / 3;
// constexpr Int MOD = 1000000007;
// constexpr Real PI = acos(-1);
constexpr Real EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));
using Point = std::complex<Real>;
using Segment = std::pair<Point, Point>;
using Polygon = std::vector<Point>;
template <class T> T sq(T x) { return x * x; }
Bool lt_complex(const Point &a, const Point &b) {
return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();
}
std::istream &operator>>(std::istream &is, Point &p) {
Real x, y;
is >> x >> y;
p = Point(x, y);
return is;
}
// 宇宙船演算子
Int compare(Real a, Real b) {
if (std::abs(a - b) < EPS)
return 0;
return a - b > 0 ? 1 : -1;
}
// outer product
Real cross(Point x, Point y) { return std::imag(std::conj(x) * (y)); }
Polygon convexhull(Polygon &g, Bool linearok) {
std::sort(g.begin(), g.end(), lt_complex);
Int N = g.size();
Polygon ret(N * 2);
Int k = 0;
for (Int i = 0; i < N; ++i) {
while (k >= 2 && compare(cross(ret[k - 1] - ret[k - 2], g[i] - ret[k - 2]),
0) < !linearok)
--k;
// linearokならcross = 0も回収する
ret[k++] = g[i];
}
Int t = k + 1;
for (Int i = N - 2; i >= 0; --i) {
while (k >= t && compare(cross(ret[k - 1] - ret[k - 2], g[i] - ret[k - 2]),
0) < !linearok)
--k;
ret[k++] = g[i];
}
// 先頭が被っているので除く
ret.resize(k - 1);
return ret;
}
int main() {
Int n;
std::cin >> n;
Polygon g;
g.push_back(Point(0, 0));
for (Int i = 0; i < n; ++i) {
Point p;
std::cin >> p;
Polygon h;
for (auto q : g)
h.push_back(p + q);
std::move(h.begin(), h.end(), std::back_inserter(g));
g = convexhull(g, false);
}
Real ans = 0;
for (auto p : g) {
ans = std::max(ans, std::abs(p));
}
std::cout << Fout(20) << ans << std::endl;
return 0;
}
| replace | 170 | 171 | 170 | 171 | TLE | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using lli = long long;
struct vec {
lli x, y;
vec() {}
vec(lli x, lli y) : x(x), y(y) {}
vec operator+(const vec &rhs) const { return vec(x + rhs.x, y + rhs.y); }
void read() { scanf("%lld %lld", &x, &y); }
lli cross(const vec rhs) const { return x * rhs.x - y * rhs.y; }
lli len() { return x * x + y * y; }
bool operator<(const vec &rhs) const {
if (y * rhs.y < 0)
return y > 0;
else if (y == 0) {
if (x > 0)
return !(rhs.y == 0 && rhs.x > 0);
else
return !(rhs.y >= 0);
} else if (rhs.y == 0 && rhs.x > 0)
return false;
else {
return cross(rhs) > 0;
}
}
} arr[100];
int n;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
arr[i].read();
if (arr[i].x == 0 && arr[i].y == 0) {
n--;
i--;
}
}
sort(arr, arr + n);
lli ans = 0;
for (int i = 0; i < n; i++) {
vec tmp(0, 0);
for (int j = 0; j < n; j++) {
tmp = tmp + arr[(i + j) % n];
ans = max(ans, tmp.len());
}
}
printf("%.12Lf\n", sqrtl(ans));
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using lli = long long;
struct vec {
lli x, y;
vec() {}
vec(lli x, lli y) : x(x), y(y) {}
vec operator+(const vec &rhs) const { return vec(x + rhs.x, y + rhs.y); }
void read() { scanf("%lld %lld", &x, &y); }
lli cross(const vec rhs) const { return x * rhs.y - y * rhs.x; }
lli len() { return x * x + y * y; }
bool operator<(const vec &rhs) const {
if (y * rhs.y < 0)
return y > 0;
else if (y == 0) {
if (x > 0)
return !(rhs.y == 0 && rhs.x > 0);
else
return !(rhs.y >= 0);
} else if (rhs.y == 0 && rhs.x > 0)
return false;
else {
return cross(rhs) > 0;
}
}
} arr[100];
int n;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
arr[i].read();
if (arr[i].x == 0 && arr[i].y == 0) {
n--;
i--;
}
}
sort(arr, arr + n);
lli ans = 0;
for (int i = 0; i < n; i++) {
vec tmp(0, 0);
for (int j = 0; j < n; j++) {
tmp = tmp + arr[(i + j) % n];
ans = max(ans, tmp.len());
}
}
printf("%.12Lf\n", sqrtl(ans));
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02926 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define pb push_back
#define fi first
#define se second
#define FF first
#define SS second
#define INF 2e18;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define pd(x) printf("%d\n", x)
#define plld(x) printf("%lld\n", x)
#define endl '\n'
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define sz(s) (int)s.size()
#define all(x) x.begin(), x.end()
typedef long double f80;
int x[105], y[105];
signed main() {
freopen("inp.txt", "r", stdin);
freopen("out.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
fr(i, 1, n) { cin >> x[i] >> y[i]; }
f80 z = (2 * acos(-1)) / 1000000;
ll ans = 0;
for (int i = 0; i < 1000000; i++) {
f80 x1 = cos(z * i), y1 = sin(z * i);
int xx = 0, yy = 0;
fr(j, 1, n) {
if (x1 * x[j] + y1 * y[j] >= 0) {
xx += x[j], yy += y[j];
}
}
ans = max(ans, (ll)xx * xx + (ll)yy * yy);
}
cout << setprecision(20) << fixed << sqrtl(ans);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define pb push_back
#define fi first
#define se second
#define FF first
#define SS second
#define INF 2e18;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define pd(x) printf("%d\n", x)
#define plld(x) printf("%lld\n", x)
#define endl '\n'
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define sz(s) (int)s.size()
#define all(x) x.begin(), x.end()
typedef long double f80;
int x[105], y[105];
signed main() {
// freopen("inp.txt","r",stdin);
// freopen("out.txt","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
fr(i, 1, n) { cin >> x[i] >> y[i]; }
f80 z = (2 * acos(-1)) / 1000000;
ll ans = 0;
for (int i = 0; i < 1000000; i++) {
f80 x1 = cos(z * i), y1 = sin(z * i);
int xx = 0, yy = 0;
fr(j, 1, n) {
if (x1 * x[j] + y1 * y[j] >= 0) {
xx += x[j], yy += y[j];
}
}
ans = max(ans, (ll)xx * xx + (ll)yy * yy);
}
cout << setprecision(20) << fixed << sqrtl(ans);
return 0;
} | replace | 25 | 27 | 25 | 27 | 0 | |
p02926 | C++ | Time Limit Exceeded | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// math, algorithm
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
// etc
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <random>
#include <utility>
// using-directive
using namespace std;
// alias template
using int64 = long long;
using uint64 = unsigned long long;
using vi = std::vector<int>;
using vl = std::vector<int64>;
using pii = std::pair<int, int>;
using pii = std::pair<int, int>;
using pll = std::pair<int64, int64>;
// text macro replacement
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(_) (_).begin(), (_).end()
#define rall(_) (_).rbegin(), (_).rend()
#define print(_) std::cout << (_) << '\n'
#define debug(_) std::cerr << #_ << ": " << (_) << '\n'
#define dbg(vec) \
for (size_t _ = 0; _ < vec.size(); ++_) { \
std::cerr << #vec << "[" << _ << "] : " << vec[_] << '\n'; \
}
// variadic template
template <typename T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
return;
}
template <typename T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
return;
}
// constant
const int INF = (1 << 30) - 1; // 1.073741823e9
const int64 INF64 = (1LL << 62) - 1; // 4.611686018427387903e18
const int MOD = 1000000007;
const double pi = 3.141592653589793;
vector<double> x(101), y(101);
int n;
double naiseki(double x1, double y1, double x2, double y2) {
return x1 * x2 + y1 * y2;
}
// 角度 theta の方向を最終的に向くとして計算
// theta は radian
double calc(const double &theta) {
double res = 0.0;
double dx = cos(theta), dy = sin(theta);
for (int i = 0; i < n; ++i) {
res += max(0.0, naiseki(dx, dy, x[i], y[i]));
}
return res;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
// auto start = chrono::system_clock::now();
cin >> n;
rep(i, n) cin >> x[i] >> y[i];
int step = 25000000;
double ans = 0.0;
for (int i = 0; i < step; ++i) {
double theta = 2.0 * pi * i / step;
chmax(ans, calc(theta));
}
// auto end = chrono::system_clock::now();
// auto dur = end - start;
// auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
// cerr << msec << '\n';
cout << setprecision(15) << ans << '\n';
return 0;
} | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// math, algorithm
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
// etc
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <random>
#include <utility>
// using-directive
using namespace std;
// alias template
using int64 = long long;
using uint64 = unsigned long long;
using vi = std::vector<int>;
using vl = std::vector<int64>;
using pii = std::pair<int, int>;
using pii = std::pair<int, int>;
using pll = std::pair<int64, int64>;
// text macro replacement
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(_) (_).begin(), (_).end()
#define rall(_) (_).rbegin(), (_).rend()
#define print(_) std::cout << (_) << '\n'
#define debug(_) std::cerr << #_ << ": " << (_) << '\n'
#define dbg(vec) \
for (size_t _ = 0; _ < vec.size(); ++_) { \
std::cerr << #vec << "[" << _ << "] : " << vec[_] << '\n'; \
}
// variadic template
template <typename T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
return;
}
template <typename T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
return;
}
// constant
const int INF = (1 << 30) - 1; // 1.073741823e9
const int64 INF64 = (1LL << 62) - 1; // 4.611686018427387903e18
const int MOD = 1000000007;
const double pi = 3.141592653589793;
vector<double> x(101), y(101);
int n;
double naiseki(double x1, double y1, double x2, double y2) {
return x1 * x2 + y1 * y2;
}
// 角度 theta の方向を最終的に向くとして計算
// theta は radian
double calc(const double &theta) {
double res = 0.0;
double dx = cos(theta), dy = sin(theta);
for (int i = 0; i < n; ++i) {
res += max(0.0, naiseki(dx, dy, x[i], y[i]));
}
return res;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
// auto start = chrono::system_clock::now();
cin >> n;
rep(i, n) cin >> x[i] >> y[i];
int step = 5000000;
double ans = 0.0;
for (int i = 0; i < step; ++i) {
double theta = 2.0 * pi * i / step;
chmax(ans, calc(theta));
}
// auto end = chrono::system_clock::now();
// auto dur = end - start;
// auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
// cerr << msec << '\n';
cout << setprecision(15) << ans << '\n';
return 0;
} | replace | 101 | 102 | 101 | 102 | TLE | |
p02926 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
ll data[N][2];
F0R(i, N) { F0R(j, 2) cin >> data[i][j]; }
ll ans = 0;
F0R(xP, 2) {
F0R(yP, 2) {
ll xC = xP;
if (xC == 0)
xC = -1;
ll yC = yP;
if (yP == 0)
yC = -1;
vpl oldPoints;
oldPoints.pb({0, 0});
F0R(i, N) {
vpl newPoints;
F0R(j, sz(oldPoints)) {
newPoints.pb(oldPoints[j]);
newPoints.pb(mp(oldPoints[j].f + data[i][0] * xC,
oldPoints[j].s + data[i][1] * yC));
}
oldPoints.clear();
F0R(x, sz(newPoints)) {
int k = sz(oldPoints) - 1;
if (sz(oldPoints) == 0 || oldPoints[k].f < newPoints[x].f ||
oldPoints[k].s < newPoints[x].s) {
oldPoints.pb(newPoints[x]);
}
}
}
F0R(i, sz(oldPoints)) {
ans = max(ans, oldPoints[i].f * oldPoints[i].f +
oldPoints[i].s * oldPoints[i].s);
}
}
}
cout << setprecision(30) << sqrtl((ld)ans) << endl;
return 0;
} | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001; // check the limits, dummy
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
ll data[N][2];
F0R(i, N) { F0R(j, 2) cin >> data[i][j]; }
ll ans = 0;
F0R(xP, 2) {
F0R(yP, 2) {
ll xC = xP;
if (xC == 0)
xC = -1;
ll yC = yP;
if (yP == 0)
yC = -1;
vpl oldPoints;
oldPoints.pb({0, 0});
F0R(i, N) {
vpl newPoints;
F0R(j, sz(oldPoints)) {
newPoints.pb(oldPoints[j]);
newPoints.pb(mp(oldPoints[j].f + data[i][0] * xC,
oldPoints[j].s + data[i][1] * yC));
}
sort(all(newPoints));
reverse(all(newPoints));
oldPoints.clear();
F0R(x, sz(newPoints)) {
int k = sz(oldPoints) - 1;
if (sz(oldPoints) == 0 || oldPoints[k].f < newPoints[x].f ||
oldPoints[k].s < newPoints[x].s) {
oldPoints.pb(newPoints[x]);
}
}
}
F0R(i, sz(oldPoints)) {
ans = max(ans, oldPoints[i].f * oldPoints[i].f +
oldPoints[i].s * oldPoints[i].s);
}
}
}
cout << setprecision(30) << sqrtl((ld)ans) << endl;
return 0;
} | insert | 80 | 80 | 80 | 82 | TLE | |
p02926 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<ll, ll> PL;
typedef vector<PL> vpl;
typedef vector<vector<PL>> vvpl;
const int INF = 1001001001;
const ll LINF = 1e17;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for (ll i = (a); i < b; i++)
#define RFOR(i, a, b) for (ll i = (a); i > b; i--)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i > -1; i--)
#define FORMAP(it, m) for (auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back
#define ALL(X) (X).begin(), (X).end()
template <typename T> T gcd(T a, T b) { return (a == 0) ? b : gcd(b % a, a); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
bool p_comp_fs(const PL p1, const PL p2) { return p1.first < p2.first; };
bool p_comp_fg(const PL p1, const PL p2) { return p1.first > p2.first; };
bool p_comp_ss(const PL p1, const PL p2) { return p1.second < p2.second; };
bool p_comp_sg(const PL p1, const PL p2) { return p1.second > p2.second; };
template <typename T> vector<T> uniquen(vector<T> vec) {
sort(ALL(vec));
vec.erase(unique(vec.begin(), vec.end()), vec.end());
return vec;
}
inline ll popcnt(ll x) { return __builtin_popcountll((unsigned long long)x); };
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// friend bool operator<(const stc& lhs, const stc& rhs){
// return std::tie(lhs.l, lhs.r) < std::tie(rhs.l, rhs.r);
// }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll N;
cin >> N;
vd X(N), Y(N);
rep(i, N) { cin >> X[i] >> Y[i]; }
double ans = 0.0;
ll size = 1e7;
rep(i, size) {
auto uc = cos(2 * pi / size * i), us = sin(2 * pi / size * i);
double res = 0.0;
rep(k, N) {
double tmp = uc * X[k] + us * Y[k];
if (tmp > 0.0) {
res += tmp;
}
}
chmax(ans, res);
}
cout << fixed << setprecision(20) << ans << endstr;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<ll, ll> PL;
typedef vector<PL> vpl;
typedef vector<vector<PL>> vvpl;
const int INF = 1001001001;
const ll LINF = 1e17;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for (ll i = (a); i < b; i++)
#define RFOR(i, a, b) for (ll i = (a); i > b; i--)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i > -1; i--)
#define FORMAP(it, m) for (auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back
#define ALL(X) (X).begin(), (X).end()
template <typename T> T gcd(T a, T b) { return (a == 0) ? b : gcd(b % a, a); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
bool p_comp_fs(const PL p1, const PL p2) { return p1.first < p2.first; };
bool p_comp_fg(const PL p1, const PL p2) { return p1.first > p2.first; };
bool p_comp_ss(const PL p1, const PL p2) { return p1.second < p2.second; };
bool p_comp_sg(const PL p1, const PL p2) { return p1.second > p2.second; };
template <typename T> vector<T> uniquen(vector<T> vec) {
sort(ALL(vec));
vec.erase(unique(vec.begin(), vec.end()), vec.end());
return vec;
}
inline ll popcnt(ll x) { return __builtin_popcountll((unsigned long long)x); };
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// friend bool operator<(const stc& lhs, const stc& rhs){
// return std::tie(lhs.l, lhs.r) < std::tie(rhs.l, rhs.r);
// }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll N;
cin >> N;
vd X(N), Y(N);
rep(i, N) { cin >> X[i] >> Y[i]; }
double ans = 0.0;
ll size = 5 * 1e6;
rep(i, size) {
auto uc = cos(2 * pi / size * i), us = sin(2 * pi / size * i);
double res = 0.0;
rep(k, N) {
double tmp = uc * X[k] + us * Y[k];
if (tmp > 0.0) {
res += tmp;
}
}
chmax(ans, res);
}
cout << fixed << setprecision(20) << ans << endstr;
return 0;
}
| replace | 98 | 99 | 98 | 99 | TLE | |
p02926 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, b) FOR(i, 0, b)
#define RFO(i, a, b) for (int i = ((b)-1); i >= (a); i--)
#define RF0(i, b) RFO(i, 0, b)
#define fi first
#define se second
#define debug(x) cout << #x << ": " << x << '\n';
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> void Print(vector<T> v) {
F0R(i, v.size()) { cout << v[i] << ' '; }
cout << newl;
}
#if 1
template <class T> struct Vector2D {
T X, Y;
Vector2D(T x = 0, T y = 0) : X(x), Y(y) {}
constexpr T MagnitudeSqr() const { return X * X + Y * Y; }
constexpr T DistanceSqr(const Vector2D<T> &r) const {
double a = r.X - X, b = r.Y - Y;
return a * a + b * b;
}
constexpr double Distance(const Vector2D<T> &r) const {
return sqrt(DistanceSqr(r));
}
Vector2D<T> &operator+=(const Vector2D<T> &r) {
X += r.X;
Y += r.Y;
return *this;
}
friend Vector2D<T> operator+(Vector2D<T> l, const Vector2D<T> &r) {
l += r;
return l;
}
Vector2D<T> &operator-=(const Vector2D<T> &r) {
X -= r.X;
Y -= r.Y;
return *this;
}
friend Vector2D<T> operator-(Vector2D<T> l, const Vector2D<T> &r) {
l -= r;
return l;
}
template <class N> Vector2D<T> &operator*=(const N &r) {
X *= r;
Y *= r;
return *this;
}
template <class N> friend Vector2D<T> operator*(Vector2D<T> l, const N &r) {
l *= r;
return l;
}
template <class N> Vector2D<T> &operator/=(const N &r) {
X /= r;
Y /= r;
return *this;
}
template <class N> friend Vector2D<T> operator/(Vector2D<T> l, const N &r) {
l /= r;
return l;
}
T DotProduct(const Vector2D<T> &r) const { return X * r.X + Y * r.Y; }
Vector2D<T> Midpoint(const Vector2D<T> &r) const {
return Vector2D<T>((X + r.X) / 2, (Y + r.Y) / 2);
}
// これが 0 のとき2つのベクトルは平行
// （誤差を考え abs(perp) < eps という判定にした方が良い）
T PerpProduct(const Vector2D<T> &r) const { return X * r.Y - Y * r.X; }
static vector<Vector2D<T>> GetIntersectionOf2Lines(const Vector2D<T> &p1,
const Vector2D<T> &v1,
const Vector2D<T> &p2,
const Vector2D<T> &v2,
T eps = 1e-10) {
T d = v1.PerpProduct(v2);
if (Abs(d) < eps) {
// 2つの線は平行
// 重なっている場合は交点は存在することになるが、今回は省略
return {};
}
auto w = p1 - p2;
T si = v2.PerpProduct(w) / d;
return {p1 + v1 * si};
}
friend constexpr ostream &operator<<(ostream &os,
const Vector2D<T> &x) noexcept {
return os << x.X << ',' << x.Y;
}
};
using ld = long double;
// INSERT ABOVE HERE
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << std::fixed << std::setprecision(15);
int N;
cin >> N;
vector<Vector2D<ld>> vs(N);
F0R(i, N) { cin >> vs[i].X >> vs[i].Y; }
sort(rrng(vs), [](const Vector2D<ld> &l, const Vector2D<ld> &r) {
return l.MagnitudeSqr() < r.MagnitudeSqr();
});
if (N == 1) {
cout << sqrt(vs[0].MagnitudeSqr());
return 0;
}
ld result = 0;
int pc = 0;
for (i64 n = 1; n < 3e8; n *= N) {
pc++;
}
FOR(i, 1, min(N, pc) + 1) {
Vector2D<ld> v1;
bitset<100> ub(false);
vector<int> us(i);
iota(rng(us), 0);
bool keep = true;
F0R(j, i) {
ub.set(j);
v1 += vs[j];
}
while (keep) {
ld d = v1.MagnitudeSqr();
// Print(us);
// debug(v1);
// debug(d);
Vector2D<ld> v2(v1);
F0R(j, N) {
if (ub.test(j))
continue;
ld nd = (v2 + vs[j]).MagnitudeSqr();
if (d < nd) {
v2 += vs[j];
d = nd;
}
}
chmax(result, d);
RF0(j, i) {
// debug(j);
if (++us[j] <= j + N - i) {
// debug(us[j] - 1);
v1 -= vs[us[j] - 1];
ub.reset(us[j] - 1);
v1 += vs[us[j]];
ub.set(us[j]);
FOR(k, j + 1, i) {
// debug('!');
v1 -= vs[us[k] - 1];
ub.reset(us[k] - 1);
us[k] = us[k - 1] + 1;
v1 += vs[us[k]];
ub.set(us[k]);
}
break;
} else if (j == 0) {
keep = false;
}
}
}
}
cout << sqrt(result);
}
#endif
| #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, b) FOR(i, 0, b)
#define RFO(i, a, b) for (int i = ((b)-1); i >= (a); i--)
#define RF0(i, b) RFO(i, 0, b)
#define fi first
#define se second
#define debug(x) cout << #x << ": " << x << '\n';
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> void Print(vector<T> v) {
F0R(i, v.size()) { cout << v[i] << ' '; }
cout << newl;
}
#if 1
template <class T> struct Vector2D {
T X, Y;
Vector2D(T x = 0, T y = 0) : X(x), Y(y) {}
constexpr T MagnitudeSqr() const { return X * X + Y * Y; }
constexpr T DistanceSqr(const Vector2D<T> &r) const {
double a = r.X - X, b = r.Y - Y;
return a * a + b * b;
}
constexpr double Distance(const Vector2D<T> &r) const {
return sqrt(DistanceSqr(r));
}
Vector2D<T> &operator+=(const Vector2D<T> &r) {
X += r.X;
Y += r.Y;
return *this;
}
friend Vector2D<T> operator+(Vector2D<T> l, const Vector2D<T> &r) {
l += r;
return l;
}
Vector2D<T> &operator-=(const Vector2D<T> &r) {
X -= r.X;
Y -= r.Y;
return *this;
}
friend Vector2D<T> operator-(Vector2D<T> l, const Vector2D<T> &r) {
l -= r;
return l;
}
template <class N> Vector2D<T> &operator*=(const N &r) {
X *= r;
Y *= r;
return *this;
}
template <class N> friend Vector2D<T> operator*(Vector2D<T> l, const N &r) {
l *= r;
return l;
}
template <class N> Vector2D<T> &operator/=(const N &r) {
X /= r;
Y /= r;
return *this;
}
template <class N> friend Vector2D<T> operator/(Vector2D<T> l, const N &r) {
l /= r;
return l;
}
T DotProduct(const Vector2D<T> &r) const { return X * r.X + Y * r.Y; }
Vector2D<T> Midpoint(const Vector2D<T> &r) const {
return Vector2D<T>((X + r.X) / 2, (Y + r.Y) / 2);
}
// これが 0 のとき2つのベクトルは平行
// （誤差を考え abs(perp) < eps という判定にした方が良い）
T PerpProduct(const Vector2D<T> &r) const { return X * r.Y - Y * r.X; }
static vector<Vector2D<T>> GetIntersectionOf2Lines(const Vector2D<T> &p1,
const Vector2D<T> &v1,
const Vector2D<T> &p2,
const Vector2D<T> &v2,
T eps = 1e-10) {
T d = v1.PerpProduct(v2);
if (Abs(d) < eps) {
// 2つの線は平行
// 重なっている場合は交点は存在することになるが、今回は省略
return {};
}
auto w = p1 - p2;
T si = v2.PerpProduct(w) / d;
return {p1 + v1 * si};
}
friend constexpr ostream &operator<<(ostream &os,
const Vector2D<T> &x) noexcept {
return os << x.X << ',' << x.Y;
}
};
using ld = long double;
// INSERT ABOVE HERE
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << std::fixed << std::setprecision(15);
int N;
cin >> N;
vector<Vector2D<ld>> vs(N);
F0R(i, N) { cin >> vs[i].X >> vs[i].Y; }
sort(rrng(vs), [](const Vector2D<ld> &l, const Vector2D<ld> &r) {
return l.MagnitudeSqr() < r.MagnitudeSqr();
});
if (N == 1) {
cout << sqrt(vs[0].MagnitudeSqr());
return 0;
}
ld result = 0;
int pc = -1;
for (i64 n = N; n < 2e10; n *= N) {
pc++;
}
FOR(i, 1, min(N, pc) + 1) {
Vector2D<ld> v1;
bitset<100> ub(false);
vector<int> us(i);
iota(rng(us), 0);
bool keep = true;
F0R(j, i) {
ub.set(j);
v1 += vs[j];
}
while (keep) {
ld d = v1.MagnitudeSqr();
// Print(us);
// debug(v1);
// debug(d);
Vector2D<ld> v2(v1);
F0R(j, N) {
if (ub.test(j))
continue;
ld nd = (v2 + vs[j]).MagnitudeSqr();
if (d < nd) {
v2 += vs[j];
d = nd;
}
}
chmax(result, d);
RF0(j, i) {
// debug(j);
if (++us[j] <= j + N - i) {
// debug(us[j] - 1);
v1 -= vs[us[j] - 1];
ub.reset(us[j] - 1);
v1 += vs[us[j]];
ub.set(us[j]);
FOR(k, j + 1, i) {
// debug('!');
v1 -= vs[us[k] - 1];
ub.reset(us[k] - 1);
us[k] = us[k - 1] + 1;
v1 += vs[us[k]];
ub.set(us[k]);
}
break;
} else if (j == 0) {
keep = false;
}
}
}
}
cout << sqrt(result);
}
#endif
| replace | 172 | 174 | 172 | 174 | TLE | |
p02926 | C++ | Runtime Error | /* while(!cin.eof()) */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)(1e9 + 7)
#define MAXI (int)(1e18 + 100)
#define N 1000200
int fre[N];
// Driver code to test above functions
int32_t main() {
#ifndef ONLINE_JUDGE
// for getting input from inpu.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
// freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<pair<int, int>> xy(n);
for (int i = 0; i < n; i++)
cin >> xy[i].first >> xy[i].second;
sort(xy.begin(), xy.end(),
[](const pair<int, int> &l, const pair<int, int> &r) {
return atan2l(l.second, l.first) < atan2l(r.second, r.first);
});
for (int i = 0; i < n; i++)
xy.push_back(xy[i]);
int res = 0;
for (int i = 0; i < n; i++) {
int x = 0, y = 0;
for (int j = i; j < i + n; j++) {
x += xy[j].first;
y += xy[j].second;
res = max(res, x * x + y * y);
}
}
cout << fixed << setprecision(15) << sqrtl(res) << endl;
return 0;
} | /* while(!cin.eof()) */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)(1e9 + 7)
#define MAXI (int)(1e18 + 100)
#define N 1000200
int fre[N];
// Driver code to test above functions
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<pair<int, int>> xy(n);
for (int i = 0; i < n; i++)
cin >> xy[i].first >> xy[i].second;
sort(xy.begin(), xy.end(),
[](const pair<int, int> &l, const pair<int, int> &r) {
return atan2l(l.second, l.first) < atan2l(r.second, r.first);
});
for (int i = 0; i < n; i++)
xy.push_back(xy[i]);
int res = 0;
for (int i = 0; i < n; i++) {
int x = 0, y = 0;
for (int j = i; j < i + n; j++) {
x += xy[j].first;
y += xy[j].second;
res = max(res, x * x + y * y);
}
}
cout << fixed << setprecision(15) << sqrtl(res) << endl;
return 0;
} | delete | 13 | 20 | 13 | 13 | 0 | |
p02926 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mp make_pair
#ifndef ONLINE_JUDGE
#define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#define LOG(x) ((void)0)
#endif
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const double PI = 3.1415926535897932384626433832795;
const ll INF = 1LL << 62;
const ll MINF = -1LL << 62;
template <typename T> T getint() {
T val = 0;
char c;
bool neg = false;
while ((c = gc()) && !(c >= '0' && c <= '9')) {
neg |= c == '-';
}
do {
val = (val * 10) + c - '0';
} while ((c = gc()) && (c >= '0' && c <= '9'));
return val * (neg ? -1 : 1);
}
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(0, n-1)(rng)
typedef pair<ll, ll> pt;
int ccw(pt a, pt b, pt c) {
b.xx -= a.xx;
c.xx -= a.xx;
b.yy -= a.yy;
c.yy -= a.yy;
if (b.yy * c.xx < c.yy * b.xx) {
return -1;
} else if (b.yy * c.xx == c.yy * b.xx) {
return 0;
}
return 1;
}
ll sqdist(pt a, pt b) {
return (a.xx - b.xx) * (a.xx - b.xx) + (a.yy - b.yy) * (a.yy - b.yy);
}
int main() {
IO;
cout << fixed << setprecision(20);
int n;
cin >> n;
vector<pt> lst_(n);
for (int i = 0; i < n; ++i) {
cin >> lst_[i].xx >> lst_[i].yy;
}
vector<pt> lst;
for (int i = 0; i < n; ++i) {
if (lst_[i].xx == 0 && lst_[i].yy == 0)
continue;
lst.push_back(lst_[i]);
}
n = lst.size();
pt orig = {0, 0};
while (1) {
bool change = false;
for (int i = 1; i < n; ++i) {
if ((ccw(orig, lst[0], lst[i]) == 0 &&
sqdist(orig, lst[i]) < sqdist(orig, lst[0]))) {
change = true;
swap(lst[0], lst[i]);
}
}
if (!change)
break;
}
if (n == 0) {
cout << 0.0 << "\n";
} else if (n == 1) {
cout << sqrtl(sqdist(orig, lst[0])) << "\n";
return 0;
}
vector<pt> bal, jobb;
for (int i = 1; i < n; ++i) {
if (ccw(orig, lst[0], lst[i]) > 0 ||
(ccw(orig, lst[0], lst[i]) == 0 &&
(sqdist(lst[0], lst[i]) <= sqdist(orig, lst[i])))) {
jobb.push_back(lst[i]);
} else {
bal.push_back(lst[i]);
}
}
sort(bal.begin(), bal.end(), [&](pt &egyik, pt &masik) -> bool {
if (ccw(orig, egyik, masik) == 0)
return sqdist(orig, egyik) < sqdist(orig, masik);
return ccw(orig, egyik, masik) > 0;
});
sort(jobb.begin(), jobb.end(), [&](pt &egyik, pt &masik) -> bool {
if (ccw(orig, egyik, masik) == 0)
return sqdist(orig, egyik) < sqdist(orig, masik);
return ccw(orig, egyik, masik) > 0;
});
vector<pt> osz;
for (auto i : bal)
osz.push_back(i);
osz.push_back(lst[0]);
for (auto i : jobb)
osz.push_back(i);
/*cerr<<lst[0].xx<<" "<<lst[0].yy<<"\n\n";
for(auto i:osz) cerr<<i.xx<<" "<<i.yy<<"\n";
*/
vector<pt> ps;
for (auto i : osz)
ps.push_back(i);
for (auto i : osz)
ps.push_back(i);
pt best = {0, 0};
for (int i = 0; i < (int)osz.size(); ++i) {
pt szum = {0, 0};
for (int j = i; j < i + (int)osz.size(); ++j) {
szum.xx += ps[j].xx;
szum.yy += ps[j].yy;
if (sqdist(best, orig) < sqdist(szum, orig))
best = szum;
}
}
cout << sqrtl(sqdist(best, orig)) << "\n";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mp make_pair
#ifndef ONLINE_JUDGE
#define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#define LOG(x) ((void)0)
#endif
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const double PI = 3.1415926535897932384626433832795;
const ll INF = 1LL << 62;
const ll MINF = -1LL << 62;
template <typename T> T getint() {
T val = 0;
char c;
bool neg = false;
while ((c = gc()) && !(c >= '0' && c <= '9')) {
neg |= c == '-';
}
do {
val = (val * 10) + c - '0';
} while ((c = gc()) && (c >= '0' && c <= '9'));
return val * (neg ? -1 : 1);
}
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(0, n-1)(rng)
typedef pair<ll, ll> pt;
int ccw(pt a, pt b, pt c) {
b.xx -= a.xx;
c.xx -= a.xx;
b.yy -= a.yy;
c.yy -= a.yy;
if (b.yy * c.xx < c.yy * b.xx) {
return -1;
} else if (b.yy * c.xx == c.yy * b.xx) {
return 0;
}
return 1;
}
ll sqdist(pt a, pt b) {
return (a.xx - b.xx) * (a.xx - b.xx) + (a.yy - b.yy) * (a.yy - b.yy);
}
int main() {
IO;
cout << fixed << setprecision(20);
int n;
cin >> n;
vector<pt> lst_(n);
for (int i = 0; i < n; ++i) {
cin >> lst_[i].xx >> lst_[i].yy;
}
vector<pt> lst;
for (int i = 0; i < n; ++i) {
if (lst_[i].xx == 0 && lst_[i].yy == 0)
continue;
lst.push_back(lst_[i]);
}
n = lst.size();
pt orig = {0, 0};
while (1) {
bool change = false;
for (int i = 1; i < n; ++i) {
if ((ccw(orig, lst[0], lst[i]) == 0 &&
sqdist(orig, lst[i]) < sqdist(orig, lst[0]))) {
change = true;
swap(lst[0], lst[i]);
}
}
if (!change)
break;
}
if (n == 0) {
cout << 0.0 << "\n";
return 0;
} else if (n == 1) {
cout << sqrtl(sqdist(orig, lst[0])) << "\n";
return 0;
}
vector<pt> bal, jobb;
for (int i = 1; i < n; ++i) {
if (ccw(orig, lst[0], lst[i]) > 0 ||
(ccw(orig, lst[0], lst[i]) == 0 &&
(sqdist(lst[0], lst[i]) <= sqdist(orig, lst[i])))) {
jobb.push_back(lst[i]);
} else {
bal.push_back(lst[i]);
}
}
sort(bal.begin(), bal.end(), [&](pt &egyik, pt &masik) -> bool {
if (ccw(orig, egyik, masik) == 0)
return sqdist(orig, egyik) < sqdist(orig, masik);
return ccw(orig, egyik, masik) > 0;
});
sort(jobb.begin(), jobb.end(), [&](pt &egyik, pt &masik) -> bool {
if (ccw(orig, egyik, masik) == 0)
return sqdist(orig, egyik) < sqdist(orig, masik);
return ccw(orig, egyik, masik) > 0;
});
vector<pt> osz;
for (auto i : bal)
osz.push_back(i);
osz.push_back(lst[0]);
for (auto i : jobb)
osz.push_back(i);
/*cerr<<lst[0].xx<<" "<<lst[0].yy<<"\n\n";
for(auto i:osz) cerr<<i.xx<<" "<<i.yy<<"\n";
*/
vector<pt> ps;
for (auto i : osz)
ps.push_back(i);
for (auto i : osz)
ps.push_back(i);
pt best = {0, 0};
for (int i = 0; i < (int)osz.size(); ++i) {
pt szum = {0, 0};
for (int j = i; j < i + (int)osz.size(); ++j) {
szum.xx += ps[j].xx;
szum.yy += ps[j].yy;
if (sqdist(best, orig) < sqdist(szum, orig))
best = szum;
}
}
cout << sqrtl(sqdist(best, orig)) << "\n";
return 0;
}
| insert | 122 | 122 | 122 | 123 | 0 | |
p02926 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<pair<int, int>> v;
long double maxAns;
inline bool cmp(const pair<int, int> A, const pair<int, int> B) {
long long f = (1LL * A.second * B.first) - (1LL * B.second * A.first);
if (f < 0)
return true;
if (f > 0)
return false;
if (A.first == B.first)
return A.second <= B.second;
return A.first <= B.first;
}
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
int x, y;
cin >> x >> y;
v.push_back({x, y});
}
sort(v.begin(), v.end(), cmp);
for (int i = 0; i < N; i++)
v.push_back(v[i]);
for (int start = 0; start < N; start++) {
long long x = 0LL, y = 0LL;
for (int l = 1; l <= N; l++) {
x += 1LL * v[start + l - 1].first;
y += 1LL * v[start + l - 1].second;
maxAns = max(maxAns, sqrtl(1LL * x * x + y * y));
}
}
cout << fixed << setprecision(60) << maxAns << '\n';
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<pair<int, int>> v;
long double maxAns;
inline bool cmp(const pair<int, int> A, const pair<int, int> B) {
return atan2(A.second, A.first) < atan2(B.second, B.first);
}
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
int x, y;
cin >> x >> y;
v.push_back({x, y});
}
sort(v.begin(), v.end(), cmp);
for (int i = 0; i < N; i++)
v.push_back(v[i]);
for (int start = 0; start < N; start++) {
long long x = 0LL, y = 0LL;
for (int l = 1; l <= N; l++) {
x += 1LL * v[start + l - 1].first;
y += 1LL * v[start + l - 1].second;
maxAns = max(maxAns, sqrtl(1LL * x * x + y * y));
}
}
cout << fixed << setprecision(60) << maxAns << '\n';
return 0;
}
| replace | 14 | 26 | 14 | 15 | 0 | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
const double eps = 1e-9;
struct V {
double x, y;
V(double x = 0, double y = 0) : x(x), y(y) {}
V &operator+=(const V &v) {
x += v.x;
y += v.y;
return *this;
}
V operator+(const V &v) const { return V(*this) += v; }
double dot(const V &v) const { return x * v.x + y * v.y; }
double cross(const V &v) const { return x * v.y + v.x * y; }
double norm2() const { return x * x + y * y; }
double norm() const { return sqrt(norm2()); }
int ort() const { // orthant
if (abs(x) < eps && abs(y) < eps)
return 0;
if (y > 0)
return x > 0 ? 1 : 2;
else
return x < 0 ? 3 : 4;
}
bool operator<(const V &v) const {
int o = ort(), vo = v.ort();
if (o != vo)
return o < vo;
return cross(v) > 0;
}
};
istream &operator>>(istream &is, V &v) {
is >> v.x >> v.y;
return is;
}
ostream &operator<<(ostream &os, V &v) {
os << v.x << v.y;
return os;
}
int main(void) {
int n;
cin >> n;
vector<V> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double ans = 0;
rep(l, n) {
int r = l;
V now;
rep(i, n) {
now += v[r];
ans = max(ans, now.norm());
r = (r + 1) % n;
}
}
printf("%.12f", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
const double eps = 1e-9;
struct V {
double x, y;
V(double x = 0, double y = 0) : x(x), y(y) {}
V &operator+=(const V &v) {
x += v.x;
y += v.y;
return *this;
}
V operator+(const V &v) const { return V(*this) += v; }
double dot(const V &v) const { return x * v.x + y * v.y; }
double cross(const V &v) const { return x * v.y - v.x * y; }
double norm2() const { return x * x + y * y; }
double norm() const { return sqrt(norm2()); }
int ort() const { // orthant
if (abs(x) < eps && abs(y) < eps)
return 0;
if (y > 0)
return x > 0 ? 1 : 2;
else
return x < 0 ? 3 : 4;
}
bool operator<(const V &v) const {
int o = ort(), vo = v.ort();
if (o != vo)
return o < vo;
return cross(v) > 0;
}
};
istream &operator>>(istream &is, V &v) {
is >> v.x >> v.y;
return is;
}
ostream &operator<<(ostream &os, V &v) {
os << v.x << v.y;
return os;
}
int main(void) {
int n;
cin >> n;
vector<V> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double ans = 0;
rep(l, n) {
int r = l;
V now;
rep(i, n) {
now += v[r];
ans = max(ans, now.norm());
r = (r + 1) % n;
}
}
printf("%.12f", ans);
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
const int N = 105;
int n;
long long x[N], y[N];
int per[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 0; i < n; i++)
per[i] = i;
sort(per, per + n, [&](int i, int j) {
i = per[i];
j = per[j];
double alp1 = atan2(y[i], x[i]);
double alp2 = atan2(y[j], x[j]);
return alp1 < alp2;
});
long long best = 0;
for (int i = 0; i < n; i++) {
long long cur_x = 0, cur_y = 0;
for (int j = i; j < i + n; j++) {
cur_x += x[per[j % n]];
cur_y += y[per[j % n]];
best = max(best, cur_x * cur_x + cur_y * cur_y);
}
}
cout << fixed << setprecision(15) << sqrt((long double)best) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
const int N = 105;
int n;
long long x[N], y[N];
int per[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 0; i < n; i++)
per[i] = i;
sort(per, per + n, [&](int i, int j) {
double alp1 = atan2(y[i], x[i]);
double alp2 = atan2(y[j], x[j]);
return alp1 < alp2;
});
long long best = 0;
for (int i = 0; i < n; i++) {
long long cur_x = 0, cur_y = 0;
for (int j = i; j < i + n; j++) {
cur_x += x[per[j % n]];
cur_y += y[per[j % n]];
best = max(best, cur_x * cur_x + cur_y * cur_y);
}
}
cout << fixed << setprecision(15) << sqrt((long double)best) << endl;
return 0;
}
| delete | 19 | 21 | 19 | 19 | 0 | |
p02926 | C++ | Time Limit Exceeded | // For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456
// a.cpp -o a.exe in cmd
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define pb push_back
#define f first
#define s second
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int T;
T = 1;
// cin.ignore(); must be there when using getline(cin, s)
while (T--) {
ll n, i, j, k, pos;
vector<pll> v, v2;
ll a, b, x, y, ans = 0, ct, maxi;
cin >> n;
for (i = 1; i <= n; ++i) {
cin >> a >> b;
v.pb({a, b});
}
for (i = -1; i <= 1; i = i + 2) {
for (j = -1; j <= 1; j = j + 2) {
x = 0, y = 0;
v2.clear();
for (auto it : v) {
if (it.f * i >= 0 && it.s * j >= 0) {
x = x + it.f;
y = y + it.s;
} else
v2.pb({it.f, it.s});
}
while (v2.size() > 0) {
maxi = -1;
pos = -1;
for (k = 0; k < v2.size(); ++k) {
if ((x + v2[k].f) * (x + v2[k].f) + (y + v2[k].s) * (y + v2[k].s) -
(x * x + y * y) >
maxi) {
maxi = (x + v2[k].f) * (x + v2[k].f) +
(y + v2[k].s) * (y + v2[k].s) - (x * x + y * y);
pos = k;
}
}
if (maxi < 0)
break;
// cout<<v2.size()<<" "<<pos<<endl;
x = x + v2[pos].f;
y = y + v2[pos].s;
v2.erase(v2.begin() + pos);
}
// cout<<x<<"..."<<y<<endl;
ans = max(ans, x * x + y * y);
}
}
for (i = -1; i <= 1; i = i + 2) {
for (j = -1; j <= 1; j = j + 2) {
x = 0, y = 0;
v2.clear();
for (auto it : v) {
if (it.f * i >= 0 && it.s * j >= 0) {
x = x + it.f;
y = y + it.s;
} else
v2.pb({it.f, it.s});
}
while (v2.size() > 0) {
maxi = -1;
pos = -1;
for (k = 0; k < v2.size(); ++k) {
if ((x + v2[k].f) * (x + v2[k].f) + (y + v2[k].s) * (y + v2[k].s) -
(x * x + y * y) >
0) {
maxi = (x + v2[k].f) * (x + v2[k].f) +
(y + v2[k].s) * (y + v2[k].s) - (x * x + y * y);
pos = k;
break;
}
}
if (maxi < 0)
break;
// cout<<v2.size()<<" "<<pos<<endl;
x = x + v2[pos].f;
y = y + v2[pos].s;
v2.erase(v2.begin() + pos);
}
// cout<<x<<"..."<<y<<endl;
ans = max(ans, x * x + y * y);
}
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int X = 100000;
while (X--) {
for (i = -1; i <= 1; i = i + 2) {
for (j = -1; j <= 1; j = j + 2) {
x = 0, y = 0;
v2.clear();
for (auto it : v) {
if (it.f * i >= 0 && it.s * j >= 0) {
x = x + it.f;
y = y + it.s;
} else
v2.pb({it.f, it.s});
}
shuffle(v2.begin(), v2.end(), rng);
while (v2.size() > 0) {
maxi = -1;
pos = -1;
for (k = 0; k < v2.size(); ++k) {
if ((x + v2[k].f) * (x + v2[k].f) +
(y + v2[k].s) * (y + v2[k].s) - (x * x + y * y) >
0) {
maxi = (x + v2[k].f) * (x + v2[k].f) +
(y + v2[k].s) * (y + v2[k].s) - (x * x + y * y);
pos = k;
break;
}
}
if (maxi < 0)
break;
// cout<<v2.size()<<" "<<pos<<endl;
x = x + v2[pos].f;
y = y + v2[pos].s;
v2.erase(v2.begin() + pos);
}
// cout<<x<<"..."<<y<<endl;
ans = max(ans, x * x + y * y);
}
}
}
// cout<<ans<<endl;
ld l = 0.0, r = 2e8, mid;
for (i = 0; i <= 200; ++i) {
mid = (l + r) / 2;
if (mid * mid > ans)
r = mid;
else
l = mid;
}
printf("%.15Lf\n", mid);
}
return 0;
}
| // For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456
// a.cpp -o a.exe in cmd
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define pb push_back
#define f first
#define s second
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int T;
T = 1;
// cin.ignore(); must be there when using getline(cin, s)
while (T--) {
ll n, i, j, k, pos;
vector<pll> v, v2;
ll a, b, x, y, ans = 0, ct, maxi;
cin >> n;
for (i = 1; i <= n; ++i) {
cin >> a >> b;
v.pb({a, b});
}
for (i = -1; i <= 1; i = i + 2) {
for (j = -1; j <= 1; j = j + 2) {
x = 0, y = 0;
v2.clear();
for (auto it : v) {
if (it.f * i >= 0 && it.s * j >= 0) {
x = x + it.f;
y = y + it.s;
} else
v2.pb({it.f, it.s});
}
while (v2.size() > 0) {
maxi = -1;
pos = -1;
for (k = 0; k < v2.size(); ++k) {
if ((x + v2[k].f) * (x + v2[k].f) + (y + v2[k].s) * (y + v2[k].s) -
(x * x + y * y) >
maxi) {
maxi = (x + v2[k].f) * (x + v2[k].f) +
(y + v2[k].s) * (y + v2[k].s) - (x * x + y * y);
pos = k;
}
}
if (maxi < 0)
break;
// cout<<v2.size()<<" "<<pos<<endl;
x = x + v2[pos].f;
y = y + v2[pos].s;
v2.erase(v2.begin() + pos);
}
// cout<<x<<"..."<<y<<endl;
ans = max(ans, x * x + y * y);
}
}
for (i = -1; i <= 1; i = i + 2) {
for (j = -1; j <= 1; j = j + 2) {
x = 0, y = 0;
v2.clear();
for (auto it : v) {
if (it.f * i >= 0 && it.s * j >= 0) {
x = x + it.f;
y = y + it.s;
} else
v2.pb({it.f, it.s});
}
while (v2.size() > 0) {
maxi = -1;
pos = -1;
for (k = 0; k < v2.size(); ++k) {
if ((x + v2[k].f) * (x + v2[k].f) + (y + v2[k].s) * (y + v2[k].s) -
(x * x + y * y) >
0) {
maxi = (x + v2[k].f) * (x + v2[k].f) +
(y + v2[k].s) * (y + v2[k].s) - (x * x + y * y);
pos = k;
break;
}
}
if (maxi < 0)
break;
// cout<<v2.size()<<" "<<pos<<endl;
x = x + v2[pos].f;
y = y + v2[pos].s;
v2.erase(v2.begin() + pos);
}
// cout<<x<<"..."<<y<<endl;
ans = max(ans, x * x + y * y);
}
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int X = 10000;
while (X--) {
for (i = -1; i <= 1; i = i + 2) {
for (j = -1; j <= 1; j = j + 2) {
x = 0, y = 0;
v2.clear();
for (auto it : v) {
if (it.f * i >= 0 && it.s * j >= 0) {
x = x + it.f;
y = y + it.s;
} else
v2.pb({it.f, it.s});
}
shuffle(v2.begin(), v2.end(), rng);
while (v2.size() > 0) {
maxi = -1;
pos = -1;
for (k = 0; k < v2.size(); ++k) {
if ((x + v2[k].f) * (x + v2[k].f) +
(y + v2[k].s) * (y + v2[k].s) - (x * x + y * y) >
0) {
maxi = (x + v2[k].f) * (x + v2[k].f) +
(y + v2[k].s) * (y + v2[k].s) - (x * x + y * y);
pos = k;
break;
}
}
if (maxi < 0)
break;
// cout<<v2.size()<<" "<<pos<<endl;
x = x + v2[pos].f;
y = y + v2[pos].s;
v2.erase(v2.begin() + pos);
}
// cout<<x<<"..."<<y<<endl;
ans = max(ans, x * x + y * y);
}
}
}
// cout<<ans<<endl;
ld l = 0.0, r = 2e8, mid;
for (i = 0; i <= 200; ++i) {
mid = (l + r) / 2;
if (mid * mid > ans)
r = mid;
else
l = mid;
}
printf("%.15Lf\n", mid);
}
return 0;
}
| replace | 112 | 113 | 112 | 113 | TLE | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
using ll = long long;
using R = long double;
const R PI = acos(-1.0);
int main(void) {
int n;
cin >> n;
vector<ll> x(n), y(n);
rep(i, n) cin >> x[i] >> y[i];
using state = tuple<R, int>;
vector<state> ary;
rep(i, n) {
if (x[i] == 0 and y[i] == 0)
continue;
ary.push_back(state(atan2(y[i], x[i]), i));
}
const int m = ary.size();
sort(begin(ary), end(ary));
rep(i, m) {
state entry = ary[i];
get<0>(entry) += 2.0L * PI;
ary.push_back(entry);
}
ll cx = 0LL, cy = 0LL;
R ans = 0.0;
int pos = 0;
rep(is, m + 1) {
const int i = get<1>(ary[is]);
{
const R tmp = sqrt(cx * cx + cy * cy);
chmax(ans, tmp);
}
while (pos < is + m) {
const int j = get<1>(ary[pos]);
const ll dot = x[i] * x[j] + y[i] * y[j];
const ll det = x[i] * y[j] - y[i] * x[j];
if (det < 0 or (det == 0 and dot < 0))
break;
cx += x[j], cy += y[j];
const R tmp = sqrt(cx * cx + cy * cy);
chmax(ans, tmp);
pos++;
}
cx -= x[i], cy -= y[i];
}
cout.precision(20);
cout << fixed << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
using ll = long long;
using R = long double;
const R PI = acos(-1.0);
int main(void) {
int n;
cin >> n;
vector<ll> x(n), y(n);
rep(i, n) cin >> x[i] >> y[i];
using state = tuple<R, int>;
vector<state> ary;
rep(i, n) {
if (x[i] == 0 and y[i] == 0)
continue;
ary.push_back(state(atan2(y[i], x[i]), i));
}
const int m = ary.size();
sort(begin(ary), end(ary));
rep(i, m) {
state entry = ary[i];
get<0>(entry) += 2.0L * PI;
ary.push_back(entry);
}
ll cx = 0LL, cy = 0LL;
R ans = 0.0;
int pos = 0;
rep(is, m) {
const int i = get<1>(ary[is]);
{
const R tmp = sqrt(cx * cx + cy * cy);
chmax(ans, tmp);
}
while (pos < is + m) {
const int j = get<1>(ary[pos]);
const ll dot = x[i] * x[j] + y[i] * y[j];
const ll det = x[i] * y[j] - y[i] * x[j];
if (det < 0 or (det == 0 and dot < 0))
break;
cx += x[j], cy += y[j];
const R tmp = sqrt(cx * cx + cy * cy);
chmax(ans, tmp);
pos++;
}
cx -= x[i], cy -= y[i];
}
cout.precision(20);
cout << fixed << ans << endl;
return 0;
}
| replace | 61 | 62 | 61 | 62 | 0 | |
p02927 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (int j = 1; j <= D; i++) {
if (M == (D / 10) * (D % 10))
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (int j = 2; j <= D; j++) {
if ((i == (j / 10) * (j % 10)) && j / 10 >= 2 && j % 10 >= 2)
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 11 | 13 | 11 | 13 | TLE | |
p02927 | C++ | Time Limit Exceeded | // #pragma GCC optimize("O3", "unroll-loops")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define FIXED cout << fixed << setprecision(12)
#define RANDOM srand(94385)
#define all(a) a.begin(), a.end()
#define shuffle(a) \
for (int i = 0; i < sz(a); ++i) \
swap(a[i], a[rand() % sz(a)]);
#define enter putchar('\n')
#define space putchar(' ')
#define Mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
void debug_out() { cerr << '\n'; }
template <typename T, typename... R> void debug_out(const T &f, const R &...r) {
cerr << f << " ";
debug_out(r...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__);
inline ll read() {
ll x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= (ch == '-'), ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return x = f ? -x : x;
}
inline void write(ll x) {
if (x == 0) {
putchar('0');
return;
}
if (x < 0) {
putchar('-');
x = -x;
}
static char s[23];
int l = 0;
while (x != 0)
s[l++] = x % 10 + 48, x /= 10;
while (l)
putchar(s[--l]);
}
int lowbit(int x) { return x & (-x); }
template <class T> T big(const T &a1, const T &a2) { return a1 > a2 ? a1 : a2; }
template <typename T, typename... R> T big(const T &f, const R &...r) {
return big(f, big(r...));
}
template <class T> T sml(const T &a1, const T &a2) { return a1 < a2 ? a1 : a2; }
template <typename T, typename... R> T sml(const T &f, const R &...r) {
return sml(f, sml(r...));
}
template <class T, class U> inline void checkMin(T &x, U y) {
if (y < x)
x = y;
}
template <class T, class U> inline void checkMax(T &x, U y) {
if (y > x)
x = y;
}
template <class T, class U> inline bool ifMax(T &x, U y) {
if (y > x)
return x = y, true;
return false;
}
template <class T, class U> inline bool ifMin(T &x, U y) {
if (y < x)
return x = y, true;
return false;
}
const int M = 212345; // 2e5+5
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1000000007; // 1e9+7
// HAVE FREE OPEN IN MAIN FUNCTION
int m, d;
void init() {
m = read();
d = read();
int ans = 0;
for (int i = 22; i <= d; ++i) {
int x1 = i / 10, x2 = i % 10;
if (x1 < 2 || x2 < 2)
continue;
if (x1 * x2 <= m && x1 * x2 >= 1)
ans++ /*, debug(i, x1 * x2)*/;
}
printf("%d\n", ans);
}
void solve() {}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
init();
solve();
return 0;
} | // #pragma GCC optimize("O3", "unroll-loops")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define FIXED cout << fixed << setprecision(12)
#define RANDOM srand(94385)
#define all(a) a.begin(), a.end()
#define shuffle(a) \
for (int i = 0; i < sz(a); ++i) \
swap(a[i], a[rand() % sz(a)]);
#define enter putchar('\n')
#define space putchar(' ')
#define Mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
void debug_out() { cerr << '\n'; }
template <typename T, typename... R> void debug_out(const T &f, const R &...r) {
cerr << f << " ";
debug_out(r...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__);
inline ll read() {
ll x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= (ch == '-'), ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return x = f ? -x : x;
}
inline void write(ll x) {
if (x == 0) {
putchar('0');
return;
}
if (x < 0) {
putchar('-');
x = -x;
}
static char s[23];
int l = 0;
while (x != 0)
s[l++] = x % 10 + 48, x /= 10;
while (l)
putchar(s[--l]);
}
int lowbit(int x) { return x & (-x); }
template <class T> T big(const T &a1, const T &a2) { return a1 > a2 ? a1 : a2; }
template <typename T, typename... R> T big(const T &f, const R &...r) {
return big(f, big(r...));
}
template <class T> T sml(const T &a1, const T &a2) { return a1 < a2 ? a1 : a2; }
template <typename T, typename... R> T sml(const T &f, const R &...r) {
return sml(f, sml(r...));
}
template <class T, class U> inline void checkMin(T &x, U y) {
if (y < x)
x = y;
}
template <class T, class U> inline void checkMax(T &x, U y) {
if (y > x)
x = y;
}
template <class T, class U> inline bool ifMax(T &x, U y) {
if (y > x)
return x = y, true;
return false;
}
template <class T, class U> inline bool ifMin(T &x, U y) {
if (y < x)
return x = y, true;
return false;
}
const int M = 212345; // 2e5+5
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1000000007; // 1e9+7
// HAVE FREE OPEN IN MAIN FUNCTION
int m, d;
void init() {
m = read();
d = read();
int ans = 0;
for (int i = 22; i <= d; ++i) {
int x1 = i / 10, x2 = i % 10;
if (x1 < 2 || x2 < 2)
continue;
if (x1 * x2 <= m && x1 * x2 >= 1)
ans++ /*, debug(i, x1 * x2)*/;
}
printf("%d\n", ans);
}
void solve() {}
int main() {
init();
solve();
return 0;
} | delete | 121 | 125 | 121 | 121 | TLE | |
p02927 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
int main() {
ll m, d;
cin >> m >> d;
ll ans = 0;
for (ll i = 1; i <= m; ++m) {
for (ll j = 1; j <= d; ++d) {
const auto j1 = j % 10;
const auto j10 = j / 10;
if (j1 >= 2 && j10 >= 2 && j1 * j10 == i) {
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
int main() {
ll m, d;
cin >> m >> d;
ll ans = 0;
for (ll i = 1; i <= m; ++i) {
for (ll j = 1; j <= d; ++j) {
const auto j1 = j % 10;
const auto j10 = j / 10;
if (j1 >= 2 && j10 >= 2 && j1 * j10 == i) {
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| replace | 9 | 11 | 9 | 11 | TLE | |
p02927 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int M, D;
int solve();
int main() {
cin >> M >> D;
int count = 0;
int d10 = D / 10;
int d1 = D % 10;
for (int ans = 1; ans <= M; ans++) {
for (int a10 = 2; a10 < d10; a10++) {
if (ans % a10 == 0) {
if (ans / a10 < 10) {
if (ans / a10 > 1) {
// cout << ans << " " << a10 << " " << ans/a10 << endl;
count++;
}
}
}
}
if (ans % d10 == 0) {
if (ans / d10 <= d1) {
if (ans / d10 > 1) {
// cout << ans << " " << d10 << " " << ans/d10 << endl;
count++;
}
}
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int M, D;
int solve();
int main() {
cin >> M >> D;
int count = 0;
int d10 = D / 10;
int d1 = D % 10;
for (int ans = 1; ans <= M; ans++) {
for (int a10 = 2; a10 < d10; a10++) {
if (ans % a10 == 0) {
if (ans / a10 < 10) {
if (ans / a10 > 1) {
// cout << ans << " " << a10 << " " << ans/a10 << endl;
count++;
}
}
}
}
if (d10 != 0) {
if (ans % d10 == 0) {
if (ans / d10 <= d1) {
if (ans / d10 > 1) {
// cout << ans << " " << d10 << " " << ans/d10 << endl;
count++;
}
}
}
}
}
cout << count << endl;
}
| replace | 22 | 27 | 22 | 29 | 0 | |
p02927 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ff first
#define ss second
const int MAXN = 1e3 + 7;
const ll INF = 1e18 + 7;
const ll MOD = 998244353;
const ll P = 311;
const int BLOCK = 720;
int main() {
#ifdef ____FILE_defined
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int m, d;
cin >> m >> d;
int ans = 0;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= d; j++) {
int a = j % 10, b = j / 10;
if (j >= 0 && a >= 2 && b >= 2 && a * b == i) {
ans++;
}
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ff first
#define ss second
const int MAXN = 1e3 + 7;
const ll INF = 1e18 + 7;
const ll MOD = 998244353;
const ll P = 311;
const int BLOCK = 720;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int m, d;
cin >> m >> d;
int ans = 0;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= d; j++) {
int a = j % 10, b = j / 10;
if (j >= 0 && a >= 2 && b >= 2 && a * b == i) {
ans++;
}
}
}
cout << ans;
return 0;
} | delete | 16 | 21 | 16 | 16 | TLE | |
p02927 | C++ | Time Limit Exceeded | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
// const long long mod = 1000000007;
// const long long mod = 998244353;
long long c[64];
int main() {
int M, D;
scanf("%d %d", &M, &D);
int res = 0;
for (int m = 1; m <= M; m++) {
for (int d = 22; d <= D; d++) {
if (d % 10 >= 2 && (d / 10) * (d % 10) == m) {
res++;
}
}
}
printf("%d", res);
while (1)
getchar();
return 0;
} | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
// const long long mod = 1000000007;
// const long long mod = 998244353;
long long c[64];
int main() {
int M, D;
scanf("%d %d", &M, &D);
int res = 0;
for (int m = 1; m <= M; m++) {
for (int d = 22; d <= D; d++) {
if (d % 10 >= 2 && (d / 10) * (d % 10) == m) {
res++;
}
}
}
printf("%d", res);
return 0;
} | delete | 21 | 23 | 21 | 21 | TLE | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
// ループマクロ
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; 0 <= i; i--)
#define ROP(i, n) for (int i = 1; i <= n; i++)
// 入出力
#define SCOUT(x) cout << (x) << " "
#define VECCIN(x) \
for (auto &ele : (x)) \
cin >> ele
#define VECOUT(x) \
for (auto &ele : (x)) \
cout << ele << " "; \
cout << endl;
// その他
#define ALL(obj) (obj).begin(), (obj).end()
#define V vector<int>
#define VLL vector<long long>
#define S set<int>
#define PQ priority_queue<int>
#define PQG priority_queue<int, V, greater<int>>
ll func(int a) {
if (a == 1)
return 1;
return a + func(a - 1);
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
V A(N);
VECCIN(A);
ll ans = 0;
ll plus1 = func(K), plus2 = func(K - 1);
REP(i, N) {
REP(j, N) {
if (i == j)
continue;
if (A[i] > A[j])
ans += (i < j) ? plus1 : plus2;
ans %= MOD;
}
}
cout << ans % MOD << endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
// ループマクロ
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; 0 <= i; i--)
#define ROP(i, n) for (int i = 1; i <= n; i++)
// 入出力
#define SCOUT(x) cout << (x) << " "
#define VECCIN(x) \
for (auto &ele : (x)) \
cin >> ele
#define VECOUT(x) \
for (auto &ele : (x)) \
cout << ele << " "; \
cout << endl;
// その他
#define ALL(obj) (obj).begin(), (obj).end()
#define V vector<int>
#define VLL vector<long long>
#define S set<int>
#define PQ priority_queue<int>
#define PQG priority_queue<int, V, greater<int>>
ll func(int a) {
if (a == 1)
return 1;
return a + func(a - 1);
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
V A(N);
VECCIN(A);
ll ans = 0;
ll plus1 = func(K), plus2 = plus1 - K;
REP(i, N) {
REP(j, N) {
if (i == j)
continue;
if (A[i] > A[j])
ans += (i < j) ? plus1 : plus2;
ans %= MOD;
}
}
cout << ans % MOD << endl;
return 0;
}
| replace | 44 | 45 | 44 | 45 | TLE | |
p02928 | C++ | Runtime Error | #include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll b, ll p = 1e9 + 7) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = modpow(a, b / 2, p);
return (d * d) % p;
} else {
return (a % p * modpow(a, b - 1, p)) % p;
}
}
int main() {
int n;
ll k;
cin >> n >> k;
k %= mod;
if (k == 0)
k = mod;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
ll cnt = 0;
for (int j = i + 1; j < n; j++) {
if (v[i] > v[j])
cnt++;
}
ll tmp = 0;
for (int j = 0; j < n; j++) {
if (v[i] > v[j])
tmp++;
}
ll a = 2 * cnt + (k - 1) * tmp;
a %= mod;
a = a * modpow(2, -1) % mod * k % mod;
ans += a;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll b, ll p = 1e9 + 7) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = modpow(a, b / 2, p);
return (d * d) % p;
} else {
return (a % p * modpow(a, b - 1, p)) % p;
}
}
int main() {
int n;
ll k;
cin >> n >> k;
k %= mod;
if (k == 0)
k = mod;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
ll cnt = 0;
for (int j = i + 1; j < n; j++) {
if (v[i] > v[j])
cnt++;
}
ll tmp = 0;
for (int j = 0; j < n; j++) {
if (v[i] > v[j])
tmp++;
}
ll a = 2 * cnt + (k - 1) * tmp;
a %= mod;
a = a * modpow(2, mod - 2) % mod * k % mod;
ans += a;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| replace | 44 | 45 | 44 | 45 | -11 | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) \
if (ans) \
printf("Yes\n"); \
else \
printf("No\n")
#define YN(ans) \
if (ans) \
printf("YES\n"); \
else \
printf("NO\n")
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
// 入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
// 出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
// デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
long long int n, k;
in(n, k);
vector<ll> a(n);
in(a);
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j])
ans++;
}
}
ll ans2 = ans * k;
ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i] > a[j])
ans++;
}
}
for (k--; k >= 1; k--) {
ans2 += (ll)ans * k;
if (ans2 > MOD)
ans2 %= MOD;
}
out(ans2);
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) \
if (ans) \
printf("Yes\n"); \
else \
printf("No\n")
#define YN(ans) \
if (ans) \
printf("YES\n"); \
else \
printf("NO\n")
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
// 入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
// 出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
// デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
long long int n, k;
in(n, k);
vector<ll> a(n);
in(a);
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j])
ans++;
}
}
ll ans2 = ans * k;
ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i] > a[j])
ans++;
}
}
ans2 += (ll)ans * ((k * (k - 1) / 2) % MOD);
ans2 %= MOD;
out(ans2);
}
| replace | 103 | 108 | 103 | 105 | TLE | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll NUM = pow(10, 9) + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i(0); i < N; ++i) {
cin >> A[i];
}
vector<int> left(N, 0), right(N, 0);
for (int i(0); i < N; ++i) {
if (i >= 1) {
for (int j(0); j < i; ++j) {
if (A[j] < A[i])
left[i]++;
}
}
if (i <= N - 2) {
for (int j(i + 1); j < N; ++j) {
if (A[j] < A[i])
right[i]++;
}
}
}
ll ans(0);
ll sum1(0), sum2(0);
for (int i(1); i <= K; ++i) {
sum2 += i;
sum2 %= NUM;
}
sum2 %= NUM;
sum1 = sum2 - K;
sum1 %= NUM;
for (int i(0); i < N; ++i) {
ans += ((sum1 * left[i]) % NUM + (sum2 * right[i]) % NUM) % NUM;
ans %= NUM;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll NUM = pow(10, 9) + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i(0); i < N; ++i) {
cin >> A[i];
}
vector<int> left(N, 0), right(N, 0);
for (int i(0); i < N; ++i) {
if (i >= 1) {
for (int j(0); j < i; ++j) {
if (A[j] < A[i])
left[i]++;
}
}
if (i <= N - 2) {
for (int j(i + 1); j < N; ++j) {
if (A[j] < A[i])
right[i]++;
}
}
}
ll ans(0);
ll sum1, sum2;
sum1 = (K * (K - 1) / 2) % NUM;
sum2 = (sum1 + K) % NUM;
for (int i(0); i < N; ++i) {
ans += ((sum1 * left[i]) % NUM + (sum2 * right[i]) % NUM) % NUM;
ans %= NUM;
}
cout << ans << endl;
return 0;
} | replace | 28 | 36 | 28 | 31 | TLE | |
p02928 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
return res;
}
int main() {
freopen("in", "r", stdin);
freopen("out", "w", stdout);
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i], b[i] = a[i];
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; ++i)
num[i] = lower_bound(b + 1, b + n + 1, a[i]) - b - 1;
for (int i = n; i; --i) {
(ans += calc(i) * k % mod) %= mod;
(ans += k * (k - 1) / 2 % mod * num[i] % mod) %= mod;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
return res;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i], b[i] = a[i];
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; ++i)
num[i] = lower_bound(b + 1, b + n + 1, a[i]) - b - 1;
for (int i = n; i; --i) {
(ans += calc(i) * k % mod) %= mod;
(ans += k * (k - 1) / 2 % mod * num[i] % mod) %= mod;
}
cout << ans << endl;
return 0;
} | delete | 22 | 24 | 22 | 22 | 0 | |
p02928 | Python | Runtime Error | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt = 0
cnt2 = 0
for i, ai in enumerate(a):
for j in range(i, n):
if ai > a[j]:
cnt += 1
if i > 0:
for j in range(i):
if ai > a[j]:
cnt2 += 1
if k % 2 == 0:
mul = (1 + k) * (k // 2)
else:
mul = (1 + k) * (k // 2) + (k // 2 + 1)
if k > 1:
k -= 1
if k % 2 == 0:
mul2 = (1 + k) * (k // 2)
else:
mul2 = (1 + k) * (k // 2) + (k // 2 + 1)
print(((cnt * mul) + (cnt2 * mul2)) % 1000000007)
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt = 0
cnt2 = 0
for i, ai in enumerate(a):
for j in range(i, n):
if ai > a[j]:
cnt += 1
if i > 0:
for j in range(i):
if ai > a[j]:
cnt2 += 1
if k % 2 == 0:
mul = (1 + k) * (k // 2)
else:
mul = (1 + k) * (k // 2) + (k // 2 + 1)
mul2 = 0
if k > 1:
k -= 1
if k % 2 == 0:
mul2 = (1 + k) * (k // 2)
else:
mul2 = (1 + k) * (k // 2) + (k // 2 + 1)
print(((cnt * mul) + (cnt2 * mul2)) % 1000000007)
| insert | 17 | 17 | 17 | 18 | 0 | |
p02928 | C++ | Runtime Error | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_map>
#include <vector>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(), a.end())
#define ff first
#define ss second
#define pii pair<int, int>
#define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
int fun(int n) { return ((n * (n - 1)) / 2) % 1000000007; }
inline void solve() {
map<int, int> oc;
int n, k, ans = 0;
cin >> n >> k;
vi a(n), b(n), help(n, 0);
for (int &i : a)
cin >> i;
for (int i = 0; i < n; i++) {
int b = 0, f = 0;
for (int j = i + 1; j < n; j++)
if (a[i] > a[j])
b++;
for (int j = 0; j < i; j++)
if (a[i] > a[j])
f++;
ans = (ans + ((f + b) * fun(k)) + (b * k)) % 1000000007;
}
cout << ans << endl;
return;
}
signed main() {
int n = 1;
cin >> n;
while (n--)
solve();
return 0;
}
| /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_map>
#include <vector>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(), a.end())
#define ff first
#define ss second
#define pii pair<int, int>
#define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
int fun(int n) { return ((n * (n - 1)) / 2) % 1000000007; }
inline void solve() {
map<int, int> oc;
int n, k, ans = 0;
cin >> n >> k;
vi a(n), b(n), help(n, 0);
for (int &i : a)
cin >> i;
for (int i = 0; i < n; i++) {
int b = 0, f = 0;
for (int j = i + 1; j < n; j++)
if (a[i] > a[j])
b++;
for (int j = 0; j < i; j++)
if (a[i] > a[j])
f++;
ans = (ans + ((f + b) * fun(k)) + (b * k)) % 1000000007;
}
cout << ans << endl;
return;
}
signed main() {
int n = 1; // cin>>n;
while (n--)
solve();
return 0;
}
| replace | 52 | 54 | 52 | 53 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.