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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02678 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int mark[10005];
vector<int> m[10005];
int main() {
int n, md;
queue<int> q;
cin >> n >> md;
for (int i = 0; i < md; i++) {
int a, b;
cin >> a >> b;
m[a].push_back(b);
m[b].push_back(a);
}
q.push(1);
while (!q.empty()) {
int val = q.front();
q.pop();
for (int i = 0; i < m[val].size(); i++) {
int next = m[val][i];
if (mark[next] == 0) {
mark[next] = val;
q.push(next);
}
}
}
bool flg = true;
for (int i = 2; i <= n; i++) {
if (mark[i] == 0)
flg = false;
}
if (flg) {
cout << "Yes" << endl;
for (int i = 2; i <= n; i++)
cout << mark[i] << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int mark[100005];
vector<int> m[100005];
int main() {
int n, md;
queue<int> q;
cin >> n >> md;
for (int i = 0; i < md; i++) {
int a, b;
cin >> a >> b;
m[a].push_back(b);
m[b].push_back(a);
}
q.push(1);
while (!q.empty()) {
int val = q.front();
q.pop();
for (int i = 0; i < m[val].size(); i++) {
int next = m[val][i];
if (mark[next] == 0) {
mark[next] = val;
q.push(next);
}
}
}
bool flg = true;
for (int i = 2; i <= n; i++) {
if (mark[i] == 0)
flg = false;
}
if (flg) {
cout << "Yes" << endl;
for (int i = 2; i <= n; i++)
cout << mark[i] << endl;
} else {
cout << "No" << endl;
}
return 0;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
vector<long> data(N, INT_MAX);
vector<vector<long>> path(N, vector<long>(N));
long a, b;
for (int i = 0; i < M; i++) {
cin >> a >> b;
path.at(a - 1).push_back(b - 1);
path.at(b - 1).push_back(a - 1);
}
queue<long> que;
que.push(0);
long size, sub;
while (que.size() != 0) {
size = que.size();
for (int i = 0; i < size; i++) {
sub = que.front();
que.pop();
for (unsigned int j = 0; j < path.at(sub).size(); j++) {
if (data.at(path.at(sub).at(j)) == INT_MAX) {
data.at(path.at(sub).at(j)) = sub;
que.push(path.at(sub).at(j));
}
}
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; i++)
cout << data.at(i) + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
vector<long> data(N, INT_MAX);
vector<vector<long>> path(N, vector<long>());
long a, b;
for (int i = 0; i < M; i++) {
cin >> a >> b;
path.at(a - 1).push_back(b - 1);
path.at(b - 1).push_back(a - 1);
}
queue<long> que;
que.push(0);
long size, sub;
while (que.size() != 0) {
size = que.size();
for (int i = 0; i < size; i++) {
sub = que.front();
que.pop();
for (unsigned int j = 0; j < path.at(sub).size(); j++) {
if (data.at(path.at(sub).at(j)) == INT_MAX) {
data.at(path.at(sub).at(j)) = sub;
que.push(path.at(sub).at(j));
}
}
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; i++)
cout << data.at(i) + 1 << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int nodes, edges;
cin >> nodes >> edges;
vector<int> adj[nodes + 1];
vector<bool> visited(nodes + 1);
vector<int> ans(nodes + 1);
for (int i = 1; i <= edges; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
queue<int> q;
q.push(1);
ans[1] = 1;
visited[1] = true;
while (!q.empty()) {
int cur = q.front();
q.pop();
for (int next : adj[cur]) {
if (!visited[next]) {
q.push(next);
// visited[next] = true;
ans[next] = cur;
}
}
}
cout << "Yes\n";
for (int i = 2; i <= nodes; i++)
cout << ans[i] << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int nodes, edges;
cin >> nodes >> edges;
vector<int> adj[nodes + 1];
vector<bool> visited(nodes + 1);
vector<int> ans(nodes + 1);
for (int i = 1; i <= edges; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
queue<int> q;
q.push(1);
ans[1] = 1;
visited[1] = true;
while (!q.empty()) {
int cur = q.front();
q.pop();
for (int next : adj[cur]) {
if (!visited[next]) {
q.push(next);
visited[next] = true;
ans[next] = cur;
}
}
}
cout << "Yes\n";
for (int i = 2; i <= nodes; i++)
cout << ans[i] << "\n";
}
| replace | 24 | 25 | 24 | 25 | TLE | |
p02678 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
typedef vector<vector<int>> Graph;
queue<int> que;
vector<int> par; // 各ノードの親
void bfs(int s, Graph &g) {
que = queue<int>();
par = vector<int>(g.size(), -1);
que.push(s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : g[v]) {
if (par[nv] != -1) { // 訪問済み
continue;
} else {
par[nv] = v; // 親ノードを保存
que.push(nv);
}
}
}
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout.precision(20);
int n, m;
cin >> n >> m;
Graph v(m);
REP(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
bfs(0, v);
cout << "Yes" << endl;
REP(i, n - 1) { cout << par[i + 1] + 1 << endl; }
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
typedef vector<vector<int>> Graph;
queue<int> que;
vector<int> par; // 各ノードの親
void bfs(int s, Graph &g) {
que = queue<int>();
par = vector<int>(g.size(), -1);
que.push(s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : g[v]) {
if (par[nv] != -1) { // 訪問済み
continue;
} else {
par[nv] = v; // 親ノードを保存
que.push(nv);
}
}
}
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout.precision(20);
int n, m;
cin >> n >> m;
Graph v(n);
REP(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
bfs(0, v);
cout << "Yes" << endl;
REP(i, n - 1) { cout << par[i + 1] + 1 << endl; }
return 0;
} | replace | 51 | 52 | 51 | 52 | 0 | |
p02678 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define int int64_t
/* ==== declarations ====== */
// functions
void solve();
void getInput();
// global variables
int N, M;
vector<vector<int>> AL;
vector<int> D;
vector<int> ans;
const int INF = 1e9;
/* ======================== */
void getInput() {
cin >> N >> M;
AL = vector<vector<int>>(N, vector<int>());
D = vector<int>(N, INF);
ans = vector<int>(N, -1);
for (int i = 0; i < M; ++i) {
int u, v;
cin >> u >> v;
u--;
v--;
AL[u].push_back(v);
AL[v].push_back(u);
}
}
void solve() {
// auto nb = AL[0];
// print(nb);
// queue<int> que;
queue<pair<int, int>> que;
que.push({0, 0});
D[0] = 0;
// print(D);
// exit(0);
while (!que.empty()) {
auto op = que.front();
que.pop();
auto n = op.first;
auto d = op.second;
// D[n] = d;
auto nb = AL[n];
for (auto nn : nb) {
if (D[nn] <= d)
continue;
D[nn] = d + 1;
que.push({nn, d + 1});
ans[nn] = n;
}
}
// print(D);
// print(ans);
for (int i = 1; i < N; ++i) {
if (ans[i] == -1) {
cout << "No" << endl;
exit(0);
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; ++i)
cout << ans[i] + 1 << endl;
}
signed main() {
getInput();
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define int int64_t
/* ==== declarations ====== */
// functions
void solve();
void getInput();
// global variables
int N, M;
vector<vector<int>> AL;
vector<int> D;
vector<int> ans;
const int INF = 1e9;
/* ======================== */
void getInput() {
cin >> N >> M;
AL = vector<vector<int>>(N, vector<int>());
D = vector<int>(N, INF);
ans = vector<int>(N, -1);
for (int i = 0; i < M; ++i) {
int u, v;
cin >> u >> v;
u--;
v--;
AL[u].push_back(v);
AL[v].push_back(u);
}
}
void solve() {
// auto nb = AL[0];
// print(nb);
// queue<int> que;
queue<pair<int, int>> que;
que.push({0, 0});
D[0] = 0;
// print(D);
// exit(0);
while (!que.empty()) {
auto op = que.front();
que.pop();
auto n = op.first;
auto d = op.second;
// D[n] = d;
auto nb = AL[n];
for (auto nn : nb) {
if (D[nn] <= d + 1)
continue;
D[nn] = d + 1;
que.push({nn, d + 1});
ans[nn] = n;
}
}
// print(D);
// print(ans);
for (int i = 1; i < N; ++i) {
if (ans[i] == -1) {
cout << "No" << endl;
exit(0);
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; ++i)
cout << ans[i] + 1 << endl;
}
signed main() {
getInput();
solve();
return 0;
} | replace | 55 | 56 | 55 | 56 | TLE | |
p02678 | C++ | Runtime Error | // Author: pankaj_m05
// Problem: D
// Created: 17.05.2020 18:20:52
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define f_in(file) freopen(file, "r", stdin)
#define f_out(file) freopen(file, "w", stdout)
#define sz(a) int((a).size())
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(c) c.begin(), c.end()
#define tr(c, i) for (typeof(c).begin() i = c.begin(); i != c.end(); i++)
#define present(c, x) (c.find(x) != c.end()) // Set and Maps
#define cpresent(c, x) (find(allc, x) != c.end()) // Vectors
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef long long ll;
const int mod = 1e9 + 7;
const int mxN = 1e5;
int n;
vector<int> adj[mxN + 1];
bool vis[mxN];
int sign[mxN] = {0};
void bfs() {
queue<int> q;
q.push(1);
while (!q.empty()) {
int v = q.front();
q.pop();
// cout << v << " ";
if (!vis[v]) {
vis[v] = 1;
for (int u : adj[v]) {
q.push(u);
if (sign[u] == 0)
sign[u] = v;
}
}
}
}
int main(void) {
fast int m;
bool flag = 1;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
if (u == 1 || v == 1)
flag = 0;
}
if (flag) {
cout << "No" << '\n';
return 0;
}
cout << "Yes" << '\n';
bfs();
for (int i = 2; i <= n; ++i) {
cout << sign[i] << '\n';
}
return 0;
} | // Author: pankaj_m05
// Problem: D
// Created: 17.05.2020 18:20:52
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define f_in(file) freopen(file, "r", stdin)
#define f_out(file) freopen(file, "w", stdout)
#define sz(a) int((a).size())
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(c) c.begin(), c.end()
#define tr(c, i) for (typeof(c).begin() i = c.begin(); i != c.end(); i++)
#define present(c, x) (c.find(x) != c.end()) // Set and Maps
#define cpresent(c, x) (find(allc, x) != c.end()) // Vectors
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef long long ll;
const int mod = 1e9 + 7;
const int mxN = 1e5;
int n;
vector<int> adj[mxN + 1];
bool vis[mxN + 1];
int sign[mxN + 1] = {0};
void bfs() {
queue<int> q;
q.push(1);
while (!q.empty()) {
int v = q.front();
q.pop();
// cout << v << " ";
if (!vis[v]) {
vis[v] = 1;
for (int u : adj[v]) {
q.push(u);
if (sign[u] == 0)
sign[u] = v;
}
}
}
}
int main(void) {
fast int m;
bool flag = 1;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
if (u == 1 || v == 1)
flag = 0;
}
if (flag) {
cout << "No" << '\n';
return 0;
}
cout << "Yes" << '\n';
bfs();
for (int i = 2; i <= n; ++i) {
cout << sign[i] << '\n';
}
return 0;
} | replace | 31 | 33 | 31 | 33 | 0 | |
p02678 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int INF = 1001001001;
vector<int> to[10005]; // 行き先
int main(void) {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
--A;
--B; // 部屋番号を1ずらす
to[A].push_back(B);
to[B].push_back(A);
}
// スタートからの深さ探索
queue<int> q; // 調べる予約リスト
vector<int> dist(N, INF);
vector<int> pre(N, -1);
dist[0] = 0;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int u : to[v]) { // 部屋vにつながる部屋をすべて調べる
if (dist[u] != INF)
continue;
dist[u] = dist[v] + 1;
pre[u] = v;
q.push(u);
}
}
// 道しるべ記入
cout << "Yes" << endl;
for (int i = 0; i < N; i++) {
if (i == 0)
continue;
int ans = pre[i];
++ans;
cout << ans << endl;
}
} | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int INF = 1001001001;
vector<int> to[100005]; // 行き先
int main(void) {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
--A;
--B; // 部屋番号を1ずらす
to[A].push_back(B);
to[B].push_back(A);
}
// スタートからの深さ探索
queue<int> q; // 調べる予約リスト
vector<int> dist(N, INF);
vector<int> pre(N, -1);
dist[0] = 0;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int u : to[v]) { // 部屋vにつながる部屋をすべて調べる
if (dist[u] != INF)
continue;
dist[u] = dist[v] + 1;
pre[u] = v;
q.push(u);
}
}
// 道しるべ記入
cout << "Yes" << endl;
for (int i = 0; i < N; i++) {
if (i == 0)
continue;
int ans = pre[i];
++ans;
cout << ans << endl;
}
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end() // 1,2,3,...
#define rALL(obj) (obj).rbegin(), (obj).rend() //...,3,2,1
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
const double pi = acos(-1);
const int MOD = 1000000007;
const int INF = 1e18;
using Graph = vector<vector<int>>;
int n, m;
Graph G;
int seen[10010];
int path[10010];
void solve() {
// remove the bottom 3 lines when you submit this code.
std::ifstream in("sample.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
G.resize(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i, 10010) {
seen[i] = false;
path[i] = INF;
}
queue<int> que;
que.push(0);
path[0] = 0;
seen[0] = true;
while (!que.empty()) {
int now = que.front();
que.pop();
seen[now] = true;
for (auto nv : G[now]) {
if (seen[nv])
continue;
seen[nv] = true;
path[nv] = now;
que.push(nv);
}
}
bool isPossible = true;
rep(i, n) {
if (seen[i] == false)
isPossible = false;
}
if (isPossible) {
cout << "Yes" << endl;
rep(i, n - 1) cout << path[i + 1] + 1 << endl;
} else {
cout << "No" << endl;
}
}
signed main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end() // 1,2,3,...
#define rALL(obj) (obj).rbegin(), (obj).rend() //...,3,2,1
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
const double pi = acos(-1);
const int MOD = 1000000007;
const int INF = 1e18;
using Graph = vector<vector<int>>;
int n, m;
Graph G;
int seen[100100];
int path[100100];
void solve() {
// remove the bottom 3 lines when you submit this code.
std::ifstream in("sample.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
G.resize(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i, 10010) {
seen[i] = false;
path[i] = INF;
}
queue<int> que;
que.push(0);
path[0] = 0;
seen[0] = true;
while (!que.empty()) {
int now = que.front();
que.pop();
seen[now] = true;
for (auto nv : G[now]) {
if (seen[nv])
continue;
seen[nv] = true;
path[nv] = now;
que.push(nv);
}
}
bool isPossible = true;
rep(i, n) {
if (seen[i] == false)
isPossible = false;
}
if (isPossible) {
cout << "Yes" << endl;
rep(i, n - 1) cout << path[i + 1] + 1 << endl;
} else {
cout << "No" << endl;
}
}
signed main() {
solve();
return 0;
}
| replace | 18 | 20 | 18 | 20 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define M0D 998244353;
vector<int> G[100009];
int ans[100009];
queue<int> test;
void answww(int num, int sup) {
test.pop();
for (int j = 0; j < G[num].size(); j++) {
if (ans[G[num][j]] == 0) {
test.push(G[num][j]);
ans[G[num][j]] = num;
}
}
answww(test.front(), sup);
}
int main() {
int N, M, sup = 1;
cin >> N >> M;
int A[M + 1], B[M + 1];
for (int i = 0; i < N + 1; i++)
ans[i] = 0;
for (int i = 1; i <= M; i++)
cin >> A[i] >> B[i];
for (int i = 1; i <= M; i++) {
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
test.push(1);
ans[1] = 1;
answww(test.front(), sup);
cout << "Yes" << endl;
for (int i = 2; i < N + 1; i++)
cout << ans[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define M0D 998244353;
vector<int> G[100009];
int ans[100009];
queue<int> test;
void answww(int num, int sup) {
test.pop();
for (int j = 0; j < G[num].size(); j++) {
if (ans[G[num][j]] == 0) {
test.push(G[num][j]);
ans[G[num][j]] = num;
}
}
if (test.size() > 0)
answww(test.front(), sup);
}
int main() {
int N, M, sup = 1;
cin >> N >> M;
int A[M + 1], B[M + 1];
for (int i = 0; i < N + 1; i++)
ans[i] = 0;
for (int i = 1; i <= M; i++)
cin >> A[i] >> B[i];
for (int i = 1; i <= M; i++) {
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
test.push(1);
ans[1] = 1;
answww(test.front(), sup);
cout << "Yes" << endl;
for (int i = 2; i < N + 1; i++)
cout << ans[i] << endl;
return 0;
}
| replace | 15 | 16 | 15 | 17 | -11 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool vis[10005];
pair<int, int> dist[10005];
const int INF = 1e9;
void bfs(vector<vector<int>> graph) {
dist[0].first = 0;
vis[0] = true;
queue<int> q;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto u : graph[v]) {
if (!vis[u]) {
vis[u] = true;
dist[u].first = dist[v].first + 1;
dist[u].second = v + 1;
q.push(u);
}
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> cave(n, vector<int>());
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
cave[u - 1].push_back(v - 1);
cave[v - 1].push_back(u - 1);
}
bfs(cave);
// cout << "hmm";
bool possible = true;
/*for (int i = 0; i < n; ++i) {
if (!vis[i]) {
possible = false;
break;
}
}*/
if (possible) {
cout << "Yes\n";
for (int i = 1; i < n; ++i) {
cout << dist[i].second << '\n';
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
bool vis[100005];
pair<int, int> dist[100005];
const int INF = 1e9;
void bfs(vector<vector<int>> graph) {
dist[0].first = 0;
vis[0] = true;
queue<int> q;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto u : graph[v]) {
if (!vis[u]) {
vis[u] = true;
dist[u].first = dist[v].first + 1;
dist[u].second = v + 1;
q.push(u);
}
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> cave(n, vector<int>());
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
cave[u - 1].push_back(v - 1);
cave[v - 1].push_back(u - 1);
}
bfs(cave);
// cout << "hmm";
bool possible = true;
/*for (int i = 0; i < n; ++i) {
if (!vis[i]) {
possible = false;
break;
}
}*/
if (possible) {
cout << "Yes\n";
for (int i = 1; i < n; ++i) {
cout << dist[i].second << '\n';
}
}
return 0;
}
| replace | 3 | 5 | 3 | 5 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
const string YES = "Yes";
int main() {
int n, m;
cin >> n >> m;
vector<vi> g(n, vi(n));
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
g[a].pb(b);
g[b].pb(a);
}
queue<int> q;
vi dir(n, INF);
q.push(0);
dir[0] = -1;
while (!q.empty()) {
int p = q.front();
q.pop();
for (int i : g[p]) {
if (dir[i] != INF)
continue;
q.push(i);
dir[i] = p;
}
}
bool ans = true;
rep(i, n) {
if (dir[i] == INF)
ans = false;
}
if (!ans)
puts("No");
else {
puts("Yes");
rep1(i, n - 1) cout << dir[i] + 1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
const string YES = "Yes";
int main() {
int n, m;
cin >> n >> m;
vector<vi> g(n);
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
g[a].pb(b);
g[b].pb(a);
}
queue<int> q;
vi dir(n, INF);
q.push(0);
dir[0] = -1;
while (!q.empty()) {
int p = q.front();
q.pop();
for (int i : g[p]) {
if (dir[i] != INF)
continue;
q.push(i);
dir[i] = p;
}
}
bool ans = true;
rep(i, n) {
if (dir[i] == INF)
ans = false;
}
if (!ans)
puts("No");
else {
puts("Yes");
rep1(i, n - 1) cout << dir[i] + 1 << endl;
}
return 0;
}
| replace | 45 | 46 | 45 | 46 | TLE | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
// constexpr ll MOD = 998244353;
constexpr ll MOD = 1000000007;
// struct UnionFind {
// vector<ll> par;
// vector<ll> siz;
// UnionFind(ll N): par(N), siz(N,1) {
// for (ll i=0;i<N;i++) par[i] = i;
// }
// ll root(ll x) {
// if (par[x] == x) return x;
// else return par[x] = root(par[x]);
// }
// void unite(ll x, ll y) {
// ll rx = root(x);
// ll ry = root(y);
// if (rx == ry) return;
// // if (siz[rx] < siz[ry]) swap(rx,ry);
// par[rx] = ry;
// siz[ry] += siz[rx];
// }
// bool same(ll x, ll y) {
// ll rx = root(x);
// ll ry = root(y);
// return rx == ry;
// }
// ll size(ll x) {
// return siz[root(x)];
// }
// };
// vector<ll> par;
// vector<ll> siz;
// UnionFind(ll N): par(N), siz(N,1LL) {
// for (ll i=0;i<N;i++) par[i] = i;
// }
// ll root(ll x) {
// if (par[x] == x) return x;
// else return par[x] = root(par[x]);
// }
// void unite(ll x, ll y) {
// ll rx = root(x);
// ll ry = root(y);
// if (rx == ry) return;
// par[rx] = ry;
// siz[ry] += siz[rx];
// }
// bool same(ll x, ll y) {
// ll rx = root(x);
// ll ry = root(y);
// return rx == ry;
// }
// ll size(ll x) {
// return siz[root(x)];
// }
// };
int main(void) {
int N, M;
vector<int> A(100010), B(100010);
vector<set<int>> S(100010);
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> A[i] >> B[i];
for (int i = 0; i < M; i++) {
S[A[i]].insert(B[i]);
S[B[i]].insert(A[i]);
}
queue<int> Q;
vector<bool> C(100010, false);
vector<int> G(100010, 0);
Q.push(1);
C[1] = true;
bool flag = false;
while (!Q.empty()) {
int x = Q.front();
Q.pop();
for (auto itr : S[x]) {
if (!C[itr]) {
C[itr] = true;
Q.push(itr);
}
if (!G[itr])
G[itr] = x;
}
}
cout << "Yes" << endl;
for (int i = 2; i <= N; i++) {
cout << G[i] << endl;
}
return 0;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
// constexpr ll MOD = 998244353;
constexpr ll MOD = 1000000007;
// struct UnionFind {
// vector<ll> par;
// vector<ll> siz;
// UnionFind(ll N): par(N), siz(N,1) {
// for (ll i=0;i<N;i++) par[i] = i;
// }
// ll root(ll x) {
// if (par[x] == x) return x;
// else return par[x] = root(par[x]);
// }
// void unite(ll x, ll y) {
// ll rx = root(x);
// ll ry = root(y);
// if (rx == ry) return;
// // if (siz[rx] < siz[ry]) swap(rx,ry);
// par[rx] = ry;
// siz[ry] += siz[rx];
// }
// bool same(ll x, ll y) {
// ll rx = root(x);
// ll ry = root(y);
// return rx == ry;
// }
// ll size(ll x) {
// return siz[root(x)];
// }
// };
// vector<ll> par;
// vector<ll> siz;
// UnionFind(ll N): par(N), siz(N,1LL) {
// for (ll i=0;i<N;i++) par[i] = i;
// }
// ll root(ll x) {
// if (par[x] == x) return x;
// else return par[x] = root(par[x]);
// }
// void unite(ll x, ll y) {
// ll rx = root(x);
// ll ry = root(y);
// if (rx == ry) return;
// par[rx] = ry;
// siz[ry] += siz[rx];
// }
// bool same(ll x, ll y) {
// ll rx = root(x);
// ll ry = root(y);
// return rx == ry;
// }
// ll size(ll x) {
// return siz[root(x)];
// }
// };
int main(void) {
int N, M;
vector<int> A(200010), B(200010);
vector<set<int>> S(100010);
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> A[i] >> B[i];
for (int i = 0; i < M; i++) {
S[A[i]].insert(B[i]);
S[B[i]].insert(A[i]);
}
queue<int> Q;
vector<bool> C(100010, false);
vector<int> G(100010, 0);
Q.push(1);
C[1] = true;
bool flag = false;
while (!Q.empty()) {
int x = Q.front();
Q.pop();
for (auto itr : S[x]) {
if (!C[itr]) {
C[itr] = true;
Q.push(itr);
}
if (!G[itr])
G[itr] = x;
}
}
cout << "Yes" << endl;
for (int i = 2; i <= N; i++) {
cout << G[i] << endl;
}
return 0;
}
| replace | 85 | 86 | 85 | 86 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m;
vector<vector<int>> nodes;
vector<int> length;
vector<int> parents;
scanf("%d%d", &n, &m);
nodes.resize(n);
length.resize(n);
parents.resize(n);
for (int i = 0; i < n; ++i) {
length[i] = ((i == 0) ? 0 : 100000000);
}
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d%d", &a, &b);
a -= 1;
b -= 1;
nodes[a].push_back(b);
nodes[b].push_back(a);
}
parents[0] = 0;
queue<int> q;
q.push(0);
while (!q.empty()) {
int p = q.front();
q.pop();
for (auto iter = nodes[p].begin(); iter != nodes[p].end(); iter++) {
if (length[*iter] < length[p] + 1)
continue;
length[*iter] = length[p] + 1;
parents[*iter] = p;
q.push(*iter);
}
}
printf("Yes\n");
for (int i = 1; i < n; ++i) {
printf("%d\n", parents[i] + 1);
}
return 0;
} | #include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m;
vector<vector<int>> nodes;
vector<int> length;
vector<int> parents;
scanf("%d%d", &n, &m);
nodes.resize(n);
length.resize(n);
parents.resize(n);
for (int i = 0; i < n; ++i) {
length[i] = ((i == 0) ? 0 : 100000000);
}
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d%d", &a, &b);
a -= 1;
b -= 1;
nodes[a].push_back(b);
nodes[b].push_back(a);
}
parents[0] = 0;
queue<int> q;
q.push(0);
while (!q.empty()) {
int p = q.front();
q.pop();
for (auto iter = nodes[p].begin(); iter != nodes[p].end(); iter++) {
if (length[*iter] <= length[p] + 1)
continue;
length[*iter] = length[p] + 1;
parents[*iter] = p;
q.push(*iter);
}
}
printf("Yes\n");
for (int i = 1; i < n; ++i) {
printf("%d\n", parents[i] + 1);
}
return 0;
} | replace | 44 | 45 | 44 | 45 | TLE | |
p02678 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
int a, b;
vector<vector<int>> to(m, vector<int>());
rep(i, m) {
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
to[b].push_back(a);
}
// rep(i, n) cout<<to[i][0]<<endl;
bool flg[200010] = {false};
flg[0] = true;
queue<int> root;
root.push(0);
int ans[200010];
while (!root.empty()) {
int v = root.front();
// cout<<v<<endl;
root.pop();
for (int x : to[v]) {
// cout<<x<<endl;
if (flg[x])
continue;
root.push(x);
ans[x] = v;
flg[x] = true;
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++) {
cout << ans[i] + 1 << endl;
}
} | #include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
int a, b;
vector<vector<int>> to(n, vector<int>());
rep(i, m) {
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
to[b].push_back(a);
}
// rep(i, n) cout<<to[i][0]<<endl;
bool flg[200010] = {false};
flg[0] = true;
queue<int> root;
root.push(0);
int ans[200010];
while (!root.empty()) {
int v = root.front();
// cout<<v<<endl;
root.pop();
for (int x : to[v]) {
// cout<<x<<endl;
if (flg[x])
continue;
root.push(x);
ans[x] = v;
flg[x] = true;
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++) {
cout << ans[i] + 1 << endl;
}
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void bfs(vector<vector<int>> &G, vector<int> &dist, vector<int> &prev,
int start) {
dist[start] = 0;
queue<int> q;
q.push(start);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int next_v : G[v]) {
if (dist[next_v] != -1)
continue;
dist[next_v] = dist[v] + 1;
prev[next_v] = v;
q.push(next_v);
}
}
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(M);
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
A--;
B--;
G[A].push_back(B);
G[B].push_back(A);
}
vector<int> dist(N, -1), prev(N, -1);
bfs(G, dist, prev, 0);
cout << "Yes" << endl;
for (int i = 1; i < N; i++)
cout << prev[i] + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
void bfs(vector<vector<int>> &G, vector<int> &dist, vector<int> &prev,
int start) {
dist[start] = 0;
queue<int> q;
q.push(start);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int next_v : G[v]) {
if (dist[next_v] != -1)
continue;
dist[next_v] = dist[v] + 1;
prev[next_v] = v;
q.push(next_v);
}
}
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
A--;
B--;
G[A].push_back(B);
G[B].push_back(A);
}
vector<int> dist(N, -1), prev(N, -1);
bfs(G, dist, prev, 0);
cout << "Yes" << endl;
for (int i = 1; i < N; i++)
cout << prev[i] + 1 << endl;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(N, vector<int>(N));
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> ans(N);
using P = pair<int, int>;
queue<P> q;
q.push(P(0, -1));
while (!q.empty()) {
P p = q.front();
q.pop();
for (int nv : G[p.first]) {
if (ans[nv] == 0 && nv != 0) {
q.push(P(nv, p.first));
ans[nv] = p.first + 1;
}
}
}
// DUMP(ans);
for (int i = 1; i < N; ++i) {
if (ans[i] == 0) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; ++i)
cout << ans[i] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(N, vector<int>());
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> ans(N);
using P = pair<int, int>;
queue<P> q;
q.push(P(0, -1));
while (!q.empty()) {
P p = q.front();
q.pop();
for (int nv : G[p.first]) {
if (ans[nv] == 0 && nv != 0) {
q.push(P(nv, p.first));
ans[nv] = p.first + 1;
}
}
}
// DUMP(ans);
for (int i = 1; i < N; ++i) {
if (ans[i] == 0) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; ++i)
cout << ans[i] << endl;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
int main() {
long long n, m, a, b;
cin >> n >> m;
vector<vector<long long>> adj(n, vector<long long>());
while (m--) {
cin >> a >> b;
a--;
b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
vector<int> d(n, INT_MAX), vis(n, 0), p(n, -1);
queue<int> q;
q.push(0);
vis[0] = 1;
d[0] = 0;
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto u : adj[v]) {
if (!vis[u]) {
vis[u] = 1;
q.push(u);
d[u] = d[v] + 1;
p[u] = v;
}
}
}
if (count(vis.begin(), vis.end(), 0) == 0) {
cout << "Yes" << endl;
for (int v = 1; v < n; v++) {
vector<int> path;
for (int i = v; i != -1; i = p[i])
path.push_back(i);
cout << path[1] + 1 << endl;
}
}
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
int main() {
long long n, m, a, b;
cin >> n >> m;
vector<vector<long long>> adj(n, vector<long long>());
while (m--) {
cin >> a >> b;
a--;
b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
vector<int> d(n, INT_MAX), vis(n, 0), p(n, -1);
queue<int> q;
q.push(0);
vis[0] = 1;
d[0] = 0;
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto u : adj[v]) {
if (!vis[u]) {
vis[u] = 1;
q.push(u);
d[u] = d[v] + 1;
p[u] = v;
}
}
}
if (count(vis.begin(), vis.end(), 0) == 0) {
cout << "Yes" << endl;
for (int v = 1; v < n; v++)
cout << p[v] + 1 << endl;
}
else
cout << "No" << endl;
return 0;
} | replace | 44 | 51 | 44 | 46 | TLE | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 5;
struct Edge {
int to, w, next;
} edge[N];
struct node {
int id, d;
node(int x, int y) {
id = x;
d = y;
}
bool operator<(const node &a) const { return d > a.d; }
};
int head[N];
int n, m, cnt;
void addedge(int u, int v, int w) {
edge[cnt].to = v;
edge[cnt].w = w;
edge[cnt].next = head[u];
head[u] = cnt++;
}
int dis[N], pre[N];
bool done[N];
void init() {
for (int i = 0; i < N; i++) {
edge[i].next = -1;
head[i] = -1;
}
cnt = 0;
}
void dijkstra() {
int s = 1;
for (int i = 1; i <= n; i++) {
dis[i] = INF;
done[i] = false;
}
dis[s] = 0;
priority_queue<node> q;
q.push(node(s, 0));
while (!q.empty()) {
node u = q.top();
q.pop();
if (done[u.id])
continue;
done[u.id] = true;
for (int i = head[u.id]; ~i; i = edge[i].next) {
int v = edge[i].to, w = edge[i].w;
if (done[v])
continue;
if (dis[v] > u.d + w) {
dis[v] = u.d + w;
q.push(node(v, dis[v]));
pre[v] = u.id;
}
}
}
int f = 1;
for (int i = 2; i <= n; i++) {
if (dis[i] == INF) {
puts("No\n");
f = 0;
}
}
if (f == 1) {
printf("Yes\n");
for (int i = 2; i <= n; i++) {
printf("%d\n", pre[i]);
}
}
}
int main() {
scanf("%d%d", &n, &m);
init();
while (m--) {
int a, b, c;
scanf("%d%d", &a, &b);
addedge(a, b, 1);
addedge(b, a, 1);
}
dijkstra();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 5e5 + 5;
struct Edge {
int to, w, next;
} edge[N];
struct node {
int id, d;
node(int x, int y) {
id = x;
d = y;
}
bool operator<(const node &a) const { return d > a.d; }
};
int head[N];
int n, m, cnt;
void addedge(int u, int v, int w) {
edge[cnt].to = v;
edge[cnt].w = w;
edge[cnt].next = head[u];
head[u] = cnt++;
}
int dis[N], pre[N];
bool done[N];
void init() {
for (int i = 0; i < N; i++) {
edge[i].next = -1;
head[i] = -1;
}
cnt = 0;
}
void dijkstra() {
int s = 1;
for (int i = 1; i <= n; i++) {
dis[i] = INF;
done[i] = false;
}
dis[s] = 0;
priority_queue<node> q;
q.push(node(s, 0));
while (!q.empty()) {
node u = q.top();
q.pop();
if (done[u.id])
continue;
done[u.id] = true;
for (int i = head[u.id]; ~i; i = edge[i].next) {
int v = edge[i].to, w = edge[i].w;
if (done[v])
continue;
if (dis[v] > u.d + w) {
dis[v] = u.d + w;
q.push(node(v, dis[v]));
pre[v] = u.id;
}
}
}
int f = 1;
for (int i = 2; i <= n; i++) {
if (dis[i] == INF) {
puts("No\n");
f = 0;
}
}
if (f == 1) {
printf("Yes\n");
for (int i = 2; i <= n; i++) {
printf("%d\n", pre[i]);
}
}
}
int main() {
scanf("%d%d", &n, &m);
init();
while (m--) {
int a, b, c;
scanf("%d%d", &a, &b);
addedge(a, b, 1);
addedge(b, a, 1);
}
dijkstra();
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// ダイクストラ
// 負の重みの辺を含むグラフには適用できない
int N, M;
const int INF = 1000000000;
vector<int> p;
vector<vector<pair<int, int>>> G; // first : 頂点, second : 有向辺の重み
void dijkstra(int r) {
// first : スタート地点からのコスト, second : 頂点
priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>
PQ;
vector<int> color(N);
vector<int> d(N, INF);
color.at(r) = 1;
d.at(r) = 0;
PQ.push(make_pair(0, r));
while (!PQ.empty()) {
// 最短経路木に追加する候補からコスト最小の頂点 u を取り出す
pair<int, int> f = PQ.top();
PQ.pop();
int u = f.second;
color.at(u) = 2; // 最短経路木に追加
if (d.at(u) < f.first)
continue;
// u に隣接する頂点を候補に追加
for (auto cand : G.at(u)) {
int v = cand.first;
if (color.at(v) == 2)
continue;
if (d.at(u) + cand.second < d.at(v)) {
d.at(v) = d.at(u) + cand.second;
PQ.push(make_pair(d.at(v), v));
color.at(v) = 1;
p.at(v) = u + 1;
}
}
}
}
int main() {
cin >> N >> M;
G.resize(M);
p = vector<int>(N, -1);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G.at(a).push_back(make_pair(b, 1));
G.at(b).push_back(make_pair(a, 1));
}
dijkstra(0);
cout << "Yes" << endl;
for (int i = 1; i < N; i++) {
cout << p.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
// ダイクストラ
// 負の重みの辺を含むグラフには適用できない
int N, M;
const int INF = 1000000000;
vector<int> p;
vector<vector<pair<int, int>>> G; // first : 頂点, second : 有向辺の重み
void dijkstra(int r) {
// first : スタート地点からのコスト, second : 頂点
priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>
PQ;
vector<int> color(N);
vector<int> d(N, INF);
color.at(r) = 1;
d.at(r) = 0;
PQ.push(make_pair(0, r));
while (!PQ.empty()) {
// 最短経路木に追加する候補からコスト最小の頂点 u を取り出す
pair<int, int> f = PQ.top();
PQ.pop();
int u = f.second;
color.at(u) = 2; // 最短経路木に追加
if (d.at(u) < f.first)
continue;
// u に隣接する頂点を候補に追加
for (auto cand : G.at(u)) {
int v = cand.first;
if (color.at(v) == 2)
continue;
if (d.at(u) + cand.second < d.at(v)) {
d.at(v) = d.at(u) + cand.second;
PQ.push(make_pair(d.at(v), v));
color.at(v) = 1;
p.at(v) = u + 1;
}
}
}
}
int main() {
cin >> N >> M;
G.resize(N);
p = vector<int>(N, -1);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G.at(a).push_back(make_pair(b, 1));
G.at(b).push_back(make_pair(a, 1));
}
dijkstra(0);
cout << "Yes" << endl;
for (int i = 1; i < N; i++) {
cout << p.at(i) << endl;
}
} | replace | 48 | 49 | 48 | 49 | 0 | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int read() {
int ans = 0, f = 1;
char c = getchar();
while (c > '9' || c < '0') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = ans * 10 + c - '0';
c = getchar();
}
return ans * f;
}
const int N = 2e5 + 5;
int n, m, fa[N], ans[N], vis[N];
struct Edge {
int v, ne;
} e[N];
int head[N], tot;
inline void add(int u, int v);
void bfs();
int main() {
n = read();
m = read();
for (int i = 1; i <= n; ++i)
fa[i] = i;
for (int i = 1; i <= m; ++i) {
int u = read(), v = read();
add(u, v);
add(v, u);
}
bfs();
if (m < n - 1)
printf("No\n");
else {
printf("Yes\n");
for (int i = 2; i <= n; ++i)
printf("%d\n", ans[i]);
}
return 0;
}
inline void add(int u, int v) {
e[++tot] = (Edge){v, head[u]};
head[u] = tot;
}
void bfs() {
queue<int> qu;
qu.push(1);
while (!qu.empty()) {
int u = qu.front();
qu.pop();
for (int i = head[u]; i; i = e[i].ne) {
int v = e[i].v;
if (!vis[v]) {
vis[v] = 1;
ans[v] = u;
qu.push(v);
}
}
}
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int read() {
int ans = 0, f = 1;
char c = getchar();
while (c > '9' || c < '0') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = ans * 10 + c - '0';
c = getchar();
}
return ans * f;
}
const int N = 1e6 + 5;
int n, m, fa[N], ans[N], vis[N];
struct Edge {
int v, ne;
} e[N];
int head[N], tot;
inline void add(int u, int v);
void bfs();
int main() {
n = read();
m = read();
for (int i = 1; i <= n; ++i)
fa[i] = i;
for (int i = 1; i <= m; ++i) {
int u = read(), v = read();
add(u, v);
add(v, u);
}
bfs();
if (m < n - 1)
printf("No\n");
else {
printf("Yes\n");
for (int i = 2; i <= n; ++i)
printf("%d\n", ans[i]);
}
return 0;
}
inline void add(int u, int v) {
e[++tot] = (Edge){v, head[u]};
head[u] = tot;
}
void bfs() {
queue<int> qu;
qu.push(1);
while (!qu.empty()) {
int u = qu.front();
qu.pop();
for (int i = head[u]; i; i = e[i].ne) {
int v = e[i].v;
if (!vis[v]) {
vis[v] = 1;
ans[v] = u;
qu.push(v);
}
}
}
} | replace | 29 | 30 | 29 | 30 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<ll, ll> P;
const int mod = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x -= mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t % 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i < n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] + ifact[n - k];
}
};
vector<vector<int>> A(10000 + 50, vector<int>());
// void bfs(int i, int p){
// if(C[i]!=-1)return;
// rep(j,A[i].size()){
// bfs(A[i][j],i);
// }
// C[i] = p;
// }
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
A[a].push_back(b);
A[b].push_back(a);
}
vector<ll> dist(n, INF);
queue<int> q;
auto push = [&](int v, int d) {
if (dist[v] != INF)
return;
dist[v] = d;
q.push(v);
};
push(0, 0);
while (!q.empty()) {
int t = q.front();
q.pop();
rep(i, A[t].size()) { push(A[t][i], t); }
}
cout << "Yes" << endl;
rrep(i, n - 1) { cout << dist[i] + 1 << endl; }
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<ll, ll> P;
const int mod = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x -= mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t % 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i < n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] + ifact[n - k];
}
};
vector<vector<int>> A(200000, vector<int>());
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
A[a].push_back(b);
A[b].push_back(a);
}
vector<ll> dist(n, INF);
queue<int> q;
auto push = [&](int v, int d) {
if (dist[v] != INF)
return;
dist[v] = d;
q.push(v);
};
push(0, 0);
while (!q.empty()) {
int t = q.front();
q.pop();
rep(i, A[t].size()) { push(A[t][i], t); }
}
cout << "Yes" << endl;
rrep(i, n - 1) { cout << dist[i] + 1 << endl; }
return 0;
} | replace | 73 | 82 | 73 | 74 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
queue<int> U;
vector<int> dist;
vector<int> d(10101);
void dfs(const Graph &G, int v) {
U.push(v);
dist[v] = 0;
while (!U.empty()) {
int v_2 = U.front();
U.pop();
for (auto next_v : G[v_2]) {
if (dist[next_v] == -1) {
U.push(next_v);
dist[next_v] = dist[v_2] + 1;
d[next_v] = v_2 + 1;
// cout << next_v << endl; //通った場所を出力(確認用)
}
}
}
}
int main() {
int n, m;
cin >> n >> m;
Graph G(n + 1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
// 頂点 s をスタートとした探索
dist.assign(n + 1, -1); // 全頂点を「未訪問」に初期化
dfs(G, 0);
// t に辿り着けるかどうか
for (int i = 1; i < n; i++) {
if (dist[i] == -1) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
rep(i, n - 1) { cout << d[i + 1] << endl; }
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
queue<int> U;
vector<int> dist;
vector<int> d(101010);
void dfs(const Graph &G, int v) {
U.push(v);
dist[v] = 0;
while (!U.empty()) {
int v_2 = U.front();
U.pop();
for (auto next_v : G[v_2]) {
if (dist[next_v] == -1) {
U.push(next_v);
dist[next_v] = dist[v_2] + 1;
d[next_v] = v_2 + 1;
// cout << next_v << endl; //通った場所を出力(確認用)
}
}
}
}
int main() {
int n, m;
cin >> n >> m;
Graph G(n + 1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
// 頂点 s をスタートとした探索
dist.assign(n + 1, -1); // 全頂点を「未訪問」に初期化
dfs(G, 0);
// t に辿り着けるかどうか
for (int i = 1; i < n; i++) {
if (dist[i] == -1) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
rep(i, n - 1) { cout << d[i + 1] << endl; }
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02678 | C++ | Runtime Error | // main.cpp
// ABC168D
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int INF = 1001001001;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> r[m + 1];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
r[a].push_back(b);
r[b].push_back(a);
}
queue<int> q;
vector<int> dist(n + 1, INF); // 入り口からの距離
dist.at(1) = 0; // 入り口の洞窟
q.push(1);
vector<int> pre(n + 1, -1); // 直前の洞窟番号
while (!q.empty()) {
int v = q.front(); // 先頭の洞窟番号
q.pop();
for (int u : r[v]) {
if (dist[u] == INF) {
dist[u] = dist[v] + 1;
pre[u] = v;
q.push(u);
}
}
}
cout << "Yes" << endl;
for (int i = 2; i <= n; i++) {
cout << pre.at(i) << endl;
}
return 0;
}
| // main.cpp
// ABC168D
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int INF = 1001001001;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> r[100005];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
r[a].push_back(b);
r[b].push_back(a);
}
queue<int> q;
vector<int> dist(n + 1, INF); // 入り口からの距離
dist.at(1) = 0; // 入り口の洞窟
q.push(1);
vector<int> pre(n + 1, -1); // 直前の洞窟番号
while (!q.empty()) {
int v = q.front(); // 先頭の洞窟番号
q.pop();
for (int u : r[v]) {
if (dist[u] == INF) {
dist[u] = dist[v] + 1;
pre[u] = v;
q.push(u);
}
}
}
cout << "Yes" << endl;
for (int i = 2; i <= n; i++) {
cout << pre.at(i) << endl;
}
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> i_i;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((ll)(x).size())
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll INF = 1e9 + 10;
const ll mod = 998244353;
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;
}
#define print(x) cerr << #x << " is " << x << endl;
// #define print(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << "
// " << __FILE__ << endl;
int V, E;
const int MAX_V = 1000;
using DD = int;
#define INF 1e9 + 7
DD d[MAX_V];
struct edge {
int to;
DD cost;
};
vector<edge> G[MAX_V];
int pprev[MAX_V];
void add_edge(int from, int to, DD dist) {
G[from].push_back((edge){to, dist});
}
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d, d + V, INF);
fill(pprev, pprev + V, -1);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (int i = 0; i < G[v].size(); i++) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
pprev[e.to] = v;
}
}
}
}
vector<int> get_path(int t) {
vector<int> path;
for (; t != -1; t = pprev[t])
path.push_back(t);
reverse(ALL(path));
return path;
}
int main() {
cin >> V >> E;
rep(i, E) {
int a, b;
cin >> a >> b;
add_edge(a - 1, b - 1, 1);
add_edge(b - 1, a - 1, 1);
}
int s = 0;
dijkstra(s); // O(M log N)
rep(i, V) {
// cout << i << " " << d[i] << endl;
if (d[i] == INF) {
cout << "No";
return 0;
}
}
cout << "Yes" << endl;
reps(i, 1, V) { cout << pprev[i] + 1 << endl; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> i_i;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((ll)(x).size())
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll INF = 1e9 + 10;
const ll mod = 998244353;
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;
}
#define print(x) cerr << #x << " is " << x << endl;
// #define print(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << "
// " << __FILE__ << endl;
int V, E;
const int MAX_V = 200009;
using DD = int;
#define INF 1e9 + 7
DD d[MAX_V];
struct edge {
int to;
DD cost;
};
vector<edge> G[MAX_V];
int pprev[MAX_V];
void add_edge(int from, int to, DD dist) {
G[from].push_back((edge){to, dist});
}
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d, d + V, INF);
fill(pprev, pprev + V, -1);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (int i = 0; i < G[v].size(); i++) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
pprev[e.to] = v;
}
}
}
}
vector<int> get_path(int t) {
vector<int> path;
for (; t != -1; t = pprev[t])
path.push_back(t);
reverse(ALL(path));
return path;
}
int main() {
cin >> V >> E;
rep(i, E) {
int a, b;
cin >> a >> b;
add_edge(a - 1, b - 1, 1);
add_edge(b - 1, a - 1, 1);
}
int s = 0;
dijkstra(s); // O(M log N)
rep(i, V) {
// cout << i << " " << d[i] << endl;
if (d[i] == INF) {
cout << "No";
return 0;
}
}
cout << "Yes" << endl;
reps(i, 1, V) { cout << pprev[i] + 1 << endl; }
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int V, d[200001], r[200001], z[200001];
vector<int> G[200001];
int bfs(int s) {
rep(i, V + 1) d[i] = 0, r[i] = 0;
queue<int> que;
que.push(s);
r[s] = 1;
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : G[v]) {
if (r[nv])
continue;
r[nv]++;
z[nv] = v;
d[nv] = d[v] + 1;
que.push(nv);
}
}
};
int main() {
int n, m, a, b;
cin >> n >> m;
rep(i, m) cin >> a >> b, G[a].push_back(b), G[b].push_back(a);
bfs(1);
cout << "Yes\n";
rep(i, n - 1) cout << z[i + 2] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int V, d[200001], r[200001], z[200001];
vector<int> G[200001];
void bfs(int s) {
rep(i, V + 1) d[i] = 0, r[i] = 0;
queue<int> que;
que.push(s);
r[s] = 1;
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : G[v]) {
if (r[nv])
continue;
r[nv]++;
z[nv] = v;
d[nv] = d[v] + 1;
que.push(nv);
}
}
};
int main() {
int n, m, a, b;
cin >> n >> m;
rep(i, m) cin >> a >> b, G[a].push_back(b), G[b].push_back(a);
bfs(1);
cout << "Yes\n";
rep(i, n - 1) cout << z[i + 2] << "\n";
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
int main() {
ll N, M, count, m;
cin >> N >> M;
vector<ll> A(M), B(M), X(N, -1), v;
vector<vector<ll>> Y(N);
rep(i, M) { cin >> A[i] >> B[i]; }
rep(i, N) {
rep(j, M) {
if (A[j] == i + 1)
Y[i].push_back(j);
if (B[j] == i + 1)
Y[i].push_back(j);
}
}
v.push_back(1); // 出口まで近い部屋から順に入れていく箱
X[0] = 0;
count = 1; // vがいくつ埋まったか
rep(s, N) {
if (count == N)
break;
rep(i, Y[v[s] - 1].size()) {
if (count == N)
break;
m = Y[v[s] - 1][i];
if (A[m] == v[s]) {
if (X[B[m] - 1] == -1) {
v.push_back(B[m]);
X[B[m] - 1] = v[s];
count++;
}
} else if (B[m] == v[s]) {
if (X[A[m] - 1] == -1) {
v.push_back(A[m]);
X[A[m] - 1] = v[s];
count++;
}
}
}
}
cout << "Yes" << endl;
for (ll i = 1; i < N; i++) {
cout << X[i] << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
int main() {
ll N, M, count, m;
cin >> N >> M;
vector<ll> A(M), B(M), X(N, -1), v;
vector<vector<ll>> Y(N);
rep(i, M) { cin >> A[i] >> B[i]; }
rep(i, M) {
Y[A[i] - 1].push_back(i);
Y[B[i] - 1].push_back(i);
}
v.push_back(1); // 出口まで近い部屋から順に入れていく箱
X[0] = 0;
count = 1; // vがいくつ埋まったか
rep(s, N) {
if (count == N)
break;
rep(i, Y[v[s] - 1].size()) {
if (count == N)
break;
m = Y[v[s] - 1][i];
if (A[m] == v[s]) {
if (X[B[m] - 1] == -1) {
v.push_back(B[m]);
X[B[m] - 1] = v[s];
count++;
}
} else if (B[m] == v[s]) {
if (X[A[m] - 1] == -1) {
v.push_back(A[m]);
X[A[m] - 1] = v[s];
count++;
}
}
}
}
cout << "Yes" << endl;
for (ll i = 1; i < N; i++) {
cout << X[i] << endl;
}
return 0;
}
| replace | 21 | 28 | 21 | 24 | TLE | |
p02678 | C++ | Runtime Error | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) \
int a; \
cin >> a;
#define readb(a, b) \
int a, b; \
cin >> a >> b;
#define readc(a, b, c) \
int a, b, c; \
cin >> a >> b >> c;
#define readarr(a, n) \
int a[(n) + 1] = {}; \
FOR(i, 1, (n)) { cin >> a[i]; }
#define readmat(a, n, m) \
int a[n + 1][m + 1] = {}; \
FOR(i, 1, n) { FOR(j, 1, m) cin >> a[i][j]; }
#define print(a) cout << a << endl;
#define printarr(a, n) \
FOR(i, 1, n) cout << a[i] << " "; \
cout << endl;
#define printv(v) \
for (int i : v) \
cout << i << " "; \
cout << endl;
#define printmat(a, n, m) \
FOR(i, 1, n) { \
FOR(j, 1, m) cout << a[i][j] << " "; \
cout << endl; \
}
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define ld long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define vvi vector<vi>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
vi adj[N];
int vis[N];
void input() {
cin >> n >> m;
// REMEMBER: update N
FOR(i, 1, m) {
readb(x, y);
adj[x].pb(y);
adj[y].pb(x);
}
}
void bfs() {
queue<int> q;
vector<bool> used(n);
vector<int> p(n);
int s = 1;
q.push(s);
used[s] = true;
p[s] = -1;
while (!q.empty()) {
int v = q.front();
q.pop();
for (int u : adj[v]) {
if (!used[u]) {
used[u] = true;
q.push(u);
p[u] = v;
}
}
}
cout << "Yes\n";
FOR(i, 2, n) cout << p[i] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
input();
bfs();
}
| #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) \
int a; \
cin >> a;
#define readb(a, b) \
int a, b; \
cin >> a >> b;
#define readc(a, b, c) \
int a, b, c; \
cin >> a >> b >> c;
#define readarr(a, n) \
int a[(n) + 1] = {}; \
FOR(i, 1, (n)) { cin >> a[i]; }
#define readmat(a, n, m) \
int a[n + 1][m + 1] = {}; \
FOR(i, 1, n) { FOR(j, 1, m) cin >> a[i][j]; }
#define print(a) cout << a << endl;
#define printarr(a, n) \
FOR(i, 1, n) cout << a[i] << " "; \
cout << endl;
#define printv(v) \
for (int i : v) \
cout << i << " "; \
cout << endl;
#define printmat(a, n, m) \
FOR(i, 1, n) { \
FOR(j, 1, m) cout << a[i][j] << " "; \
cout << endl; \
}
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define ld long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define vvi vector<vi>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
vi adj[N];
int vis[N];
void input() {
cin >> n >> m;
// REMEMBER: update N
FOR(i, 1, m) {
readb(x, y);
adj[x].pb(y);
adj[y].pb(x);
}
}
void bfs() {
queue<int> q;
vector<bool> used(n + 1);
vector<int> p(n + 1);
int s = 1;
q.push(s);
used[s] = true;
p[s] = -1;
while (!q.empty()) {
int v = q.front();
q.pop();
for (int u : adj[v]) {
if (!used[u]) {
used[u] = true;
q.push(u);
p[u] = v;
}
}
}
cout << "Yes\n";
FOR(i, 2, n) cout << p[i] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
input();
bfs();
}
| replace | 70 | 72 | 70 | 72 | 0 | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <bitset>
#include <complex>
#include <cstdio>
#include <list>
//< in.txt > out.txt
using namespace std;
// std::ios::sync_with_stdio(false);
// std::cin.tie(0);
const long long MOD = 998244353;
const long long INF = 1e18;
typedef long long LL;
typedef long double LD;
typedef pair<LL, LL> PLL;
typedef pair<LD, LL> pdl;
typedef pair<LD, LD> pdd;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned long long ULL;
// typedef boost::multiprecision::cpp_int bigint;
template <class T> struct Gedge {
LL src, to;
T cost;
Gedge(LL s, LL t, T c) : src(s), to(t), cost(c) {}
Gedge(LL t, T c) : src(-1), to(t), cost(c) {}
};
template <class T> using WeightedGraph = vector<vector<Gedge<T>>>;
using UnweightedGraph = vector<vector<LL>>;
template <class T> using Gedges = vector<Gedge<T>>;
struct TNode {
LL parent;
VLL childs;
TNode() : parent(-1){};
};
using Tree = vector<TNode>;
// 到達不可能->INF
template <class T>
void dijkstra(WeightedGraph<T> &G, LL start, vector<T> &res) {
res.resize(G.size(), INF);
res[start] = 0;
typedef pair<T, LL> P;
priority_queue<P, vector<P>, greater<P>> q;
q.push(P(0, start));
while (!q.empty()) {
LL cur = q.top().second;
T cost = q.top().first;
q.pop();
if (res[cur] < cost)
continue;
for (Gedge<T> e : G[cur]) {
if (res[e.to] > cost + e.cost) {
res[e.to] = cost + e.cost;
q.push(P(res[e.to], e.to));
}
}
}
return;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
LL N, M;
cin >> N >> M;
WeightedGraph<LL> G(N);
for (LL n = 0; n < N; n++) {
LL a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back({a, b, 1});
G[b].push_back({b, a, 1});
}
VLL res;
dijkstra(G, 0, res);
VLL path(N, -1);
bool flag = false;
for (LL n = 1; n < N; n++) {
LL d = res[n];
if (d == INF) {
flag = true;
break;
}
for (auto edge : G[n]) {
if (res[edge.to] == d - 1) {
path[n] = edge.to;
break;
}
}
}
if (flag)
cout << "No\n";
else {
cout << "Yes\n";
for (LL n = 1; n < N; n++) {
cout << path[n] + 1 << "\n";
}
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <bitset>
#include <complex>
#include <cstdio>
#include <list>
//< in.txt > out.txt
using namespace std;
// std::ios::sync_with_stdio(false);
// std::cin.tie(0);
const long long MOD = 998244353;
const long long INF = 1e18;
typedef long long LL;
typedef long double LD;
typedef pair<LL, LL> PLL;
typedef pair<LD, LL> pdl;
typedef pair<LD, LD> pdd;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned long long ULL;
// typedef boost::multiprecision::cpp_int bigint;
template <class T> struct Gedge {
LL src, to;
T cost;
Gedge(LL s, LL t, T c) : src(s), to(t), cost(c) {}
Gedge(LL t, T c) : src(-1), to(t), cost(c) {}
};
template <class T> using WeightedGraph = vector<vector<Gedge<T>>>;
using UnweightedGraph = vector<vector<LL>>;
template <class T> using Gedges = vector<Gedge<T>>;
struct TNode {
LL parent;
VLL childs;
TNode() : parent(-1){};
};
using Tree = vector<TNode>;
// 到達不可能->INF
template <class T>
void dijkstra(WeightedGraph<T> &G, LL start, vector<T> &res) {
res.resize(G.size(), INF);
res[start] = 0;
typedef pair<T, LL> P;
priority_queue<P, vector<P>, greater<P>> q;
q.push(P(0, start));
while (!q.empty()) {
LL cur = q.top().second;
T cost = q.top().first;
q.pop();
if (res[cur] < cost)
continue;
for (Gedge<T> e : G[cur]) {
if (res[e.to] > cost + e.cost) {
res[e.to] = cost + e.cost;
q.push(P(res[e.to], e.to));
}
}
}
return;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
LL N, M;
cin >> N >> M;
WeightedGraph<LL> G(N);
for (LL n = 0; n < M; n++) {
LL a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back({a, b, 1});
G[b].push_back({b, a, 1});
}
VLL res;
dijkstra(G, 0, res);
VLL path(N, -1);
bool flag = false;
for (LL n = 1; n < N; n++) {
LL d = res[n];
if (d == INF) {
flag = true;
break;
}
for (auto edge : G[n]) {
if (res[edge.to] == d - 1) {
path[n] = edge.to;
break;
}
}
}
if (flag)
cout << "No\n";
else {
cout << "Yes\n";
for (LL n = 1; n < N; n++) {
cout << path[n] + 1 << "\n";
}
}
return 0;
} | replace | 85 | 86 | 85 | 86 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T> using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acosl(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
Graph<int> G(N);
for (int i = 0; i < N; ++i) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> dist(N, 1e9);
vector<int> ans(N, -1);
queue<int> que;
dist[0] = 0;
que.push(0);
ans[0] = 0;
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv] < 1e9)
continue;
dist[nv] = dist[v] + 1;
ans[nv] = v;
que.push(nv);
}
}
bool flag = true;
for (int i = 0; i < N; ++i) {
if (ans[i] == -1) {
flag = false;
break;
}
}
if (!flag)
cout << "No" << '\n';
else {
cout << "Yes" << '\n';
for (int i = 1; i < N; ++i)
cout << ans[i] + 1 << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T> using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acosl(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
Graph<int> G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> dist(N, 1e9);
vector<int> ans(N, -1);
queue<int> que;
dist[0] = 0;
que.push(0);
ans[0] = 0;
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv] < 1e9)
continue;
dist[nv] = dist[v] + 1;
ans[nv] = v;
que.push(nv);
}
}
bool flag = true;
for (int i = 0; i < N; ++i) {
if (ans[i] == -1) {
flag = false;
break;
}
}
if (!flag)
cout << "No" << '\n';
else {
cout << "Yes" << '\n';
for (int i = 1; i < N; ++i)
cout << ans[i] + 1 << '\n';
}
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p02678 | C++ | Time Limit Exceeded | #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;
using vvll = vector<vector<ll>>;
using vll = vector<ll>;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
const ll maxs = 1e6 + 5;
const ll lmaxs = 20;
ll mod = 1e9 + 7;
ll oo = 1e15;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define I insert
#define endl '\n'
using vvll = vector<vector<ll>>;
using vll = vector<ll>;
#define pbds \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define fastio() \
; \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll fast(ll x, ll y) {
ll res = 1;
while (y) {
if (y & 1) {
res = res * x % mod;
}
x = x * x % mod;
y >>= 1;
}
return res;
}
ll inv(ll n) { return fast(n, mod - 2); }
void pre() {}
ll p[maxs];
ll r[maxs];
ll fn(ll x) {
if (p[x] == x) {
return x;
}
return p[x] = fn(p[x]);
}
bool add(ll x, ll y) {
x = fn(x);
y = fn(y);
if (x == y)
return false;
if (r[x] < r[y])
swap(x, y);
p[y] = x;
if (r[x] == r[y])
r[x]++;
return true;
}
vector<ll> g[maxs];
void solve() {
ll n, m;
cin >> n >> m;
for (ll i = 1; i < n + 1; i++) {
p[i] = i;
}
while (m--) {
ll s, d;
cin >> s >> d;
add(s, d);
g[s].pb(d);
g[d].pb(s);
}
set<ll> SET;
for (ll i = 1; i < n + 1; i++) {
SET.I(fn(i));
}
if (SET.size() > 1) {
cout << "No";
return;
}
vll ans(n + 1, -1);
vll vis(n + 1, 0);
queue<ll> q;
q.push(1);
while (q.size()) {
ll s = q.front();
q.pop();
vis[s] = 1;
for (auto d : g[s]) {
if (!vis[d]) {
if (ans[d] == -1)
ans[d] = s;
q.push(d);
}
}
}
cout << "Yes\n";
for (ll i = 2; i <= n; i++) {
cout << ans[i] << endl;
}
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input00.txt","r",stdin);
// #endif
IOS;
pre();
ll T = 1;
// cin>>T;
ll tt = 1;
while (T--) {
// cout << "Case #" << tt << ": ";
tt++;
solve();
}
return 0;
} | #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;
using vvll = vector<vector<ll>>;
using vll = vector<ll>;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
const ll maxs = 1e6 + 5;
const ll lmaxs = 20;
ll mod = 1e9 + 7;
ll oo = 1e15;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define I insert
#define endl '\n'
using vvll = vector<vector<ll>>;
using vll = vector<ll>;
#define pbds \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define fastio() \
; \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll fast(ll x, ll y) {
ll res = 1;
while (y) {
if (y & 1) {
res = res * x % mod;
}
x = x * x % mod;
y >>= 1;
}
return res;
}
ll inv(ll n) { return fast(n, mod - 2); }
void pre() {}
ll p[maxs];
ll r[maxs];
ll fn(ll x) {
if (p[x] == x) {
return x;
}
return p[x] = fn(p[x]);
}
bool add(ll x, ll y) {
x = fn(x);
y = fn(y);
if (x == y)
return false;
if (r[x] < r[y])
swap(x, y);
p[y] = x;
if (r[x] == r[y])
r[x]++;
return true;
}
vector<ll> g[maxs];
void solve() {
ll n, m;
cin >> n >> m;
for (ll i = 1; i < n + 1; i++) {
p[i] = i;
}
while (m--) {
ll s, d;
cin >> s >> d;
add(s, d);
g[s].pb(d);
g[d].pb(s);
}
set<ll> SET;
for (ll i = 1; i < n + 1; i++) {
SET.I(fn(i));
}
if (SET.size() > 1) {
cout << "No";
return;
}
vll ans(n + 1, -1);
vll vis(n + 1, 0);
queue<ll> q;
q.push(1);
while (q.size()) {
ll s = q.front();
q.pop();
vis[s] = 1;
for (auto d : g[s]) {
if (!vis[d]) {
if (ans[d] == -1)
ans[d] = s;
vis[d] = true;
q.push(d);
}
}
}
cout << "Yes\n";
for (ll i = 2; i <= n; i++) {
cout << ans[i] << endl;
}
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input00.txt","r",stdin);
// #endif
IOS;
pre();
ll T = 1;
// cin>>T;
ll tt = 1;
while (T--) {
// cout << "Case #" << tt << ": ";
tt++;
solve();
}
return 0;
} | insert | 121 | 121 | 121 | 122 | TLE | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
int N, M;
// std::vector<int> A, B;
int A, B;
std::vector<std::vector<int>> adj_list;
std::vector<int> sign;
std::queue<int> que;
int main() {
std::cin >> N >> M;
// A.assign(M, 0);
// B.assign(M, 0);
adj_list.assign(M, std::vector<int>());
sign.assign(N, -1);
for (int j = 0; j < N; j++) {
adj_list.at(j).reserve(N);
}
for (int i = 0; i < M; i++) {
std::cin >> A >> B;
--A;
--B;
adj_list.at(A).push_back(B);
adj_list.at(B).push_back(A);
}
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : adj_list.at(v)) {
if (sign.at(nv) == -1) {
sign.at(nv) = v;
que.push(nv);
}
}
}
std::cout << "Yes" << std::endl;
for (int j = 1; j < N; j++) {
std::cout << sign.at(j) + 1 << std::endl;
}
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
int N, M;
// std::vector<int> A, B;
int A, B;
std::vector<std::vector<int>> adj_list;
std::vector<int> sign;
std::queue<int> que;
int main() {
std::cin >> N >> M;
// A.assign(M, 0);
// B.assign(M, 0);
adj_list.assign(N, std::vector<int>());
sign.assign(N, -1);
for (int j = 0; j < N; j++) {
adj_list.at(j).reserve(N);
}
for (int i = 0; i < M; i++) {
std::cin >> A >> B;
--A;
--B;
adj_list.at(A).push_back(B);
adj_list.at(B).push_back(A);
}
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : adj_list.at(v)) {
if (sign.at(nv) == -1) {
sign.at(nv) = v;
que.push(nv);
}
}
}
std::cout << "Yes" << std::endl;
for (int j = 1; j < N; j++) {
std::cout << sign.at(j) + 1 << std::endl;
}
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> G[N];
REP(i, M) {
ll a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<ll> michishirube(N, -1);
queue<ll> q;
vector<bool> isVisited(N, false);
vector<bool> isAdd(N, false);
q.push(0);
isAdd[0] = true;
while (!q.empty()) {
ll p = q.front();
q.pop();
isVisited[p] = true;
REPV(it, G[p]) {
if (!isVisited[*it] || !isAdd[*it]) {
q.push(*it);
isAdd[*it] = true;
if (michishirube[*it] == -1) {
michishirube[*it] = p;
}
}
}
}
cout << "Yes" << endl;
for (ll i = 1; i < N; ++i) {
cout << michishirube[i] + 1 << endl;
}
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> G[N];
REP(i, M) {
ll a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<ll> michishirube(N, -1);
queue<ll> q;
vector<bool> isVisited(N, false);
vector<bool> isAdd(N, false);
q.push(0);
isAdd[0] = true;
while (!q.empty()) {
ll p = q.front();
q.pop();
isVisited[p] = true;
REPV(it, G[p]) {
if (!isVisited[*it] && !isAdd[*it]) {
q.push(*it);
isAdd[*it] = true;
if (michishirube[*it] == -1) {
michishirube[*it] = p;
}
}
}
}
cout << "Yes" << endl;
for (ll i = 1; i < N; ++i) {
cout << michishirube[i] + 1 << endl;
}
}
| replace | 37 | 38 | 37 | 38 | TLE | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return abs(x - y) / gcd(x, y); }
int main() {
lint n, m;
cin >> n >> m;
vector<lint> a(m, 0), b(m, 0);
for (lint i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
vector<vector<lint>> mat(m);
vector<int> check(n, -1);
for (lint i = 0; i < m; i++) {
mat[a[i] - 1].push_back(b[i] - 1);
mat[b[i] - 1].push_back(a[i] - 1);
}
queue<lint> q;
q.push(0);
while (!q.empty()) {
lint elem = q.front();
q.pop();
lint size = (int)mat[elem].size();
for (lint i = 0; i < size; i++) {
if (check[mat[elem][i]] == -1) {
check[mat[elem][i]] = elem;
q.push(mat[elem][i]);
}
}
}
for (lint i = 1; i < n; i++) {
if (check[i] == -1) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
for (lint i = 1; i < n; i++) {
cout << check[i] + 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return abs(x - y) / gcd(x, y); }
int main() {
lint n, m;
cin >> n >> m;
vector<lint> a(m, 0), b(m, 0);
for (lint i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
vector<vector<lint>> mat(n);
vector<int> check(n, -1);
for (lint i = 0; i < m; i++) {
mat[a[i] - 1].push_back(b[i] - 1);
mat[b[i] - 1].push_back(a[i] - 1);
}
queue<lint> q;
q.push(0);
while (!q.empty()) {
lint elem = q.front();
q.pop();
lint size = (int)mat[elem].size();
for (lint i = 0; i < size; i++) {
if (check[mat[elem][i]] == -1) {
check[mat[elem][i]] = elem;
q.push(mat[elem][i]);
}
}
}
for (lint i = 1; i < n; i++) {
if (check[i] == -1) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
for (lint i = 1; i < n; i++) {
cout << check[i] + 1 << endl;
}
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define I_1000000007 (1000000007)
#define I_998244353 (998244353)
#define I_INF (1 << 28)
#define L_INF (1LL << 60)
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define yesno(cond) YESNO((cond), "Yes", "No")
#define YESNO(cond, a, b) cout << ((cond) ? (a) : (b)) << "\n"
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
namespace solver {
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int N, M, parent[100010];
Graph G;
void init() {
cin >> N >> M;
G.resize(N);
int a, b;
rep(i, N) {
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
}
void bfs() {
queue<pair<int, int>> que;
que.push(make_pair(0, 0));
while (!que.empty()) {
auto pr = que.front();
que.pop();
int s = pr.first, p = pr.second;
if (parent[s] >= 0)
continue;
parent[s] = p;
for (const auto &t : G[s]) {
if (parent[t] >= 0)
continue;
else {
que.push(make_pair(t, s));
}
}
}
}
void solve() {
memset(parent, -1, sizeof parent);
bfs();
cout << "Yes"
<< "\n";
REP(i, 1, N) { cout << parent[i] + 1 << "\n"; }
}
} // namespace solver
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solver::init();
solver::solve();
return 0;
} | #include <bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define I_1000000007 (1000000007)
#define I_998244353 (998244353)
#define I_INF (1 << 28)
#define L_INF (1LL << 60)
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define yesno(cond) YESNO((cond), "Yes", "No")
#define YESNO(cond, a, b) cout << ((cond) ? (a) : (b)) << "\n"
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
namespace solver {
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int N, M, parent[100010];
Graph G;
void init() {
cin >> N >> M;
G.resize(N);
int a, b;
rep(i, M) {
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
}
void bfs() {
queue<pair<int, int>> que;
que.push(make_pair(0, 0));
while (!que.empty()) {
auto pr = que.front();
que.pop();
int s = pr.first, p = pr.second;
if (parent[s] >= 0)
continue;
parent[s] = p;
for (const auto &t : G[s]) {
if (parent[t] >= 0)
continue;
else {
que.push(make_pair(t, s));
}
}
}
}
void solve() {
memset(parent, -1, sizeof parent);
bfs();
cout << "Yes"
<< "\n";
REP(i, 1, N) { cout << parent[i] + 1 << "\n"; }
}
} // namespace solver
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solver::init();
solver::solve();
return 0;
} | replace | 45 | 46 | 45 | 46 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> v(n);
rep(i, n) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
queue<int> que;
que.push(0);
vector<int> ans(n);
ans[0] = -1;
while (!que.empty()) {
auto it = que.front();
que.pop();
for (auto i : v[it]) {
if (ans[i] == 0) {
ans[i] = it + 1;
que.push(i);
}
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++) {
cout << ans[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> v(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
queue<int> que;
que.push(0);
vector<int> ans(n);
ans[0] = -1;
while (!que.empty()) {
auto it = que.front();
que.pop();
for (auto i : v[it]) {
if (ans[i] == 0) {
ans[i] = it + 1;
que.push(i);
}
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++) {
cout << ans[i] << endl;
}
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long ll;
struct Edge {
int to, next;
} e[N];
int n, m, cnt, first[N], s[N], h, r, q[N << 2];
void add(int u, int v) {
e[++cnt] = (Edge){v, first[u]};
first[u] = cnt;
}
int main() {
cout << "Yes" << endl;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
add(u, v);
add(v, u);
}
q[h = r = 1] = 1;
while (h <= r) {
int u = q[h];
for (int i = first[u]; i; i = e[i].next) {
int v = e[i].to;
if (!s[v]) {
s[v] = u;
q[++r] = v;
}
}
h++;
}
for (int i = 2; i <= n; i++)
cout << s[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
typedef long long ll;
struct Edge {
int to, next;
} e[N];
int n, m, cnt, first[N], s[N], h, r, q[N << 2];
void add(int u, int v) {
e[++cnt] = (Edge){v, first[u]};
first[u] = cnt;
}
int main() {
cout << "Yes" << endl;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
add(u, v);
add(v, u);
}
q[h = r = 1] = 1;
while (h <= r) {
int u = q[h];
for (int i = first[u]; i; i = e[i].next) {
int v = e[i].to;
if (!s[v]) {
s[v] = u;
q[++r] = v;
}
}
h++;
}
for (int i = 2; i <= n; i++)
cout << s[i] << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02678 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, a, b;
cin >> n >> m;
vector<vector<int>> G(m + 1);
for (int i = 0; i < m; i++) {
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> ans(n + 1, -1);
queue<int> q;
q.push(1);
ans[1] = 1;
while (q.empty() != true) {
int v = q.front();
q.pop();
for (int x : G[v]) {
if (ans[x] == -1) {
q.push(x);
ans[x] = v;
}
}
}
cout << "Yes" << endl;
for (int i = 2; i < n + 1; i++)
cout << ans[i] << endl;
return 0;
} | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, a, b;
cin >> n >> m;
vector<vector<int>> G(n + 1);
for (int i = 0; i < m; i++) {
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> ans(n + 1, -1);
queue<int> q;
q.push(1);
ans[1] = 1;
while (q.empty() != true) {
int v = q.front();
q.pop();
for (int x : G[v]) {
if (ans[x] == -1) {
q.push(x);
ans[x] = v;
}
}
}
cout << "Yes" << endl;
for (int i = 2; i < n + 1; i++)
cout << ans[i] << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); ++i)
int main() {
cin.tie(nullptr);
int N, M;
std::cin >> N >> M;
std::vector<std::vector<int>> C(M);
for (int i = 0; i < M; ++i) {
int A, B;
std::cin >> A >> B;
A--;
B--;
C[A].emplace_back(B);
C[B].emplace_back(A);
}
std::vector<int> next(N, -1);
std::vector<int> flag(N, 0);
std::queue<int> q;
q.push(0);
next[0] = 0;
while (!q.empty()) {
int const index = q.front();
q.pop();
if (flag[index])
continue;
flag[index] = 1;
for (auto const n : C[index]) {
if (next[n] == -1) {
next[n] = index;
q.push(n);
}
}
}
for (auto const n : next) {
if (n == -1) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes\n";
for (int i = 1; i < N; ++i) {
std::cout << next[i] + 1 << "\n";
}
std::cout << std::flush;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); ++i)
int main() {
cin.tie(nullptr);
int N, M;
std::cin >> N >> M;
std::vector<std::vector<int>> C(N);
for (int i = 0; i < M; ++i) {
int A, B;
std::cin >> A >> B;
A--;
B--;
C[A].emplace_back(B);
C[B].emplace_back(A);
}
std::vector<int> next(N, -1);
std::vector<int> flag(N, 0);
std::queue<int> q;
q.push(0);
next[0] = 0;
while (!q.empty()) {
int const index = q.front();
q.pop();
if (flag[index])
continue;
flag[index] = 1;
for (auto const n : C[index]) {
if (next[n] == -1) {
next[n] = index;
q.push(n);
}
}
}
for (auto const n : next) {
if (n == -1) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes\n";
for (int i = 1; i < N; ++i) {
std::cout << next[i] + 1 << "\n";
}
std::cout << std::flush;
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02678 | C++ | Runtime Error | /*
@uthor: Amit Kumar
user --> CodeChef: dr_virus_ ; Codeforces,AtCoder,Hackerearth,Hakerrank:
dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// #define ln mp::cpp_int;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout << "\Case #" << x << "\:"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9 + 7;
const ll inf = 1e18;
ll popcount(ll num) {
num = num - ((num >> 1) & 0x55555555);
num = (num & 0x33333333) + ((num >> 2) & 0x33333333);
return ((num + (num >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
void virus() {
ll nodes, vertices;
cin >> nodes >> vertices;
vector<ll> adj[vertices + 1];
for (auto i = 0; i < vertices; i++) {
ll scr, dest;
cin >> scr >> dest;
adj[scr].push_back(dest);
adj[dest].push_back(scr);
}
queue<ll> q;
vector<bool> visited(nodes + 1);
vector<ll> res(nodes + 1);
q.push(1);
visited[1] = true;
while (!q.empty()) {
ll val = q.front();
q.pop();
for (auto i : adj[val]) {
if (!visited[i]) {
q.push(i);
visited[i] = true;
res[i] = val;
}
}
}
cout << "Yes\n";
for (auto i = 2; i <= nodes; i++)
cout << res[i] << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
ll t = 1;
// cin>>t;
while (t--) {
auto start = high_resolution_clock::now();
virus();
auto stop = high_resolution_clock::now();
auto duration = duration_cast<seconds>(stop - start);
// cout << "Time: "<<duration.count()<<endl;
// your code goes here
}
return 0;
} | /*
@uthor: Amit Kumar
user --> CodeChef: dr_virus_ ; Codeforces,AtCoder,Hackerearth,Hakerrank:
dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// #define ln mp::cpp_int;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout << "\Case #" << x << "\:"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9 + 7;
const ll inf = 1e18;
ll popcount(ll num) {
num = num - ((num >> 1) & 0x55555555);
num = (num & 0x33333333) + ((num >> 2) & 0x33333333);
return ((num + (num >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
void virus() {
ll nodes, vertices;
cin >> nodes >> vertices;
vector<ll> adj[nodes + 1];
for (auto i = 0; i < vertices; i++) {
ll scr, dest;
cin >> scr >> dest;
adj[scr].push_back(dest);
adj[dest].push_back(scr);
}
queue<ll> q;
vector<bool> visited(nodes + 1);
vector<ll> res(nodes + 1);
q.push(1);
visited[1] = true;
while (!q.empty()) {
ll val = q.front();
q.pop();
for (auto i : adj[val]) {
if (!visited[i]) {
q.push(i);
visited[i] = true;
res[i] = val;
}
}
}
cout << "Yes\n";
for (auto i = 2; i <= nodes; i++)
cout << res[i] << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
ll t = 1;
// cin>>t;
while (t--) {
auto start = high_resolution_clock::now();
virus();
auto stop = high_resolution_clock::now();
auto duration = duration_cast<seconds>(stop - start);
// cout << "Time: "<<duration.count()<<endl;
// your code goes here
}
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> to(m);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
to[b].push_back(a);
}
const int INF = 1e9;
vector<int> dist(n, INF);
vector<int> parent(n);
queue<int> q;
q.push(0);
dist[0];
while (!q.empty()) {
int from = q.front();
q.pop();
for (int t : to[from]) {
if (dist[t] != INF)
continue;
dist[t] = dist[from] + 1;
q.push(t);
parent[t] = from;
}
}
for (int d : dist) {
if (d == INF) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++)
cout << parent[i] + 1 << 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;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> to(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
to[b].push_back(a);
}
const int INF = 1e9;
vector<int> dist(n, INF);
vector<int> parent(n);
queue<int> q;
q.push(0);
dist[0];
while (!q.empty()) {
int from = q.front();
q.pop();
for (int t : to[from]) {
if (dist[t] != INF)
continue;
dist[t] = dist[from] + 1;
q.push(t);
parent[t] = from;
}
}
for (int d : dist) {
if (d == INF) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++)
cout << parent[i] + 1 << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> to[10005];
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
to[b].push_back(a);
}
vector<int> dist(n, inf);
vector<int> pre(n);
queue<int> q;
dist.at(0) = 0;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int u : to[v]) {
if (dist.at(u) != inf)
continue;
pre.at(u) = v;
dist.at(u) = dist.at(v) + 1;
q.push(u);
}
}
cout << "Yes" << endl;
rep(i, n) {
if (i == 0)
continue;
cout << pre.at(i) + 1 << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> to[100005];
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
to[b].push_back(a);
}
vector<int> dist(n, inf);
vector<int> pre(n);
queue<int> q;
dist.at(0) = 0;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int u : to[v]) {
if (dist.at(u) != inf)
continue;
pre.at(u) = v;
dist.at(u) = dist.at(v) + 1;
q.push(u);
}
}
cout << "Yes" << endl;
rep(i, n) {
if (i == 0)
continue;
cout << pre.at(i) + 1 << endl;
}
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define per(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#define bg begin()
#define en end()
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef long double ld;
static const long long MOD = 1000000007;
static const long long LINF = (ll)(1e18 + 99);
static const int INF = 1e9 + 99;
const int MAX = 100;
vector<int> G[MAX];
int ans[MAX];
void bfs(int s) {
rep(i, 0, MAX) ans[i] = -1;
queue<int> q;
ans[s] = 0;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int v : G[u]) {
if (ans[v] == -1) {
ans[v] = u;
q.push(v);
}
}
}
}
int main(void) {
int n, m;
cin >> n >> m;
rep(i, 0, m) {
int a, b;
cin >> a >> b;
G[a].pb(b);
G[b].pb(a);
}
bfs(1);
puts("Yes");
rep(i, 2, n + 1) { printf("%d\n", ans[i]); }
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define per(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#define bg begin()
#define en end()
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef long double ld;
static const long long MOD = 1000000007;
static const long long LINF = (ll)(1e18 + 99);
static const int INF = 1e9 + 99;
const int MAX = 100005;
vector<int> G[MAX];
int ans[MAX];
void bfs(int s) {
rep(i, 0, MAX) ans[i] = -1;
queue<int> q;
ans[s] = 0;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int v : G[u]) {
if (ans[v] == -1) {
ans[v] = u;
q.push(v);
}
}
}
}
int main(void) {
int n, m;
cin >> n >> m;
rep(i, 0, m) {
int a, b;
cin >> a >> b;
G[a].pb(b);
G[b].pb(a);
}
bfs(1);
puts("Yes");
rep(i, 2, n + 1) { printf("%d\n", ans[i]); }
return 0;
}
| replace | 27 | 28 | 27 | 28 | 0 | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert> // assert
#include <cmath> // abs など
#include <functional> // greater など
#include <iostream>
#include <numeric> // accumulate など
#include <queue>
#include <set>
#include <stdexcept>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
// #define NDEBUG 1
// debug用出力 https://trap.jp/post/998/
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << H << " ";
debug_out(T...);
}
#ifdef NDEBUG
#define debug(...)
#else
#define debug(...) debug_out(__VA_ARGS__)
#endif
//////////////// //////////////// //////////////// ////////////////
///////////////////
//////////////// //////////////// //////////////// ////////////////
///////////////////
// constexpr inline ll MOD = 1'000'000'007;
constexpr int MAX_N = 20'000 + 9;
int n, m;
array<vector<int>, MAX_N> vs;
array<int, MAX_N> ans;
queue<int> mins;
int main() {
// 入出力
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
vs.at(a).push_back(b);
vs.at(b).push_back(a);
}
// bfs
ans.at(1) = 1;
mins.push(1);
while (!mins.empty()) {
int v = mins.front();
mins.pop();
for (int u : vs.at(v)) {
if (ans.at(u) != 0) {
continue;
}
ans.at(u) = v;
mins.push(u);
}
}
cout << "Yes" << endl;
REP(i, n - 1) { cout << ans.at(i + 2) << endl; }
return 0;
}
| #include <algorithm>
#include <array>
#include <cassert> // assert
#include <cmath> // abs など
#include <functional> // greater など
#include <iostream>
#include <numeric> // accumulate など
#include <queue>
#include <set>
#include <stdexcept>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
// #define NDEBUG 1
// debug用出力 https://trap.jp/post/998/
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << H << " ";
debug_out(T...);
}
#ifdef NDEBUG
#define debug(...)
#else
#define debug(...) debug_out(__VA_ARGS__)
#endif
//////////////// //////////////// //////////////// ////////////////
///////////////////
//////////////// //////////////// //////////////// ////////////////
///////////////////
// constexpr inline ll MOD = 1'000'000'007;
constexpr int MAX_N = 200'000 + 9;
int n, m;
array<vector<int>, MAX_N> vs;
array<int, MAX_N> ans;
queue<int> mins;
int main() {
// 入出力
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
vs.at(a).push_back(b);
vs.at(b).push_back(a);
}
// bfs
ans.at(1) = 1;
mins.push(1);
while (!mins.empty()) {
int v = mins.front();
mins.pop();
for (int u : vs.at(v)) {
if (ans.at(u) != 0) {
continue;
}
ans.at(u) = v;
mins.push(u);
}
}
cout << "Yes" << endl;
REP(i, n - 1) { cout << ans.at(i + 2) << endl; }
return 0;
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> Map(N);
vector<int> Ans(N - 1, -1);
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
Map[A - 1].push_back(B - 1);
Map[B - 1].push_back(A - 1);
}
queue<pair<int, int>> Q;
Q.push({0, -1});
while (!Q.empty()) {
auto p = Q.front();
int v = p.first, before = p.second;
Q.pop();
if (v > 0) {
if (Ans[v - 1] >= 0)
continue;
Ans[v - 1] = before;
}
for (int u : Map[v])
Q.push({u, v});
}
bool OK = true;
for (int a : Ans)
if (a < 0)
OK = false;
if (!OK)
cout << "No" << endl;
else {
cout << "Yes" << endl;
for (int a : Ans)
cout << a + 1 << endl;
}
} | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> Map(N);
vector<int> Ans(N - 1, -1);
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
Map[A - 1].push_back(B - 1);
Map[B - 1].push_back(A - 1);
}
queue<pair<int, int>> Q;
Q.push({0, -1});
while (!Q.empty()) {
auto p = Q.front();
int v = p.first, before = p.second;
Q.pop();
if (v > 0) {
if (Ans[v - 1] >= 0)
continue;
Ans[v - 1] = before;
}
for (int u : Map[v])
if (Ans[u - 1] < 0)
Q.push({u, v});
}
bool OK = true;
for (int a : Ans)
if (a < 0)
OK = false;
if (!OK)
cout << "No" << endl;
else {
cout << "Yes" << endl;
for (int a : Ans)
cout << a + 1 << endl;
}
} | replace | 28 | 29 | 28 | 30 | TLE | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b;
cin >> n >> m;
vector<vector<int>> r(m + 1);
vector<int> answer(n + 1);
for (int i = 0; i < m; i++) {
cin >> a >> b;
r.at(a).push_back(b);
r.at(b).push_back(a);
}
vector<bool> checked(n + 1, false);
queue<int> q;
q.push(1);
checked.at(1) = true;
while (!q.empty()) {
int t = q.front();
q.pop();
for (int i : r.at(t)) {
if (!checked.at(i)) {
answer.at(i) = t;
checked.at(i) = true;
q.push(i);
}
}
}
cout << "Yes" << endl;
for (int i = 2; i <= n; i++) {
cout << answer.at(i) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b;
cin >> n >> m;
vector<vector<int>> r(n + 1);
vector<int> answer(n + 1);
for (int i = 0; i < m; i++) {
cin >> a >> b;
r.at(a).push_back(b);
r.at(b).push_back(a);
}
vector<bool> checked(n + 1, false);
queue<int> q;
q.push(1);
checked.at(1) = true;
while (!q.empty()) {
int t = q.front();
q.pop();
for (int i : r.at(t)) {
if (!checked.at(i)) {
answer.at(i) = t;
checked.at(i) = true;
q.push(i);
}
}
}
cout << "Yes" << endl;
for (int i = 2; i <= n; i++) {
cout << answer.at(i) << endl;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define rush() \
int T; \
scanf("%d", &T); \
while (T--)
#define mm(a, b) memset(a, b, sizeof(a))
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define sc(a) scanf("%d", &a)
#define sc2(a, b) scanf("%d%d", &a, &b)
#define pf(a) printf("%d\n", a)
#define pf2(a, b) printf("%d %d\n", a, b)
#define p_f(a) printf("%d ", a)
#define pyn(a) \
if (a) \
puts("Yes"); \
else \
puts("No");
#define fi first
#define se second
#define db double
#define ll long long
using namespace std;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const db eps = 1e-9;
const int N = 1e5 + 5, M = N << 1;
struct edge {
int u, v, w, next;
} e[M];
int head[N], cnt;
void add_edges(int u, int v, int w) {
e[++cnt].u = u;
e[cnt].v = v;
e[cnt].w = w;
e[cnt].next = head[u];
head[u] = cnt;
e[++cnt].u = v;
e[cnt].v = u;
e[cnt].w = w;
e[cnt].next = head[v];
head[v] = cnt;
}
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
heap;
int n, m, u, v, dist[N], pre[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> u >> v;
add_edges(u, v, 1);
}
mm(dist, inf);
dist[1] = 0;
heap.push({0, 1});
while (!heap.empty()) {
pair<int, int> cur = heap.top();
heap.pop();
int u = cur.second;
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].v, w = e[i].w;
if (dist[v] > dist[u] + w) {
dist[v] = dist[u] + w;
pre[v] = u;
heap.push({dist[v], v});
}
}
}
int i;
for (i = 1; i <= n; i++)
if (dist[i] == inf)
break;
if (i != n + 1)
puts("No");
else {
puts("Yes");
for (i = 2; i <= n; i++)
cout << pre[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define rush() \
int T; \
scanf("%d", &T); \
while (T--)
#define mm(a, b) memset(a, b, sizeof(a))
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define sc(a) scanf("%d", &a)
#define sc2(a, b) scanf("%d%d", &a, &b)
#define pf(a) printf("%d\n", a)
#define pf2(a, b) printf("%d %d\n", a, b)
#define p_f(a) printf("%d ", a)
#define pyn(a) \
if (a) \
puts("Yes"); \
else \
puts("No");
#define fi first
#define se second
#define db double
#define ll long long
using namespace std;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const db eps = 1e-9;
const int N = 1e5 + 5, M = N << 2;
struct edge {
int u, v, w, next;
} e[M];
int head[N], cnt;
void add_edges(int u, int v, int w) {
e[++cnt].u = u;
e[cnt].v = v;
e[cnt].w = w;
e[cnt].next = head[u];
head[u] = cnt;
e[++cnt].u = v;
e[cnt].v = u;
e[cnt].w = w;
e[cnt].next = head[v];
head[v] = cnt;
}
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
heap;
int n, m, u, v, dist[N], pre[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> u >> v;
add_edges(u, v, 1);
}
mm(dist, inf);
dist[1] = 0;
heap.push({0, 1});
while (!heap.empty()) {
pair<int, int> cur = heap.top();
heap.pop();
int u = cur.second;
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].v, w = e[i].w;
if (dist[v] > dist[u] + w) {
dist[v] = dist[u] + w;
pre[v] = u;
heap.push({dist[v], v});
}
}
}
int i;
for (i = 1; i <= n; i++)
if (dist[i] == inf)
break;
if (i != n + 1)
puts("No");
else {
puts("Yes");
for (i = 2; i <= n; i++)
cout << pre[i] << endl;
}
return 0;
}
| replace | 29 | 30 | 29 | 30 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
const int INF = 10000000;
int main() {
int n, m;
cin >> n >> m;
vector<int> to[1000001000];
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
to[b].push_back(a);
}
queue<int> q;
vector<int> dist(n, INF);
vector<int> pre(n, -1);
dist[0] = 0;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int u : to[v]) {
if (dist[u] != INF)
continue;
dist[u] = dist[v] + 1;
pre[u] = v;
q.push(u);
}
}
cout << "Yes" << endl;
rep(i, n) {
if (i == 0)
continue;
int ans = pre[i];
ans++;
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
const int INF = 10000000;
int main() {
int n, m;
cin >> n >> m;
vector<int> to[100005];
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
to[b].push_back(a);
}
queue<int> q;
vector<int> dist(n, INF);
vector<int> pre(n, -1);
dist[0] = 0;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int u : to[v]) {
if (dist[u] != INF)
continue;
dist[u] = dist[v] + 1;
pre[u] = v;
q.push(u);
}
}
cout << "Yes" << endl;
rep(i, n) {
if (i == 0)
continue;
int ans = pre[i];
ans++;
cout << ans << endl;
}
}
| replace | 9 | 10 | 9 | 10 | -11 | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const long long LINF = 1000000000000000018ll;
const int INF = 1000000009;
const int mod = 1000000007;
const int mod2 = 998244353;
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};
int n, m;
vector<vector<int>> g;
vector<int> ans;
int bfs(int src_v) {
vector<int> dist(n, -1);
dist[src_v] = 0;
queue<int> q;
q.push(src_v);
while (!q.empty()) {
int cur_v = q.front();
q.pop();
for (int i = 0; i < (int)g[cur_v].size(); i++) {
int next_v = g[cur_v][i];
if (dist[next_v] != -1) {
continue;
}
ans[next_v] = cur_v + 1;
dist[next_v] = dist[cur_v] + 1;
q.push(next_v);
}
}
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::setprecision(20) << std::fixed;
cin >> n >> m;
ans = vector<int>(n);
g = vector<vector<int>>(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
bfs(0);
cout << "Yes\n";
for (int i = 1; i < n; i++) {
cout << ans[i] << "\n";
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const long long LINF = 1000000000000000018ll;
const int INF = 1000000009;
const int mod = 1000000007;
const int mod2 = 998244353;
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};
int n, m;
vector<vector<int>> g;
vector<int> ans;
void bfs(int src_v) {
vector<int> dist(n, -1);
dist[src_v] = 0;
queue<int> q;
q.push(src_v);
while (!q.empty()) {
int cur_v = q.front();
q.pop();
for (int i = 0; i < (int)g[cur_v].size(); i++) {
int next_v = g[cur_v][i];
if (dist[next_v] != -1) {
continue;
}
ans[next_v] = cur_v + 1;
dist[next_v] = dist[cur_v] + 1;
q.push(next_v);
}
}
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::setprecision(20) << std::fixed;
cin >> n >> m;
ans = vector<int>(n);
g = vector<vector<int>>(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
bfs(0);
cout << "Yes\n";
for (int i = 1; i < n; i++) {
cout << ans[i] << "\n";
}
return 0;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <deque>
#include <iostream>
#include <vector>
struct BFS {
size_t N;
size_t M;
std::vector<std::vector<size_t>> Graph;
std::vector<size_t> dist;
std::vector<std::vector<size_t>> distMap;
std::deque<size_t> que;
std::vector<size_t> arrow;
BFS() {
std::cin >> N;
std::cin >> M;
Graph.assign(N, std::vector<size_t>());
for (size_t i = 0; i != M; i++) {
size_t j1, j2;
std::cin >> j1 >> j2;
j1--;
j2--;
Graph[j1].push_back(j2);
Graph[j2].push_back(j1);
}
dist.assign(N, -1);
distMap.assign(N, std::vector<size_t>());
arrow.assign(N, -1);
}
void find(size_t pos) {
dist[pos] = 0;
distMap[dist[pos]].push_back(pos);
que.push_back(pos);
while (que.empty() == false) {
pos = que.front();
que.pop_front();
for (size_t i = 0; i != Graph[pos].size(); i++) {
size_t nextPos = Graph[pos][i];
if (dist[nextPos] != -1)
continue;
dist[nextPos] = dist[pos] + 1;
distMap[dist[nextPos]].push_back(nextPos);
que.push_back(nextPos);
}
}
for (size_t i = 1; i != N; i++) {
std::vector<size_t> v1(N, 0);
for (auto e : distMap[dist[i] - 1]) {
v1[e]++;
}
std::vector<size_t> v2(N, 0);
for (auto e : Graph[i]) {
if (v1[e] != 0) {
arrow[i] = e;
}
}
}
}
};
int main() {
BFS f;
f.find(0);
for (size_t i = 1; i != f.arrow.size(); i++) {
if (f.arrow[i] == -1) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
for (size_t i = 1; i != f.arrow.size(); i++) {
std::cout << f.arrow[i] + 1 << std::endl;
}
return 0;
} | #include <deque>
#include <iostream>
#include <vector>
struct BFS {
size_t N;
size_t M;
std::vector<std::vector<size_t>> Graph;
std::vector<size_t> dist;
std::vector<std::vector<size_t>> distMap;
std::deque<size_t> que;
std::vector<size_t> arrow;
BFS() {
std::cin >> N;
std::cin >> M;
Graph.assign(N, std::vector<size_t>());
for (size_t i = 0; i != M; i++) {
size_t j1, j2;
std::cin >> j1 >> j2;
j1--;
j2--;
Graph[j1].push_back(j2);
Graph[j2].push_back(j1);
}
dist.assign(N, -1);
distMap.assign(N, std::vector<size_t>());
arrow.assign(N, -1);
}
void find(size_t pos) {
dist[pos] = 0;
distMap[dist[pos]].push_back(pos);
que.push_back(pos);
while (que.empty() == false) {
pos = que.front();
que.pop_front();
for (size_t i = 0; i != Graph[pos].size(); i++) {
size_t nextPos = Graph[pos][i];
if (dist[nextPos] != -1)
continue;
dist[nextPos] = dist[pos] + 1;
distMap[dist[nextPos]].push_back(nextPos);
que.push_back(nextPos);
arrow[nextPos] = pos;
}
}
}
};
int main() {
BFS f;
f.find(0);
for (size_t i = 1; i != f.arrow.size(); i++) {
if (f.arrow[i] == -1) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
for (size_t i = 1; i != f.arrow.size(); i++) {
std::cout << f.arrow[i] + 1 << std::endl;
}
return 0;
} | replace | 50 | 63 | 50 | 51 | TLE | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
#define node_num 10005
#define edge_num 40005
#define INF 100000000
class node {
public:
// 这里的dis并不是主要的dis，只是用来比较，完善pq的
int id, dis;
bool operator<(const node &a) const { return a.dis < dis; }
};
int pre[edge_num];
int to[edge_num];
int val[edge_num];
int ans[node_num];
int tot; // 从1开始
int last[node_num];
int ndis[node_num];
int used[node_num];
void add(int u, int v) {
tot++;
to[tot] = v;
val[tot] = 1;
pre[tot] = last[u];
last[u] = tot;
}
int n, m;
int a, b, c;
int main() {
priority_queue<node> qu;
scanf("%d%d", &n, &m);
fill(ndis, ndis + node_num, INF);
ndis[1] = 0;
/*数据输入*/
for (int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
add(a, b);
add(b, a);
}
qu.push(node{1, ndis[1]});
/*主循环*/
while (!qu.empty()) {
/*弹出元素*/
int x = qu.top().id;
int ptr = last[x];
qu.pop();
/*判断终止*/
if (used[x])
continue;
used[x] = 1;
/*遍历松弛*/
while (ptr) {
int y = to[ptr];
if (!used[y] && ndis[y] > ndis[x] + val[ptr]) {
ndis[y] = ndis[x] + val[ptr];
ans[y] = x;
qu.push(node{y, ndis[y]});
}
ptr = pre[ptr];
}
}
bool flag = true;
for (int i = 2; i <= n; i++) {
if (ndis[i] == INF) {
flag = false;
break;
}
}
if (flag) {
printf("Yes\n");
for (int i = 2; i <= n; i++) {
printf("%d\n", ans[i]);
}
} else
printf("No\n");
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
#define node_num 100005
#define edge_num 400005
#define INF 100000000
class node {
public:
// 这里的dis并不是主要的dis，只是用来比较，完善pq的
int id, dis;
bool operator<(const node &a) const { return a.dis < dis; }
};
int pre[edge_num];
int to[edge_num];
int val[edge_num];
int ans[node_num];
int tot; // 从1开始
int last[node_num];
int ndis[node_num];
int used[node_num];
void add(int u, int v) {
tot++;
to[tot] = v;
val[tot] = 1;
pre[tot] = last[u];
last[u] = tot;
}
int n, m;
int a, b, c;
int main() {
priority_queue<node> qu;
scanf("%d%d", &n, &m);
fill(ndis, ndis + node_num, INF);
ndis[1] = 0;
/*数据输入*/
for (int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
add(a, b);
add(b, a);
}
qu.push(node{1, ndis[1]});
/*主循环*/
while (!qu.empty()) {
/*弹出元素*/
int x = qu.top().id;
int ptr = last[x];
qu.pop();
/*判断终止*/
if (used[x])
continue;
used[x] = 1;
/*遍历松弛*/
while (ptr) {
int y = to[ptr];
if (!used[y] && ndis[y] > ndis[x] + val[ptr]) {
ndis[y] = ndis[x] + val[ptr];
ans[y] = x;
qu.push(node{y, ndis[y]});
}
ptr = pre[ptr];
}
}
bool flag = true;
for (int i = 2; i <= n; i++) {
if (ndis[i] == INF) {
flag = false;
break;
}
}
if (flag) {
printf("Yes\n");
for (int i = 2; i <= n; i++) {
printf("%d\n", ans[i]);
}
} else
printf("No\n");
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define endl '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define IO \
ios::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5000;
int tot, head[maxn];
struct E {
int to, next;
} edge[maxn << 1];
void add(int u, int v) {
edge[tot].to = v;
edge[tot].next = head[u];
head[u] = tot++;
}
int n, m, ans[maxn], cnt = 0;
void bfs(int x) {
ans[x] = 1;
cnt += 1;
queue<int> q;
q.push(x);
while (!q.empty()) {
int now = q.front();
q.pop();
for (int i = head[now]; i != -1; i = edge[i].next) {
int v = edge[i].to;
if (!ans[v]) {
cnt += 1;
ans[v] = now;
q.push(v);
}
}
}
}
int main() {
scanf("%d%d", &n, &m);
mem(head, -1);
while (m--) {
int u, v;
scanf("%d%d", &u, &v);
add(u, v);
add(v, u);
}
bfs(1);
if (cnt != n) {
puts("No");
return 0;
}
puts("Yes");
for (int i = 2; i <= n; i++) {
cout << ans[i] << endl;
}
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define endl '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define IO \
ios::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
int tot, head[maxn];
struct E {
int to, next;
} edge[maxn << 1];
void add(int u, int v) {
edge[tot].to = v;
edge[tot].next = head[u];
head[u] = tot++;
}
int n, m, ans[maxn], cnt = 0;
void bfs(int x) {
ans[x] = 1;
cnt += 1;
queue<int> q;
q.push(x);
while (!q.empty()) {
int now = q.front();
q.pop();
for (int i = head[now]; i != -1; i = edge[i].next) {
int v = edge[i].to;
if (!ans[v]) {
cnt += 1;
ans[v] = now;
q.push(v);
}
}
}
}
int main() {
scanf("%d%d", &n, &m);
mem(head, -1);
while (m--) {
int u, v;
scanf("%d%d", &u, &v);
add(u, v);
add(v, u);
}
bfs(1);
if (cnt != n) {
puts("No");
return 0;
}
puts("Yes");
for (int i = 2; i <= n; i++) {
cout << ans[i] << endl;
}
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02678 | C++ | Runtime Error |
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
struct Node {
vector<int> neighbors;
bool visited = false;
};
int N, M;
Node nodes[2000];
map<int, int> signs; // 道しるべ
void bfs(int start) {
nodes[start].visited = true;
queue<int> search_queue;
search_queue.push(start);
while (!search_queue.empty()) {
// キューから探索対象のノードのインデックスを取り出す
int i = search_queue.front();
search_queue.pop();
for (int n : nodes[i].neighbors) {
if (nodes[n].visited) {
continue; // 探索済みならキューに入れない
}
nodes[n].visited = true;
signs[n] = i;
search_queue.push(n);
}
}
}
int main() {
cin >> N >> M;
int A, B;
for (int i = 0; i < M; i++) {
cin >> A >> B;
A--;
B--;
nodes[A].neighbors.push_back(B);
nodes[B].neighbors.push_back(A);
}
bfs(0);
cout << "Yes" << endl;
for (auto itr = signs.begin(); itr != signs.end(); itr++) {
cout << itr->second + 1 << endl;
}
return 0;
} |
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
struct Node {
vector<int> neighbors;
bool visited = false;
};
int N, M;
Node nodes[100000];
map<int, int> signs; // 道しるべ
void bfs(int start) {
nodes[start].visited = true;
queue<int> search_queue;
search_queue.push(start);
while (!search_queue.empty()) {
// キューから探索対象のノードのインデックスを取り出す
int i = search_queue.front();
search_queue.pop();
for (int n : nodes[i].neighbors) {
if (nodes[n].visited) {
continue; // 探索済みならキューに入れない
}
nodes[n].visited = true;
signs[n] = i;
search_queue.push(n);
}
}
}
int main() {
cin >> N >> M;
int A, B;
for (int i = 0; i < M; i++) {
cin >> A >> B;
A--;
B--;
nodes[A].neighbors.push_back(B);
nodes[B].neighbors.push_back(A);
}
bfs(0);
cout << "Yes" << endl;
for (auto itr = signs.begin(); itr != signs.end(); itr++) {
cout << itr->second + 1 << endl;
}
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02678 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int N = 100001, M = 200002;
const int INF = 0x7f7f7f7f;
struct node {
int i, value;
friend bool operator<(node a, node b) { return a.value > b.value; }
};
struct edge {
int to, value;
int next;
} mem[M];
priority_queue<node> minq;
int head[N], siz = 0, dis[N], n, m, start, qian[N];
bool vis[N];
void dijkstra(int start) {
dis[start] = 0;
node tmp = {start, 0};
minq.push(tmp);
while (!minq.empty()) {
tmp = minq.top();
minq.pop();
if (vis[tmp.i])
continue;
vis[tmp.i] = true;
for (int j = head[tmp.i]; j != 0; j = mem[j].next) {
int to = mem[j].to;
if (!vis[to] && mem[j].value + dis[tmp.i] < dis[to]) {
dis[to] = mem[j].value + dis[tmp.i];
node tmp2 = {to, dis[to]};
minq.push(tmp2);
qian[to] = tmp.i;
}
}
}
}
int main() {
memset(head, 0, sizeof(head));
memset(dis, 0x7f, sizeof(dis));
memset(vis, false, sizeof(vis));
memset(qian, -1, sizeof(qian));
scanf("%d %d", &n, &m);
start = 1;
int u, v, w;
for (int i = 1; i <= m; i++) {
scanf("%d %d", &u, &v);
w = 1;
siz++;
mem[siz].to = v;
mem[siz].value = w;
mem[siz].next = head[u];
head[u] = siz;
siz++;
mem[siz].to = u;
mem[siz].value = w;
mem[siz].next = head[v];
head[v] = siz;
}
dijkstra(start);
for (int i = 1; i <= n; i++) {
if (dis[i] >= 2139062143) {
printf("No");
return 0;
}
}
printf("Yes\n");
for (int i = 2; i <= n; i++) {
cout << qian[i] << endl;
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int N = 100001, M = 400004;
const int INF = 0x7f7f7f7f;
struct node {
int i, value;
friend bool operator<(node a, node b) { return a.value > b.value; }
};
struct edge {
int to, value;
int next;
} mem[M];
priority_queue<node> minq;
int head[N], siz = 0, dis[N], n, m, start, qian[N];
bool vis[N];
void dijkstra(int start) {
dis[start] = 0;
node tmp = {start, 0};
minq.push(tmp);
while (!minq.empty()) {
tmp = minq.top();
minq.pop();
if (vis[tmp.i])
continue;
vis[tmp.i] = true;
for (int j = head[tmp.i]; j != 0; j = mem[j].next) {
int to = mem[j].to;
if (!vis[to] && mem[j].value + dis[tmp.i] < dis[to]) {
dis[to] = mem[j].value + dis[tmp.i];
node tmp2 = {to, dis[to]};
minq.push(tmp2);
qian[to] = tmp.i;
}
}
}
}
int main() {
memset(head, 0, sizeof(head));
memset(dis, 0x7f, sizeof(dis));
memset(vis, false, sizeof(vis));
memset(qian, -1, sizeof(qian));
scanf("%d %d", &n, &m);
start = 1;
int u, v, w;
for (int i = 1; i <= m; i++) {
scanf("%d %d", &u, &v);
w = 1;
siz++;
mem[siz].to = v;
mem[siz].value = w;
mem[siz].next = head[u];
head[u] = siz;
siz++;
mem[siz].to = u;
mem[siz].value = w;
mem[siz].next = head[v];
head[v] = siz;
}
dijkstra(start);
for (int i = 1; i <= n; i++) {
if (dis[i] >= 2139062143) {
printf("No");
return 0;
}
}
printf("Yes\n");
for (int i = 2; i <= n; i++) {
cout << qian[i] << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x, v) \
(lower_bound(x.begin(), x.end(), v) - x.begin()) // xi>=v x is sorted
#define POSU(x, v) \
(upper_bound(x.begin(), x.end(), v) - x.begin()) // xi>v x is sorted
#define NUM(x, v) (POSU(x, v) - POSL(x, v)) // x is sorted
#define REV(x) (reverse(x.begin(), x.end())) // reverse
ll gcd_(ll a, ll b) {
if (a % b == 0)
return b;
return gcd_(b, a % b);
}
ll lcm_(ll a, ll b) {
ll c = gcd_(a, b);
return ((a / c) * (b / c) * c);
}
#define NEXTP(x) next_permutation(x.begin(), x.end())
const ll INF = ll(1e16) + ll(7);
const ll MOD = 1000000007LL;
#define out(a) cout << fixed << setprecision((a))
// tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a) {
ll r = 0;
while (a) {
a /= 10;
r++;
}
return r;
}
vector<int> dis_(int n, vector<int> &a, vector<int> &b, int start) {
vector<int> G[n];
FOR(i, 0, a.size()) {
G[a[i]].push_back(b[i]);
G[b[i]].push_back(a[i]);
}
vector<int> res(n, -1);
queue<int> nex;
nex.push(start);
res[start] = 0;
while (nex.size()) {
int from = nex.front();
nex.pop();
for (auto to : G[from]) {
if (res[to] >= 0)
continue;
res[to] = res[from] + 1;
nex.push(to);
}
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(n), ans(n), min_d(n, MOD);
FOR(i, 0, m) cin >> a[i] >> b[i];
FOR(i, 0, m) a[i]--, b[i]--;
auto dis = dis_(n, a, b, 0);
if (count(dis.begin(), dis.end(), -1)) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
FOR(i, 0, m) {
if (min_d[a[i]] > dis[b[i]]) {
min_d[a[i]] = dis[b[i]];
ans[a[i]] = b[i];
}
if (min_d[b[i]] > dis[a[i]]) {
min_d[b[i]] = dis[a[i]];
ans[b[i]] = a[i];
}
}
FOR(i, 1, n) { cout << ans[i] + 1 << endl; }
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x, v) \
(lower_bound(x.begin(), x.end(), v) - x.begin()) // xi>=v x is sorted
#define POSU(x, v) \
(upper_bound(x.begin(), x.end(), v) - x.begin()) // xi>v x is sorted
#define NUM(x, v) (POSU(x, v) - POSL(x, v)) // x is sorted
#define REV(x) (reverse(x.begin(), x.end())) // reverse
ll gcd_(ll a, ll b) {
if (a % b == 0)
return b;
return gcd_(b, a % b);
}
ll lcm_(ll a, ll b) {
ll c = gcd_(a, b);
return ((a / c) * (b / c) * c);
}
#define NEXTP(x) next_permutation(x.begin(), x.end())
const ll INF = ll(1e16) + ll(7);
const ll MOD = 1000000007LL;
#define out(a) cout << fixed << setprecision((a))
// tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a) {
ll r = 0;
while (a) {
a /= 10;
r++;
}
return r;
}
vector<int> dis_(int n, vector<int> &a, vector<int> &b, int start) {
vector<int> G[n];
FOR(i, 0, a.size()) {
G[a[i]].push_back(b[i]);
G[b[i]].push_back(a[i]);
}
vector<int> res(n, -1);
queue<int> nex;
nex.push(start);
res[start] = 0;
while (nex.size()) {
int from = nex.front();
nex.pop();
for (auto to : G[from]) {
if (res[to] >= 0)
continue;
res[to] = res[from] + 1;
nex.push(to);
}
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m), b(m), ans(n), min_d(n, MOD);
FOR(i, 0, m) cin >> a[i] >> b[i];
FOR(i, 0, m) a[i]--, b[i]--;
auto dis = dis_(n, a, b, 0);
if (count(dis.begin(), dis.end(), -1)) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
FOR(i, 0, m) {
if (min_d[a[i]] > dis[b[i]]) {
min_d[a[i]] = dis[b[i]];
ans[a[i]] = b[i];
}
if (min_d[b[i]] > dis[a[i]]) {
min_d[b[i]] = dis[a[i]];
ans[b[i]] = a[i];
}
}
FOR(i, 1, n) { cout << ans[i] + 1 << endl; }
}
| replace | 65 | 66 | 65 | 66 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#include <algorithm>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
#include <cmath>
#include <iomanip>
#include <queue>
#include <set>
const int MOD = 1000000007;
ll POWER(ll x, ll y) {
ll ret = 1;
ll p = x;
for (ll i = y; i > 0; i /= 2) {
if (i % 2)
ret = (ret * p) % MOD;
p = (p * p) % MOD;
}
return ret;
}
ll gcm(ll a, ll b) {
if (b > a) {
ll c = a;
a = b;
b = c;
}
while (b > 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> c(n + 1, 0), d(n + 1);
vector<set<int>> ab(n + 1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
ab[a].insert(b);
ab[b].insert(a);
}
c[1] = 1;
int rest = n - 1;
queue<int> q;
q.push(1);
while (!q.empty()) {
int a = q.front();
auto it = ab[a].begin();
while (it != ab[a].end()) {
if (c[*it] == 0) {
c[*it] = c[a] + 1;
d[*it] = a;
q.push(*it);
}
it++;
}
}
cout << "Yes" << endl;
for (int i = 2; i <= n; i++) {
cout << d[i] << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
#include <algorithm>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
#include <cmath>
#include <iomanip>
#include <queue>
#include <set>
const int MOD = 1000000007;
ll POWER(ll x, ll y) {
ll ret = 1;
ll p = x;
for (ll i = y; i > 0; i /= 2) {
if (i % 2)
ret = (ret * p) % MOD;
p = (p * p) % MOD;
}
return ret;
}
ll gcm(ll a, ll b) {
if (b > a) {
ll c = a;
a = b;
b = c;
}
while (b > 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> c(n + 1, 0), d(n + 1);
vector<set<int>> ab(n + 1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
ab[a].insert(b);
ab[b].insert(a);
}
c[1] = 1;
int rest = n - 1;
queue<int> q;
q.push(1);
while (!q.empty()) {
int a = q.front();
q.pop();
auto it = ab[a].begin();
while (it != ab[a].end()) {
if (c[*it] == 0) {
c[*it] = c[a] + 1;
d[*it] = a;
q.push(*it);
}
it++;
}
}
cout << "Yes" << endl;
for (int i = 2; i <= n; i++) {
cout << d[i] << endl;
}
return 0;
}
| replace | 58 | 59 | 58 | 59 | TLE | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
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;
}
int main() {
int n, m;
cin >> n >> m;
Graph G(m);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> dist(n, -1);
queue<int> que;
vector<int> pre(n, -1);
dist[0] = 0;
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv] != -1)
continue;
dist[nv] = dist[v] + 1;
pre[nv] = v;
que.push(nv);
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++) {
cout << pre[i] + 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
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;
}
int main() {
int n, m;
cin >> n >> m;
Graph G(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> dist(n, -1);
queue<int> que;
vector<int> pre(n, -1);
dist[0] = 0;
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv] != -1)
continue;
dist[nv] = dist[v] + 1;
pre[nv] = v;
que.push(nv);
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++) {
cout << pre[i] + 1 << endl;
}
return 0;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define INF 1e9
#define INFL 8e18
#define XX first
#define YY second
#define PB push_back
#define MP make_pair
#define NEWLINE cerr << "\n";
#define HOISE cerr << "hoise " << __LINE__ << "\n"
#define PAUSE system("pause")
#define DEBUG(x) cerr << #x << " = " << x << "\n"
#define READ freopen("D:\\moidda CPP\\alu.txt", "r", stdin)
#define WRITE freopen("D:\\moidda CPP\\vorta.txt", "w", stdout)
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MASK(x) \
for (int i = 0; i < 8; i++) { \
if (x & (1 << i)) { \
cout << i << " "; \
} \
} \
cout << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pff;
const int MAX = 30 + 10;
const int MAX_VALUE = 2e6 + 10;
const int MAXLOG = log2(MAX) + 2;
const int MOD = 10007;
const double PY = acos(-1.0);
const double EPS = 1E-9;
int n, m;
vector<int> G[MAX];
int dis[MAX];
int par[MAX];
int32_t main() {
#ifndef ONLINE_JUDGE
// READ;
// WRITE;
#endif
FASTIO;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
G[u].PB(v);
G[v].PB(u);
}
for (int i = 0; i < MAX; i++)
dis[i] = INF;
memset(par, -1, sizeof par);
queue<int> Q;
dis[1] = 0;
Q.push(1);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
for (int v : G[u]) {
if (dis[v] > dis[u] + 1) {
dis[v] = dis[u] + 1;
par[v] = u;
Q.push(v);
}
}
}
for (int i = 1; i <= n; i++) {
if (dis[i] >= INF) {
cout << "No";
return 0;
}
}
cout << "Yes\n";
for (int i = 2; i <= n; i++)
cout << par[i] << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define INF 1e9
#define INFL 8e18
#define XX first
#define YY second
#define PB push_back
#define MP make_pair
#define NEWLINE cerr << "\n";
#define HOISE cerr << "hoise " << __LINE__ << "\n"
#define PAUSE system("pause")
#define DEBUG(x) cerr << #x << " = " << x << "\n"
#define READ freopen("D:\\moidda CPP\\alu.txt", "r", stdin)
#define WRITE freopen("D:\\moidda CPP\\vorta.txt", "w", stdout)
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MASK(x) \
for (int i = 0; i < 8; i++) { \
if (x & (1 << i)) { \
cout << i << " "; \
} \
} \
cout << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pff;
const int MAX = 1e5 + 10;
const int MAX_VALUE = 2e6 + 10;
const int MAXLOG = log2(MAX) + 2;
const int MOD = 10007;
const double PY = acos(-1.0);
const double EPS = 1E-9;
int n, m;
vector<int> G[MAX];
int dis[MAX];
int par[MAX];
int32_t main() {
#ifndef ONLINE_JUDGE
// READ;
// WRITE;
#endif
FASTIO;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
G[u].PB(v);
G[v].PB(u);
}
for (int i = 0; i < MAX; i++)
dis[i] = INF;
memset(par, -1, sizeof par);
queue<int> Q;
dis[1] = 0;
Q.push(1);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
for (int v : G[u]) {
if (dis[v] > dis[u] + 1) {
dis[v] = dis[u] + 1;
par[v] = u;
Q.push(v);
}
}
}
for (int i = 1; i <= n; i++) {
if (dis[i] >= INF) {
cout << "No";
return 0;
}
}
cout << "Yes\n";
for (int i = 2; i <= n; i++)
cout << par[i] << "\n";
return 0;
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p02678 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i, n) for (int i = 0; i < (n); i++)
#define fori(a, b, i) for (int i = (a); i <= (b); i++)
#define ford(a, b, i) for (int i = (a); i >= (b); i--)
#define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL);
#define INF 0x3f3f3f3f
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define fir first
#define sec second
#define pb push_back
#define mp make_pair
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int, int> MII;
typedef set<int> SI;
typedef long long int llint;
llint n, e;
llint height[10000];
bool bfs(llint root, vector<llint> v[]) {
bool vis[n + 1];
memset(vis, 0, sizeof(vis));
vis[root] = 1;
queue<llint> q;
q.push(root);
while (!q.empty()) {
llint x = q.front();
q.pop();
for (auto i : v[x]) {
if (!vis[i]) {
vis[i] = 1;
q.push(i);
height[i] = 1 + height[x];
}
}
}
for (int i = 1; i <= n; ++i)
if (!vis[i])
return false;
return true;
}
int main() {
cin >> n >> e;
vector<llint> v[n + 1];
loop(i, e) {
llint a, b;
cin >> a >> b;
v[a].pb(b);
v[b].pb(a);
}
if (!bfs(1, v)) {
cout << "No";
return 0;
}
cout << "Yes" << endl;
for (int i = 2; i < n + 1; ++i) {
llint mdis = INF, ans = -1;
for (auto j : v[i]) {
if (height[j] < mdis) {
mdis = height[j];
ans = j;
}
}
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i, n) for (int i = 0; i < (n); i++)
#define fori(a, b, i) for (int i = (a); i <= (b); i++)
#define ford(a, b, i) for (int i = (a); i >= (b); i--)
#define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL);
#define INF 0x3f3f3f3f
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define fir first
#define sec second
#define pb push_back
#define mp make_pair
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int, int> MII;
typedef set<int> SI;
typedef long long int llint;
llint n, e;
llint height[500000];
bool bfs(llint root, vector<llint> v[]) {
bool vis[n + 1];
memset(vis, 0, sizeof(vis));
vis[root] = 1;
queue<llint> q;
q.push(root);
while (!q.empty()) {
llint x = q.front();
q.pop();
for (auto i : v[x]) {
if (!vis[i]) {
vis[i] = 1;
q.push(i);
height[i] = 1 + height[x];
}
}
}
for (int i = 1; i <= n; ++i)
if (!vis[i])
return false;
return true;
}
int main() {
cin >> n >> e;
vector<llint> v[n + 1];
loop(i, e) {
llint a, b;
cin >> a >> b;
v[a].pb(b);
v[b].pb(a);
}
if (!bfs(1, v)) {
cout << "No";
return 0;
}
cout << "Yes" << endl;
for (int i = 2; i < n + 1; ++i) {
llint mdis = INF, ans = -1;
for (auto j : v[i]) {
if (height[j] < mdis) {
mdis = height[j];
ans = j;
}
}
cout << ans << endl;
}
return 0;
}
| replace | 51 | 52 | 51 | 52 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
int u, v, n, m, flag, cnt;
int fa[MAXN], head[MAXN];
struct edge {
int v, next;
} e[MAXN];
void add(int u, int v) {
e[++cnt].v = v;
e[cnt].next = head[u];
head[u] = cnt;
}
void bfs() {
queue<int> q;
q.push(1);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].v;
if (fa[v])
continue;
fa[v] = u;
q.push(v);
}
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ++i) {
scanf("%d%d", &u, &v);
add(u, v);
add(v, u);
}
bfs();
for (int i = 2; i <= n; ++i)
if (!fa[i]) {
printf("No");
flag = 1;
break;
}
if (!flag) {
printf("Yes\n");
for (int i = 2; i <= n; ++i)
printf("%d\n", fa[i]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
int u, v, n, m, flag, cnt;
int fa[MAXN], head[MAXN];
struct edge {
int v, next;
} e[MAXN << 1];
void add(int u, int v) {
e[++cnt].v = v;
e[cnt].next = head[u];
head[u] = cnt;
}
void bfs() {
queue<int> q;
q.push(1);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].v;
if (fa[v])
continue;
fa[v] = u;
q.push(v);
}
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ++i) {
scanf("%d%d", &u, &v);
add(u, v);
add(v, u);
}
bfs();
for (int i = 2; i <= n; ++i)
if (!fa[i]) {
printf("No");
flag = 1;
break;
}
if (!flag) {
printf("Yes\n");
for (int i = 2; i <= n; ++i)
printf("%d\n", fa[i]);
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
struct Edge {
int next, to;
} edge[N];
int fi[N], se, pre[N], que[N], s, t;
inline void add_edge(int u, int v) { edge[++se] = {fi[u], v}, fi[u] = se; }
inline void add(int u, int v) { add_edge(u, v), add_edge(v, u); }
int main() {
int n, m, u, v;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++)
scanf("%d%d", &u, &v), add(u, v);
que[t++] = 1;
while (s < t) {
int u = que[s++];
for (int i = fi[u]; i; i = edge[i].next) {
int v = edge[i].to;
if (pre[v])
continue;
pre[v] = u, que[t++] = v;
}
}
if (s < n)
return puts("No"), 0;
puts("Yes");
for (int i = 2; i <= n; i++)
printf("%d\n", pre[i]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
struct Edge {
int next, to;
} edge[N * 2];
int fi[N], se, pre[N], que[N], s, t;
inline void add_edge(int u, int v) { edge[++se] = {fi[u], v}, fi[u] = se; }
inline void add(int u, int v) { add_edge(u, v), add_edge(v, u); }
int main() {
int n, m, u, v;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++)
scanf("%d%d", &u, &v), add(u, v);
que[t++] = 1;
while (s < t) {
int u = que[s++];
for (int i = fi[u]; i; i = edge[i].next) {
int v = edge[i].to;
if (pre[v])
continue;
pre[v] = u, que[t++] = v;
}
}
if (s < n)
return puts("No"), 0;
puts("Yes");
for (int i = 2; i <= n; i++)
printf("%d\n", pre[i]);
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int vis[maxn], pre[maxn];
int head[maxn], tot;
struct Edge {
int to, next;
} e[maxn << 1];
void addedge(int from, int to) {
e[tot].to = to;
e[tot].next = head[from];
head[from] = tot++;
}
void bfs(int u) {
memset(vis, 0, sizeof(vis));
vis[u] = 1;
queue<int> q;
q.push(u);
while (!q.empty()) {
u = q.front();
q.pop();
for (int i = head[u]; i != -1; i = e[i].next) {
int v = e[i].to;
if (!vis[v]) {
vis[v] = 1;
pre[v] = u;
q.push(v);
}
}
}
}
int main() {
memset(head, -1, sizeof(head));
tot = 0;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int from, to;
cin >> from >> to;
addedge(from, to);
addedge(to, from);
}
bfs(1);
bool judge = true;
for (int i = 2; i <= n; i++)
if (!vis[i]) {
judge = false;
break;
}
if (judge) {
puts("Yes");
for (int i = 2; i <= n; i++)
cout << pre[i] << endl;
} else
puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int vis[maxn], pre[maxn];
int head[maxn], tot;
struct Edge {
int to, next;
} e[maxn << 1];
void addedge(int from, int to) {
e[tot].to = to;
e[tot].next = head[from];
head[from] = tot++;
}
void bfs(int u) {
memset(vis, 0, sizeof(vis));
vis[u] = 1;
queue<int> q;
q.push(u);
while (!q.empty()) {
u = q.front();
q.pop();
for (int i = head[u]; i != -1; i = e[i].next) {
int v = e[i].to;
if (!vis[v]) {
vis[v] = 1;
pre[v] = u;
q.push(v);
}
}
}
}
int main() {
memset(head, -1, sizeof(head));
tot = 0;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int from, to;
cin >> from >> to;
addedge(from, to);
addedge(to, from);
}
bfs(1);
bool judge = true;
for (int i = 2; i <= n; i++)
if (!vis[i]) {
judge = false;
break;
}
if (judge) {
puts("Yes");
for (int i = 2; i <= n; i++)
cout << pre[i] << endl;
} else
puts("No");
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pi 3.14159265358979323846
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> G(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
queue<int> que;
que.push(0);
vector<bool> visit(n, false);
vector<int> key(n, -1); // 道しるべ
while (que.size() != 0) {
int now = que.front();
que.pop();
visit[now] = true;
for (auto next : G[now]) {
if (visit[next] == true)
continue;
if (key[next] == -1) {
key[next] = now;
}
que.push(next);
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++) {
cout << key[i] + 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pi 3.14159265358979323846
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> G(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
queue<int> que;
que.push(0);
vector<bool> visit(n, false);
vector<int> key(n, -1); // 道しるべ
while (que.size() != 0) {
int now = que.front();
que.pop();
if (visit[now] == true)
continue;
visit[now] = true;
for (auto next : G[now]) {
if (visit[next] == true)
continue;
if (key[next] == -1) {
key[next] = now;
}
que.push(next);
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; i++) {
cout << key[i] + 1 << endl;
}
return 0;
} | insert | 27 | 27 | 27 | 29 | TLE | |
p02678 | C++ | Runtime Error | /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) \
for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) \
for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T>
istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T>
ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end())
os << ", ";
}
return os << "}";
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T, typename U>
ostream &operator<<(ostream &os, um<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) {
return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty())
os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#define DEBUG_
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} ATCODER_INITIALIZE;
string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
void yn(bool p) { cout << (p ? yes : no) << endl; }
/* #endregion */
/* #region Graph */
// エッジ（本来エッジは双方向だが，ここでは単方向で管理）
template <class weight_t, class flow_t> struct Edge {
ll src; // エッジ始点となる頂点
ll dst; // エッジ終点となる頂点
weight_t weight; // 重み
flow_t cap;
Edge() : src(0), dst(0), weight(0) {}
Edge(ll src, ll dst, weight_t weight) : src(src), dst(dst), weight(weight) {}
Edge(ll src, ll dst, weight_t weight, flow_t cap)
: src(src), dst(dst), weight(weight), cap(cap) {}
// Edge 標準出力
friend ostream &operator<<(ostream &os, Edge &edge) {
os << "(" << edge.src << " -> " << edge.dst << ", " << edge.weight << ")";
return os;
}
};
// 同じ頂点を始点とするエッジ集合
template <class weight_t, class flow_t>
class Node : public vc<Edge<weight_t, flow_t>> {
public:
ll idx;
Node() : vc<Edge<weight_t, flow_t>>() {}
// void add(int a, int b, weight_t w, flow_t cap) { this->emplace_back(a, b,
// w, cap); };
};
// graph[i] := 頂点 i を始点とするエッジ集合
template <class weight_t, class flow_t>
class Graph : public vc<Node<weight_t, flow_t>> {
public:
Graph() : vc<Node<weight_t, flow_t>>() {}
Graph(int n) : vc<Node<weight_t, flow_t>>(n) {
REP(i, 0, n)(*this)[i].idx = i;
}
// 単方向
void add_arc(int a, int b, weight_t w = 1, flow_t cap = 1) {
(*this)[a].emplace_back(a, b, w, cap);
}
// 双方向
void add_edge(int a, int b, weight_t w = 1, flow_t cap = 1) {
add_arc(a, b, w, cap), add_arc(b, a, w, cap);
}
};
// using Array = vc<Weight>;
// using Matrix = vc<Array>;
/* #endregion */
// Problem
void solve() {
ll n, m;
cin >> n >> m;
vll a(m), b(m);
REP(i, 0, m) {
cin >> a[i] >> b[i];
a[i]--, b[i]--;
}
Graph<ll, ll> graph(n);
REP(i, 0, n) graph.add_edge(a[i], b[i]);
vll dist(n, -1);
queue<Node<ll, ll>> que; // 「訪問予定」頂点リスト
// 初期条件 (頂点 idx1 を初期頂点とする)
dist[0] = 0;
que.push(graph[0]); // 頂点 idx を「訪問予定」頂点リストに追加
// BFS 開始 (キューが空になるまで探索を行う)
while (!que.empty()) {
Node<ll, ll> current = que.front(); // キューから先頭頂点を取り出す
que.pop();
// cuerrent から辿れる頂点をすべて調べる
for (Edge<ll, ll> edge : current) {
if (dist[edge.dst] != -1)
continue; // 訪問済み (weight=1 固定なら continue してよい)
// 未訪問の頂点 nv について距離情報を更新してキューに追加する
dist[edge.dst] = edge.src;
que.push(graph[edge.dst]);
}
}
// validate
REP(i, 1, n) if (dist[i] == -1) {
yn(false);
return;
}
yn(true);
REP(i, 1, n) cout << (dist[i] + 1) << endl;
}
// entry point
int main() {
solve();
return 0;
}
| /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) \
for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) \
for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T>
istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T>
ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end())
os << ", ";
}
return os << "}";
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T, typename U>
ostream &operator<<(ostream &os, um<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) {
return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty())
os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#define DEBUG_
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} ATCODER_INITIALIZE;
string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
void yn(bool p) { cout << (p ? yes : no) << endl; }
/* #endregion */
/* #region Graph */
// エッジ（本来エッジは双方向だが，ここでは単方向で管理）
template <class weight_t, class flow_t> struct Edge {
ll src; // エッジ始点となる頂点
ll dst; // エッジ終点となる頂点
weight_t weight; // 重み
flow_t cap;
Edge() : src(0), dst(0), weight(0) {}
Edge(ll src, ll dst, weight_t weight) : src(src), dst(dst), weight(weight) {}
Edge(ll src, ll dst, weight_t weight, flow_t cap)
: src(src), dst(dst), weight(weight), cap(cap) {}
// Edge 標準出力
friend ostream &operator<<(ostream &os, Edge &edge) {
os << "(" << edge.src << " -> " << edge.dst << ", " << edge.weight << ")";
return os;
}
};
// 同じ頂点を始点とするエッジ集合
template <class weight_t, class flow_t>
class Node : public vc<Edge<weight_t, flow_t>> {
public:
ll idx;
Node() : vc<Edge<weight_t, flow_t>>() {}
// void add(int a, int b, weight_t w, flow_t cap) { this->emplace_back(a, b,
// w, cap); };
};
// graph[i] := 頂点 i を始点とするエッジ集合
template <class weight_t, class flow_t>
class Graph : public vc<Node<weight_t, flow_t>> {
public:
Graph() : vc<Node<weight_t, flow_t>>() {}
Graph(int n) : vc<Node<weight_t, flow_t>>(n) {
REP(i, 0, n)(*this)[i].idx = i;
}
// 単方向
void add_arc(int a, int b, weight_t w = 1, flow_t cap = 1) {
(*this)[a].emplace_back(a, b, w, cap);
}
// 双方向
void add_edge(int a, int b, weight_t w = 1, flow_t cap = 1) {
add_arc(a, b, w, cap), add_arc(b, a, w, cap);
}
};
// using Array = vc<Weight>;
// using Matrix = vc<Array>;
/* #endregion */
// Problem
void solve() {
ll n, m;
cin >> n >> m;
vll a(m), b(m);
REP(i, 0, m) {
cin >> a[i] >> b[i];
a[i]--, b[i]--;
}
Graph<ll, ll> graph(n);
REP(i, 0, m) graph.add_edge(a[i], b[i]);
vll dist(n, -1);
queue<Node<ll, ll>> que; // 「訪問予定」頂点リスト
// 初期条件 (頂点 idx1 を初期頂点とする)
dist[0] = 0;
que.push(graph[0]); // 頂点 idx を「訪問予定」頂点リストに追加
// BFS 開始 (キューが空になるまで探索を行う)
while (!que.empty()) {
Node<ll, ll> current = que.front(); // キューから先頭頂点を取り出す
que.pop();
// cuerrent から辿れる頂点をすべて調べる
for (Edge<ll, ll> edge : current) {
if (dist[edge.dst] != -1)
continue; // 訪問済み (weight=1 固定なら continue してよい)
// 未訪問の頂点 nv について距離情報を更新してキューに追加する
dist[edge.dst] = edge.src;
que.push(graph[edge.dst]);
}
}
// validate
REP(i, 1, n) if (dist[i] == -1) {
yn(false);
return;
}
yn(true);
REP(i, 1, n) cout << (dist[i] + 1) << endl;
}
// entry point
int main() {
solve();
return 0;
}
| replace | 236 | 237 | 236 | 237 | 0 | |
p02679 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
#define MAX 200002
long long MOD = 1000000007;
long long MODPOW2[MAX] = {0};
void initModPow2() {
MODPOW2[0] = 1;
for (int i = 1; i < MAX; i++) {
MODPOW2[i] = (MODPOW2[i - 1] * 2) % MOD;
}
}
long long GCD(long long x, long long y) {
long long r = 0;
if (x < y)
swap(x, y);
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
// U(u個)とV(v個)が直交しているとき、どの2つも内積が0にならない選び方の数
// 余事象で考えて、2**(u+v)から内積が0になりうる選び方の数を引く
long long countUV(long long u, long long v) {
long long a = 0, b = 0, c = 0, ret = 0;
a = MODPOW2[u + v] % MOD;
b = (MODPOW2[u] - 1) % MOD;
b = (b * (MODPOW2[v] - 1)) % MOD;
ret = (a - b) % MOD;
if (ret < 0)
ret += MOD;
return ret;
}
class Tilt {
public:
long long x;
long long y;
Tilt() { x = 0, y = 0; }
Tilt(long long x, long long y) {
if (x == 0) {
this->x = 0;
this->y = 1;
} else if (y == 0) {
this->x = 1;
this->y = 0;
} else {
long p, a, b;
p = GCD(x, y);
a = x / p;
b = y / p;
if (a > 0) {
this->x = a;
this->y = b;
} else {
this->x = 0 - a;
this->y = 0 - b;
}
}
}
inline bool operator==(const Tilt &t) const {
if (x == t.x && y == t.y) {
return true;
} else {
return false;
}
}
inline bool operator!=(const Tilt &t) const { return !(this->operator==(t)); }
};
class MyHash {
public:
std::size_t operator()(const Tilt &t) const {
std::size_t h1 = std::hash<long long>{}(abs(t.x));
std::size_t h2 = std::hash<long long>{}(abs(t.y));
return h1 ^ (h2 << 1);
}
};
unordered_map<Tilt, long long, MyHash> m1, m2;
int main(int argc, char *argv[]) {
int N, M;
long long zero = 0;
cin >> N;
m1.reserve(N);
m2.reserve(N);
initModPow2();
long long ans = 1;
for (int i = 1; i <= N; i++) {
long long a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
zero++;
continue; //(0, 0)は除外するが、数えておく
}
Tilt t = Tilt(a, b);
if (m1.count(t) == 0) {
m1[t] = 1;
m2[t] = 1;
} else {
long long v = m1[t];
m1[t] = v + 1;
m2[t] = v + 1;
}
}
for (auto itr = m1.begin(); itr != m1.end(); itr++) {
if (m2.empty())
break;
long long x, y, u, v;
Tilt t = itr->first;
auto tmpitr1 = m2.find(t);
if (tmpitr1 == m2.end()) {
continue;
}
u = itr->second;
x = t.x;
y = t.y;
Tilt w = Tilt(0 - y, x); // 法線ベクトル
auto tmpitr2 = m2.find(w);
if (tmpitr2 != m2.end()) {
v = m1[w];
} else {
v = 0;
}
long long uvcnt = countUV(u, v);
ans = (ans * uvcnt) % MOD;
m2.erase(t);
m2.erase(w);
}
ans = ans + (zero % MOD) -
1; //(0, 0)は他のどの要素とも直交するので足す。まったく選ばないを引く。
ans = ans % MOD;
if (ans < 0)
ans += MOD;
cout << ans << endl;
return 0;
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
#define MAX 200002
long long MOD = 1000000007;
long long MODPOW2[MAX] = {0};
void initModPow2() {
MODPOW2[0] = 1;
for (int i = 1; i < MAX; i++) {
MODPOW2[i] = (MODPOW2[i - 1] * 2) % MOD;
}
}
long long GCD(long long x, long long y) {
long long r = 0;
if (x < y)
swap(x, y);
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
// U(u個)とV(v個)が直交しているとき、どの2つも内積が0にならない選び方の数
// 余事象で考えて、2**(u+v)から内積が0になりうる選び方の数を引く
long long countUV(long long u, long long v) {
long long a = 0, b = 0, c = 0, ret = 0;
a = MODPOW2[u + v] % MOD;
b = (MODPOW2[u] - 1) % MOD;
b = (b * (MODPOW2[v] - 1)) % MOD;
ret = (a - b) % MOD;
if (ret < 0)
ret += MOD;
return ret;
}
class Tilt {
public:
long long x;
long long y;
Tilt() { x = 0, y = 0; }
Tilt(long long x, long long y) {
if (x == 0) {
this->x = 0;
this->y = 1;
} else if (y == 0) {
this->x = 1;
this->y = 0;
} else {
long p, a, b;
p = GCD(x, y);
a = x / p;
b = y / p;
if (a > 0) {
this->x = a;
this->y = b;
} else {
this->x = 0 - a;
this->y = 0 - b;
}
}
}
inline bool operator==(const Tilt &t) const {
if (x == t.x && y == t.y) {
return true;
} else {
return false;
}
}
inline bool operator!=(const Tilt &t) const { return !(this->operator==(t)); }
};
class MyHash {
public:
std::size_t operator()(const Tilt &t) const { return (std::size_t)abs(t.x); }
};
unordered_map<Tilt, long long, MyHash> m1, m2;
int main(int argc, char *argv[]) {
int N, M;
long long zero = 0;
cin >> N;
m1.reserve(N);
m2.reserve(N);
initModPow2();
long long ans = 1;
for (int i = 1; i <= N; i++) {
long long a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
zero++;
continue; //(0, 0)は除外するが、数えておく
}
Tilt t = Tilt(a, b);
if (m1.count(t) == 0) {
m1[t] = 1;
m2[t] = 1;
} else {
long long v = m1[t];
m1[t] = v + 1;
m2[t] = v + 1;
}
}
for (auto itr = m1.begin(); itr != m1.end(); itr++) {
if (m2.empty())
break;
long long x, y, u, v;
Tilt t = itr->first;
auto tmpitr1 = m2.find(t);
if (tmpitr1 == m2.end()) {
continue;
}
u = itr->second;
x = t.x;
y = t.y;
Tilt w = Tilt(0 - y, x); // 法線ベクトル
auto tmpitr2 = m2.find(w);
if (tmpitr2 != m2.end()) {
v = m1[w];
} else {
v = 0;
}
long long uvcnt = countUV(u, v);
ans = (ans * uvcnt) % MOD;
m2.erase(t);
m2.erase(w);
}
ans = ans + (zero % MOD) -
1; //(0, 0)は他のどの要素とも直交するので足す。まったく選ばないを引く。
ans = ans % MOD;
if (ans < 0)
ans += MOD;
cout << ans << endl;
return 0;
} | replace | 94 | 99 | 94 | 95 | TLE | |
p02679 | C++ | Time Limit Exceeded | // #define TIMER_
#include <bits/stdc++.h>
using namespace std;
#define rep(i, r) for (int i = 0; i < (r); i++)
#define pb push_back
#define ALL(a) a.begin(), a.end()
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
// #define int long long
using ll = long long;
using ull = unsigned long long;
const long long mod = 1000000007;
long long pw[200200] = {1};
signed main() {
fastio;
map<pair<ll, ll>, pair<ll, ll>> chk;
for (int i = 1; i < 200200; i++)
pw[i] = (pw[i - 1] * 2) % mod;
ll z = mod - 1;
ll n;
scanf("%d", &n);
while (n--) {
ll a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
z++;
continue;
} else if (a == 0) {
chk[make_pair(0, 1)].first++;
} else if (b == 0) {
chk[make_pair(0, 1)].second++;
} else {
ll g = __gcd(abs(a), abs(b));
a /= g;
b /= g;
if (a * b > 0) {
chk[make_pair(abs(a), abs(b))].first++;
} else {
chk[make_pair(abs(b), abs(a))].second++;
}
}
}
ll r = 1;
for (auto &p : chk) {
r = r * (pw[p.second.first] + pw[p.second.second] - 1) % mod;
}
cout << (z + r) % mod << "\n";
#ifdef TIMER_
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
| // #define TIMER_
#include <bits/stdc++.h>
using namespace std;
#define rep(i, r) for (int i = 0; i < (r); i++)
#define pb push_back
#define ALL(a) a.begin(), a.end()
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
// #define int long long
using ll = long long;
using ull = unsigned long long;
const long long mod = 1000000007;
long long pw[200200] = {1};
signed main() {
fastio;
map<pair<ll, ll>, pair<ll, ll>> chk;
for (int i = 1; i < 200200; i++)
pw[i] = (pw[i - 1] * 2) % mod;
ll z = mod - 1;
int n;
cin >> n;
while (n--) {
ll a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
z++;
continue;
} else if (a == 0) {
chk[make_pair(0, 1)].first++;
} else if (b == 0) {
chk[make_pair(0, 1)].second++;
} else {
ll g = __gcd(abs(a), abs(b));
a /= g;
b /= g;
if (a * b > 0) {
chk[make_pair(abs(a), abs(b))].first++;
} else {
chk[make_pair(abs(b), abs(a))].second++;
}
}
}
ll r = 1;
for (auto &p : chk) {
r = r * (pw[p.second.first] + pw[p.second.second] - 1) % mod;
}
cout << (z + r) % mod << "\n";
#ifdef TIMER_
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
| replace | 24 | 26 | 24 | 26 | TLE | |
p02679 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (ll i = (x); i < (y); i++)
#define rrep(i, x, y) for (ll i = (ll)(y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl
#define itrdebug(x) \
cerr << #x << " "; \
for (auto &el : (x)) { \
cerr << (el) << " "; \
} \
cerr << endl
#define dassert(...) assert(__VA_ARGS__)
#else
#define debug(x)
#define itrdebug(x)
#define dassert(...)
#endif
// #define int long long
typedef long long ll;
const ll MOD = 1e9 + 7;
const long double EPS = 1e-8;
long long getGcd(long long a, long long b) {
if (a < b)
swap(a, b);
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
namespace mod {
long long pow(long long a, long long x, long long p) {
long long res = 1;
while (x > 0) {
if (x % 2 != 0) {
res = (res * a) % p;
}
a = (a * a) % p;
x /= 2;
}
return res;
}
long long inverse(long long a, long long p) {
// calculates the modular multiplicative of a mod m.
//(assuming p is prime).
return pow(a, p - 2, p);
}
long long factorial(long long a, long long p) {
long long fact = 1;
for (long long i = 2; i <= a; i++) {
fact *= i;
fact %= p;
}
return fact;
}
long long MOD = 1e9 + 7;
template <long long MOD> struct mint {
long long x;
mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint<MOD>(-x); }
mint &operator+=(const mint<MOD> a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint<MOD> a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint<MOD> a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint<MOD> a) const { return mint<MOD>(*this) += a; }
mint operator-(const mint<MOD> a) const { return mint<MOD>(*this) -= a; }
mint operator*(const mint<MOD> a) const { return mint<MOD>(*this) *= a; }
mint pow(long long t) const {
if (!t)
return 1;
mint<MOD> a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint<MOD> a) { return *this *= a.inv(); }
mint operator/(const mint<MOD> a) const { return mint<MOD>(*this) /= a; }
};
} // namespace mod
std::istream &operator>>(std::istream &is, const mod::mint<MOD> &a) {
return is >> a.x;
}
std::ostream &operator<<(std::ostream &os, const mod::mint<MOD> &a) {
return os << a.x;
}
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
return p.first ^ p.second;
}
};
void solve(long long N, std::vector<long long> A, std::vector<long long> B) {
ll abZeroCnt = 0;
unordered_map<pair<ll, ll>, ll, hash_pair> cnt;
rep(i, 0, N) {
if (A[i] == 0 && B[i] == 0) {
abZeroCnt++;
} else if (A[i] == 0) {
cnt[{1, 0}]++;
} else if (B[i] == 0) {
cnt[{-0, 1}]++;
} else {
ll a = A[i], b = B[i];
ll gcd = getGcd(abs(a), abs(b));
a /= gcd;
b /= gcd;
if (b < 0) {
a *= -1;
b *= -1;
}
cnt[{a, b}]++;
}
}
mod::mint<MOD> answer = 1;
for (const auto &el : cnt) {
ll a = el.first.first, b = el.first.second;
mod::mint<MOD> current = mod::pow(2, el.second, MOD);
auto counterpart = a > 0 ? pair<ll, ll>{-b, a} : pair<ll, ll>{b, -a};
if (cnt.find(counterpart) != cnt.end()) {
current += mod::pow(2, cnt[counterpart], MOD) - 1;
cnt.erase(counterpart);
}
answer *= current;
}
answer += abZeroCnt - 1;
cout << answer << endl;
}
signed main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
std::vector<long long> B(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
scanf("%lld", &B[i]);
}
solve(N, std::move(A), std::move(B));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (ll i = (x); i < (y); i++)
#define rrep(i, x, y) for (ll i = (ll)(y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl
#define itrdebug(x) \
cerr << #x << " "; \
for (auto &el : (x)) { \
cerr << (el) << " "; \
} \
cerr << endl
#define dassert(...) assert(__VA_ARGS__)
#else
#define debug(x)
#define itrdebug(x)
#define dassert(...)
#endif
// #define int long long
typedef long long ll;
const ll MOD = 1e9 + 7;
const long double EPS = 1e-8;
long long getGcd(long long a, long long b) {
if (a < b)
swap(a, b);
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
namespace mod {
long long pow(long long a, long long x, long long p) {
long long res = 1;
while (x > 0) {
if (x % 2 != 0) {
res = (res * a) % p;
}
a = (a * a) % p;
x /= 2;
}
return res;
}
long long inverse(long long a, long long p) {
// calculates the modular multiplicative of a mod m.
//(assuming p is prime).
return pow(a, p - 2, p);
}
long long factorial(long long a, long long p) {
long long fact = 1;
for (long long i = 2; i <= a; i++) {
fact *= i;
fact %= p;
}
return fact;
}
long long MOD = 1e9 + 7;
template <long long MOD> struct mint {
long long x;
mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint<MOD>(-x); }
mint &operator+=(const mint<MOD> a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint<MOD> a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint<MOD> a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint<MOD> a) const { return mint<MOD>(*this) += a; }
mint operator-(const mint<MOD> a) const { return mint<MOD>(*this) -= a; }
mint operator*(const mint<MOD> a) const { return mint<MOD>(*this) *= a; }
mint pow(long long t) const {
if (!t)
return 1;
mint<MOD> a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint<MOD> a) { return *this *= a.inv(); }
mint operator/(const mint<MOD> a) const { return mint<MOD>(*this) /= a; }
};
} // namespace mod
std::istream &operator>>(std::istream &is, const mod::mint<MOD> &a) {
return is >> a.x;
}
std::ostream &operator<<(std::ostream &os, const mod::mint<MOD> &a) {
return os << a.x;
}
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
return p.first ^ p.second;
}
};
void solve(long long N, std::vector<long long> A, std::vector<long long> B) {
ll abZeroCnt = 0;
// unordered_map<pair<ll, ll>, ll, hash_pair> cnt;
map<pair<ll, ll>, ll> cnt;
rep(i, 0, N) {
if (A[i] == 0 && B[i] == 0) {
abZeroCnt++;
} else if (A[i] == 0) {
cnt[{1, 0}]++;
} else if (B[i] == 0) {
cnt[{-0, 1}]++;
} else {
ll a = A[i], b = B[i];
ll gcd = getGcd(abs(a), abs(b));
a /= gcd;
b /= gcd;
if (b < 0) {
a *= -1;
b *= -1;
}
cnt[{a, b}]++;
}
}
mod::mint<MOD> answer = 1;
for (const auto &el : cnt) {
ll a = el.first.first, b = el.first.second;
mod::mint<MOD> current = mod::pow(2, el.second, MOD);
auto counterpart = a > 0 ? pair<ll, ll>{-b, a} : pair<ll, ll>{b, -a};
if (cnt.find(counterpart) != cnt.end()) {
current += mod::pow(2, cnt[counterpart], MOD) - 1;
cnt.erase(counterpart);
}
answer *= current;
}
answer += abZeroCnt - 1;
cout << answer << endl;
}
signed main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
std::vector<long long> B(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
scanf("%lld", &B[i]);
}
solve(N, std::move(A), std::move(B));
return 0;
}
| replace | 122 | 123 | 122 | 124 | TLE | |
p02679 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
constexpr auto MOD = 1000000007LL;
// a^n mod m を計算する(繰り返し二乗法,二分累乗法:O(logn)) (再帰版)
long long modpow(long long a, long long n) {
return n ? modpow(a * a % MOD, n / 2) * (n % 2 ? a : 1) % MOD : 1;
}
// // MOD考慮power関数
// inline long long modpow(long long a,long long n)
// {
// long long ret=1;
// for(long long i=0;i<n;i++){
// ret*=a;
// ret%=MOD;
// }
// return ret;
// }
// gcd関数
inline long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
long long zero = 0;
map<pair<long long, long long>, vector<int>> bad;
while (n--) {
long long x, y;
cin >> x >> y;
// 両方0ならカウントしてcontinue
if (x == 0 && y == 0) {
zero++;
continue;
}
// 既約分数計算
long long g = gcd(x, y);
x /= g;
y /= g;
// 符号情報を統一
if (y < 0)
x = -x, y = -y;
if (y == 0 && x < 0)
x = -x, y = -y;
int rotate90 = (x <= 0);
if (rotate90) {
swap(x, y);
y = -y;
}
if (bad.count({x, y}) == 0)
bad[{x, y}] = {0, 0};
bad[{x, y}][rotate90]++;
}
// 組み合わせ計算
long long ans = 1;
for (auto x : bad) {
vector<int> c = x.second;
ans *= (modpow(2, c[0]) - 1) + (modpow(2, c[1]) - 1) + 1;
ans %= MOD;
}
ans += zero - 1;
ans = (ans + MOD) % MOD;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
constexpr auto MOD = 1000000007LL;
// a^n mod m を計算する(繰り返し二乗法,二分累乗法:O(logn)) (再帰版)
long long modpow(long long a, long long n) {
return n ? modpow(a * a % MOD, n / 2) * (n % 2 ? a : 1) % MOD : 1;
}
// // MOD考慮power関数
// inline long long modpow(long long a,long long n)
// {
// long long ret=1;
// for(long long i=0;i<n;i++){
// ret*=a;
// ret%=MOD;
// }
// return ret;
// }
// gcd関数
// inline long long gcd(long long a, long long b)
// {
// if(a<b) swap(a,b);
// if(a%b==0) return b;
// else return gcd(b,a%b);
// }
int main() {
int n;
cin >> n;
long long zero = 0;
map<pair<long long, long long>, vector<int>> bad;
while (n--) {
long long x, y;
cin >> x >> y;
// 両方0ならカウントしてcontinue
if (x == 0 && y == 0) {
zero++;
continue;
}
// 既約分数計算
long long g = gcd(x, y);
x /= g;
y /= g;
// 符号情報を統一
if (y < 0)
x = -x, y = -y;
if (y == 0 && x < 0)
x = -x, y = -y;
int rotate90 = (x <= 0);
if (rotate90) {
swap(x, y);
y = -y;
}
if (bad.count({x, y}) == 0)
bad[{x, y}] = {0, 0};
bad[{x, y}][rotate90]++;
}
// 組み合わせ計算
long long ans = 1;
for (auto x : bad) {
vector<int> c = x.second;
ans *= (modpow(2, c[0]) - 1) + (modpow(2, c[1]) - 1) + 1;
ans %= MOD;
}
ans += zero - 1;
ans = (ans + MOD) % MOD;
cout << ans << endl;
}
| replace | 23 | 31 | 23 | 29 | 0 | |
p02679 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll modpow(ll x, ll n) {
ll res = 1;
ll mul = x;
while (n) {
if (n % 2)
res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
ll modinv(ll x, ll n) { return modpow(x, n - 2); }
ll a[100010];
ll b[100010];
int main() {
ll n, cnt0 = 0;
cin >> n;
rep(i, n) cin >> a[i] >> b[i];
map<P, ll> mp;
vector<P> lp;
rep(i, n) {
if (a[i] == 0 && b[i] == 0)
cnt0++;
else if (a[i] == 0)
mp[{0, 1}]++, lp.push_back({0, 1});
else if (b[i] == 0)
mp[{1, 0}]++, lp.push_back({1, 0});
else if (b[i] > 0) {
ll g = __gcd(abs(a[i]), abs(b[i]));
mp[{a[i] / g, b[i] / g}]++;
lp.push_back({a[i] / g, b[i] / g});
} else {
ll g = __gcd(abs(a[i]), abs(b[i]));
mp[{-a[i] / g, -b[i] / g}]++;
lp.push_back({-a[i] / g, -b[i] / g});
}
}
ll ans = 1;
map<P, ll> check;
ll m = lp.size();
rep(i, m) {
ll x = lp[i].first;
ll y = lp[i].second;
ll c = mp[lp[i]];
if (check[lp[i]] > 0)
continue;
check[lp[i]]++;
ll d = 0, tmp = 1;
if (x > 0 && y > 0) {
d = mp[{-y, x}];
tmp = modpow(2, c) + modpow(2, d) - 1 + MOD;
check[{-y, x}]++;
} else if (x < 0 || y < 0) {
d = mp[{y, -x}];
tmp = modpow(2, c) + modpow(2, d) - 1 + MOD;
check[{y, -x}]++;
} else if (x == 0 || y == 0) {
d = mp[{y, x}];
tmp = modpow(2, c) + modpow(2, d) - 1 + MOD;
check[{y, x}]++;
}
tmp %= MOD;
ans *= tmp;
ans %= MOD;
}
ans = (ans + cnt0 - 1 + MOD) % MOD;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll modpow(ll x, ll n) {
ll res = 1;
ll mul = x;
while (n) {
if (n % 2)
res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
ll modinv(ll x, ll n) { return modpow(x, n - 2); }
ll a[200010];
ll b[200010];
int main() {
ll n, cnt0 = 0;
cin >> n;
rep(i, n) cin >> a[i] >> b[i];
map<P, ll> mp;
vector<P> lp;
rep(i, n) {
if (a[i] == 0 && b[i] == 0)
cnt0++;
else if (a[i] == 0)
mp[{0, 1}]++, lp.push_back({0, 1});
else if (b[i] == 0)
mp[{1, 0}]++, lp.push_back({1, 0});
else if (b[i] > 0) {
ll g = __gcd(abs(a[i]), abs(b[i]));
mp[{a[i] / g, b[i] / g}]++;
lp.push_back({a[i] / g, b[i] / g});
} else {
ll g = __gcd(abs(a[i]), abs(b[i]));
mp[{-a[i] / g, -b[i] / g}]++;
lp.push_back({-a[i] / g, -b[i] / g});
}
}
ll ans = 1;
map<P, ll> check;
ll m = lp.size();
rep(i, m) {
ll x = lp[i].first;
ll y = lp[i].second;
ll c = mp[lp[i]];
if (check[lp[i]] > 0)
continue;
check[lp[i]]++;
ll d = 0, tmp = 1;
if (x > 0 && y > 0) {
d = mp[{-y, x}];
tmp = modpow(2, c) + modpow(2, d) - 1 + MOD;
check[{-y, x}]++;
} else if (x < 0 || y < 0) {
d = mp[{y, -x}];
tmp = modpow(2, c) + modpow(2, d) - 1 + MOD;
check[{y, -x}]++;
} else if (x == 0 || y == 0) {
d = mp[{y, x}];
tmp = modpow(2, c) + modpow(2, d) - 1 + MOD;
check[{y, x}]++;
}
tmp %= MOD;
ans *= tmp;
ans %= MOD;
}
ans = (ans + cnt0 - 1 + MOD) % MOD;
cout << ans << endl;
return 0;
} | replace | 26 | 28 | 26 | 28 | 0 | |
p02679 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long gcd(long long a, long long b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main(int, char **) {
int n;
cin >> n;
long long cnt0 = mod - 1;
map<pair<long long, long long>, pair<long long, long long>> cnt;
long long pw[202020] = {1};
for (int i = 1; i < 202020; i++)
pw[i] = (pw[i - 1] * 2) % mod;
for (int i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
cnt0++;
continue;
}
if (make_pair(a, b) < make_pair(0ll, 0ll))
a = -a, b = -b;
long long g = gcd(abs(a), abs(b));
a /= g;
b /= g;
if (b > 0)
cnt[{a, b}].first++;
else
cnt[{-b, a}].second++;
}
long long ret = 1;
for (auto &c : cnt) {
ret = ret * (pw[c.second.first] + pw[c.second.second] - 1) % mod;
}
cout << (ret + cnt0) % mod << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main(int, char **) {
int n;
cin >> n;
long long cnt0 = mod - 1;
map<pair<long long, long long>, pair<long long, long long>> cnt;
long long pw[202020] = {1};
for (int i = 1; i < 202020; i++)
pw[i] = (pw[i - 1] * 2) % mod;
for (int i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
cnt0++;
continue;
}
if (make_pair(a, b) < make_pair(0ll, 0ll))
a = -a, b = -b;
long long g = gcd(abs(a), abs(b));
a /= g;
b /= g;
if (b > 0)
cnt[{a, b}].first++;
else
cnt[{-b, a}].second++;
}
long long ret = 1;
for (auto &c : cnt) {
ret = ret * (pw[c.second.first] + pw[c.second.second] - 1) % mod;
}
cout << (ret + cnt0) % mod << endl;
return 0;
}
| replace | 6 | 13 | 6 | 7 | 0 | |
p02679 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)-1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr long double PI = 3.1415926535897932384626433832795028L;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
while (b) {
swap(a %= b, b);
}
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <typename T> void fin(T mes) {
cout << mes << endl;
exit(0);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
os << "{";
for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
os << *itr << (next(itr) != rhs.end() ? ", " : "");
}
os << "}";
return os;
}
struct setup {
static constexpr int PREC = 20;
setup() {
cout << fixed << setprecision(PREC);
cerr << fixed << setprecision(PREC);
};
} setup;
template <int MOD = 1000000007> struct mod_int {
int val;
mod_int(long long val_ = 0) : val(val_ % MOD) {
if (val < 0) {
val += MOD;
}
}
bool operator==(const mod_int &rhs) const { return val == rhs.val; }
bool operator!=(const mod_int &rhs) const {
return std::rel_ops::operator!=(*this, rhs);
}
mod_int &operator+=(const mod_int &rhs) {
if ((val += rhs.val) >= MOD) {
val -= MOD;
}
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((val += MOD - rhs.val) >= MOD) {
val -= MOD;
}
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
val = (int)((long long)val * rhs.val % MOD);
return *this;
}
mod_int &operator/=(const mod_int &rhs) { return *this *= rhs.inv(); }
mod_int operator+() const { return *this; }
mod_int operator-() const { return -val; }
mod_int operator++() { return *this += 1; }
mod_int operator--() { return *this -= 1; }
mod_int operator++(signed) {
const mod_int ret(*this);
++*this;
return ret;
}
mod_int operator--(signed) {
const mod_int ret(*this);
--*this;
return ret;
}
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
mod_int inv() const {
int a = val, b = MOD, x = 1, u = 0;
while (b) {
int t = a / b;
std::swap(a -= t * b, b);
std::swap(x -= t * u, u);
}
return x;
}
mod_int pow(long long n) const {
if (n < 0) {
return pow(-n).inv();
}
mod_int ret = 1, mul = *this;
while (n) {
if (n & 1) {
ret *= mul;
}
mul *= mul;
n >>= 1;
}
return ret;
}
friend std::istream &operator>>(std::istream &is, mod_int &rhs) {
long long v;
is >> v;
rhs = v;
return is;
}
friend std::ostream &operator<<(std::ostream &os, const mod_int &rhs) {
return os << rhs.val;
}
struct combination {
std::vector<mod_int> fact{1, 1}, f_inv{1, 1}, inv{0, 1};
void calc(int n) {
while (fact.size() <= n) {
int i = fact.size();
fact.push_back(fact[i - 1] * i);
inv.push_back(-inv[MOD % i] * (MOD / i));
f_inv.push_back(f_inv[i - 1] * inv[i]);
}
}
mod_int P(int n, int r) {
return r < 0 || n < r ? 0 : (calc(n), fact[n] * f_inv[n - r]);
}
mod_int C(int n, int r) {
return r < 0 || n < r ? 0 : (calc(n), fact[n] * f_inv[r] * f_inv[n - r]);
}
mod_int H(int n, int r) { return C(n + r - 1, r); }
};
};
signed main() {
int N;
cin >> N;
vint A(N), B(N);
rep(i, N) { cin >> A[i] >> B[i]; }
using mint = mod_int<>;
using m0 = mod_int<>;
using m1 = mod_int<998244353>;
map<pint, int> mp;
int acnt = 0, bcnt = 0, xcnt = 0;
rep(i, N) {
if (A[i] == 0 && B[i] == 0) {
xcnt++;
continue;
}
if (A[i] == 0) {
acnt++;
continue;
}
if (B[i] == 0) {
bcnt++;
continue;
}
m0 cur0 = m0(A[i]) / B[i];
m1 cur1 = m1(A[i]) / B[i];
mp[{cur0.val, cur1.val}]++;
}
set<pint> st;
mint ans = 1;
for (auto p : mp) {
m0 a0 = p.first.first;
m0 b0 = m0(-1) / a0;
m1 a1 = p.first.second;
m1 b1 = m1(-1) / a1;
if (st.count({a0.val, a1.val}) != 0) {
continue;
}
st.insert({b0.val, b1.val});
int ca = mp[{a0.val, a1.val}];
int cb = mp[{b0.val, b1.val}];
dump(ca), dump(cb);
ans *= mint(2).pow(ca) + mint(2).pow(cb) - 1;
}
ans *= mint(2).pow(acnt) + mint(2).pow(bcnt) - 1;
ans += xcnt;
cout << ans - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)-1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr long double PI = 3.1415926535897932384626433832795028L;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
while (b) {
swap(a %= b, b);
}
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <typename T> void fin(T mes) {
cout << mes << endl;
exit(0);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
os << "{";
for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
os << *itr << (next(itr) != rhs.end() ? ", " : "");
}
os << "}";
return os;
}
struct setup {
static constexpr int PREC = 20;
setup() {
cout << fixed << setprecision(PREC);
cerr << fixed << setprecision(PREC);
};
} setup;
template <int MOD = 1000000007> struct mod_int {
int val;
mod_int(long long val_ = 0) : val(val_ % MOD) {
if (val < 0) {
val += MOD;
}
}
bool operator==(const mod_int &rhs) const { return val == rhs.val; }
bool operator!=(const mod_int &rhs) const {
return std::rel_ops::operator!=(*this, rhs);
}
mod_int &operator+=(const mod_int &rhs) {
if ((val += rhs.val) >= MOD) {
val -= MOD;
}
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((val += MOD - rhs.val) >= MOD) {
val -= MOD;
}
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
val = (int)((long long)val * rhs.val % MOD);
return *this;
}
mod_int &operator/=(const mod_int &rhs) { return *this *= rhs.inv(); }
mod_int operator+() const { return *this; }
mod_int operator-() const { return -val; }
mod_int operator++() { return *this += 1; }
mod_int operator--() { return *this -= 1; }
mod_int operator++(signed) {
const mod_int ret(*this);
++*this;
return ret;
}
mod_int operator--(signed) {
const mod_int ret(*this);
--*this;
return ret;
}
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
mod_int inv() const {
int a = val, b = MOD, x = 1, u = 0;
while (b) {
int t = a / b;
std::swap(a -= t * b, b);
std::swap(x -= t * u, u);
}
return x;
}
mod_int pow(long long n) const {
if (n < 0) {
return pow(-n).inv();
}
mod_int ret = 1, mul = *this;
while (n) {
if (n & 1) {
ret *= mul;
}
mul *= mul;
n >>= 1;
}
return ret;
}
friend std::istream &operator>>(std::istream &is, mod_int &rhs) {
long long v;
is >> v;
rhs = v;
return is;
}
friend std::ostream &operator<<(std::ostream &os, const mod_int &rhs) {
return os << rhs.val;
}
struct combination {
std::vector<mod_int> fact{1, 1}, f_inv{1, 1}, inv{0, 1};
void calc(int n) {
while (fact.size() <= n) {
int i = fact.size();
fact.push_back(fact[i - 1] * i);
inv.push_back(-inv[MOD % i] * (MOD / i));
f_inv.push_back(f_inv[i - 1] * inv[i]);
}
}
mod_int P(int n, int r) {
return r < 0 || n < r ? 0 : (calc(n), fact[n] * f_inv[n - r]);
}
mod_int C(int n, int r) {
return r < 0 || n < r ? 0 : (calc(n), fact[n] * f_inv[r] * f_inv[n - r]);
}
mod_int H(int n, int r) { return C(n + r - 1, r); }
};
};
signed main() {
int N;
cin >> N;
vint A(N), B(N);
rep(i, N) { cin >> A[i] >> B[i]; }
using mint = mod_int<>;
using m0 = mod_int<>;
using m1 = mod_int<998244353>;
map<pint, int> mp;
int acnt = 0, bcnt = 0, xcnt = 0;
rep(i, N) {
if (A[i] == 0 && B[i] == 0) {
xcnt++;
continue;
}
if (A[i] == 0) {
acnt++;
continue;
}
if (B[i] == 0) {
bcnt++;
continue;
}
m0 cur0 = m0(A[i]) / B[i];
m1 cur1 = m1(A[i]) / B[i];
mp[{cur0.val, cur1.val}]++;
}
set<pint> st;
mint ans = 1;
for (auto p : mp) {
m0 a0 = p.first.first;
m0 b0 = m0(-1) / a0;
m1 a1 = p.first.second;
m1 b1 = m1(-1) / a1;
if (st.count({a0.val, a1.val}) != 0) {
continue;
}
st.insert({b0.val, b1.val});
int ca = mp[{a0.val, a1.val}];
int cb = mp[{b0.val, b1.val}];
ans *= mint(2).pow(ca) + mint(2).pow(cb) - 1;
}
ans *= mint(2).pow(acnt) + mint(2).pow(bcnt) - 1;
ans += xcnt;
cout << ans - 1 << endl;
}
| delete | 203 | 204 | 203 | 203 | TLE | |
p02679 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long pow(long long a, long long b, long long mod) {
if (b == 0) {
return 1;
} else {
if (b % 2 == 0) {
return pow(a * a % mod, b / 2, mod);
} else {
return pow(a * a % mod, b / 2, mod) * a % mod;
}
}
}
long long gcd(long long a, long long b) {
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int N;
cin >> N;
long long a, b, g;
long long mod = 1000000007;
map<pair<long long, long long>, pair<int, int>> m;
int z = 0;
for (int i = 0; i < N; i++) {
cin >> a >> b;
if (a == 0 && b == 0) {
z++;
} else if (a > 0 && b > 0) {
g = gcd(a, b);
m[{a / g, b / g}].first++;
} else if (a > 0) {
g = gcd(a, -b);
m[{-b / g, a / g}].second++;
} else if (b > 0) {
g = gcd(-a, b);
m[{b / g, -a / g}].second++;
} else {
g = gcd(-a, -b);
m[{-a / g, -b / g}].first++;
}
}
long long ans = 1;
long long tmp;
for (auto p : m) {
// cout<<p.second.first<<" "<<p.second.second<<endl;
tmp = pow(2, p.second.first, mod);
tmp += pow(2, p.second.second, mod);
tmp--;
tmp %= mod;
ans *= tmp;
ans %= mod;
}
ans--;
ans += mod;
ans %= mod;
ans += z;
ans %= mod;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long pow(long long a, long long b, long long mod) {
if (b == 0) {
return 1;
} else {
if (b % 2 == 0) {
return pow(a * a % mod, b / 2, mod);
} else {
return pow(a * a % mod, b / 2, mod) * a % mod;
}
}
}
long long gcd(long long a, long long b) {
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int N;
cin >> N;
long long a, b, g;
long long mod = 1000000007;
map<pair<long long, long long>, pair<int, int>> m;
int z = 0;
for (int i = 0; i < N; i++) {
cin >> a >> b;
if (a == 0 && b == 0) {
z++;
} else if (a == 0) {
m[{0, 1}].first++;
} else if (b == 0) {
m[{0, 1}].second++;
} else if (a > 0 && b > 0) {
g = gcd(a, b);
m[{a / g, b / g}].first++;
} else if (a > 0) {
g = gcd(a, -b);
m[{-b / g, a / g}].second++;
} else if (b > 0) {
g = gcd(-a, b);
m[{b / g, -a / g}].second++;
} else {
g = gcd(-a, -b);
m[{-a / g, -b / g}].first++;
}
}
long long ans = 1;
long long tmp;
for (auto p : m) {
// cout<<p.second.first<<" "<<p.second.second<<endl;
tmp = pow(2, p.second.first, mod);
tmp += pow(2, p.second.second, mod);
tmp--;
tmp %= mod;
ans *= tmp;
ans %= mod;
}
ans--;
ans += mod;
ans %= mod;
ans += z;
ans %= mod;
cout << ans << endl;
return 0;
} | insert | 42 | 42 | 42 | 46 | 0 | |
p02679 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <utility>
using namespace std;
const long long MOD = 1000000007;
long long euclid_gcd(long long a, long long b) {
if (a < b) {
return euclid_gcd(b, a);
}
if (b == 0) {
return a;
}
long long r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// c^n
long long modpow(long long c, long long n) {
long long ret = 1;
while (n != 0) {
if (n & 1) {
ret = ret * c % MOD;
}
c = c * c % MOD;
n /= 2;
}
return ret;
}
int main() {
long long N;
cin >> N;
long long zero_zero = 0, l_zero = 0, r_zero = 0;
map<pair<long long, long long>, long long> M;
for (int i = 0; i < N; i++) {
long long A, B;
cin >> A >> B;
if (A == 0 && B == 0) {
zero_zero++;
} else if (A == 0) {
l_zero++;
} else if (B == 0) {
r_zero++;
} else {
if (B == 0) {
M[make_pair(1, 0)]++;
} else if (B > 0) {
long long gcd = euclid_gcd(abs(A), abs(B));
A /= gcd;
B /= gcd;
M[make_pair(A, B)]++;
} else {
long long gcd = euclid_gcd(abs(A), abs(B));
A /= -gcd;
B /= -gcd;
M[make_pair(A, B)]++;
}
}
}
long long ans = 1;
if (l_zero != 0 || r_zero != 0) {
ans *= (modpow(2, l_zero) + modpow(2, r_zero) - 1 + MOD) % MOD;
}
for (auto m : M) {
long long n = M[m.first];
if (n == 0) {
continue;
}
auto counterpart = make_pair(m.first.second, m.first.first);
if (counterpart.second < 0) {
counterpart.second *= -1;
} else {
counterpart.first *= -1;
}
cerr << "(" << m.first.first << ", " << m.first.second << ", " << m.second
<< "), (" << counterpart.first << ", " << counterpart.second << ")"
<< endl;
long long n_counterpart = M[counterpart];
M[counterpart] = 0;
if (n_counterpart != 0) {
ans *= ((modpow(2, n) + modpow(2, n_counterpart)) % MOD - 1 + MOD) % MOD;
ans %= MOD;
} else {
ans *= modpow(2, n);
ans %= MOD;
}
}
cout << (ans + zero_zero - 1 + MOD) % MOD << endl;
return 0;
}
| #include <iostream>
#include <map>
#include <utility>
using namespace std;
const long long MOD = 1000000007;
long long euclid_gcd(long long a, long long b) {
if (a < b) {
return euclid_gcd(b, a);
}
if (b == 0) {
return a;
}
long long r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// c^n
long long modpow(long long c, long long n) {
long long ret = 1;
while (n != 0) {
if (n & 1) {
ret = ret * c % MOD;
}
c = c * c % MOD;
n /= 2;
}
return ret;
}
int main() {
long long N;
cin >> N;
long long zero_zero = 0, l_zero = 0, r_zero = 0;
map<pair<long long, long long>, long long> M;
for (int i = 0; i < N; i++) {
long long A, B;
cin >> A >> B;
if (A == 0 && B == 0) {
zero_zero++;
} else if (A == 0) {
l_zero++;
} else if (B == 0) {
r_zero++;
} else {
if (B == 0) {
M[make_pair(1, 0)]++;
} else if (B > 0) {
long long gcd = euclid_gcd(abs(A), abs(B));
A /= gcd;
B /= gcd;
M[make_pair(A, B)]++;
} else {
long long gcd = euclid_gcd(abs(A), abs(B));
A /= -gcd;
B /= -gcd;
M[make_pair(A, B)]++;
}
}
}
long long ans = 1;
if (l_zero != 0 || r_zero != 0) {
ans *= (modpow(2, l_zero) + modpow(2, r_zero) - 1 + MOD) % MOD;
}
for (auto m : M) {
long long n = M[m.first];
if (n == 0) {
continue;
}
auto counterpart = make_pair(m.first.second, m.first.first);
if (counterpart.second < 0) {
counterpart.second *= -1;
} else {
counterpart.first *= -1;
}
long long n_counterpart = M[counterpart];
M[counterpart] = 0;
if (n_counterpart != 0) {
ans *= ((modpow(2, n) + modpow(2, n_counterpart)) % MOD - 1 + MOD) % MOD;
ans %= MOD;
} else {
ans *= modpow(2, n);
ans %= MOD;
}
}
cout << (ans + zero_zero - 1 + MOD) % MOD << endl;
return 0;
}
| delete | 86 | 90 | 86 | 86 | TLE | |
p02679 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (lint)(n); i++)
#define REP(i, n) for (int i = 1; i <= (lint)(n); i++)
#define all(V) V.begin(), V.end()
typedef long long lint;
typedef std::pair<lint, lint> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = 1e-9;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b;
b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
lint mypow(lint a, lint b) {
if (!b)
return 1;
if (b & 1)
return mypow(a, b - 1) * a;
lint memo = mypow(a, b >> 1);
return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
lint memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
template <typename T> void printArray(std::vector<T> &vec) {
rep(i, vec.size() - 1) std::cout << vec[i] << " ";
std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
T rprev = r;
rprev--;
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
std::string to_string(std::vector<int> &vec) {
std::string res = "[";
rep(i, vec.size() - 1) res += std::to_string(vec[i]) + ", ";
res += std::to_string(vec.back()) + "]";
return res;
}
class Rational {
public:
lint num, den;
Rational() : num(0), den(1) {}
Rational(lint p) : num(p), den(1) {}
Rational(lint p, lint q) : num(p), den(q) { reduce(); }
void reduce() {
if (den < 0) {
num = -num;
den = -den;
}
if (num == 0)
den = 1;
else {
lint r = gcd(std::abs(num), std::abs(den));
num /= r;
den /= r;
}
}
inline bool operator<(const Rational &rhs) const {
return num * rhs.den < rhs.num * den;
}
inline bool operator==(const Rational &rhs) const {
return num == rhs.num && den == rhs.den;
}
inline bool operator>(const Rational &rhs) const {
return num * rhs.den > rhs.num * den;
}
inline Rational &operator+=(Rational rhs) {
lint r = lcm(this->den, rhs.den);
num *= r / this->den;
rhs.num *= r / rhs.den;
den = rhs.den = r;
num += rhs.num;
reduce();
return *this;
}
inline Rational operator-() { return Rational(-num, den); }
inline Rational &operator-=(Rational rhs) {
lint r = lcm(this->den, rhs.den);
num *= r / this->den;
rhs.num *= r / rhs.den;
den = rhs.den = r;
num -= rhs.num;
reduce();
return *this;
}
inline Rational &operator*=(const Rational &rhs) {
num *= rhs.num;
den *= rhs.den;
reduce();
return *this;
}
inline Rational &operator/=(const Rational &rhs) {
num *= rhs.den;
den *= rhs.num;
reduce();
return *this;
}
template <typename T> Rational operator+(const T &rhs) const {
return Rational(*this) += rhs;
}
template <typename T> Rational &operator+=(const T &rhs) {
return operator+=(Rational(rhs));
}
template <typename T> Rational operator-(const T &rhs) const {
return Rational(*this) -= rhs;
}
template <typename T> Rational &operator-=(const T &rhs) {
return operator-=(Rational(rhs));
}
template <typename T> Rational operator*(const T &rhs) const {
return Rational(*this) *= rhs;
}
template <typename T> Rational &operator*=(const T &rhs) {
return operator*=(Rational(rhs));
}
template <typename T> Rational operator/(const T &rhs) const {
return Rational(*this) /= rhs;
}
template <typename T> Rational &operator/=(const T &rhs) {
return operator/=(Rational(rhs));
}
Rational inv() const { return Rational(den, num); }
};
std::ostream &operator<<(std::ostream &ofs, const Rational &x) {
ofs << x.num << "/" << x.den;
return ofs;
}
template <unsigned int modulo = 1000000007> class ModInt {
lint value;
public:
ModInt() : value(0) {}
template <typename T> ModInt(T value = 0) : value(value) {
if (value < 0)
value = -(lint)(-value % modulo) + modulo;
this->value = value % modulo;
}
inline operator int() const { return value; }
inline ModInt &operator+=(const ModInt &x) {
value += x.value;
if (value >= modulo)
value -= modulo;
return *this;
}
inline ModInt &operator++() {
if (value == modulo - 1)
value = 0;
else
value++;
return *this;
}
inline ModInt operator-() const { return ModInt(0) -= *this; }
inline ModInt &operator-=(const ModInt &x) {
value -= x.value;
if (value < 0)
value += modulo;
return *this;
}
inline ModInt &operator--() {
if (value == 0)
value = modulo - 1;
else
value--;
return *this;
}
inline ModInt &operator*=(const ModInt &x) {
value = value * x.value % modulo;
return *this;
}
inline ModInt &operator/=(ModInt rhs) {
int exp = modulo - 2;
while (exp) {
if (exp & 1)
*this *= rhs;
rhs *= rhs;
exp >>= 1;
}
return *this;
}
template <typename T> ModInt operator+(const T &rhs) const {
return ModInt(*this) += rhs;
}
template <typename T> ModInt &operator+=(const T &rhs) {
return operator+=(ModInt(rhs));
}
template <typename T> ModInt operator-(const T &rhs) const {
return ModInt(*this) -= rhs;
}
template <typename T> ModInt &operator-=(const T &rhs) {
return operator-=(ModInt(rhs));
}
template <typename T> ModInt operator*(const T &rhs) const {
return ModInt(*this) *= rhs;
}
template <typename T> ModInt &operator*=(const T &rhs) {
return operator*=(ModInt(rhs));
}
template <typename T> ModInt operator/(const T &rhs) const {
return ModInt(*this) /= rhs;
}
template <typename T> ModInt &operator/=(const T &rhs) {
return operator/=(ModInt(rhs));
}
};
template <unsigned int T>
std::istream &operator>>(std::istream &ist, ModInt<T> &x) {
lint a;
ist >> a;
x = a;
return ist;
}
int n;
int a0, b0, both0;
class myhash {
public:
lint operator()(const Rational &r) const {
return (r.num + (r.num >> 6) + 0x19f7e5) ^
(r.den + (r.den >> 6) + 0x19f7e5);
}
};
std::unordered_map<Rational, int, myhash> mp;
std::unordered_set<Rational, myhash> d;
int main() {
std::cin >> n;
rep(i, n) {
lint a, b;
std::cin >> a >> b;
if (a == 0 && b == 0)
both0++;
else if (a == 0)
a0++;
else if (b == 0)
b0++;
else
mp[Rational(a, b)]++;
}
ModInt<> ans = 1;
std::vector<Rational> vec;
for (const auto &i : mp) {
if (d.find(i.first) != d.end())
continue;
vec.emplace_back(i.first);
d.insert(i.first);
d.insert(-i.first.inv());
}
for (const Rational &i : vec) {
ans *=
modpow(2, mp[i], 1000000007) + modpow(2, mp[-i.inv()], 1000000007) - 1;
}
ans *= modpow(2, a0, 1000000007) + modpow(2, b0, 1000000007) - 1;
ans += both0;
ans -= 1;
std::cout << ans << std::endl;
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (lint)(n); i++)
#define REP(i, n) for (int i = 1; i <= (lint)(n); i++)
#define all(V) V.begin(), V.end()
typedef long long lint;
typedef std::pair<lint, lint> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = 1e-9;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b;
b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
lint mypow(lint a, lint b) {
if (!b)
return 1;
if (b & 1)
return mypow(a, b - 1) * a;
lint memo = mypow(a, b >> 1);
return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
lint memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
template <typename T> void printArray(std::vector<T> &vec) {
rep(i, vec.size() - 1) std::cout << vec[i] << " ";
std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
T rprev = r;
rprev--;
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
std::string to_string(std::vector<int> &vec) {
std::string res = "[";
rep(i, vec.size() - 1) res += std::to_string(vec[i]) + ", ";
res += std::to_string(vec.back()) + "]";
return res;
}
class Rational {
public:
lint num, den;
Rational() : num(0), den(1) {}
Rational(lint p) : num(p), den(1) {}
Rational(lint p, lint q) : num(p), den(q) { reduce(); }
void reduce() {
if (den < 0) {
num = -num;
den = -den;
}
if (num == 0)
den = 1;
else {
lint r = gcd(std::abs(num), std::abs(den));
num /= r;
den /= r;
}
}
inline bool operator<(const Rational &rhs) const {
return num * rhs.den < rhs.num * den;
}
inline bool operator==(const Rational &rhs) const {
return num == rhs.num && den == rhs.den;
}
inline bool operator>(const Rational &rhs) const {
return num * rhs.den > rhs.num * den;
}
inline Rational &operator+=(Rational rhs) {
lint r = lcm(this->den, rhs.den);
num *= r / this->den;
rhs.num *= r / rhs.den;
den = rhs.den = r;
num += rhs.num;
reduce();
return *this;
}
inline Rational operator-() { return Rational(-num, den); }
inline Rational &operator-=(Rational rhs) {
lint r = lcm(this->den, rhs.den);
num *= r / this->den;
rhs.num *= r / rhs.den;
den = rhs.den = r;
num -= rhs.num;
reduce();
return *this;
}
inline Rational &operator*=(const Rational &rhs) {
num *= rhs.num;
den *= rhs.den;
reduce();
return *this;
}
inline Rational &operator/=(const Rational &rhs) {
num *= rhs.den;
den *= rhs.num;
reduce();
return *this;
}
template <typename T> Rational operator+(const T &rhs) const {
return Rational(*this) += rhs;
}
template <typename T> Rational &operator+=(const T &rhs) {
return operator+=(Rational(rhs));
}
template <typename T> Rational operator-(const T &rhs) const {
return Rational(*this) -= rhs;
}
template <typename T> Rational &operator-=(const T &rhs) {
return operator-=(Rational(rhs));
}
template <typename T> Rational operator*(const T &rhs) const {
return Rational(*this) *= rhs;
}
template <typename T> Rational &operator*=(const T &rhs) {
return operator*=(Rational(rhs));
}
template <typename T> Rational operator/(const T &rhs) const {
return Rational(*this) /= rhs;
}
template <typename T> Rational &operator/=(const T &rhs) {
return operator/=(Rational(rhs));
}
Rational inv() const { return Rational(den, num); }
};
std::ostream &operator<<(std::ostream &ofs, const Rational &x) {
ofs << x.num << "/" << x.den;
return ofs;
}
template <unsigned int modulo = 1000000007> class ModInt {
lint value;
public:
ModInt() : value(0) {}
template <typename T> ModInt(T value = 0) : value(value) {
if (value < 0)
value = -(lint)(-value % modulo) + modulo;
this->value = value % modulo;
}
inline operator int() const { return value; }
inline ModInt &operator+=(const ModInt &x) {
value += x.value;
if (value >= modulo)
value -= modulo;
return *this;
}
inline ModInt &operator++() {
if (value == modulo - 1)
value = 0;
else
value++;
return *this;
}
inline ModInt operator-() const { return ModInt(0) -= *this; }
inline ModInt &operator-=(const ModInt &x) {
value -= x.value;
if (value < 0)
value += modulo;
return *this;
}
inline ModInt &operator--() {
if (value == 0)
value = modulo - 1;
else
value--;
return *this;
}
inline ModInt &operator*=(const ModInt &x) {
value = value * x.value % modulo;
return *this;
}
inline ModInt &operator/=(ModInt rhs) {
int exp = modulo - 2;
while (exp) {
if (exp & 1)
*this *= rhs;
rhs *= rhs;
exp >>= 1;
}
return *this;
}
template <typename T> ModInt operator+(const T &rhs) const {
return ModInt(*this) += rhs;
}
template <typename T> ModInt &operator+=(const T &rhs) {
return operator+=(ModInt(rhs));
}
template <typename T> ModInt operator-(const T &rhs) const {
return ModInt(*this) -= rhs;
}
template <typename T> ModInt &operator-=(const T &rhs) {
return operator-=(ModInt(rhs));
}
template <typename T> ModInt operator*(const T &rhs) const {
return ModInt(*this) *= rhs;
}
template <typename T> ModInt &operator*=(const T &rhs) {
return operator*=(ModInt(rhs));
}
template <typename T> ModInt operator/(const T &rhs) const {
return ModInt(*this) /= rhs;
}
template <typename T> ModInt &operator/=(const T &rhs) {
return operator/=(ModInt(rhs));
}
};
template <unsigned int T>
std::istream &operator>>(std::istream &ist, ModInt<T> &x) {
lint a;
ist >> a;
x = a;
return ist;
}
int n;
int a0, b0, both0;
class myhash {
public:
lint operator()(const Rational &r) const {
lint seed = 123219831;
seed ^= r.num + seed + (seed >> 6);
seed ^= r.den + seed + (seed >> 6);
return seed;
}
};
std::unordered_map<Rational, int, myhash> mp;
std::unordered_set<Rational, myhash> d;
int main() {
std::cin >> n;
rep(i, n) {
lint a, b;
std::cin >> a >> b;
if (a == 0 && b == 0)
both0++;
else if (a == 0)
a0++;
else if (b == 0)
b0++;
else
mp[Rational(a, b)]++;
}
ModInt<> ans = 1;
std::vector<Rational> vec;
for (const auto &i : mp) {
if (d.find(i.first) != d.end())
continue;
vec.emplace_back(i.first);
d.insert(i.first);
d.insert(-i.first.inv());
}
for (const Rational &i : vec) {
ans *=
modpow(2, mp[i], 1000000007) + modpow(2, mp[-i.inv()], 1000000007) - 1;
}
ans *= modpow(2, a0, 1000000007) + modpow(2, b0, 1000000007) - 1;
ans += both0;
ans -= 1;
std::cout << ans << std::endl;
return 0;
}
| replace | 286 | 288 | 286 | 290 | TLE | |
p02679 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
cout << "------------------------------------\n";
rep(i, n) cout << i << " " << vec.at(i) << "\n";
cout << "------------------------------------\n";
}
void pr2d(vector<vector<ll>> vec) { // for debug
ll h = vec.size();
ll w = vec.at(0).size();
cout << "------------------------------------\n";
rep(i, h) {
rep(j, w) { cout << vec.at(i).at(j) << " "; }
cout << "\n";
}
cout << "------------------------------------\n";
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % mod;
a = (a * a) % mod;
n >>= 1;
}
return res;
}
int main() {
std::ifstream in("sample_01.txt");
std::cin.rdbuf(in.rdbuf());
ll n;
cin >> n;
map<pair<ll, ll>, ll> mp_plus, mp_minus;
ll zerocount = 0;
ll azero = 0, bzero = 0;
rep(i, n) {
ll a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
zerocount++;
continue;
}
if (b == 0) {
bzero++;
continue;
}
if (a == 0) {
azero++;
continue;
}
if ((a > 0 && b > 0) || (a < 0 && b < 0)) {
a = abs(a), b = abs(b);
pair<ll, ll> x = make_pair(a / __gcd(a, b), b / __gcd(a, b));
if (mp_plus.count(x)) {
mp_plus.at(x)++;
} else {
mp_plus[x] = 1;
}
} else {
a = abs(a), b = abs(b);
pair<ll, ll> x = make_pair(b / __gcd(a, b), a / __gcd(a, b));
if (mp_minus.count(x)) {
mp_minus.at(x)++;
} else {
mp_minus[x] = 1;
}
}
}
ll hategaitoucount = 0;
ll hate_comb = 1;
for (auto a : mp_plus) {
if (mp_minus.count(a.first)) {
hate_comb = hate_comb *
((modpow(2, a.second, mod) - 1) +
(modpow(2, mp_minus.at(a.first), mod) - 1) + 1) %
mod; // hate_combだけの組み合わせ
hategaitoucount +=
a.second + mp_minus.at(a.first); // hateペアになりうるものの数
}
}
ll non_hate = n - hategaitoucount - zerocount - azero - bzero;
hate_comb = hate_comb *
((modpow(2, azero, mod) - 1) + (modpow(2, bzero, mod) - 1) + 1) %
mod;
ll ans = modpow(2, non_hate, mod) * hate_comb % mod;
ans--;
ans += zerocount;
if (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
cout << "------------------------------------\n";
rep(i, n) cout << i << " " << vec.at(i) << "\n";
cout << "------------------------------------\n";
}
void pr2d(vector<vector<ll>> vec) { // for debug
ll h = vec.size();
ll w = vec.at(0).size();
cout << "------------------------------------\n";
rep(i, h) {
rep(j, w) { cout << vec.at(i).at(j) << " "; }
cout << "\n";
}
cout << "------------------------------------\n";
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % mod;
a = (a * a) % mod;
n >>= 1;
}
return res;
}
int main() {
// std::ifstream in("sample_01.txt");
// std::cin.rdbuf(in.rdbuf());
ll n;
cin >> n;
map<pair<ll, ll>, ll> mp_plus, mp_minus;
ll zerocount = 0;
ll azero = 0, bzero = 0;
rep(i, n) {
ll a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
zerocount++;
continue;
}
if (b == 0) {
bzero++;
continue;
}
if (a == 0) {
azero++;
continue;
}
if ((a > 0 && b > 0) || (a < 0 && b < 0)) {
a = abs(a), b = abs(b);
pair<ll, ll> x = make_pair(a / __gcd(a, b), b / __gcd(a, b));
if (mp_plus.count(x)) {
mp_plus.at(x)++;
} else {
mp_plus[x] = 1;
}
} else {
a = abs(a), b = abs(b);
pair<ll, ll> x = make_pair(b / __gcd(a, b), a / __gcd(a, b));
if (mp_minus.count(x)) {
mp_minus.at(x)++;
} else {
mp_minus[x] = 1;
}
}
}
ll hategaitoucount = 0;
ll hate_comb = 1;
for (auto a : mp_plus) {
if (mp_minus.count(a.first)) {
hate_comb = hate_comb *
((modpow(2, a.second, mod) - 1) +
(modpow(2, mp_minus.at(a.first), mod) - 1) + 1) %
mod; // hate_combだけの組み合わせ
hategaitoucount +=
a.second + mp_minus.at(a.first); // hateペアになりうるものの数
}
}
ll non_hate = n - hategaitoucount - zerocount - azero - bzero;
hate_comb = hate_comb *
((modpow(2, azero, mod) - 1) + (modpow(2, bzero, mod) - 1) + 1) %
mod;
ll ans = modpow(2, non_hate, mod) * hate_comb % mod;
ans--;
ans += zerocount;
if (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
}
| replace | 40 | 42 | 40 | 42 | TLE | |
p02679 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
#define MAX 100005
#define MOD 1000000007
long long arr[MAX];
map<pair<long long, long long>, int> M;
set<pair<long long, long long>> S;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
pair<long long, long long> p, q;
arr[0] = 1;
int n, i, j;
long long g;
scanf("%d", &n);
long long current = 0, ans = 1;
for (i = 0; i < n; i++) {
arr[i + 1] = (arr[i] * 2) % MOD;
scanf("%lld %lld", &p.first, &p.second);
g = gcd(abs(p.first), abs(p.second));
if (g == 0) {
current++;
continue;
}
p.first = p.first / g;
p.second = p.second / g;
if (p.first < 0 || (p.first == 0 && p.second < 0)) {
p.first = -p.first;
p.second = -p.second;
}
j = S.size();
S.insert(p);
if (S.size() == j) {
M[p]++;
} else {
M[p] = 1;
}
}
long long zeros = current;
while (S.size() > 0) {
j = S.size();
p = *(S.begin());
current = arr[M[p]];
q.first = p.second;
q.second = -p.first;
swap(p, q);
if (p.first < 0 || (p.first == 0 && p.second < 0)) {
p.first = -p.first;
p.second = -p.second;
}
S.erase(p);
if (S.size() < j) {
current = (current + arr[M[p]] + MOD - 1) % MOD;
}
ans = (ans * current) % MOD;
S.erase(q);
}
ans = (ans + zeros) % MOD;
ans = (ans + MOD - 1) % MOD;
printf("%lld", ans);
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
#define MAX 200005
#define MOD 1000000007
long long arr[MAX];
map<pair<long long, long long>, int> M;
set<pair<long long, long long>> S;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
pair<long long, long long> p, q;
arr[0] = 1;
int n, i, j;
long long g;
scanf("%d", &n);
long long current = 0, ans = 1;
for (i = 0; i < n; i++) {
arr[i + 1] = (arr[i] * 2) % MOD;
scanf("%lld %lld", &p.first, &p.second);
g = gcd(abs(p.first), abs(p.second));
if (g == 0) {
current++;
continue;
}
p.first = p.first / g;
p.second = p.second / g;
if (p.first < 0 || (p.first == 0 && p.second < 0)) {
p.first = -p.first;
p.second = -p.second;
}
j = S.size();
S.insert(p);
if (S.size() == j) {
M[p]++;
} else {
M[p] = 1;
}
}
long long zeros = current;
while (S.size() > 0) {
j = S.size();
p = *(S.begin());
current = arr[M[p]];
q.first = p.second;
q.second = -p.first;
swap(p, q);
if (p.first < 0 || (p.first == 0 && p.second < 0)) {
p.first = -p.first;
p.second = -p.second;
}
S.erase(p);
if (S.size() < j) {
current = (current + arr[M[p]] + MOD - 1) % MOD;
}
ans = (ans * current) % MOD;
S.erase(q);
}
ans = (ans + zeros) % MOD;
ans = (ans + MOD - 1) % MOD;
printf("%lld", ans);
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02679 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = mod(res * a, c);
a = mod(a * a, c);
b >>= 1;
}
return res;
}
int main() {
ll MOD = 1000000007;
int n;
cin >> n;
ll a[n], b[n];
map<llP, int> memo;
map<llP, int> memo2;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
ll c = abs(a[i]), d = abs(b[i]);
if (c == 0 and d == 0)
memo[make_pair((long long)0, (long long)0)]++;
else if (c == 0)
memo[make_pair((long long)0, (long long)-1)]++;
else if (d == 0)
memo[make_pair((long long)1, (long long)0)]++;
else {
while (c % d != 0) {
ll temp = d;
d = c % d;
c = temp;
}
a[i] /= d;
b[i] /= d;
if (a[i] < 0) {
a[i] = -a[i];
b[i] = -b[i];
}
memo[make_pair(a[i], b[i])]++;
}
}
if (n == 2 and a[0] * a[1] + b[0] * b[1] == 0) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
vector<ll> anss;
for (auto itr = memo.begin(); itr != memo.end(); itr++) {
if (itr->first == make_pair((long long)0, (long long)0))
continue;
ll f = itr->first.first, s = itr->first.second;
if (s < 0) {
if (memo2[make_pair(f, s)] > 0)
continue;
if (memo.count(make_pair(-s, f))) {
anss.push_back(memo[make_pair(f, s)]);
anss.push_back(memo[make_pair(-s, f)]);
memo2[make_pair(f, s)]++;
memo2[make_pair(-s, f)]++;
} else
ans += itr->second;
} else {
if (memo2[make_pair(f, s)] > 0)
continue;
if (memo.count(make_pair(s, -f))) {
anss.push_back(memo[make_pair(f, s)]);
anss.push_back(memo[make_pair(s, -f)]);
memo2[make_pair(f, s)]++;
memo2[make_pair(s, -f)]++;
} else
ans += itr->second;
}
}
ll sum = 1;
if (ans != 0)
sum = mod(modpow(2, ans, MOD), MOD);
for (long unsigned int i = 0; i < anss.size() - 1; i += 2) {
sum = mod(
sum * mod(((modpow(2, anss[i], MOD)) + modpow(2, anss[i + 1], MOD) - 1),
MOD),
MOD);
}
cout << mod(sum - 1 + memo[make_pair((ll)0, (ll)0)], MOD) << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = mod(res * a, c);
a = mod(a * a, c);
b >>= 1;
}
return res;
}
int main() {
ll MOD = 1000000007;
int n;
cin >> n;
ll a[n], b[n];
map<llP, int> memo;
map<llP, int> memo2;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
ll c = abs(a[i]), d = abs(b[i]);
if (c == 0 and d == 0)
memo[make_pair((long long)0, (long long)0)]++;
else if (c == 0)
memo[make_pair((long long)0, (long long)-1)]++;
else if (d == 0)
memo[make_pair((long long)1, (long long)0)]++;
else {
while (c % d != 0) {
ll temp = d;
d = c % d;
c = temp;
}
a[i] /= d;
b[i] /= d;
if (a[i] < 0) {
a[i] = -a[i];
b[i] = -b[i];
}
memo[make_pair(a[i], b[i])]++;
}
}
if (n == 2 and a[0] * a[1] + b[0] * b[1] == 0) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
vector<ll> anss;
for (auto itr = memo.begin(); itr != memo.end(); itr++) {
if (itr->first == make_pair((long long)0, (long long)0))
continue;
ll f = itr->first.first, s = itr->first.second;
if (s < 0) {
if (memo2[make_pair(f, s)] > 0)
continue;
if (memo.count(make_pair(-s, f))) {
anss.push_back(memo[make_pair(f, s)]);
anss.push_back(memo[make_pair(-s, f)]);
memo2[make_pair(f, s)]++;
memo2[make_pair(-s, f)]++;
} else
ans += itr->second;
} else {
if (memo2[make_pair(f, s)] > 0)
continue;
if (memo.count(make_pair(s, -f))) {
anss.push_back(memo[make_pair(f, s)]);
anss.push_back(memo[make_pair(s, -f)]);
memo2[make_pair(f, s)]++;
memo2[make_pair(s, -f)]++;
} else
ans += itr->second;
}
}
ll sum = 1;
if (ans != 0)
sum = mod(modpow(2, ans, MOD), MOD);
for (int i = 0; i < (int)anss.size() - 1; i += 2) {
sum = mod(
sum * mod(((modpow(2, anss[i], MOD)) + modpow(2, anss[i + 1], MOD) - 1),
MOD),
MOD);
}
cout << mod(sum - 1 + memo[make_pair((ll)0, (ll)0)], MOD) << endl;
return 0;
}
| replace | 91 | 92 | 91 | 92 | 0 | |
p02679 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T> inline bool chmax(T &a, T b) { return a = (a < b) ? b : a; }
template <class T> inline bool chmin(T &a, T b) { return a = (a > b) ? b : a; }
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// ユークリッドの互除法
ll euclidean_gcd(ll a, ll b) {
if (a < b)
return euclidean_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
INIT;
ll N;
cin >> N;
vector<ll> A(N), B(N);
rep(i, N) { cin >> A[i] >> B[i]; }
ll zero = 0;
map<pair<ll, ll>, pair<ll, ll>> mp;
rep(i, N) {
if (A[i] == 0 && B[i] == 0) {
zero++;
continue;
}
ll g = euclidean_gcd(A[i], B[i]);
A[i] /= g;
B[i] /= g;
if (B[i] < 0) {
A[i] = -A[i];
B[i] = -B[i];
}
if (B[i] == 0 && A[i] < 0) {
A[i] = -A[i];
B[i] = -B[i];
}
bool rot90 = (A[i] <= 0);
if (rot90) {
ll tmp = A[i];
A[i] = B[i];
B[i] = -tmp;
}
if (rot90)
mp[{A[i], B[i]}].first++;
else
mp[{A[i], B[i]}].second++;
}
// for (auto elem : mp) {
// cout << "{" << elem.first.first << ", " << elem.first.second << "}:
// {"
// << elem.second.first << ", " << elem.second.second << "}" <<
// endl;
// }
mint ans = 1;
for (auto p : mp) {
ll s = p.second.first;
ll t = p.second.second;
mint now = 1;
now += mint(2).pow(s) - 1;
now += mint(2).pow(t) - 1;
ans *= now;
}
ans -= 1;
ans += zero;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T> inline bool chmax(T &a, T b) { return a = (a < b) ? b : a; }
template <class T> inline bool chmin(T &a, T b) { return a = (a > b) ? b : a; }
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// ユークリッドの互除法
ll euclidean_gcd(ll a, ll b) {
if (a < b)
return euclidean_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
INIT;
ll N;
cin >> N;
vector<ll> A(N), B(N);
rep(i, N) { cin >> A[i] >> B[i]; }
ll zero = 0;
map<pair<ll, ll>, pair<ll, ll>> mp;
rep(i, N) {
if (A[i] == 0 && B[i] == 0) {
zero++;
continue;
}
ll g = __gcd(A[i], B[i]);
A[i] /= g;
B[i] /= g;
if (B[i] < 0) {
A[i] = -A[i];
B[i] = -B[i];
}
if (B[i] == 0 && A[i] < 0) {
A[i] = -A[i];
B[i] = -B[i];
}
bool rot90 = (A[i] <= 0);
if (rot90) {
ll tmp = A[i];
A[i] = B[i];
B[i] = -tmp;
}
if (rot90)
mp[{A[i], B[i]}].first++;
else
mp[{A[i], B[i]}].second++;
}
// for (auto elem : mp) {
// cout << "{" << elem.first.first << ", " << elem.first.second << "}:
// {"
// << elem.second.first << ", " << elem.second.second << "}" <<
// endl;
// }
mint ans = 1;
for (auto p : mp) {
ll s = p.second.first;
ll t = p.second.second;
mint now = 1;
now += mint(2).pow(s) - 1;
now += mint(2).pow(t) - 1;
ans *= now;
}
ans -= 1;
ans += zero;
cout << ans << endl;
return 0;
} | replace | 112 | 113 | 112 | 113 | 0 | |
p02679 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
struct vec {
long long x, y;
vec(long long _x, long long _y) : x(_x), y(_y) {}
__int128 dot(const vec &o) {
return (__int128)x * (__int128)o.x + (__int128)y * (__int128)o.y;
}
__int128 cross(const vec &o) {
return (__int128)x * (__int128)o.y - (__int128)y * (__int128)o.x;
}
bool operator<(const vec &o) { return (*this).cross(o) < (__int128)0; }
};
const int mod = 1000000007;
const int maxN = 100000;
int f[maxN + 1];
int mul(int a, int b) {
return (int)((((long long)a * (long long)b) % (long long)mod + mod) % mod);
}
int add(int a, int b) {
return (int)((((long long)a + (long long)b) % (long long)mod + mod) % mod);
}
int get(int a, int b) { return add(add(f[a], f[b]), mod - 1); }
int main() {
f[0] = 1;
for (int i = 0; i < maxN; ++i) {
f[i + 1] = add(f[i], f[i]);
}
int n;
std::cin >> n;
std::vector<vec> a;
int s = 0;
for (int i = 0; i < n; ++i) {
long long x, y;
std::cin >> x >> y;
if (x == 0 && y == 0) {
s += 1;
continue;
}
if (x < 0 || (x == 0 && y < 0)) {
x = -x;
y = -y;
}
a.push_back(vec(x, y));
}
n = (int)a.size();
int ans = 1;
std::sort(a.begin(), a.end());
std::vector<bool> u(n, false);
int cur = 0, next = 0;
while (cur < n) {
if (u[cur]) {
++cur;
continue;
}
// std::cerr << "---" << std::endl;
int i = cur;
while (i < n && a[cur].cross(a[i]) == (__int128)0) {
assert(!u[i]);
u[i] = true;
// std::cerr << " main: " << a[i].x << " " << a[i].y << std::endl;
++i;
}
int s1 = (i - cur);
if (next < i) {
next = i;
}
while (next < n && a[cur].dot(a[next]) > (__int128)0) {
++next;
}
int j = next;
while (j < n && a[cur].dot(a[j]) == (__int128)0) {
assert(!u[j]);
u[j] = true;
// std::cerr << " sec: " << a[j].x << " " << a[j].y << std::endl;
++j;
}
int s2 = j - next;
ans = mul(ans, get(s1, s2));
}
ans = add(ans, mod - 1);
ans = add(ans, s);
std::cout << ans << std::endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
struct vec {
long long x, y;
vec(long long _x, long long _y) : x(_x), y(_y) {}
__int128 dot(const vec &o) {
return (__int128)x * (__int128)o.x + (__int128)y * (__int128)o.y;
}
__int128 cross(const vec &o) {
return (__int128)x * (__int128)o.y - (__int128)y * (__int128)o.x;
}
bool operator<(const vec &o) { return (*this).cross(o) < (__int128)0; }
};
const int mod = 1000000007;
const int maxN = 1000000;
int f[maxN + 1];
int mul(int a, int b) {
return (int)((((long long)a * (long long)b) % (long long)mod + mod) % mod);
}
int add(int a, int b) {
return (int)((((long long)a + (long long)b) % (long long)mod + mod) % mod);
}
int get(int a, int b) { return add(add(f[a], f[b]), mod - 1); }
int main() {
f[0] = 1;
for (int i = 0; i < maxN; ++i) {
f[i + 1] = add(f[i], f[i]);
}
int n;
std::cin >> n;
std::vector<vec> a;
int s = 0;
for (int i = 0; i < n; ++i) {
long long x, y;
std::cin >> x >> y;
if (x == 0 && y == 0) {
s += 1;
continue;
}
if (x < 0 || (x == 0 && y < 0)) {
x = -x;
y = -y;
}
a.push_back(vec(x, y));
}
n = (int)a.size();
int ans = 1;
std::sort(a.begin(), a.end());
std::vector<bool> u(n, false);
int cur = 0, next = 0;
while (cur < n) {
if (u[cur]) {
++cur;
continue;
}
// std::cerr << "---" << std::endl;
int i = cur;
while (i < n && a[cur].cross(a[i]) == (__int128)0) {
assert(!u[i]);
u[i] = true;
// std::cerr << " main: " << a[i].x << " " << a[i].y << std::endl;
++i;
}
int s1 = (i - cur);
if (next < i) {
next = i;
}
while (next < n && a[cur].dot(a[next]) > (__int128)0) {
++next;
}
int j = next;
while (j < n && a[cur].dot(a[j]) == (__int128)0) {
assert(!u[j]);
u[j] = true;
// std::cerr << " sec: " << a[j].x << " " << a[j].y << std::endl;
++j;
}
int s2 = j - next;
ans = mul(ans, get(s1, s2));
}
ans = add(ans, mod - 1);
ans = add(ans, s);
std::cout << ans << std::endl;
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02679 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
ll gcd(ll a, ll b) {
while (b) {
ll c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
ios::sync_with_stdio(false);
int n, y = 0;
ll a[200005] = {}, b[200005] = {}, z = 1, p[200005] = {1};
map<pair<ll, ll>, int> m;
set<pair<ll, ll>> s;
cin >> n;
for (int i = 1; i <= n; i++)
p[i] = p[i - 1] * 2 % mod;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
ll g = gcd(abs(a[i]), abs(b[i]));
if (g == 0) {
return 1;
y = 1;
continue;
}
a[i] /= g;
b[i] /= g;
m[{a[i], b[i]}]++;
}
for (auto i : m)
if (s.find(i.first) == s.end()) {
ll c, d, x = i.first.first, y = i.first.second;
s.insert({x, y});
s.insert({-y, x});
s.insert({-x, -y});
s.insert({y, -x});
c = m[{x, y}] + m[{-x, -y}];
d = m[{-y, x}] + m[{y, -x}];
z = z * (p[c] + p[d] - 1) % mod;
}
cout << (z + mod - 1 + y) % mod;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
ll gcd(ll a, ll b) {
while (b) {
ll c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
ios::sync_with_stdio(false);
int n, y = 0;
ll a[200005] = {}, b[200005] = {}, z = 1, p[200005] = {1};
map<pair<ll, ll>, int> m;
set<pair<ll, ll>> s;
cin >> n;
for (int i = 1; i <= n; i++)
p[i] = p[i - 1] * 2 % mod;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
ll g = gcd(abs(a[i]), abs(b[i]));
if (g == 0) {
y++;
continue;
}
a[i] /= g;
b[i] /= g;
m[{a[i], b[i]}]++;
}
for (auto i : m)
if (s.find(i.first) == s.end()) {
ll c, d, x = i.first.first, y = i.first.second;
s.insert({x, y});
s.insert({-y, x});
s.insert({-x, -y});
s.insert({y, -x});
c = m[{x, y}] + m[{-x, -y}];
d = m[{-y, x}] + m[{y, -x}];
z = z * (p[c] + p[d] - 1) % mod;
}
cout << (z + mod - 1 + y) % mod;
}
| replace | 34 | 36 | 34 | 35 | 0 | |
p02679 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = 0; (i) < (ll)(n); ++(i))
#define REPN(i, m, n) for (ll(i) = m; (i) < (ll)(n); ++(i))
#define REP_REV(i, n) for (ll(i) = (ll)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (ll(i) = (ll)(n)-1; (i) >= m; --(i))
#define ALL(x) (x).begin(), (x).end()
#define Ceil(x, n) (((((x)) + ((n)-1)) / n))
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n)
#define INF 2e7
#define INF_LL 1LL << 60
#define ll long long
typedef pair<ll, ll> P;
struct modint {
using i64 = int_fast64_t;
i64 a;
static constexpr i64 MOD = 1000000007;
modint() { a = 0; }
modint(i64 a_) {
a = a_ % MOD;
if (a < 0)
a += MOD;
}
modint inv() const {
i64 n = 1, m = MOD - 2, A = a;
while (m) {
if (m & 1)
(n *= A) %= MOD;
(A *= A) %= MOD;
m >>= 1;
}
modint y(n);
return y;
}
bool operator==(const modint &x) { return a == x.a; }
bool operator!=(const modint &x) { return a != x.a; }
modint &operator=(const modint &x) {
a = x.a;
return *this;
}
modint operator+(const modint &x) {
modint y;
y.a = a + x.a;
if (y.a > MOD)
y.a -= MOD;
return y;
}
modint operator-(const modint &x) {
modint y;
y.a = a - x.a;
if (y.a < 0)
y.a += MOD;
return y;
}
modint operator*(const modint &x) {
modint y;
y.a = (a * x.a) % MOD;
return y;
}
modint operator/(const modint &x) {
modint y;
y.a = (a * x.inv().a) % MOD;
return y;
}
modint &operator+=(const modint &x) {
a += x.a;
if (a >= MOD)
a -= MOD;
return *this;
}
modint &operator-=(const modint &x) {
a -= x.a;
if (a < 0)
a += MOD;
return *this;
}
modint &operator*=(const modint &x) {
(a *= x.a) %= MOD;
return *this;
}
modint &operator/=(const modint &x) {
(a *= x.inv().a) %= MOD;
return *this;
}
};
istream &operator>>(istream &in, modint &x) {
int_fast64_t a_;
in >> a_;
modint y(a_);
x = y;
return in;
}
ostream &operator<<(ostream &out, const modint &x) {
out << x.a;
return out;
}
modint pwr(int_fast64_t a, int_fast64_t b) {
modint _;
int_fast64_t n = 1, A = a;
while (b) {
if (b & 1)
(n *= A) %= modint::MOD;
(A *= A) %= modint::MOD;
b >>= 1;
}
_.a = n;
return _;
}
ll gcd(ll a, ll b) {
ll tmp;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int n;
cin >> n;
int both_zero = 0;
map<P, P> mp;
modint ans = 1;
REP(i, n) {
ll x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
both_zero++;
continue;
}
ll gcd_ = gcd(x, y);
x /= gcd_, y /= gcd_;
if (y < 0)
x = -x, y = -y;
if (y == 0 && x < 0)
x = -x, y = -y;
bool rot90 = (x <= 0);
if (rot90) {
ll tmp = x;
x = y, y = -tmp;
}
if (rot90)
mp[{x, y}].first++;
else
mp[{x, y}].second++;
}
for (auto p : mp) {
int s = p.second.first;
int t = p.second.second;
modint now = 1; /* なにも選ばない */
now += pwr(2, s) - 1;
now += pwr(2, t) - 1;
ans *= now;
}
ans -= 1;
ans += both_zero;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = 0; (i) < (ll)(n); ++(i))
#define REPN(i, m, n) for (ll(i) = m; (i) < (ll)(n); ++(i))
#define REP_REV(i, n) for (ll(i) = (ll)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (ll(i) = (ll)(n)-1; (i) >= m; --(i))
#define ALL(x) (x).begin(), (x).end()
#define Ceil(x, n) (((((x)) + ((n)-1)) / n))
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n)
#define INF 2e7
#define INF_LL 1LL << 60
#define ll long long
typedef pair<ll, ll> P;
struct modint {
using i64 = int_fast64_t;
i64 a;
static constexpr i64 MOD = 1000000007;
modint() { a = 0; }
modint(i64 a_) {
a = a_ % MOD;
if (a < 0)
a += MOD;
}
modint inv() const {
i64 n = 1, m = MOD - 2, A = a;
while (m) {
if (m & 1)
(n *= A) %= MOD;
(A *= A) %= MOD;
m >>= 1;
}
modint y(n);
return y;
}
bool operator==(const modint &x) { return a == x.a; }
bool operator!=(const modint &x) { return a != x.a; }
modint &operator=(const modint &x) {
a = x.a;
return *this;
}
modint operator+(const modint &x) {
modint y;
y.a = a + x.a;
if (y.a > MOD)
y.a -= MOD;
return y;
}
modint operator-(const modint &x) {
modint y;
y.a = a - x.a;
if (y.a < 0)
y.a += MOD;
return y;
}
modint operator*(const modint &x) {
modint y;
y.a = (a * x.a) % MOD;
return y;
}
modint operator/(const modint &x) {
modint y;
y.a = (a * x.inv().a) % MOD;
return y;
}
modint &operator+=(const modint &x) {
a += x.a;
if (a >= MOD)
a -= MOD;
return *this;
}
modint &operator-=(const modint &x) {
a -= x.a;
if (a < 0)
a += MOD;
return *this;
}
modint &operator*=(const modint &x) {
(a *= x.a) %= MOD;
return *this;
}
modint &operator/=(const modint &x) {
(a *= x.inv().a) %= MOD;
return *this;
}
};
istream &operator>>(istream &in, modint &x) {
int_fast64_t a_;
in >> a_;
modint y(a_);
x = y;
return in;
}
ostream &operator<<(ostream &out, const modint &x) {
out << x.a;
return out;
}
modint pwr(int_fast64_t a, int_fast64_t b) {
modint _;
int_fast64_t n = 1, A = a;
while (b) {
if (b & 1)
(n *= A) %= modint::MOD;
(A *= A) %= modint::MOD;
b >>= 1;
}
_.a = n;
return _;
}
ll gcd(ll a, ll b) {
ll tmp;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
if (b == 0)
return a;
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int n;
cin >> n;
int both_zero = 0;
map<P, P> mp;
modint ans = 1;
REP(i, n) {
ll x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
both_zero++;
continue;
}
ll gcd_ = gcd(x, y);
x /= gcd_, y /= gcd_;
if (y < 0)
x = -x, y = -y;
if (y == 0 && x < 0)
x = -x, y = -y;
bool rot90 = (x <= 0);
if (rot90) {
ll tmp = x;
x = y, y = -tmp;
}
if (rot90)
mp[{x, y}].first++;
else
mp[{x, y}].second++;
}
for (auto p : mp) {
int s = p.second.first;
int t = p.second.second;
modint now = 1; /* なにも選ばない */
now += pwr(2, s) - 1;
now += pwr(2, t) - 1;
ans *= now;
}
ans -= 1;
ans += both_zero;
cout << ans << endl;
return 0;
}
| insert | 119 | 119 | 119 | 121 | 0 | |
p02679 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
using int64 = long long int;
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
// ModInt begin
using ll = long long;
template <ll mod> struct ModInt {
ll v;
ll mod_pow(ll x, ll n) const {
return (!n) ? 1 : (mod_pow((x * x) % mod, n / 2) * ((n & 1) ? x : 1)) % mod;
}
ModInt(ll a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
ModInt operator+(const ModInt &b) const {
return (v + b.v >= mod ? ModInt(v + b.v - mod) : ModInt(v + b.v));
}
ModInt operator-() const { return ModInt(-v); }
ModInt operator-(const ModInt &b) const {
return (v - b.v < 0 ? ModInt(v - b.v + mod) : ModInt(v - b.v));
}
ModInt operator*(const ModInt &b) const { return (v * b.v) % mod; }
ModInt operator/(const ModInt &b) const {
return (v * mod_pow(b.v, mod - 2)) % mod;
}
bool operator==(const ModInt &b) const { return v == b.v; }
bool operator!=(const ModInt &b) const { return !(*this == b); }
ModInt &operator+=(const ModInt &b) {
v += b.v;
if (v >= mod)
v -= mod;
return *this;
}
ModInt &operator-=(const ModInt &b) {
v -= b.v;
if (v < 0)
v += mod;
return *this;
}
ModInt &operator*=(const ModInt &b) {
(v *= b.v) %= mod;
return *this;
}
ModInt &operator/=(const ModInt &b) {
(v *= mod_pow(b.v, mod - 2)) %= mod;
return *this;
}
ModInt pow(ll x) { return ModInt(mod_pow(v, x)); }
// operator int() const { return int(v); }
// operator long long int() const { return v; }
};
template <ll mod> ModInt<mod> pow(ModInt<mod> n, ll k) {
return ModInt<mod>(n.mod_pow(n.v, k));
}
template <ll mod> ostream &operator<<(ostream &out, ModInt<mod> a) {
return out << a.v;
}
template <ll mod> istream &operator>>(istream &in, ModInt<mod> &a) {
in >> a.v;
return in;
}
// ModInt end
using mint = ModInt<MOD>;
int main() {
ll N;
cin >> N;
mint ans(0);
ll a0 = 0, b0 = 0;
map<pair<ll, ll>, int> posi, nega;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
if (a == 0 and b == 0) {
ans += mint(1);
continue;
} else if (a == 0 or b == 0) {
ll m = max(abs(a), abs(b));
a /= m;
b /= m;
} else {
ll g = __gcd(abs(a), abs(b));
a /= g, b /= g;
}
// a は負ではない
if (a < 0)
a *= -1, b *= -1;
if (a == 0)
a0++;
else if (b == 0)
b0++;
else if (b > 0)
posi[make_pair(a, b)]++;
else
nega[make_pair(-b, a)]++;
}
// a0 から自然数個・b0 から自然数個・何も選ばない
mint mul(0);
mul += mint(2).pow(a0) - mint(1);
mul += mint(2).pow(b0) - mint(1);
mul += mint(1);
for (auto e : posi) {
ll a, b, n0;
tie(a, b) = e.first;
n0 = e.second;
ll n1 = !nega.count(make_pair(a, b)) ? 0 : nega[make_pair(a, b)];
// fprintf(stderr, "a = %lld, b = %lld, n0 = %lld, n1 = %lld\n", a, b, n0,
// n1); n0 から自然数個・n1 から自然数個・何も選ばない
mint add(0);
add += mint(2).pow(n0) - mint(1);
add += mint(2).pow(n1) - mint(1);
add += mint(1);
mul *= add;
}
for (auto e : nega) {
ll a, b, n0;
tie(a, b) = e.first;
n0 = e.second;
if (posi.count(make_pair(a, b)))
continue;
// fprintf(stderr, "a = %lld, b = %lld, n0 = %lld\n", a, b, n0);
// n0 から任意個
mul *= mint(2).pow(n0);
}
// 何も選んでいない場合以外
ans += mul - mint(1);
cout << ans << endl;
return 1;
}
| // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
using int64 = long long int;
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
// ModInt begin
using ll = long long;
template <ll mod> struct ModInt {
ll v;
ll mod_pow(ll x, ll n) const {
return (!n) ? 1 : (mod_pow((x * x) % mod, n / 2) * ((n & 1) ? x : 1)) % mod;
}
ModInt(ll a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
ModInt operator+(const ModInt &b) const {
return (v + b.v >= mod ? ModInt(v + b.v - mod) : ModInt(v + b.v));
}
ModInt operator-() const { return ModInt(-v); }
ModInt operator-(const ModInt &b) const {
return (v - b.v < 0 ? ModInt(v - b.v + mod) : ModInt(v - b.v));
}
ModInt operator*(const ModInt &b) const { return (v * b.v) % mod; }
ModInt operator/(const ModInt &b) const {
return (v * mod_pow(b.v, mod - 2)) % mod;
}
bool operator==(const ModInt &b) const { return v == b.v; }
bool operator!=(const ModInt &b) const { return !(*this == b); }
ModInt &operator+=(const ModInt &b) {
v += b.v;
if (v >= mod)
v -= mod;
return *this;
}
ModInt &operator-=(const ModInt &b) {
v -= b.v;
if (v < 0)
v += mod;
return *this;
}
ModInt &operator*=(const ModInt &b) {
(v *= b.v) %= mod;
return *this;
}
ModInt &operator/=(const ModInt &b) {
(v *= mod_pow(b.v, mod - 2)) %= mod;
return *this;
}
ModInt pow(ll x) { return ModInt(mod_pow(v, x)); }
// operator int() const { return int(v); }
// operator long long int() const { return v; }
};
template <ll mod> ModInt<mod> pow(ModInt<mod> n, ll k) {
return ModInt<mod>(n.mod_pow(n.v, k));
}
template <ll mod> ostream &operator<<(ostream &out, ModInt<mod> a) {
return out << a.v;
}
template <ll mod> istream &operator>>(istream &in, ModInt<mod> &a) {
in >> a.v;
return in;
}
// ModInt end
using mint = ModInt<MOD>;
int main() {
ll N;
cin >> N;
mint ans(0);
ll a0 = 0, b0 = 0;
map<pair<ll, ll>, int> posi, nega;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
if (a == 0 and b == 0) {
ans += mint(1);
continue;
} else if (a == 0 or b == 0) {
ll m = max(abs(a), abs(b));
a /= m;
b /= m;
} else {
ll g = __gcd(abs(a), abs(b));
a /= g, b /= g;
}
// a は負ではない
if (a < 0)
a *= -1, b *= -1;
if (a == 0)
a0++;
else if (b == 0)
b0++;
else if (b > 0)
posi[make_pair(a, b)]++;
else
nega[make_pair(-b, a)]++;
}
// a0 から自然数個・b0 から自然数個・何も選ばない
mint mul(0);
mul += mint(2).pow(a0) - mint(1);
mul += mint(2).pow(b0) - mint(1);
mul += mint(1);
for (auto e : posi) {
ll a, b, n0;
tie(a, b) = e.first;
n0 = e.second;
ll n1 = !nega.count(make_pair(a, b)) ? 0 : nega[make_pair(a, b)];
// fprintf(stderr, "a = %lld, b = %lld, n0 = %lld, n1 = %lld\n", a, b, n0,
// n1); n0 から自然数個・n1 から自然数個・何も選ばない
mint add(0);
add += mint(2).pow(n0) - mint(1);
add += mint(2).pow(n1) - mint(1);
add += mint(1);
mul *= add;
}
for (auto e : nega) {
ll a, b, n0;
tie(a, b) = e.first;
n0 = e.second;
if (posi.count(make_pair(a, b)))
continue;
// fprintf(stderr, "a = %lld, b = %lld, n0 = %lld\n", a, b, n0);
// n0 から任意個
mul *= mint(2).pow(n0);
}
// 何も選んでいない場合以外
ans += mul - mint(1);
cout << ans << endl;
return 0;
}
| replace | 173 | 174 | 173 | 174 | 1 | |
p02679 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXR = 510000;
template <ll mod> class modint {
public:
ll val = 0;
// コンストラクタ
modint(ll x = 0) {
while (x < 0)
x += mod;
val = x % mod;
}
// コピーコンストラクタ
modint(const modint &r) { val = r.val; }
// 算術演算子
modint operator-() { return modint(-val); } // 単項
modint operator+(const modint &r) { return modint(*this) += r; }
modint operator-(const modint &r) { return modint(*this) -= r; }
modint operator*(const modint &r) { return modint(*this) *= r; }
modint operator/(const modint &r) { return modint(*this) /= r; }
// 代入演算子
modint &operator+=(const modint &r) {
val += r.val;
if (val >= mod)
val -= mod;
return *this;
}
modint &operator-=(const modint &r) {
if (val < r.val)
val += mod;
val -= r.val;
return *this;
}
modint &operator*=(const modint &r) {
val = val * r.val % mod;
return *this;
}
modint &operator/=(const modint &r) {
ll a = r.val, b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % mod;
if (val < 0)
val += mod;
return *this;
}
// 等価比較演算子
bool operator==(const modint &r) { return this->val == r.val; }
bool operator<(const modint &r) { return this->val < r.val; }
bool operator!=(const modint &r) { return this->val != r.val; }
};
using mint = modint<MOD>;
// 入出力ストリーム
istream &operator>>(istream &is, mint &x) { // xにconst付けない
ll t;
is >> t;
x = t;
return (is);
}
ostream &operator<<(ostream &os, const mint &x) { return os << x.val; }
// 累乗
mint modpow(const mint &a, ll n) {
if (n == 0)
return 1;
mint t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
// 二項係数の計算
mint fac[MAXR + 1], finv[MAXR + 1], inv[MAXR + 1];
// テーブルの作成
void com_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAXR) {
fac[i] = fac[i - 1] * mint(i);
inv[i] = -inv[MOD % i] * mint(MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
// 演算部分
mint com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0)
return 0;
if (k == 0)
return 1;
return fac[n] * finv[k] * finv[n - k];
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int N;
cin >> N;
map<pair<ll, ll>, int> AB;
mint zeros = 0;
REP(i, N) {
ll a, b;
cin >> a >> b;
if (a == 0 && b == 0) { //[0,0]は除外（どの点とも組にならないため）
zeros += 1;
continue;
}
if (a == 0 && b != 0) {
a = 0;
b = 1;
} else if (a > 0) {
ll g = gcd(a, abs(b));
a = a / g;
b = b / g;
} else if (a < 0) {
ll g = gcd(abs(a), abs(b));
a = -a / g;
b = -b / g;
}
AB[make_pair(a, b)]++;
}
mint ans = 1;
map<pair<ll, ll>, int> seen;
for (auto x : AB) {
if (x.second == 0 || seen[x.first] == 1) {
continue;
}
ll num1 = x.second;
ll pa = -x.first.second;
ll pb = x.first.first;
if (pa == 0) {
pb = 1;
} else if (pa < 0) {
pa = -pa;
pb = -pb;
}
ll num2 = AB[make_pair(pa, pb)];
seen[x.first] = 1;
seen[make_pair(pa, pb)] = 1;
ans *= (modpow(2, num1) + modpow(2, num2) - 1);
}
ans += zeros;
ans -= 1; // 0匹の場合をのぞく
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXR = 510000;
template <ll mod> class modint {
public:
ll val = 0;
// コンストラクタ
modint(ll x = 0) {
while (x < 0)
x += mod;
val = x % mod;
}
// コピーコンストラクタ
modint(const modint &r) { val = r.val; }
// 算術演算子
modint operator-() { return modint(-val); } // 単項
modint operator+(const modint &r) { return modint(*this) += r; }
modint operator-(const modint &r) { return modint(*this) -= r; }
modint operator*(const modint &r) { return modint(*this) *= r; }
modint operator/(const modint &r) { return modint(*this) /= r; }
// 代入演算子
modint &operator+=(const modint &r) {
val += r.val;
if (val >= mod)
val -= mod;
return *this;
}
modint &operator-=(const modint &r) {
if (val < r.val)
val += mod;
val -= r.val;
return *this;
}
modint &operator*=(const modint &r) {
val = val * r.val % mod;
return *this;
}
modint &operator/=(const modint &r) {
ll a = r.val, b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % mod;
if (val < 0)
val += mod;
return *this;
}
// 等価比較演算子
bool operator==(const modint &r) { return this->val == r.val; }
bool operator<(const modint &r) { return this->val < r.val; }
bool operator!=(const modint &r) { return this->val != r.val; }
};
using mint = modint<MOD>;
// 入出力ストリーム
istream &operator>>(istream &is, mint &x) { // xにconst付けない
ll t;
is >> t;
x = t;
return (is);
}
ostream &operator<<(ostream &os, const mint &x) { return os << x.val; }
// 累乗
mint modpow(const mint &a, ll n) {
if (n == 0)
return 1;
mint t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
// 二項係数の計算
mint fac[MAXR + 1], finv[MAXR + 1], inv[MAXR + 1];
// テーブルの作成
void com_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAXR) {
fac[i] = fac[i - 1] * mint(i);
inv[i] = -inv[MOD % i] * mint(MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
// 演算部分
mint com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0)
return 0;
if (k == 0)
return 1;
return fac[n] * finv[k] * finv[n - k];
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int N;
cin >> N;
map<pair<ll, ll>, int> AB;
mint zeros = 0;
REP(i, N) {
ll a, b;
cin >> a >> b;
if (a == 0 && b == 0) { //[0,0]は除外（どの点とも組にならないため）
zeros += 1;
continue;
}
if (a == 0 && b != 0) {
a = 0;
b = 1;
} else if (a != 0 && b == 0) {
a = 1;
b = 0;
} else if (a > 0) {
ll g = gcd(a, abs(b));
a = a / g;
b = b / g;
} else if (a < 0) {
ll g = gcd(abs(a), abs(b));
a = -a / g;
b = -b / g;
}
AB[make_pair(a, b)]++;
}
mint ans = 1;
map<pair<ll, ll>, int> seen;
for (auto x : AB) {
if (x.second == 0 || seen[x.first] == 1) {
continue;
}
ll num1 = x.second;
ll pa = -x.first.second;
ll pb = x.first.first;
if (pa == 0) {
pb = 1;
} else if (pa < 0) {
pa = -pa;
pb = -pb;
}
ll num2 = AB[make_pair(pa, pb)];
seen[x.first] = 1;
seen[make_pair(pa, pb)] = 1;
ans *= (modpow(2, num1) + modpow(2, num2) - 1);
}
ans += zeros;
ans -= 1; // 0匹の場合をのぞく
cout << ans << endl;
return 0;
} | insert | 145 | 145 | 145 | 148 | 0 | |
p02679 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> pll;
long long A[200005];
long long B[200005];
long long C[200005];
long long D[200005];
long long pow2[200005];
const long long MOD = 1e9 + 7;
map<pll, long long> map1;
void insert1(long long a, long long b, int i) {
if (b == 0 && a == 0) {
a = b = 0;
} else if (b == 0) {
b = 0;
a = 1;
} else if (a == 0) {
a = 0;
b = 1;
} else {
long long temp = __gcd(abs(a), abs(b));
a /= temp;
b /= temp;
}
if (a < 0) {
a = -a;
b = -b;
}
C[i] = a;
D[i] = b;
pll indx = pll(a, b);
// printf("%lld %lld inserted into map\n", a, b);
if (map1.find(indx) == map1.end()) {
map1[indx] = 1;
} else {
map1[indx]++;
}
}
int main() {
int N;
scanf("%d", &N);
pow2[0] = 1;
for (int i = 1; i <= N; i++) {
scanf("%lld%lld", &A[i], &B[i]);
if (A[i] == 0 && B[i] == 0) {
throw;
}
// if(abs(A[i]) == abs(B[i])){throw;}
pow2[i] = 2 * pow2[i - 1] % MOD;
}
map1[pll(0, 0)] = 0;
for (int i = 1; i <= N; i++) {
insert1(A[i], B[i], i);
}
long long ans = 1;
long long temp = map1[pll(0, 0)];
for (int i = 1; i <= N; i++) {
// printf("C[%d]=%lld D[%d]=%lld\n", i, C[i], i, D[i]);
if (C[i] == 0 && D[i] == 0) {
continue;
}
// printf("%lld\n", map1[pll(C[i], D[i])]);
long long ways = pow2[map1[pll(C[i], D[i])]];
pll inv;
if (C[i] == 0 || D[i] == 0) {
// ways = pow2[map1[pll(C[i], D[i])]];
map1[pll(C[i], D[i])] = 0;
inv = pll(D[i], C[i]);
if (map1.find(inv) != map1.end()) {
ways += pow2[map1[inv]];
map1[inv] = 0;
} else {
ways++;
}
ways = (ways + MOD - 1) % MOD;
// throw;
} else {
map1[pll(C[i], D[i])] = 0;
inv = pll(-D[i], C[i]);
if (map1.find(inv) != map1.end()) {
ways += pow2[map1[inv]];
map1[inv] = 0;
} else {
ways++;
}
inv = pll(D[i], -C[i]);
if (map1.find(inv) != map1.end()) {
ways += pow2[map1[inv]];
map1[inv] = 0;
} else {
ways++;
}
ways = (ways + MOD - 2) % MOD;
}
// printf("ways=%lld\n", ways);
ans = ans * ways % MOD;
}
ans += temp;
ans = (ans + MOD - 1) % MOD;
printf("%lld", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> pll;
long long A[200005];
long long B[200005];
long long C[200005];
long long D[200005];
long long pow2[200005];
const long long MOD = 1e9 + 7;
map<pll, long long> map1;
void insert1(long long a, long long b, int i) {
if (b == 0 && a == 0) {
a = b = 0;
} else if (b == 0) {
b = 0;
a = 1;
} else if (a == 0) {
a = 0;
b = 1;
} else {
long long temp = __gcd(abs(a), abs(b));
a /= temp;
b /= temp;
}
if (a < 0) {
a = -a;
b = -b;
}
C[i] = a;
D[i] = b;
pll indx = pll(a, b);
// printf("%lld %lld inserted into map\n", a, b);
if (map1.find(indx) == map1.end()) {
map1[indx] = 1;
} else {
map1[indx]++;
}
}
int main() {
int N;
scanf("%d", &N);
pow2[0] = 1;
for (int i = 1; i <= N; i++) {
scanf("%lld%lld", &A[i], &B[i]);
// if(A[i] == 0 && B[i] == 0){throw;}
// if(abs(A[i]) == abs(B[i])){throw;}
pow2[i] = 2 * pow2[i - 1] % MOD;
}
map1[pll(0, 0)] = 0;
for (int i = 1; i <= N; i++) {
insert1(A[i], B[i], i);
}
long long ans = 1;
long long temp = map1[pll(0, 0)];
for (int i = 1; i <= N; i++) {
// printf("C[%d]=%lld D[%d]=%lld\n", i, C[i], i, D[i]);
if (C[i] == 0 && D[i] == 0) {
continue;
}
// printf("%lld\n", map1[pll(C[i], D[i])]);
long long ways = pow2[map1[pll(C[i], D[i])]];
pll inv;
if (C[i] == 0 || D[i] == 0) {
// ways = pow2[map1[pll(C[i], D[i])]];
map1[pll(C[i], D[i])] = 0;
inv = pll(D[i], C[i]);
if (map1.find(inv) != map1.end()) {
ways += pow2[map1[inv]];
map1[inv] = 0;
} else {
ways++;
}
ways = (ways + MOD - 1) % MOD;
// throw;
} else {
map1[pll(C[i], D[i])] = 0;
inv = pll(-D[i], C[i]);
if (map1.find(inv) != map1.end()) {
ways += pow2[map1[inv]];
map1[inv] = 0;
} else {
ways++;
}
inv = pll(D[i], -C[i]);
if (map1.find(inv) != map1.end()) {
ways += pow2[map1[inv]];
map1[inv] = 0;
} else {
ways++;
}
ways = (ways + MOD - 2) % MOD;
}
// printf("ways=%lld\n", ways);
ans = ans * ways % MOD;
}
ans += temp;
ans = (ans + MOD - 1) % MOD;
printf("%lld", ans);
return 0;
}
| replace | 55 | 58 | 55 | 56 | 0 | |
p02679 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
// こんなクソコードを生み出してしまうなんて趣味は罪ね
const int mod = 1e9 + 7;
const int IMAX = 200000;
const int D[9] = {1, 10, 100, 1000, 10000,
100000, 1000000, 10000000, 100000000};
class unko {
public:
int f[IMAX + 1];
// 働いてない？
constexpr unko() : f() {
f[0] = 1;
rep1(i, IMAX) f[i] = ll(f[i - 1]) * 2 % mod;
}
} f;
void pakuri_sort(int N, ull A[]) {
const int b = 8;
ull tmp[200001];
rep(k, 8) {
int kazu[1 << b] = {}, kazu2[1 << b] = {};
rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];
for (int i = N - 1; i >= 0; i--)
tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];
k++;
rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];
for (int i = N - 1; i >= 0; i--)
A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];
}
}
const int CM = 1 << 17, CL = 22;
char cn[CM + CL], *ci = cn + CM + CL, *owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline ll getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
int pn = 1;
if (*ci == '-') {
pn = -pn;
ci++;
}
ll tmp = *(ll *)ci;
int dig = ((tmp & ma0) ^ ma0) ? 68 - __builtin_ctzll((tmp & ma0) ^ ma0) : 0;
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += (64 - dig >> 3);
ll tmp2 = *(ll *)ci;
dig = ((tmp2 & ma0) ^ ma0) ? 68 - __builtin_ctzll((tmp2 & ma0) ^ ma0) : 0;
tmp2 = tmp2 << dig & ma1;
if (dig == 64)
tmp2 = 0; //?
tmp2 = tmp2 * 10 + (tmp >> 8) & ma2;
tmp2 = tmp2 * 100 + (tmp >> 16) & ma3;
tmp2 = tmp2 * 10000 + (tmp >> 32) & ma4;
int d = (64 - dig >> 3);
tmp = tmp * D[d] + tmp2;
ci += d;
while ((ct = *ci++) >= '0')
tmp = tmp * 10 + ct - '0';
return pn * tmp;
}
const ull ma = (1ull << 52) - 1;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N = getint();
ull AB[200001];
int a0 = 0, b0 = 0;
int ab00 = 0;
int n = 0;
rep(i, N) {
ll a = getint(), b = getint();
if (a == 0 && b == 0) {
ab00++;
continue;
}
if (a == 0) {
a0++;
continue;
}
if (b == 0) {
b0++;
continue;
}
if (a < 0) {
a = -a;
b = -b;
}
bool p = (b > 0);
if (!p) {
b = -b;
swap(a, b);
}
ull tmp = 0;
rep(i, 3) {
tmp *= 3;
if (b) {
int k = __builtin_clzll(a) - __builtin_clzll(b);
if (k > 0)
a <<= k;
else
b <<= -k;
if (a > b) {
b <<= 1;
k--;
}
double d = double(b) / a;
ull tmp1 = *(ull *)&d;
ull c = tmp1 & ma | (1ull << 52);
lll sa = (lll(b) << 52) - lll(a) * c;
while (sa >= 0) {
sa -= a;
c++;
}
while (sa < 0) {
sa += a;
c--;
}
tmp += ull(k + 63) << 53 | c;
b = sa;
}
}
if (p)
AB[n++] = tmp << 1 | 1ull;
else
AB[n++] = tmp << 1;
}
pakuri_sort(n, AB);
ll kotae = 1;
ull mae = AB[0] >> 1;
int k1 = 0, k2 = 0;
rep(i, n) {
if (mae != AB[i] >> 1) {
kotae = kotae * (f.f[k1] + f.f[k2] - 1) % mod;
k1 = 0;
k2 = 0;
mae = AB[i] >> 1;
}
if (AB[i] & 1ull)
k1++;
else
k2++;
}
kotae = kotae * (f.f[k1] + f.f[k2] - 1) % mod;
kotae = kotae * (f.f[a0] + f.f[b0] - 1) % mod;
printf("%lld\n", (kotae - 1 + ab00 + mod) % mod);
Would you please return 0;
} | #pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
// こんなクソコードを生み出してしまうなんて趣味は罪ね
const int mod = 1e9 + 7;
const int IMAX = 200000;
const int D[9] = {1, 10, 100, 1000, 10000,
100000, 1000000, 10000000, 100000000};
class unko {
public:
int f[IMAX + 1];
// 働いてない？
constexpr unko() : f() {
f[0] = 1;
rep1(i, IMAX) f[i] = ll(f[i - 1]) * 2 % mod;
}
} f;
void pakuri_sort(int N, ull A[]) {
const int b = 8;
ull tmp[200001];
rep(k, 8) {
int kazu[1 << b] = {}, kazu2[1 << b] = {};
rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];
for (int i = N - 1; i >= 0; i--)
tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];
k++;
rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];
for (int i = N - 1; i >= 0; i--)
A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];
}
}
const int CM = 1 << 17, CL = 22;
char cn[CM + CL], *ci = cn + CM + CL, *owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline ll getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
int pn = 1;
if (*ci == '-') {
pn = -pn;
ci++;
}
ll tmp = *(ll *)ci;
int dig = ((tmp & ma0) ^ ma0) ? 68 - __builtin_ctzll((tmp & ma0) ^ ma0) : 0;
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += (64 - dig >> 3);
ll tmp2 = *(ll *)ci;
dig = ((tmp2 & ma0) ^ ma0) ? 68 - __builtin_ctzll((tmp2 & ma0) ^ ma0) : 0;
tmp2 = tmp2 << dig & ma1;
if (dig == 64)
tmp2 = 0; //?
tmp2 = tmp2 * 10 + (tmp2 >> 8) & ma2;
tmp2 = tmp2 * 100 + (tmp2 >> 16) & ma3;
tmp2 = tmp2 * 10000 + (tmp2 >> 32) & ma4;
int d = (64 - dig >> 3);
tmp = tmp * D[d] + tmp2;
ci += d;
while ((ct = *ci++) >= '0')
tmp = tmp * 10 + ct - '0';
return pn * tmp;
}
const ull ma = (1ull << 52) - 1;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N = getint();
ull AB[200001];
int a0 = 0, b0 = 0;
int ab00 = 0;
int n = 0;
rep(i, N) {
ll a = getint(), b = getint();
if (a == 0 && b == 0) {
ab00++;
continue;
}
if (a == 0) {
a0++;
continue;
}
if (b == 0) {
b0++;
continue;
}
if (a < 0) {
a = -a;
b = -b;
}
bool p = (b > 0);
if (!p) {
b = -b;
swap(a, b);
}
ull tmp = 0;
rep(i, 3) {
tmp *= 3;
if (b) {
int k = __builtin_clzll(a) - __builtin_clzll(b);
if (k > 0)
a <<= k;
else
b <<= -k;
if (a > b) {
b <<= 1;
k--;
}
double d = double(b) / a;
ull tmp1 = *(ull *)&d;
ull c = tmp1 & ma | (1ull << 52);
lll sa = (lll(b) << 52) - lll(a) * c;
while (sa >= 0) {
sa -= a;
c++;
}
while (sa < 0) {
sa += a;
c--;
}
tmp += ull(k + 63) << 53 | c;
b = sa;
}
}
if (p)
AB[n++] = tmp << 1 | 1ull;
else
AB[n++] = tmp << 1;
}
pakuri_sort(n, AB);
ll kotae = 1;
ull mae = AB[0] >> 1;
int k1 = 0, k2 = 0;
rep(i, n) {
if (mae != AB[i] >> 1) {
kotae = kotae * (f.f[k1] + f.f[k2] - 1) % mod;
k1 = 0;
k2 = 0;
mae = AB[i] >> 1;
}
if (AB[i] & 1ull)
k1++;
else
k2++;
}
kotae = kotae * (f.f[k1] + f.f[k2] - 1) % mod;
kotae = kotae * (f.f[a0] + f.f[b0] - 1) % mod;
printf("%lld\n", (kotae - 1 + ab00 + mod) % mod);
Would you please return 0;
} | replace | 84 | 87 | 84 | 87 | 0 | |
p02679 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main();
using ll = long long;
using ull = unsigned long long;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VC = vector<char>;
using VVC = vector<vector<char>>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VD = vector<double>;
using VVD = vector<vector<double>>;
using P = pair<int, int>;
using VP = vector<P>;
using VVP = vector<vector<P>>;
// グラフ用
using Edge = pair<ll, int>; // first : コスト, second : 接続先ノード
using Graph = vector<vector<Edge>>;
const double PI = 3.14159265358979323846;
const int INF =
1 << 29; // INF + N 程度の余裕を残すため、INT_MAXは使用しないこと。
const ll INFLL = 1LL << 61;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP1LL(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define REVALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((int)(x).size())
#define LEN(x) ((int)(x).length())
#define ZERO(a) memset(a, 0, sizeof(a))
#define RAD(d) (PI * (d) / 180)
#define DEG(r) (180.0 * (r) / PI)
#define popcnt(x) __builtin_popcount(x)
#define popcnt64(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define YESNO(x) \
{ cout << ((x) ? "Yes" : "No") << endl; }
#define YES() \
{ cout << "Yes" << endl; }
#define NO() \
{ cout << "No" << endl; }
#define mt make_tuple
#define get0(x) get<0>(x)
#define get1(x) get<1>(x)
#define get2(x) get<2>(x)
#define get3(x) get<3>(x)
#define get4(x) get<4>(x)
// DP用
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// ダンプ
template <class T> void dump(const vector<T> &v) {
if (SZ(v) == 0)
return;
REP(i, SZ(v) - 1) { cout << v[i] << " "; }
cout << v[SZ(v) - 1] << endl;
}
// ダンプ（2次元）
template <class T> void dump(const vector<vector<T>> &v) {
REP(j, SZ(v)) { dump(v[j]); }
}
// ダンプ（２次元）
template <class T> void dump(int w, int h, const vector<T> &v) {
REP(j, h) {
REP(i, w - 1) { cout << v[j * w + i] << " "; }
cout << v[j * w + w - 1] << endl;
}
}
// 和
template <class T> T accumulate(const vector<T> &v) {
T sum = 0;
REP(i, SZ(v)) { sum += v[i]; }
return sum;
}
// 和（範囲指定）
template <class T> T accumulate(const vector<T> &v, int start, int length) {
T sum = 0;
REP(i, length) { sum += v[start + i]; }
return sum;
}
// 平均
template <class T> T average(const vector<T> &v) {
return accumulate(v) / SZ(v);
}
// 行列構造体
template <class T> struct Matrix {
T w, h;
vector<T> A;
Matrix(T w_, T h_) : w(w_), h(h_), A(w * h) {}
T get(T x, T y) const { return A[y * w + x]; }
};
// 行列への入力
template <class T> void input(Matrix<T> &m) {
REP(j, m.h) {
REP(i, m.w) { cin >> m.A[j * m.w + i]; }
}
}
// 行列の積算
template <class T> Matrix<T> prod(const Matrix<T> &a, const Matrix<T> &b) {
Matrix<T> m(b.w, a.h);
REP(j, m.h) {
REP(i, m.w) {
ll c = 0;
REP(k, a.w) { c += a.A[j * a.w + k] * b.A[k * b.w + i]; }
m.A[j * m.w + i] = c;
}
}
return m;
}
// 行列の出力(int)
void dump(const Matrix<int> &m) {
REP(j, m.h) {
REP(i, m.w - 1) { printf("%d ", m.A[j * m.w + i]); }
printf("%d\n", m.A[j * m.w + m.w - 1]);
}
}
// 行列の出力(long long)
void dump(const Matrix<ll> &m) {
REP(j, m.h) {
REP(i, m.w - 1) { printf("%lld ", m.A[j * m.w + i]); }
printf("%lld\n", m.A[j * m.w + m.w - 1]);
}
}
// 行列の出力(double)
void dump(const Matrix<double> &m) {
REP(j, m.h) {
REP(i, m.w - 1) { printf("%f ", m.A[j * m.w + i]); }
printf("%f\n", m.A[j * m.w + m.w - 1]);
}
}
// 文字列の大文字化
string &to_upper(string &s) {
REP(i, s.length()) {
if ('a' <= s[i] && s[i] <= 'z') {
s[i] -= 32;
}
}
return s;
}
// 文字列の小文字化
string &to_lower(string &s) {
REP(i, s.length()) {
if ('A' <= s[i] && s[i] <= 'Z') {
s[i] += 32;
}
}
return s;
}
// 素数取得
VB get_prime(int n) {
VB prime_flag(n, true);
prime_flag[0] = false;
prime_flag[1] = false;
for (int i = 2; i < n; i++) {
if (!prime_flag[i])
continue;
for (int j = i * 2; j < n; j += i)
prime_flag[j] = false;
}
return prime_flag;
}
// 素数判定（エラトステネスのふるい）
template <class T> bool is_prime(T value) {
for (ll i = 2; i * i <= value; i++) {
if (value % i == 0)
return false;
}
return true;
}
// 約数の列挙
template <class T> vector<T> get_divisors(T n) {
vector<T> ret;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ALL(ret));
return ret;
}
// 約数の列挙（1 ～ √Nまで）
template <class T> vector<T> get_divisors2(T n) {
vector<T> ret;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
}
}
return ret;
}
// 最大公約数(GCD; Greatest Common Divisor) ※ユークリッドの互除法
template <class T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// ３数の最大公約数
template <class T> T gcd(T a, T b, T c) { return gcd(gcd(a, b), c); }
// ３数以上の最大公約数
template <class T> T gcd(const vector<T> v) {
if (SZ(v) == 0)
return 0;
if (SZ(v) == 1)
return v[0];
if (SZ(v) == 2)
return gcd(v[0], v[1]);
T g = v[0];
for (int i = 1; i < SZ(v); i++) {
g = gcd(g, v[i]);
}
return g;
}
// 最小公倍数(LCM; Least Common Multiple)
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#if 0
// MOD計算(べき乗) : a^n % 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;
}
// MOD計算(逆元) : a^(-1) MOD (※拡張ユークリッド互除法)
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while(b){
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= mod;
if(u < 0) u += mod;
return u;
}
#endif
// MOD演算用構造体 (https://noshi91.hatenablog.com/entry/2019/03/31/174006)
struct mint {
static ll MOD;
ll a;
mint(const ll x = 0) noexcept : a(x % MOD) {}
const mint operator+(const mint rhs) const noexcept {
return mint(*this) += rhs;
}
const mint operator-(const mint rhs) const noexcept {
return mint(*this) -= rhs;
}
const mint operator*(const mint rhs) const noexcept {
return mint(*this) *= rhs;
}
const mint operator/(const mint rhs) const noexcept {
return mint(*this) /= rhs;
}
mint &operator+=(const mint rhs) noexcept {
a += rhs.a;
if (a >= MOD) {
a -= MOD;
}
return *this;
}
mint &operator-=(const mint rhs) noexcept {
if (a < rhs.a) {
a += MOD;
}
a -= rhs.a;
return *this;
}
mint &operator*=(const mint rhs) noexcept {
a = a * rhs.a % MOD;
return *this;
}
mint &operator/=(mint rhs) noexcept {
ll exp = MOD - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
// べき乗(a^n)
mint pow(ll n) const noexcept {
ll x = a, r = 1;
while (n > 0) {
if (n & 1)
r = r * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return mint(r);
}
// 逆元(a^-1)
mint inverse() const noexcept {
ll x = a, b = MOD, u = 1, v = 0;
while (b) {
ll t = x / b;
x -= t * b;
swap(x, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return mint(u);
}
friend ostream &operator<<(ostream &os, const mint &x);
};
ll mint::MOD = 0;
ostream &operator<<(ostream &os, const mint &x) {
os << x.a;
return os;
}
// DFS 幅優先探索 (A[0] ... A[N] タイプ)
#if 0
VI AA(N);
void dfs(int index, int size, int start, int end)
{
if (index == size) {
solve(A); // ここで必要な処理を行う
}
else{
for(int i = start; i <= end; ++i){
A[index] = i;
// start <= A[i] <= end (i=0~size-1) の場合
//dfs(index + 1, size, start, end);
// start <= A[0] <= A[1] <= ... <= A[size-1] <= end の場合
dfs(index + 1, size, i, end); // start = iを指定することで、次indexの値域を狭める
}
}
}
#endif
// DFS 幅優先探索 (グラフ問題)
//
// ■ 解ける問題
// 1.グラフ上の到達可否
// 2.連結成分の数
// 3.二部グラフ判定 → 引数に現在ノードの色を追加する。color[v]が到達済みで、かつ同じ色の場合、二部グラフではない。
// 4.各頂点の深さ → (行きがけ順)
// 5.各頂点の部分木サイズ → (帰りがけ順)
// 6.サイクル検出（★勉強中）
//
#if 0
VVI G(N); // グラフ
VB seen(N, false); // 到達フラグ
VI first_order(N); // 行きがけ順
VI last_order(N); // 帰りがけ順
VI color(N, 0); // 二部グラフ判定用(0:未到達, 1:白, -1:黒)
VI depth(N); // 各頂点の深さ
VI subtree_size(N); // 各頂点の部分木サイズ
void dfs(const VVI &G, int v, int &order, int parent, int d)
{
first_order[v] = order++;
depth[v] = d;
seen[v] = true;
for(auto nv : G[v]){
if(seen[nv]) continue;
dfs(G, nv, order, v, d);
}
// 部分木サイズ
subtree_size[v] = 1;
for(auto c : G[v]){
if(c == parent) continue;
subtree_size[v] += subtree_size[c];
}
last_order[v] = order++;
}
#endif
// DAG(有向無閉路グラフ)のトポロジカルソート
//
// ■ 応用問題
// 1.依存関係の解決処理
//
VI tsort(const VVI &G) {
int N = G.size();
VI indeg(N); // 各ノードへの入力辺数
stack<int> S; // indeg(x) == 0 のノード
for (auto &v : G) {
for (auto &e : v) {
indeg[e]++;
}
}
REP(i, N) {
if (indeg[i] == 0)
S.push(i);
}
VI ans;
while (!S.empty()) {
int v = S.top();
S.pop();
ans.pb(v);
for (auto &e : G[v]) {
indeg[e]--;
if (indeg[e] == 0)
S.push(e);
}
}
return ans;
}
// ダイクストラ法(最短経路問題。コストが負の場合使用できない)
//
// 返り値 : 各ノードiにおける距離（＝到達コスト）
VL dijkstra(const Graph &G, int start) {
int N = G.size();
priority_queue<Edge, vector<Edge>, greater<Edge>> que;
VL dists(N, INFLL);
que.push(mp(0LL, start));
dists[start] = 0;
while (!que.empty()) {
Edge p = que.top();
que.pop();
if (dists[p.second] < p.first)
continue;
for (auto &e : G[p.second]) {
if (dists[e.second] > dists[p.second] + e.first) {
dists[e.second] = dists[p.second] + e.first;
que.push(mp(dists[e.second], e.second));
}
}
}
return dists;
}
// ダイクストラ法の復元 : 指定した頂点（node）の1つ前のノードを取得する
int dijkstra_get_prev_node(const Graph &G, const VL &dists, int node) {
const vector<Edge> &edges = G[node];
int min_index = -1;
ll min_dist = INFLL;
for (Edge e : edges) {
int nv = e.second;
if (dists[nv] < min_dist) {
min_dist = dists[nv];
min_index = nv;
}
}
return min_index;
}
// ダイクストラ法の復元 :
// 始点（距離0）から指定した頂点（node）までのパスを取得する
VI dijkstra_restore_path(const Graph &G, const VL &dists, int node) {
VI path;
path.pb(node);
while ((node = dijkstra_get_prev_node(G, dists, node)) >= 0) {
path.pb(node);
}
reverse(ALL(path));
return path;
}
// Union-Find木(素集合データ構造) -
// グループ分けを木構造で管理する。任意の２要素が同じグループに所属するか判定する
struct UnionFind {
// 親ノードのインデックス
VI parent;
UnionFind(int size) {
parent.resize(size);
REP(i, size) {
parent[i] = i;
} // 初期状態は自ノードが親ノード(＝すべてのノードが独立)
}
// 木の根(root)を取得する
int root(int x) {
// 要素xが根の場合
if (parent[x] == x)
return x;
// 経路圧縮
parent[x] = root(parent[x]);
return parent[x];
}
// 同じグループかどうか判定する
bool same(int x, int y) { return root(x) == root(y); }
// ２つのグループを併合する
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x != y)
parent[x] = y;
}
};
// 最小全域木(Minimum Spanning Tree) (クラスカル法)
typedef tuple<int, int, int> STEdge; // get0 : コスト, get1,2 : 頂点
struct SpanningTree {
vector<STEdge> edges;
// 辺を追加する(※直接edges変数に追加してもよい。)
void add(int cost, int a, int b) { edges.push_back(mt(cost, a, b)); }
// 最小全域木を生成し、コストの和を計算する
int kuraskal(int size) {
sort(ALL(edges));
UnionFind tree(size);
int min_cost = 0;
REP(i, SZ(edges)) {
auto &e = edges[i];
if (!tree.same(get1(e), get2(e))) {
min_cost += get0(e);
tree.unite(get1(e), get2(e));
}
}
return min_cost;
}
};
// よく忘れるSTLの使い方
//
// ■ 最小値、最大値
// it = min_element(first, last);
// it = min_element(first, last);
//
// ■ 値の交換 swap(a, b) ※文字列(string)も交換可能。
//
// ■ 乱数
// srand((unsigned)time(NULL));
// rand() - 0 ~ 2^31-1 の範囲の乱数(※VSの場合2^15-1。)
//
// ■ 時間計測
// int t0 = clock();
// double ts = 1.0 * (clock() - t0) / CLOCKS_PER_SEC;
//
// ■ sort ソート（降順）
// sort(first, last, greater<T>()); // 大きい順(降順)
//
// ■ カウント O(N)、探索 O(N)、二分探索 O(logN)
// n = count(first, last, value);
// it = find(first, last, value); ※見つからない場合、it == last
// i = lower_bound(first, last, value) - first
// ★[first, last) 間は小さい順に【 ソート済み 】であること。
//
// 条件付き検索（ラムダ式）
// it = find_if(first, last, [](T &v){ return true/false; });
//
// ■ vector<T>
// v{ a, b, c } // 初期値
// v.assign(first, last) ※sizeも変わる
// v.assign(N, value) ※sizeも変わる
// find(ALL(v)) != v.end()
// v.emplace_back(v) ※emplace_back()が要素型Tのコンストラクタの役割をする
//
// ■ stack<T>, queue<T>
// ■ priority_queue<T, vector<T>, greater<T>> // 大きい順(降順)の場合、less<T>
// (※sortとは逆) s.push(x) s.pop() x = s.top() or x = q.front()
// ※queueの場合はfront()。 s.size() s.empty()
//
// ■ set<T>, multiset<T>
// s.insert(x)
// s.erase(x) ※multisetではすべてのx
// s.erase(it)
// s.find(x) == s.end()
// s.lower_bound(x)
//
// ■ map<K, V>
// m[K] = V; // 追加
// m.find(K) == m.end() // 探索
//
// ■ tuple
// tuple<T0, T1, T2, ...> t;
// t = mt(v0, v1, v2, ...)
// v0 = get0(t)
// get0(t) = v0
//
// ■ 順列
// do{
// }while(next_permutation(first, last));
// ★[first, last) 間は小さい順に【 ソート済み 】であること。
//
// ■ ビットセット
// bitset<8> b("10000000");
// bs.size()
// b[i] (i = 0 ~ b.size()-1)
// b.set(i) or b.reset(i)
// b.count(), b.all(), b.any(), b.none() 1の数, すべて1か, いずれか1か,
// すべて0か
//
int main() {
int N;
cin >> N;
int zero = 0;
map<pair<ll, ll>, P> mp;
REP(i, N) {
// Ai * Bi + Aj * Bj = 0をベクトルの内積に見立てる
ll x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
zero++;
continue;
}
// 約分
ll g = gcd(x, y);
x /= g;
y /= g;
// 180度回転
if (y < 0) {
x = -x;
y = -y;
}
if (y == 0 && x < 0) {
x = -x;
y = -y;
}
// 90度回転
bool rot90 = false;
if (x <= 0)
rot90 = true;
if (x <= 0) {
ll tmp = x;
x = y;
y = -tmp;
}
// 90度回転させて{x, y}が同じとなるものが、一緒に入れられないもの
if (rot90) {
// 90度回転したものの数
mp[{x, y}].first++;
} else {
// 90度回転していないものの数
mp[{x, y}].second++;
}
}
mint::MOD = 1e9 + 7;
mint ans = 1;
for (auto p : mp) {
int s = p.second.first;
int t = p.second.second;
mint now = 1;
now += mint(2).pow(s) - 1;
now += mint(2).pow(t) - 1;
ans *= now;
}
// x==0 && y==0のものを１個だけ選んだ場合を追加
ans += zero;
// 誰も選ばない場合（1パターン）を除く
ans -= 1;
cout << ans << endl;
return 0;
}
| // #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main();
using ll = long long;
using ull = unsigned long long;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VC = vector<char>;
using VVC = vector<vector<char>>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VD = vector<double>;
using VVD = vector<vector<double>>;
using P = pair<int, int>;
using VP = vector<P>;
using VVP = vector<vector<P>>;
// グラフ用
using Edge = pair<ll, int>; // first : コスト, second : 接続先ノード
using Graph = vector<vector<Edge>>;
const double PI = 3.14159265358979323846;
const int INF =
1 << 29; // INF + N 程度の余裕を残すため、INT_MAXは使用しないこと。
const ll INFLL = 1LL << 61;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP1LL(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define REVALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((int)(x).size())
#define LEN(x) ((int)(x).length())
#define ZERO(a) memset(a, 0, sizeof(a))
#define RAD(d) (PI * (d) / 180)
#define DEG(r) (180.0 * (r) / PI)
#define popcnt(x) __builtin_popcount(x)
#define popcnt64(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define YESNO(x) \
{ cout << ((x) ? "Yes" : "No") << endl; }
#define YES() \
{ cout << "Yes" << endl; }
#define NO() \
{ cout << "No" << endl; }
#define mt make_tuple
#define get0(x) get<0>(x)
#define get1(x) get<1>(x)
#define get2(x) get<2>(x)
#define get3(x) get<3>(x)
#define get4(x) get<4>(x)
// DP用
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// ダンプ
template <class T> void dump(const vector<T> &v) {
if (SZ(v) == 0)
return;
REP(i, SZ(v) - 1) { cout << v[i] << " "; }
cout << v[SZ(v) - 1] << endl;
}
// ダンプ（2次元）
template <class T> void dump(const vector<vector<T>> &v) {
REP(j, SZ(v)) { dump(v[j]); }
}
// ダンプ（２次元）
template <class T> void dump(int w, int h, const vector<T> &v) {
REP(j, h) {
REP(i, w - 1) { cout << v[j * w + i] << " "; }
cout << v[j * w + w - 1] << endl;
}
}
// 和
template <class T> T accumulate(const vector<T> &v) {
T sum = 0;
REP(i, SZ(v)) { sum += v[i]; }
return sum;
}
// 和（範囲指定）
template <class T> T accumulate(const vector<T> &v, int start, int length) {
T sum = 0;
REP(i, length) { sum += v[start + i]; }
return sum;
}
// 平均
template <class T> T average(const vector<T> &v) {
return accumulate(v) / SZ(v);
}
// 行列構造体
template <class T> struct Matrix {
T w, h;
vector<T> A;
Matrix(T w_, T h_) : w(w_), h(h_), A(w * h) {}
T get(T x, T y) const { return A[y * w + x]; }
};
// 行列への入力
template <class T> void input(Matrix<T> &m) {
REP(j, m.h) {
REP(i, m.w) { cin >> m.A[j * m.w + i]; }
}
}
// 行列の積算
template <class T> Matrix<T> prod(const Matrix<T> &a, const Matrix<T> &b) {
Matrix<T> m(b.w, a.h);
REP(j, m.h) {
REP(i, m.w) {
ll c = 0;
REP(k, a.w) { c += a.A[j * a.w + k] * b.A[k * b.w + i]; }
m.A[j * m.w + i] = c;
}
}
return m;
}
// 行列の出力(int)
void dump(const Matrix<int> &m) {
REP(j, m.h) {
REP(i, m.w - 1) { printf("%d ", m.A[j * m.w + i]); }
printf("%d\n", m.A[j * m.w + m.w - 1]);
}
}
// 行列の出力(long long)
void dump(const Matrix<ll> &m) {
REP(j, m.h) {
REP(i, m.w - 1) { printf("%lld ", m.A[j * m.w + i]); }
printf("%lld\n", m.A[j * m.w + m.w - 1]);
}
}
// 行列の出力(double)
void dump(const Matrix<double> &m) {
REP(j, m.h) {
REP(i, m.w - 1) { printf("%f ", m.A[j * m.w + i]); }
printf("%f\n", m.A[j * m.w + m.w - 1]);
}
}
// 文字列の大文字化
string &to_upper(string &s) {
REP(i, s.length()) {
if ('a' <= s[i] && s[i] <= 'z') {
s[i] -= 32;
}
}
return s;
}
// 文字列の小文字化
string &to_lower(string &s) {
REP(i, s.length()) {
if ('A' <= s[i] && s[i] <= 'Z') {
s[i] += 32;
}
}
return s;
}
// 素数取得
VB get_prime(int n) {
VB prime_flag(n, true);
prime_flag[0] = false;
prime_flag[1] = false;
for (int i = 2; i < n; i++) {
if (!prime_flag[i])
continue;
for (int j = i * 2; j < n; j += i)
prime_flag[j] = false;
}
return prime_flag;
}
// 素数判定（エラトステネスのふるい）
template <class T> bool is_prime(T value) {
for (ll i = 2; i * i <= value; i++) {
if (value % i == 0)
return false;
}
return true;
}
// 約数の列挙
template <class T> vector<T> get_divisors(T n) {
vector<T> ret;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ALL(ret));
return ret;
}
// 約数の列挙（1 ～ √Nまで）
template <class T> vector<T> get_divisors2(T n) {
vector<T> ret;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
}
}
return ret;
}
// 最大公約数(GCD; Greatest Common Divisor) ※ユークリッドの互除法
template <class T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
if (a == 0 && b == 0)
return 0;
if (b == 0)
return a;
T r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// ３数の最大公約数
template <class T> T gcd(T a, T b, T c) { return gcd(gcd(a, b), c); }
// ３数以上の最大公約数
template <class T> T gcd(const vector<T> v) {
if (SZ(v) == 0)
return 0;
if (SZ(v) == 1)
return v[0];
if (SZ(v) == 2)
return gcd(v[0], v[1]);
T g = v[0];
for (int i = 1; i < SZ(v); i++) {
g = gcd(g, v[i]);
}
return g;
}
// 最小公倍数(LCM; Least Common Multiple)
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#if 0
// MOD計算(べき乗) : a^n % 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;
}
// MOD計算(逆元) : a^(-1) MOD (※拡張ユークリッド互除法)
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while(b){
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= mod;
if(u < 0) u += mod;
return u;
}
#endif
// MOD演算用構造体 (https://noshi91.hatenablog.com/entry/2019/03/31/174006)
struct mint {
static ll MOD;
ll a;
mint(const ll x = 0) noexcept : a(x % MOD) {}
const mint operator+(const mint rhs) const noexcept {
return mint(*this) += rhs;
}
const mint operator-(const mint rhs) const noexcept {
return mint(*this) -= rhs;
}
const mint operator*(const mint rhs) const noexcept {
return mint(*this) *= rhs;
}
const mint operator/(const mint rhs) const noexcept {
return mint(*this) /= rhs;
}
mint &operator+=(const mint rhs) noexcept {
a += rhs.a;
if (a >= MOD) {
a -= MOD;
}
return *this;
}
mint &operator-=(const mint rhs) noexcept {
if (a < rhs.a) {
a += MOD;
}
a -= rhs.a;
return *this;
}
mint &operator*=(const mint rhs) noexcept {
a = a * rhs.a % MOD;
return *this;
}
mint &operator/=(mint rhs) noexcept {
ll exp = MOD - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
// べき乗(a^n)
mint pow(ll n) const noexcept {
ll x = a, r = 1;
while (n > 0) {
if (n & 1)
r = r * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return mint(r);
}
// 逆元(a^-1)
mint inverse() const noexcept {
ll x = a, b = MOD, u = 1, v = 0;
while (b) {
ll t = x / b;
x -= t * b;
swap(x, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return mint(u);
}
friend ostream &operator<<(ostream &os, const mint &x);
};
ll mint::MOD = 0;
ostream &operator<<(ostream &os, const mint &x) {
os << x.a;
return os;
}
// DFS 幅優先探索 (A[0] ... A[N] タイプ)
#if 0
VI AA(N);
void dfs(int index, int size, int start, int end)
{
if (index == size) {
solve(A); // ここで必要な処理を行う
}
else{
for(int i = start; i <= end; ++i){
A[index] = i;
// start <= A[i] <= end (i=0~size-1) の場合
//dfs(index + 1, size, start, end);
// start <= A[0] <= A[1] <= ... <= A[size-1] <= end の場合
dfs(index + 1, size, i, end); // start = iを指定することで、次indexの値域を狭める
}
}
}
#endif
// DFS 幅優先探索 (グラフ問題)
//
// ■ 解ける問題
// 1.グラフ上の到達可否
// 2.連結成分の数
// 3.二部グラフ判定 → 引数に現在ノードの色を追加する。color[v]が到達済みで、かつ同じ色の場合、二部グラフではない。
// 4.各頂点の深さ → (行きがけ順)
// 5.各頂点の部分木サイズ → (帰りがけ順)
// 6.サイクル検出（★勉強中）
//
#if 0
VVI G(N); // グラフ
VB seen(N, false); // 到達フラグ
VI first_order(N); // 行きがけ順
VI last_order(N); // 帰りがけ順
VI color(N, 0); // 二部グラフ判定用(0:未到達, 1:白, -1:黒)
VI depth(N); // 各頂点の深さ
VI subtree_size(N); // 各頂点の部分木サイズ
void dfs(const VVI &G, int v, int &order, int parent, int d)
{
first_order[v] = order++;
depth[v] = d;
seen[v] = true;
for(auto nv : G[v]){
if(seen[nv]) continue;
dfs(G, nv, order, v, d);
}
// 部分木サイズ
subtree_size[v] = 1;
for(auto c : G[v]){
if(c == parent) continue;
subtree_size[v] += subtree_size[c];
}
last_order[v] = order++;
}
#endif
// DAG(有向無閉路グラフ)のトポロジカルソート
//
// ■ 応用問題
// 1.依存関係の解決処理
//
VI tsort(const VVI &G) {
int N = G.size();
VI indeg(N); // 各ノードへの入力辺数
stack<int> S; // indeg(x) == 0 のノード
for (auto &v : G) {
for (auto &e : v) {
indeg[e]++;
}
}
REP(i, N) {
if (indeg[i] == 0)
S.push(i);
}
VI ans;
while (!S.empty()) {
int v = S.top();
S.pop();
ans.pb(v);
for (auto &e : G[v]) {
indeg[e]--;
if (indeg[e] == 0)
S.push(e);
}
}
return ans;
}
// ダイクストラ法(最短経路問題。コストが負の場合使用できない)
//
// 返り値 : 各ノードiにおける距離（＝到達コスト）
VL dijkstra(const Graph &G, int start) {
int N = G.size();
priority_queue<Edge, vector<Edge>, greater<Edge>> que;
VL dists(N, INFLL);
que.push(mp(0LL, start));
dists[start] = 0;
while (!que.empty()) {
Edge p = que.top();
que.pop();
if (dists[p.second] < p.first)
continue;
for (auto &e : G[p.second]) {
if (dists[e.second] > dists[p.second] + e.first) {
dists[e.second] = dists[p.second] + e.first;
que.push(mp(dists[e.second], e.second));
}
}
}
return dists;
}
// ダイクストラ法の復元 : 指定した頂点（node）の1つ前のノードを取得する
int dijkstra_get_prev_node(const Graph &G, const VL &dists, int node) {
const vector<Edge> &edges = G[node];
int min_index = -1;
ll min_dist = INFLL;
for (Edge e : edges) {
int nv = e.second;
if (dists[nv] < min_dist) {
min_dist = dists[nv];
min_index = nv;
}
}
return min_index;
}
// ダイクストラ法の復元 :
// 始点（距離0）から指定した頂点（node）までのパスを取得する
VI dijkstra_restore_path(const Graph &G, const VL &dists, int node) {
VI path;
path.pb(node);
while ((node = dijkstra_get_prev_node(G, dists, node)) >= 0) {
path.pb(node);
}
reverse(ALL(path));
return path;
}
// Union-Find木(素集合データ構造) -
// グループ分けを木構造で管理する。任意の２要素が同じグループに所属するか判定する
struct UnionFind {
// 親ノードのインデックス
VI parent;
UnionFind(int size) {
parent.resize(size);
REP(i, size) {
parent[i] = i;
} // 初期状態は自ノードが親ノード(＝すべてのノードが独立)
}
// 木の根(root)を取得する
int root(int x) {
// 要素xが根の場合
if (parent[x] == x)
return x;
// 経路圧縮
parent[x] = root(parent[x]);
return parent[x];
}
// 同じグループかどうか判定する
bool same(int x, int y) { return root(x) == root(y); }
// ２つのグループを併合する
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x != y)
parent[x] = y;
}
};
// 最小全域木(Minimum Spanning Tree) (クラスカル法)
typedef tuple<int, int, int> STEdge; // get0 : コスト, get1,2 : 頂点
struct SpanningTree {
vector<STEdge> edges;
// 辺を追加する(※直接edges変数に追加してもよい。)
void add(int cost, int a, int b) { edges.push_back(mt(cost, a, b)); }
// 最小全域木を生成し、コストの和を計算する
int kuraskal(int size) {
sort(ALL(edges));
UnionFind tree(size);
int min_cost = 0;
REP(i, SZ(edges)) {
auto &e = edges[i];
if (!tree.same(get1(e), get2(e))) {
min_cost += get0(e);
tree.unite(get1(e), get2(e));
}
}
return min_cost;
}
};
// よく忘れるSTLの使い方
//
// ■ 最小値、最大値
// it = min_element(first, last);
// it = min_element(first, last);
//
// ■ 値の交換 swap(a, b) ※文字列(string)も交換可能。
//
// ■ 乱数
// srand((unsigned)time(NULL));
// rand() - 0 ~ 2^31-1 の範囲の乱数(※VSの場合2^15-1。)
//
// ■ 時間計測
// int t0 = clock();
// double ts = 1.0 * (clock() - t0) / CLOCKS_PER_SEC;
//
// ■ sort ソート（降順）
// sort(first, last, greater<T>()); // 大きい順(降順)
//
// ■ カウント O(N)、探索 O(N)、二分探索 O(logN)
// n = count(first, last, value);
// it = find(first, last, value); ※見つからない場合、it == last
// i = lower_bound(first, last, value) - first
// ★[first, last) 間は小さい順に【 ソート済み 】であること。
//
// 条件付き検索（ラムダ式）
// it = find_if(first, last, [](T &v){ return true/false; });
//
// ■ vector<T>
// v{ a, b, c } // 初期値
// v.assign(first, last) ※sizeも変わる
// v.assign(N, value) ※sizeも変わる
// find(ALL(v)) != v.end()
// v.emplace_back(v) ※emplace_back()が要素型Tのコンストラクタの役割をする
//
// ■ stack<T>, queue<T>
// ■ priority_queue<T, vector<T>, greater<T>> // 大きい順(降順)の場合、less<T>
// (※sortとは逆) s.push(x) s.pop() x = s.top() or x = q.front()
// ※queueの場合はfront()。 s.size() s.empty()
//
// ■ set<T>, multiset<T>
// s.insert(x)
// s.erase(x) ※multisetではすべてのx
// s.erase(it)
// s.find(x) == s.end()
// s.lower_bound(x)
//
// ■ map<K, V>
// m[K] = V; // 追加
// m.find(K) == m.end() // 探索
//
// ■ tuple
// tuple<T0, T1, T2, ...> t;
// t = mt(v0, v1, v2, ...)
// v0 = get0(t)
// get0(t) = v0
//
// ■ 順列
// do{
// }while(next_permutation(first, last));
// ★[first, last) 間は小さい順に【 ソート済み 】であること。
//
// ■ ビットセット
// bitset<8> b("10000000");
// bs.size()
// b[i] (i = 0 ~ b.size()-1)
// b.set(i) or b.reset(i)
// b.count(), b.all(), b.any(), b.none() 1の数, すべて1か, いずれか1か,
// すべて0か
//
int main() {
int N;
cin >> N;
int zero = 0;
map<pair<ll, ll>, P> mp;
REP(i, N) {
// Ai * Bi + Aj * Bj = 0をベクトルの内積に見立てる
ll x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
zero++;
continue;
}
// 約分
ll g = gcd(x, y);
x /= g;
y /= g;
// 180度回転
if (y < 0) {
x = -x;
y = -y;
}
if (y == 0 && x < 0) {
x = -x;
y = -y;
}
// 90度回転
bool rot90 = false;
if (x <= 0)
rot90 = true;
if (x <= 0) {
ll tmp = x;
x = y;
y = -tmp;
}
// 90度回転させて{x, y}が同じとなるものが、一緒に入れられないもの
if (rot90) {
// 90度回転したものの数
mp[{x, y}].first++;
} else {
// 90度回転していないものの数
mp[{x, y}].second++;
}
}
mint::MOD = 1e9 + 7;
mint ans = 1;
for (auto p : mp) {
int s = p.second.first;
int t = p.second.second;
mint now = 1;
now += mint(2).pow(s) - 1;
now += mint(2).pow(t) - 1;
ans *= now;
}
// x==0 && y==0のものを１個だけ選んだ場合を追加
ans += zero;
// 誰も選ばない場合（1パターン）を除く
ans -= 1;
cout << ans << endl;
return 0;
}
| replace | 263 | 264 | 263 | 270 | 0 | |
p02679 | C++ | Runtime Error | /*
AB=0,0はコーナーケースこれらを足した上で,
省いて普通の分析につなげる
S, Tに対して, それぞれの集合は直線上で
sとtは直行
この時, SかTかのどっちかのみ選べる
選び方は2^|S|+2^|T|-1(空集合に注意)
これをS[i]で掛け合わせればいい
問題はS[i]の分類, どうやって同じ直線上の点を検出するか
角度に直して分析? doubleだと誤差がだるそう
最大公約数で割り算? logAなのでいけそう
*/
#include <bits/stdc++.h>
using namespace std;
typedef pair<long, long> P;
#define Q 1000000007
long gcd(long x, long y) { return (x % y == 0 ? y : gcd(y, x % y)); }
long pow(long x) {
if (x == 0)
return 1;
if (x % 2)
return pow(x - 1) * 2 % Q;
else {
long y = pow(x / 2);
return y * y % Q;
}
}
int main() {
long N;
cin >> N;
vector<P> S, T;
long ans = 0;
for (long i = 0; i < N; i++) {
long a, b;
cin >> a >> b;
// [0,90), [90,180)にする
if (a == 0 && b == 0) {
ans++;
continue;
}
if ((a < 0 && b <= 0) || (a >= 0 && b < 0)) {
a *= -1;
b *= -1;
}
if (a > 0 && b >= 0) { //[0,90)
if (b == 0)
S.push_back(P(1, 0));
else {
long g = gcd(a, b);
S.push_back(P(a / g, b / g));
}
} else if (a <= 0 && b > 0) { //[90,180),
// これをさらに90度回転させて[0,90)に
if (a == 0)
T.push_back(P(1, 0));
else {
long g = gcd(-a, b);
T.push_back(P(b / g, -a / g));
}
} else
cout << "error";
}
// map<P,P>: ベクトル/ (Sの個数,Tの個数)
// set, 登録されたベクトル
map<P, P> VST;
for (P s : S) {
VST[s].first++;
}
for (P t : T) {
VST[t].second++;
}
long x = 1;
for (const auto &[k, v] : VST) {
x = x * ((pow(v.first) + pow(v.second) - 1) % Q) % Q;
}
assert((ans + x - 1) % Q >= 0);
cout << (ans + x - 1) % Q;
} | /*
AB=0,0はコーナーケースこれらを足した上で,
省いて普通の分析につなげる
S, Tに対して, それぞれの集合は直線上で
sとtは直行
この時, SかTかのどっちかのみ選べる
選び方は2^|S|+2^|T|-1(空集合に注意)
これをS[i]で掛け合わせればいい
問題はS[i]の分類, どうやって同じ直線上の点を検出するか
角度に直して分析? doubleだと誤差がだるそう
最大公約数で割り算? logAなのでいけそう
*/
#include <bits/stdc++.h>
using namespace std;
typedef pair<long, long> P;
#define Q 1000000007
long gcd(long x, long y) { return (x % y == 0 ? y : gcd(y, x % y)); }
long pow(long x) {
if (x == 0)
return 1;
if (x % 2)
return pow(x - 1) * 2 % Q;
else {
long y = pow(x / 2);
return y * y % Q;
}
}
int main() {
long N;
cin >> N;
vector<P> S, T;
long ans = 0;
for (long i = 0; i < N; i++) {
long a, b;
cin >> a >> b;
// [0,90), [90,180)にする
if (a == 0 && b == 0) {
ans++;
continue;
}
if ((a < 0 && b <= 0) || (a >= 0 && b < 0)) {
a *= -1;
b *= -1;
}
if (a > 0 && b >= 0) { //[0,90)
if (b == 0)
S.push_back(P(1, 0));
else {
long g = gcd(a, b);
S.push_back(P(a / g, b / g));
}
} else if (a <= 0 && b > 0) { //[90,180),
// これをさらに90度回転させて[0,90)に
if (a == 0)
T.push_back(P(1, 0));
else {
long g = gcd(-a, b);
T.push_back(P(b / g, -a / g));
}
} else
cout << "error";
}
// map<P,P>: ベクトル/ (Sの個数,Tの個数)
// set, 登録されたベクトル
map<P, P> VST;
for (P s : S) {
VST[s].first++;
}
for (P t : T) {
VST[t].second++;
}
long x = 1;
for (const auto &[k, v] : VST) {
x = x * ((pow(v.first) + pow(v.second) - 1) % Q) % Q;
}
assert((ans + x - 1 + Q) % Q >= 0);
cout << (ans + x - 1 + Q) % Q;
} | replace | 81 | 83 | 81 | 83 | 0 | |
p02679 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) { return (x % y) ? gcd(y, x % y) : y; }
const long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<long long> pw(200010);
pw[0] = 1;
for (int i = 1; i < 200010; ++i)
pw[i] = (pw[i - 1] * 2) % MOD;
map<pair<long long, long long>, pair<int, int>> x;
long long zz = 0;
for (int i = 0; i < N; ++i) {
long long a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
zz++;
continue;
}
if (make_pair(a, b) < make_pair(0LL, 0LL)) {
a = -a;
b = -b;
}
long long g = gcd(abs(a), abs(b));
a /= g;
b /= g;
if (b > 0) {
x[make_pair(a, b)].first++;
} else {
x[make_pair(-b, a)].second++;
}
}
long long ans = 1;
for (auto &p : x) {
ans = ans * (pw[p.second.first] + pw[p.second.second] - 1) % MOD;
}
cout << (ans + zz + MOD - 1) % MOD << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) { return (y) ? gcd(y, x % y) : x; }
const long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<long long> pw(200010);
pw[0] = 1;
for (int i = 1; i < 200010; ++i)
pw[i] = (pw[i - 1] * 2) % MOD;
map<pair<long long, long long>, pair<int, int>> x;
long long zz = 0;
for (int i = 0; i < N; ++i) {
long long a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
zz++;
continue;
}
if (make_pair(a, b) < make_pair(0LL, 0LL)) {
a = -a;
b = -b;
}
long long g = gcd(abs(a), abs(b));
a /= g;
b /= g;
if (b > 0) {
x[make_pair(a, b)].first++;
} else {
x[make_pair(-b, a)].second++;
}
}
long long ans = 1;
for (auto &p : x) {
ans = ans * (pw[p.second.first] + pw[p.second.second] - 1) % MOD;
}
cout << (ans + zz + MOD - 1) % MOD << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02679 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
constexpr long long int MOD = 1000000007;
struct Coordinate {
long long int a, b;
bool operator<(const Coordinate &that) const {
return a == that.a ? b < that.b : a < that.a;
}
};
long long int gcd(const long long int a, const long long int b) {
return b == 0 ? a : gcd(b, a % b);
}
long long int power(const long long int base, const long long int exp) {
switch (exp) {
case 0:
return 1L;
case 1:
return base % MOD;
default:
return power(base * base % MOD, exp >> 1) * power(base, exp & 1) % MOD;
}
}
int main() {
std::cin.tie(nullptr);
std::cin.sync_with_stdio(false);
int n;
std::cin >> n;
std::vector<Coordinate> points(n);
for (auto &point : points) {
long long int a, b;
std::cin >> a >> b;
const auto g = gcd(a, b);
point.a = a / g;
point.b = b / g;
}
std::map<Coordinate, long long int> appear;
long long int both_zero{0}, a_zero{0}, b_zero{0};
for (const auto &point : points) {
if (point.a == 0 && point.b == 0) {
++both_zero;
} else if (point.a == 0) {
++a_zero;
} else if (point.b == 0) {
++b_zero;
} else {
appear[point]++;
}
}
long long int valid_pattern = (power(2, a_zero) + power(2, b_zero) - 1) % MOD;
while (!appear.empty()) {
const auto first = *appear.begin();
const auto origin = first.first;
const auto opposite = Coordinate{-origin.a, -origin.b};
const auto rightA = Coordinate{-origin.b, origin.a};
const auto rightB = Coordinate{origin.b, -origin.a};
const auto parallel = first.second + appear[opposite];
const auto right = appear[rightA] + appear[rightB];
valid_pattern *= (power(2, parallel) + power(2, right) - 1) % MOD;
valid_pattern %= MOD;
appear.erase(origin);
appear.erase(opposite);
appear.erase(rightA);
appear.erase(rightB);
}
valid_pattern += both_zero - 1;
std::cout << (valid_pattern % MOD + MOD) % MOD << '\n';
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
constexpr long long int MOD = 1000000007;
struct Coordinate {
long long int a, b;
bool operator<(const Coordinate &that) const {
return a == that.a ? b < that.b : a < that.a;
}
};
long long int gcd(const long long int a, const long long int b) {
return b == 0 ? a : gcd(b, a % b);
}
long long int power(const long long int base, const long long int exp) {
switch (exp) {
case 0:
return 1L;
case 1:
return base % MOD;
default:
return power(base * base % MOD, exp >> 1) * power(base, exp & 1) % MOD;
}
}
int main() {
std::cin.tie(nullptr);
std::cin.sync_with_stdio(false);
int n;
std::cin >> n;
std::vector<Coordinate> points(n);
for (auto &point : points) {
long long int a, b;
std::cin >> a >> b;
const auto g = a == 0 && b == 0 ? 1 : gcd(a, b);
point.a = a / g;
point.b = b / g;
}
std::map<Coordinate, long long int> appear;
long long int both_zero{0}, a_zero{0}, b_zero{0};
for (const auto &point : points) {
if (point.a == 0 && point.b == 0) {
++both_zero;
} else if (point.a == 0) {
++a_zero;
} else if (point.b == 0) {
++b_zero;
} else {
appear[point]++;
}
}
long long int valid_pattern = (power(2, a_zero) + power(2, b_zero) - 1) % MOD;
while (!appear.empty()) {
const auto first = *appear.begin();
const auto origin = first.first;
const auto opposite = Coordinate{-origin.a, -origin.b};
const auto rightA = Coordinate{-origin.b, origin.a};
const auto rightB = Coordinate{origin.b, -origin.a};
const auto parallel = first.second + appear[opposite];
const auto right = appear[rightA] + appear[rightB];
valid_pattern *= (power(2, parallel) + power(2, right) - 1) % MOD;
valid_pattern %= MOD;
appear.erase(origin);
appear.erase(opposite);
appear.erase(rightA);
appear.erase(rightB);
}
valid_pattern += both_zero - 1;
std::cout << (valid_pattern % MOD + MOD) % MOD << '\n';
}
| replace | 46 | 47 | 46 | 47 | 0 | |
p02680 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int, int>;
using piii = pair<pii, int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define isSquare(x) (sqrt(x) * sqrt(x) == x)
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
};
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
};
inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
cin >> first;
in(rest...);
return;
}
inline void out(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void out(First first, Rest... rest) {
cout << first << " ";
out(rest...);
return;
}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T>
pair<S, T> operator*(const pair<S, T> &s, const S &t) {
return pair<S, T>(s.first * t, s.second * t);
}
template <typename T> void Exit(T first) {
cout << first << endl;
exit(0);
};
template <int mod> struct ModInt {
unsigned x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1, 0), pii(0, 1), pii(-1, 0), pii(0, -1)};
const int calender[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int ucalender[13] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool range(int a, int b, int x) {
if (a <= x and x < b)
return true;
else
return false;
}
bool range(int a, int b, int c, int d, pii p) {
if (a <= p.first and p.first < b and c <= p.second and p.second < d)
return true;
else
return false;
}
unordered_map<int, int> Z(vector<int> v) {
unordered_map<int, int> ret;
for (auto x : v) {
int n = ret.size();
ret[x] = n;
}
return ret;
}
struct GridUnionFind {
int H, W;
std::vector<int> par, cou;
using P = std::pair<int, int>;
GridUnionFind(int H_, int W_) : H(H_), W(W_), par(H * W), cou(H * W, 1) {
std::iota(par.begin(), par.end(), 0);
}
inline int id_(int h, int w) { return h * W + w; }
inline bool coordinate_valid(int h, int w) {
return h >= 0 and h < H and w >= 0 and w < W;
}
int _find(int x) { return (par[x] == x) ? x : (par[x] = _find(par[x])); }
bool _unite(int x, int y) {
x = _find(x), y = _find(y);
if (x == y)
return false;
if (cou[x] < cou[y])
std::swap(x, y);
par[y] = x, cou[x] += cou[y];
return true;
}
int find(int h, int w) {
assert(coordinate_valid(h, w));
return _find(id_(h, w));
}
bool unite(int h, int w, int h2, int w2) {
assert(coordinate_valid(h, w) and coordinate_valid(h2, w2));
return _unite(id_(h, w), id_(h2, w2));
}
int count(int h, int w) { return cou[find(h, w)]; }
bool same(int h, int w, int h2, int w2) { return find(h, w) == find(h2, w2); }
int find(P p) { return find(p.first, p.second); }
bool unite(P p, P p2) {
return unite(p.first, p.second, p2.first, p2.second);
}
int count(P p) { return count(p.first, p.second); }
bool same(P p, P p2) { return same(p.first, p.second, p2.first, p2.second); }
void merge_outer() {
for (int h = 0; h < H - 1; h++)
unite(h, 0, h + 1, 0), unite(h, W - 1, h + 1, W - 1);
for (int w = 0; w < W - 1; w++)
unite(0, w, 0, w + 1), unite(H - 1, w, H - 1, w + 1);
}
friend std::ostream &operator<<(std::ostream &os, GridUnionFind &g) {
constexpr int WW = 3;
os << "[(" << g.H << " * " << g.W << " grid)\n";
for (int i = 0; i < g.H; i++) {
for (int j = 0; j < g.W - 1; j++) {
os << std::setw(WW) << g.find(i, j)
<< (g.same(i, j, i, j + 1) ? '-' : ' ');
}
os << std::setw(WW) << g.find(i, g.W - 1) << '\n';
if (i < g.H - 1) {
for (int j = 0; j < g.W; j++)
os << std::setw(WW + 1) << (g.same(i, j, i + 1, j) ? "| " : " ");
os << "\n";
}
}
os << "]\n";
return os;
}
};
// https://atcoder.jp/contests/abc168/submissions/13313031
int main() {
iosetup();
int n, m;
cin >> n >> m;
vector<int> zx{-INF, 0, INF}, zy{-INF, 0, INF};
// cerr << zx << endl;
vector<int> A(n), B(n), C(n), D(m), E(m), F(m);
rep(i, 0, n) cin >> A[i] >> B[i] >> C[i];
rep(i, 0, m) cin >> D[i] >> E[i] >> F[i];
zx.insert(zx.end(), ALL(A));
zx.insert(zx.end(), ALL(B));
zx.insert(zx.end(), ALL(D));
zy.insert(zy.end(), ALL(C));
zy.insert(zy.end(), ALL(E));
zy.insert(zy.end(), ALL(F));
sort(ALL(zx));
UNIQUE(zx);
sort(ALL(zy));
UNIQUE(zy);
unordered_map<int, int> xinv = Z(zx), yinv = Z(zy);
vector<vector<int>> conn1(zx.size(), vector<int>(zy.size(), 0));
vector<vector<int>> conn2(zx.size(), vector<int>(zy.size(), 0));
rep(i, 0, n) {
int x1 = xinv[A[i]], x2 = xinv[B[i]], y = yinv[C[i]];
conn1[x1][y - 1]++;
conn1[x2][y - 1]--;
}
rep(i, 0, conn1.size() - 1) rep(j, 0, conn1[i].size()) conn1[i + 1][j] +=
conn1[i][j];
rep(j, 0, m) {
int x = xinv[D[j]], y1 = yinv[E[j]], y2 = yinv[F[j]];
conn2[x - 1][y1]++;
conn2[x - 1][y2]--;
}
rep(i, 0, conn2.size()) rep(j, 0, conn2[i].size() - 1) conn2[i][j + 1] +=
conn2[i][j];
GridUnionFind uf(zx.size(), zy.size());
rep(x, 0, zx.size()) rep(y, 0, zy.size()) {
if (x + 1 < zx.size() and conn2[x][y] == 0)
uf.unite(x, y, x + 1, y);
if (y + 1 < zy.size() and conn1[x][y] == 0)
uf.unite(x, y, x, y + 1);
}
int xz = xinv[0], yz = yinv[0];
if (uf.same(xz, yz, 0, 0))
Exit("INF");
ll ans = 0;
rep(x, 0, zx.size() - 1) rep(y, 0, zy.size() - 1) if (uf.same(x, y, xz, yz)) {
ans += (ll)(zx[x + 1] - zx[x]) * (zy[y + 1] - zy[y]);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int, int>;
using piii = pair<pii, int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define isSquare(x) (sqrt(x) * sqrt(x) == x)
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
};
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
};
inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
cin >> first;
in(rest...);
return;
}
inline void out(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void out(First first, Rest... rest) {
cout << first << " ";
out(rest...);
return;
}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9 + 100;
const long long INFLL = 1e18;
void iosetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T>
pair<S, T> operator*(const pair<S, T> &s, const S &t) {
return pair<S, T>(s.first * t, s.second * t);
}
template <typename T> void Exit(T first) {
cout << first << endl;
exit(0);
};
template <int mod> struct ModInt {
unsigned x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1, 0), pii(0, 1), pii(-1, 0), pii(0, -1)};
const int calender[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int ucalender[13] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool range(int a, int b, int x) {
if (a <= x and x < b)
return true;
else
return false;
}
bool range(int a, int b, int c, int d, pii p) {
if (a <= p.first and p.first < b and c <= p.second and p.second < d)
return true;
else
return false;
}
unordered_map<int, int> Z(vector<int> v) {
unordered_map<int, int> ret;
for (auto x : v) {
int n = ret.size();
ret[x] = n;
}
return ret;
}
struct GridUnionFind {
int H, W;
std::vector<int> par, cou;
using P = std::pair<int, int>;
GridUnionFind(int H_, int W_) : H(H_), W(W_), par(H * W), cou(H * W, 1) {
std::iota(par.begin(), par.end(), 0);
}
inline int id_(int h, int w) { return h * W + w; }
inline bool coordinate_valid(int h, int w) {
return h >= 0 and h < H and w >= 0 and w < W;
}
int _find(int x) { return (par[x] == x) ? x : (par[x] = _find(par[x])); }
bool _unite(int x, int y) {
x = _find(x), y = _find(y);
if (x == y)
return false;
if (cou[x] < cou[y])
std::swap(x, y);
par[y] = x, cou[x] += cou[y];
return true;
}
int find(int h, int w) {
assert(coordinate_valid(h, w));
return _find(id_(h, w));
}
bool unite(int h, int w, int h2, int w2) {
assert(coordinate_valid(h, w) and coordinate_valid(h2, w2));
return _unite(id_(h, w), id_(h2, w2));
}
int count(int h, int w) { return cou[find(h, w)]; }
bool same(int h, int w, int h2, int w2) { return find(h, w) == find(h2, w2); }
int find(P p) { return find(p.first, p.second); }
bool unite(P p, P p2) {
return unite(p.first, p.second, p2.first, p2.second);
}
int count(P p) { return count(p.first, p.second); }
bool same(P p, P p2) { return same(p.first, p.second, p2.first, p2.second); }
void merge_outer() {
for (int h = 0; h < H - 1; h++)
unite(h, 0, h + 1, 0), unite(h, W - 1, h + 1, W - 1);
for (int w = 0; w < W - 1; w++)
unite(0, w, 0, w + 1), unite(H - 1, w, H - 1, w + 1);
}
friend std::ostream &operator<<(std::ostream &os, GridUnionFind &g) {
constexpr int WW = 3;
os << "[(" << g.H << " * " << g.W << " grid)\n";
for (int i = 0; i < g.H; i++) {
for (int j = 0; j < g.W - 1; j++) {
os << std::setw(WW) << g.find(i, j)
<< (g.same(i, j, i, j + 1) ? '-' : ' ');
}
os << std::setw(WW) << g.find(i, g.W - 1) << '\n';
if (i < g.H - 1) {
for (int j = 0; j < g.W; j++)
os << std::setw(WW + 1) << (g.same(i, j, i + 1, j) ? "| " : " ");
os << "\n";
}
}
os << "]\n";
return os;
}
};
// https://atcoder.jp/contests/abc168/submissions/13313031
int main() {
iosetup();
int n, m;
cin >> n >> m;
vector<int> zx{-INF, 0, INF}, zy{-INF, 0, INF};
// cerr << zx << endl;
vector<int> A(n), B(n), C(n), D(m), E(m), F(m);
rep(i, 0, n) cin >> A[i] >> B[i] >> C[i];
rep(i, 0, m) cin >> D[i] >> E[i] >> F[i];
zx.insert(zx.end(), ALL(A));
zx.insert(zx.end(), ALL(B));
zx.insert(zx.end(), ALL(D));
zy.insert(zy.end(), ALL(C));
zy.insert(zy.end(), ALL(E));
zy.insert(zy.end(), ALL(F));
sort(ALL(zx));
UNIQUE(zx);
sort(ALL(zy));
UNIQUE(zy);
unordered_map<int, int> xinv = Z(zx), yinv = Z(zy);
vector<vector<int>> conn1(zx.size(), vector<int>(zy.size(), 0));
vector<vector<int>> conn2(zx.size(), vector<int>(zy.size(), 0));
rep(i, 0, n) {
int x1 = xinv[A[i]], x2 = xinv[B[i]], y = yinv[C[i]];
conn1[x1][y - 1]++;
conn1[x2][y - 1]--;
}
rep(i, 0, conn1.size() - 1) rep(j, 0, conn1[i].size()) conn1[i + 1][j] +=
conn1[i][j];
rep(j, 0, m) {
int x = xinv[D[j]], y1 = yinv[E[j]], y2 = yinv[F[j]];
conn2[x - 1][y1]++;
conn2[x - 1][y2]--;
}
rep(i, 0, conn2.size()) rep(j, 0, conn2[i].size() - 1) conn2[i][j + 1] +=
conn2[i][j];
GridUnionFind uf(zx.size(), zy.size());
rep(x, 0, zx.size()) rep(y, 0, zy.size()) {
if (x + 1 < zx.size() and conn2[x][y] == 0)
uf.unite(x, y, x + 1, y);
if (y + 1 < zy.size() and conn1[x][y] == 0)
uf.unite(x, y, x, y + 1);
}
int xz = xinv[0], yz = yinv[0];
if (uf.same(xz, yz, 0, 0))
Exit("INF");
ll ans = 0;
rep(x, 0, zx.size() - 1) rep(y, 0, zy.size() - 1) if (uf.same(x, y, xz, yz)) {
ans += (ll)(zx[x + 1] - zx[x]) * (zy[y + 1] - zy[y]);
}
cout << ans << endl;
return 0;
} | replace | 73 | 74 | 73 | 74 | 0 | |
p02680 | C++ | Runtime Error | // READ & UNDERSTAND
// ll, int overflow, array bounds, memset(0)
// special cases (n=1?), n+1 (1-index)
// do smth instead of nothing & stay organized
// WRITE STUFF DOWN
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
ll INF = LLONG_MAX;
int const mxn = 1111;
int n, m;
int a[mxn], b[mxn], c[mxn], d[mxn], e[mxn], f[mxn];
bool vis[mxn][mxn], up[mxn][mxn], dw[mxn][mxn], le[mxn][mxn],
ri[mxn][mxn]; // blockage
int const dx[] = {-1, 0, 1, 0};
int const dy[] = {0, -1, 0, 1};
vi xx = {-MOD, MOD}, yy = {-MOD, MOD};
void bfs(int x, int y) {
queue<ii> q;
q.emplace(x, y);
vis[x][y] = 1;
while (!q.empty()) {
x = q.front().fi;
y = q.front().se;
q.pop();
for (int i = 0; i < 4; i++) {
if (i == 0 && le[x][y])
continue;
if (i == 1 && dw[x][y])
continue;
if (i == 2 && ri[x][y])
continue;
if (i == 3 && up[x][y])
continue;
int X = x + dx[i];
int Y = y + dy[i];
if (X < 0 || X >= (int)xx.size() - 1)
continue;
if (Y < 0 || Y >= (int)yy.size() - 1)
continue;
if (vis[X][Y])
continue;
vis[X][Y] = 1;
q.emplace(X, Y);
}
}
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
cin >> n >> m;
memset(vis, 0, sizeof(vis));
memset(up, 0, sizeof(up));
memset(dw, 0, sizeof(dw));
memset(le, 0, sizeof(le));
memset(ri, 0, sizeof(ri));
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
xx.pb(a[i]);
xx.pb(b[i]);
yy.pb(c[i]);
}
for (int i = 0; i < m; i++) {
cin >> d[i] >> e[i] >> f[i];
xx.pb(d[i]);
yy.pb(e[i]);
yy.pb(f[i]);
}
sort(all(xx));
xx.erase(unique(all(xx)), xx.end());
sort(all(yy));
yy.erase(unique(all(yy)), yy.end());
// setting up blockage
for (int i = 0; i < n; i++) {
int x1 = lower_bound(all(xx), a[i]) - xx.begin();
int x2 = lower_bound(all(xx), b[i]) - xx.begin();
int y = lower_bound(all(yy), c[i]) - yy.begin();
// at y x1 --- x2
for (int j = x1; j < x2; j++) {
up[j][y - 1] = 1;
dw[j][y] = 1;
}
}
for (int i = 0; i < m; i++) {
int x = lower_bound(all(xx), d[i]) - xx.begin();
int y1 = lower_bound(all(yy), e[i]) - yy.begin();
int y2 = lower_bound(all(yy), f[i]) - yy.begin();
/* at x
y1
|
|
|
y2
*/
for (int j = y1; j < y2; j++) {
ri[x - 1][j] = 1;
le[x][j] = 1;
}
}
int x = lower_bound(all(xx), 0) - xx.begin() - 1;
int y = lower_bound(all(yy), 0) - yy.begin() - 1;
bfs(x, y);
if (vis[0][0] || vis[xx.size() - 1][yy.size() - 1]) {
cout << "INF" << endl;
return 0;
}
ll ans = 0LL;
for (int i = 0; i < (int)xx.size() - 1; i++)
for (int j = 0; j < (int)yy.size() - 1; j++)
if (vis[i][j])
ans += ll(xx[i + 1] - xx[i]) * (yy[j + 1] - yy[j]);
cout << ans << endl;
}
| // READ & UNDERSTAND
// ll, int overflow, array bounds, memset(0)
// special cases (n=1?), n+1 (1-index)
// do smth instead of nothing & stay organized
// WRITE STUFF DOWN
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
ll INF = LLONG_MAX;
int const mxn = 4444;
int n, m;
int a[mxn], b[mxn], c[mxn], d[mxn], e[mxn], f[mxn];
bool vis[mxn][mxn], up[mxn][mxn], dw[mxn][mxn], le[mxn][mxn],
ri[mxn][mxn]; // blockage
int const dx[] = {-1, 0, 1, 0};
int const dy[] = {0, -1, 0, 1};
vi xx = {-MOD, MOD}, yy = {-MOD, MOD};
void bfs(int x, int y) {
queue<ii> q;
q.emplace(x, y);
vis[x][y] = 1;
while (!q.empty()) {
x = q.front().fi;
y = q.front().se;
q.pop();
for (int i = 0; i < 4; i++) {
if (i == 0 && le[x][y])
continue;
if (i == 1 && dw[x][y])
continue;
if (i == 2 && ri[x][y])
continue;
if (i == 3 && up[x][y])
continue;
int X = x + dx[i];
int Y = y + dy[i];
if (X < 0 || X >= (int)xx.size() - 1)
continue;
if (Y < 0 || Y >= (int)yy.size() - 1)
continue;
if (vis[X][Y])
continue;
vis[X][Y] = 1;
q.emplace(X, Y);
}
}
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
cin >> n >> m;
memset(vis, 0, sizeof(vis));
memset(up, 0, sizeof(up));
memset(dw, 0, sizeof(dw));
memset(le, 0, sizeof(le));
memset(ri, 0, sizeof(ri));
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
xx.pb(a[i]);
xx.pb(b[i]);
yy.pb(c[i]);
}
for (int i = 0; i < m; i++) {
cin >> d[i] >> e[i] >> f[i];
xx.pb(d[i]);
yy.pb(e[i]);
yy.pb(f[i]);
}
sort(all(xx));
xx.erase(unique(all(xx)), xx.end());
sort(all(yy));
yy.erase(unique(all(yy)), yy.end());
// setting up blockage
for (int i = 0; i < n; i++) {
int x1 = lower_bound(all(xx), a[i]) - xx.begin();
int x2 = lower_bound(all(xx), b[i]) - xx.begin();
int y = lower_bound(all(yy), c[i]) - yy.begin();
// at y x1 --- x2
for (int j = x1; j < x2; j++) {
up[j][y - 1] = 1;
dw[j][y] = 1;
}
}
for (int i = 0; i < m; i++) {
int x = lower_bound(all(xx), d[i]) - xx.begin();
int y1 = lower_bound(all(yy), e[i]) - yy.begin();
int y2 = lower_bound(all(yy), f[i]) - yy.begin();
/* at x
y1
|
|
|
y2
*/
for (int j = y1; j < y2; j++) {
ri[x - 1][j] = 1;
le[x][j] = 1;
}
}
int x = lower_bound(all(xx), 0) - xx.begin() - 1;
int y = lower_bound(all(yy), 0) - yy.begin() - 1;
bfs(x, y);
if (vis[0][0] || vis[xx.size() - 1][yy.size() - 1]) {
cout << "INF" << endl;
return 0;
}
ll ans = 0LL;
for (int i = 0; i < (int)xx.size() - 1; i++)
for (int j = 0; j < (int)yy.size() - 1; j++)
if (vis[i][j])
ans += ll(xx[i + 1] - xx[i]) * (yy[j + 1] - yy[j]);
cout << ans << endl;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02680 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 1005
struct Line {
ll A, B, C;
};
struct Info {
Info() { x = y = 0; }
Info(ll arg_x, ll arg_y) {
x = arg_x;
y = arg_y;
}
ll x, y;
};
ll N, M;
ll diff_row[4] = {-1, 0, 0, 1}, diff_col[4] = {0, -1, 1, 0};
Line tate[SIZE], yoko[SIZE];
map<ll, ll> mapX, mapY;
short table[4 * SIZE][4 * SIZE];
int main() {
scanf("%lld %lld", &N, &M);
vector<ll> X, Y;
X.push_back(0);
Y.push_back(0);
// 縦線
for (int i = 0; i < N; i++) {
scanf("%lld %lld %lld", &tate[i].A, &tate[i].B, &tate[i].C);
X.push_back(tate[i].A);
X.push_back(tate[i].B);
Y.push_back(tate[i].C);
}
// 横線
for (int i = 0; i < M; i++) {
scanf("%lld %lld %lld", &yoko[i].A, &yoko[i].B, &yoko[i].C);
X.push_back(yoko[i].A);
Y.push_back(yoko[i].B);
Y.push_back(yoko[i].C);
}
sort(X.begin(), X.end());
sort(Y.begin(), Y.end());
X.erase(unique(X.begin(), X.end()), X.end());
Y.erase(unique(Y.begin(), Y.end()), Y.end());
for (ll i = 0; i < X.size(); i++) {
mapX[X[i]] = i;
}
for (ll i = 0; i < Y.size(); i++) {
mapY[Y[i]] = i;
}
ll H = X.size() * 2; // 偶数行が、ダミー
ll W = Y.size() * 2; // 偶数列が、ダミー
for (int row = 0; row < H; row++) {
for (int col = 0; col < W; col++) {
table[row][col] = 0;
}
}
for (int i = 0; i < N; i++) {
ll a = mapX[tate[i].A] * 2;
ll b = mapX[tate[i].B] * 2;
ll c = mapY[tate[i].C] * 2;
for (ll x = a; x <= b; x++) {
table[x][c] = -1;
}
}
for (int i = 0; i < M; i++) {
ll a = mapX[yoko[i].A] * 2;
ll b = mapY[yoko[i].B] * 2;
ll c = mapY[yoko[i].C] * 2;
for (int y = b; y <= c; y++) {
table[a][y] = -1;
}
}
queue<Info> Q;
ll start_x = mapX[0] * 2;
ll start_y = mapY[0] * 2;
table[start_x][start_y] = 1;
Q.push(Info(start_x, start_y));
Info info;
while (!Q.empty()) {
info = Q.front();
Q.pop();
for (int i = 0; i < 4; i++) {
ll adj_x = info.x + diff_row[i];
ll adj_y = info.y + diff_col[i];
if (adj_x < 0 || adj_x >= H)
continue;
if (adj_y < 0 || adj_y >= W)
continue;
if (table[adj_x][adj_y] != 0)
continue;
table[adj_x][adj_y] = 1;
Q.push(Info(adj_x, adj_y));
}
}
ll ans = 0;
for (ll row = 0; row < H; row++) {
for (ll col = 0; col < W; col++) {
if (table[row][col] != 1)
continue;
if (row == 0 || row == H - 1 || col == 0 || col == W - 1) {
printf("INF\n");
return 0;
}
if (row % 2 == 0 || col % 2 == 0)
continue;
ll tmp_x = X[row / 2 + 1] - X[row / 2];
ll tmp_y = Y[col / 2 + 1] - Y[col / 2];
ans += tmp_x * tmp_y;
}
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 2005
struct Line {
ll A, B, C;
};
struct Info {
Info() { x = y = 0; }
Info(ll arg_x, ll arg_y) {
x = arg_x;
y = arg_y;
}
ll x, y;
};
ll N, M;
ll diff_row[4] = {-1, 0, 0, 1}, diff_col[4] = {0, -1, 1, 0};
Line tate[SIZE], yoko[SIZE];
map<ll, ll> mapX, mapY;
short table[4 * SIZE][4 * SIZE];
int main() {
scanf("%lld %lld", &N, &M);
vector<ll> X, Y;
X.push_back(0);
Y.push_back(0);
// 縦線
for (int i = 0; i < N; i++) {
scanf("%lld %lld %lld", &tate[i].A, &tate[i].B, &tate[i].C);
X.push_back(tate[i].A);
X.push_back(tate[i].B);
Y.push_back(tate[i].C);
}
// 横線
for (int i = 0; i < M; i++) {
scanf("%lld %lld %lld", &yoko[i].A, &yoko[i].B, &yoko[i].C);
X.push_back(yoko[i].A);
Y.push_back(yoko[i].B);
Y.push_back(yoko[i].C);
}
sort(X.begin(), X.end());
sort(Y.begin(), Y.end());
X.erase(unique(X.begin(), X.end()), X.end());
Y.erase(unique(Y.begin(), Y.end()), Y.end());
for (ll i = 0; i < X.size(); i++) {
mapX[X[i]] = i;
}
for (ll i = 0; i < Y.size(); i++) {
mapY[Y[i]] = i;
}
ll H = X.size() * 2; // 偶数行が、ダミー
ll W = Y.size() * 2; // 偶数列が、ダミー
for (int row = 0; row < H; row++) {
for (int col = 0; col < W; col++) {
table[row][col] = 0;
}
}
for (int i = 0; i < N; i++) {
ll a = mapX[tate[i].A] * 2;
ll b = mapX[tate[i].B] * 2;
ll c = mapY[tate[i].C] * 2;
for (ll x = a; x <= b; x++) {
table[x][c] = -1;
}
}
for (int i = 0; i < M; i++) {
ll a = mapX[yoko[i].A] * 2;
ll b = mapY[yoko[i].B] * 2;
ll c = mapY[yoko[i].C] * 2;
for (int y = b; y <= c; y++) {
table[a][y] = -1;
}
}
queue<Info> Q;
ll start_x = mapX[0] * 2;
ll start_y = mapY[0] * 2;
table[start_x][start_y] = 1;
Q.push(Info(start_x, start_y));
Info info;
while (!Q.empty()) {
info = Q.front();
Q.pop();
for (int i = 0; i < 4; i++) {
ll adj_x = info.x + diff_row[i];
ll adj_y = info.y + diff_col[i];
if (adj_x < 0 || adj_x >= H)
continue;
if (adj_y < 0 || adj_y >= W)
continue;
if (table[adj_x][adj_y] != 0)
continue;
table[adj_x][adj_y] = 1;
Q.push(Info(adj_x, adj_y));
}
}
ll ans = 0;
for (ll row = 0; row < H; row++) {
for (ll col = 0; col < W; col++) {
if (table[row][col] != 1)
continue;
if (row == 0 || row == H - 1 || col == 0 || col == W - 1) {
printf("INF\n");
return 0;
}
if (row % 2 == 0 || col % 2 == 0)
continue;
ll tmp_x = X[row / 2 + 1] - X[row / 2];
ll tmp_y = Y[col / 2 + 1] - Y[col / 2];
ans += tmp_x * tmp_y;
}
}
printf("%lld\n", ans);
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02680 | C++ | Time Limit Exceeded | /* coordinate_compress_2D.cpp
2Dの座標圧縮を行う
verified: [AOJ] DSL_4_A Union of Rectangles
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_4_A&lang=ja
*/
#include <bits/stdc++.h>
using namespace std;
// 1次元 vector
template <class T> ostream &operator<<(ostream &s, vector<T> vec) {
for (int i = 0; i < (int)vec.size(); ++i) {
if (i > 0) {
s << " ";
}
s << vec[i];
}
return s << endl;
}
template <class T> // 2次元 vector
ostream &operator<<(ostream &s, vector<vector<T>> vec2) {
for (int i = 0; i < (int)vec2.size(); ++i) {
s << vec2[i];
}
return s;
}
/* compress
(X1,Y1),(X2,Y2)という二点で表されるもの（長方形や直線など）について、行か列の片方（X1とX2
or Y1とY2）を座標圧縮する（副作用） 返り値: ソートされ重複要素を除いた値
計算量: O(n log n)
*/
template <typename T> vector<T> compress(vector<T> &C1, vector<T> &C2) {
vector<T> vals;
int N = (int)C1.size();
for (int i = 0; i < N; i++) {
for (
T d = 0; d <= 1;
d++) { // その位置と、一つ隣を確保(隣を確保しないと空白が埋まってしまうことがある)
T tc1 = C1[i] + d;
T tc2 = C2[i] + d;
vals.push_back(tc1);
vals.push_back(tc2);
}
}
// ソート
sort(vals.begin(), vals.end());
// 隣り合う重複を削除(unique), 末端のゴミを削除(erase)
vals.erase(unique(vals.begin(), vals.end()), vals.end());
for (int i = 0; i < N; i++) {
C1[i] = lower_bound(vals.begin(), vals.end(), C1[i]) - vals.begin();
C2[i] = lower_bound(vals.begin(), vals.end(), C2[i]) - vals.begin();
}
return vals;
}
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X1, Y1, X2, Y2;
for (int i = 0; i < N; i++) {
ll a, b, c;
cin >> a >> b >> c;
X1.push_back(a);
X2.push_back(b);
Y1.push_back(c);
Y2.push_back(c);
}
for (int i = 0; i < M; i++) {
ll a, b, c;
cin >> a >> b >> c;
X1.push_back(a);
X2.push_back(a);
Y1.push_back(b);
Y2.push_back(c);
}
// 牛の位置
X1.push_back(0);
X2.push_back(0);
Y1.push_back(0);
Y2.push_back(0);
vector<long long> X = compress(X1, X2);
vector<long long> Y = compress(Y1, Y2);
int H = X.size() * 2;
int W = Y.size() * 2;
vector<vector<int>> G(H, vector<int>(W));
for (int i = 0; i < N; i++) {
for (int x = X1[i] * 2; x <= X2[i] * 2; x++) {
G[x][Y1[i] * 2] = -1;
}
}
for (int i = N; i < N + M; i++) {
for (int y = Y1[i] * 2; y <= Y2[i] * 2; y++) {
G[X1[i] * 2][y] = -1;
}
}
using P = pair<int, int>;
P s(X1[N + M] * 2, Y1[N + M] * 2);
G[s.first][s.second] = 1;
// cerr << G;
queue<pair<int, int>> que;
que.emplace(s);
while (que.size() != 0) {
pair<int, int> now = que.front();
que.pop();
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1}; // dx,dy は次の探索場所への距離を表す（４方向分）
for (int i = 0; i < 4; i++) {
int nx = now.first + dx[i];
int ny = now.second + dy[i];
if (nx < 0 || ny < 0 || H <= nx || W <= ny)
continue;
if (G[nx][ny] != 0)
continue; // 障害物があればスルー
que.push(P(nx, ny));
G[nx][ny] = 1;
}
}
ll ans = 0;
for (int x = 0; x < H; x++) {
for (int y = 0; y < W; y++) {
if (G[x][y] != 1)
continue;
if (x == 0 || H - 1 == x || y == 0 || W - 1 == y) {
cout << "INF" << endl;
return 0;
}
if (x % 2 == 0 || y % 2 == 0)
continue;
ans += (X[x / 2 + 1] - X[x / 2]) * (Y[y / 2 + 1] - Y[y / 2]);
}
}
cout << ans << endl;
}
| /* coordinate_compress_2D.cpp
2Dの座標圧縮を行う
verified: [AOJ] DSL_4_A Union of Rectangles
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_4_A&lang=ja
*/
#include <bits/stdc++.h>
using namespace std;
// 1次元 vector
template <class T> ostream &operator<<(ostream &s, vector<T> vec) {
for (int i = 0; i < (int)vec.size(); ++i) {
if (i > 0) {
s << " ";
}
s << vec[i];
}
return s << endl;
}
template <class T> // 2次元 vector
ostream &operator<<(ostream &s, vector<vector<T>> vec2) {
for (int i = 0; i < (int)vec2.size(); ++i) {
s << vec2[i];
}
return s;
}
/* compress
(X1,Y1),(X2,Y2)という二点で表されるもの（長方形や直線など）について、行か列の片方（X1とX2
or Y1とY2）を座標圧縮する（副作用） 返り値: ソートされ重複要素を除いた値
計算量: O(n log n)
*/
template <typename T> vector<T> compress(vector<T> &C1, vector<T> &C2) {
vector<T> vals;
int N = (int)C1.size();
for (int i = 0; i < N; i++) {
T tc1 = C1[i];
T tc2 = C2[i];
vals.push_back(tc1);
vals.push_back(tc2);
}
// ソート
sort(vals.begin(), vals.end());
// 隣り合う重複を削除(unique), 末端のゴミを削除(erase)
vals.erase(unique(vals.begin(), vals.end()), vals.end());
for (int i = 0; i < N; i++) {
C1[i] = lower_bound(vals.begin(), vals.end(), C1[i]) - vals.begin();
C2[i] = lower_bound(vals.begin(), vals.end(), C2[i]) - vals.begin();
}
return vals;
}
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X1, Y1, X2, Y2;
for (int i = 0; i < N; i++) {
ll a, b, c;
cin >> a >> b >> c;
X1.push_back(a);
X2.push_back(b);
Y1.push_back(c);
Y2.push_back(c);
}
for (int i = 0; i < M; i++) {
ll a, b, c;
cin >> a >> b >> c;
X1.push_back(a);
X2.push_back(a);
Y1.push_back(b);
Y2.push_back(c);
}
// 牛の位置
X1.push_back(0);
X2.push_back(0);
Y1.push_back(0);
Y2.push_back(0);
vector<long long> X = compress(X1, X2);
vector<long long> Y = compress(Y1, Y2);
int H = X.size() * 2;
int W = Y.size() * 2;
vector<vector<int>> G(H, vector<int>(W));
for (int i = 0; i < N; i++) {
for (int x = X1[i] * 2; x <= X2[i] * 2; x++) {
G[x][Y1[i] * 2] = -1;
}
}
for (int i = N; i < N + M; i++) {
for (int y = Y1[i] * 2; y <= Y2[i] * 2; y++) {
G[X1[i] * 2][y] = -1;
}
}
using P = pair<int, int>;
P s(X1[N + M] * 2, Y1[N + M] * 2);
G[s.first][s.second] = 1;
// cerr << G;
queue<pair<int, int>> que;
que.emplace(s);
while (que.size() != 0) {
pair<int, int> now = que.front();
que.pop();
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1}; // dx,dy は次の探索場所への距離を表す（４方向分）
for (int i = 0; i < 4; i++) {
int nx = now.first + dx[i];
int ny = now.second + dy[i];
if (nx < 0 || ny < 0 || H <= nx || W <= ny)
continue;
if (G[nx][ny] != 0)
continue; // 障害物があればスルー
que.push(P(nx, ny));
G[nx][ny] = 1;
}
}
ll ans = 0;
for (int x = 0; x < H; x++) {
for (int y = 0; y < W; y++) {
if (G[x][y] != 1)
continue;
if (x == 0 || H - 1 == x || y == 0 || W - 1 == y) {
cout << "INF" << endl;
return 0;
}
if (x % 2 == 0 || y % 2 == 0)
continue;
ans += (X[x / 2 + 1] - X[x / 2]) * (Y[y / 2 + 1] - Y[y / 2]);
}
}
cout << ans << endl;
}
| replace | 35 | 43 | 35 | 39 | TLE | |
p02680 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using PII = pair<int, int>;
const int inf = 2e9;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(n), c(n);
vector<int> d(m), e(m), f(m);
set<int> sx, sy;
sx = sy = {0, inf, -inf};
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
sx.insert(a[i]);
sx.insert(b[i]);
sy.insert(c[i]);
}
for (int i = 0; i < m; i++) {
cin >> d[i] >> e[i] >> f[i];
sx.insert(d[i]);
sy.insert(e[i]);
sy.insert(f[i]);
}
vector<int> vx(sx.begin(), sx.end());
vector<int> vy(sy.begin(), sy.end());
int w = 2 * sx.size() - 1;
int h = 2 * sy.size() - 1;
vector<string> board(h, string(w, '.'));
// printf("hw %d %d\n", w, h);
// for (int i = 0; i < max(vx.size(), vy.size()); i++) {
// if (i < min(vx.size(), vy.size())) {
// printf("i %2d, x %4d, y %4d\n", i, vx[i], vy[i]);
// } else if (i >= vx.size()) {
// printf("i %2d, x ----, y %4d\n", i, vy[i]);
// } else {
// printf("i %2d, x %4d, y ----\n", i, vx[i]);
// }
// }
for (int i = 0; i < n; i++) {
int ix1 = lower_bound(vx.begin(), vx.end(), a[i]) - vx.begin();
int ix2 = lower_bound(vx.begin(), vx.end(), b[i]) - vx.begin();
int iy = lower_bound(vy.begin(), vy.end(), c[i]) - vy.begin();
ix1 = 2 * ix1;
ix2 = 2 * ix2;
iy = 2 * iy;
for (int i = ix1; i <= ix2; i++) {
board[iy][i] = '#';
}
}
for (int i = 0; i < m; i++) {
int ix = lower_bound(vx.begin(), vx.end(), d[i]) - vx.begin();
int iy1 = lower_bound(vy.begin(), vy.end(), e[i]) - vy.begin();
int iy2 = lower_bound(vy.begin(), vy.end(), f[i]) - vy.begin();
ix = 2 * ix;
iy1 = 2 * iy1;
iy2 = 2 * iy2;
for (int i = iy1; i <= iy2; i++) {
board[i][ix] = '#';
}
}
long long ans = 0;
queue<PII> que;
int ix = lower_bound(vx.begin(), vx.end(), 0) - vx.begin();
int iy = lower_bound(vy.begin(), vy.end(), 0) - vy.begin();
int bx = 2 * ix;
int by = 2 * iy;
que.emplace(bx, by);
while (!que.empty()) {
tie(bx, by) = que.front();
que.pop();
if (board[by][bx] != '.') {
continue;
}
// printf("bx %d, by %d, %c, %lu\n", bx, by, board[by][bx], que.size());
if (bx == 0 || bx == w - 1 || by == 0 || by == h) {
cout << "INF" << endl;
return 0;
}
board[by][bx] = 'O';
if (bx % 2 == 1 && by % 2 == 1) {
ix = bx / 2;
iy = by / 2;
ans += 1LL * (vx[ix + 1] - vx[ix]) * (vy[iy + 1] - vy[iy]);
}
for (int i = 0; i < 4; i++) {
que.emplace(bx + dx[i], by + dy[i]);
}
}
for (auto s : board) {
cerr << s << endl;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using PII = pair<int, int>;
const int inf = 2e9;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(n), c(n);
vector<int> d(m), e(m), f(m);
set<int> sx, sy;
sx = sy = {0, inf, -inf};
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
sx.insert(a[i]);
sx.insert(b[i]);
sy.insert(c[i]);
}
for (int i = 0; i < m; i++) {
cin >> d[i] >> e[i] >> f[i];
sx.insert(d[i]);
sy.insert(e[i]);
sy.insert(f[i]);
}
vector<int> vx(sx.begin(), sx.end());
vector<int> vy(sy.begin(), sy.end());
int w = 2 * sx.size() - 1;
int h = 2 * sy.size() - 1;
vector<string> board(h, string(w, '.'));
// printf("hw %d %d\n", w, h);
// for (int i = 0; i < max(vx.size(), vy.size()); i++) {
// if (i < min(vx.size(), vy.size())) {
// printf("i %2d, x %4d, y %4d\n", i, vx[i], vy[i]);
// } else if (i >= vx.size()) {
// printf("i %2d, x ----, y %4d\n", i, vy[i]);
// } else {
// printf("i %2d, x %4d, y ----\n", i, vx[i]);
// }
// }
for (int i = 0; i < n; i++) {
int ix1 = lower_bound(vx.begin(), vx.end(), a[i]) - vx.begin();
int ix2 = lower_bound(vx.begin(), vx.end(), b[i]) - vx.begin();
int iy = lower_bound(vy.begin(), vy.end(), c[i]) - vy.begin();
ix1 = 2 * ix1;
ix2 = 2 * ix2;
iy = 2 * iy;
for (int i = ix1; i <= ix2; i++) {
board[iy][i] = '#';
}
}
for (int i = 0; i < m; i++) {
int ix = lower_bound(vx.begin(), vx.end(), d[i]) - vx.begin();
int iy1 = lower_bound(vy.begin(), vy.end(), e[i]) - vy.begin();
int iy2 = lower_bound(vy.begin(), vy.end(), f[i]) - vy.begin();
ix = 2 * ix;
iy1 = 2 * iy1;
iy2 = 2 * iy2;
for (int i = iy1; i <= iy2; i++) {
board[i][ix] = '#';
}
}
long long ans = 0;
queue<PII> que;
int ix = lower_bound(vx.begin(), vx.end(), 0) - vx.begin();
int iy = lower_bound(vy.begin(), vy.end(), 0) - vy.begin();
int bx = 2 * ix;
int by = 2 * iy;
que.emplace(bx, by);
while (!que.empty()) {
tie(bx, by) = que.front();
que.pop();
if (board[by][bx] != '.') {
continue;
}
// printf("bx %d, by %d, %c, %lu\n", bx, by, board[by][bx], que.size());
if (bx == 0 || bx == w - 1 || by == 0 || by == h - 1) {
cout << "INF" << endl;
return 0;
}
board[by][bx] = 'O';
if (bx % 2 == 1 && by % 2 == 1) {
ix = bx / 2;
iy = by / 2;
ans += 1LL * (vx[ix + 1] - vx[ix]) * (vy[iy + 1] - vy[iy]);
}
for (int i = 0; i < 4; i++) {
que.emplace(bx + dx[i], by + dy[i]);
}
}
for (auto s : board) {
cerr << s << endl;
}
cout << ans << endl;
return 0;
}
| replace | 102 | 103 | 102 | 103 | 0 | .....................
.....................
......#..............
......#..............
......#.......#......
......#.......#......
..###############....
......#OOOOOOO#......
......#OOO###O#......
......#OOO#.#O#......
......#O###.#O#......
......#O#...#O#......
......#O#####O#......
......#OOO#OOO#......
....###############..
......#...#...#......
......#...#...#......
......#..............
......#..............
.....................
.....................
|
p02680 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template <class T> class Compress {
int N;
map<T, int> idx;
map<int, T> value;
vec<T> v;
vec<T> cmp;
public:
Compress() {}
void add(T x) { v.push_back(x); }
void build() {
for (auto &x : v)
cmp.push_back(x);
sort(cmp.begin(), cmp.end());
cmp.erase(unique(cmp.begin(), cmp.end()), cmp.end());
N = cmp.size();
for (int i = 0; i < N; i++)
idx[cmp[i]] = i;
}
int id(T val) { return idx[val]; }
T val(int id) { return cmp[id]; }
int size() { return N; }
};
class UnionFind {
private:
vec<int> p, s;
vec<ll> val;
int cnt;
public:
UnionFind() {}
UnionFind(int N, vec<ll> v) : cnt(N), s(N, 1), p(N) {
iota(p.begin(), p.end(), 0);
val = v;
}
int find(int x) {
if (p[x] == x)
return x;
else
return p[x] = find(p[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (s[x] > s[y])
swap(x, y);
p[x] = y;
s[y] += s[x];
val[y] += val[x];
cnt--;
}
bool is_same_set(int x, int y) { return find(x) == find(y); }
int size(int x) { return s[find(x)]; }
int compnents_number() { return cnt; }
ll getval(int x) { return val[find(x)]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
Compress<int> cx, cy;
vec<int> A(N), B(N), C(N), D(M), E(M), F(M);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i] >> C[i];
cy.add(C[i]);
cx.add(A[i]), cx.add(B[i]);
}
for (int i = 0; i < M; i++) {
cin >> D[i] >> E[i] >> F[i];
cx.add(D[i]);
cy.add(E[i]), cy.add(F[i]);
}
int inf = 1e9 + 1;
cx.add(-inf), cx.add(inf);
cy.add(-inf), cy.add(inf);
cx.add(0), cy.add(0);
cx.build(), cy.build();
int H = cx.size(), W = cy.size();
// cerr << "H : " << H << " W : " << W << "\n";
int sx = 0, sy = 0;
for (int i = 0; i + 1 < H; i++)
if (cx.val(i + 1) <= 0)
sx = i;
for (int j = 0; j + 1 < W; j++)
if (cy.val(j + 1) <= 0)
sy = j;
// cerr << sx << " " << sy << "\n";
vec<set<int>> noX(H), noY(W);
for (int i = 0; i < N; i++) {
int y = cy.id(C[i]), l = cx.id(A[i]), r = cx.id(B[i]);
// cerr << "i : " << i << " y : " << y << " l : " << l << " r : " <<
// r << "\n";
for (int j = l; j < r; j++)
noY[y - 1].insert(j);
}
for (int i = 0; i < M; i++) {
int x = cx.id(D[i]), l = cy.id(E[i]), r = cy.id(F[i]);
for (int j = l; j < r; j++)
noX[x - 1].insert(j);
}
vec<ll> v;
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++) {
if (i + 1 < H && j + 1 < W) {
ll h = cx.val(i + 1) - cx.val(i), w = cy.val(j + 1) - cy.val(j);
v.push_back(h * w);
} else {
v.push_back(0);
}
}
UnionFind uf(H * W, v);
auto id = [&](int i, int j) { return i * W + j; };
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++) {
if (i + 1 < H && !noX[i].count(j))
uf.unite(id(i, j), id(i + 1, j));
if (j + 1 < W && !noY[j].count(i))
uf.unite(id(i, j), id(i, j + 1));
}
for (auto x : {0, H - 1})
for (auto y : {0, W - 1}) {
if (uf.is_same_set(id(sx, sy), id(x, y))) {
cout << "INF\n";
assert(false);
return 0;
}
}
// cerr << uf.size(id(sx,sy)) << "\n";
cout << uf.getval(id(sx, sy)) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template <class T> class Compress {
int N;
map<T, int> idx;
map<int, T> value;
vec<T> v;
vec<T> cmp;
public:
Compress() {}
void add(T x) { v.push_back(x); }
void build() {
for (auto &x : v)
cmp.push_back(x);
sort(cmp.begin(), cmp.end());
cmp.erase(unique(cmp.begin(), cmp.end()), cmp.end());
N = cmp.size();
for (int i = 0; i < N; i++)
idx[cmp[i]] = i;
}
int id(T val) { return idx[val]; }
T val(int id) { return cmp[id]; }
int size() { return N; }
};
class UnionFind {
private:
vec<int> p, s;
vec<ll> val;
int cnt;
public:
UnionFind() {}
UnionFind(int N, vec<ll> v) : cnt(N), s(N, 1), p(N) {
iota(p.begin(), p.end(), 0);
val = v;
}
int find(int x) {
if (p[x] == x)
return x;
else
return p[x] = find(p[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (s[x] > s[y])
swap(x, y);
p[x] = y;
s[y] += s[x];
val[y] += val[x];
cnt--;
}
bool is_same_set(int x, int y) { return find(x) == find(y); }
int size(int x) { return s[find(x)]; }
int compnents_number() { return cnt; }
ll getval(int x) { return val[find(x)]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
Compress<int> cx, cy;
vec<int> A(N), B(N), C(N), D(M), E(M), F(M);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i] >> C[i];
cy.add(C[i]);
cx.add(A[i]), cx.add(B[i]);
}
for (int i = 0; i < M; i++) {
cin >> D[i] >> E[i] >> F[i];
cx.add(D[i]);
cy.add(E[i]), cy.add(F[i]);
}
int inf = 1e9 + 1;
cx.add(-inf), cx.add(inf);
cy.add(-inf), cy.add(inf);
cx.add(0), cy.add(0);
cx.build(), cy.build();
int H = cx.size(), W = cy.size();
// cerr << "H : " << H << " W : " << W << "\n";
int sx = 0, sy = 0;
for (int i = 0; i + 1 < H; i++)
if (cx.val(i + 1) <= 0)
sx = i;
for (int j = 0; j + 1 < W; j++)
if (cy.val(j + 1) <= 0)
sy = j;
// cerr << sx << " " << sy << "\n";
vec<set<int>> noX(H), noY(W);
for (int i = 0; i < N; i++) {
int y = cy.id(C[i]), l = cx.id(A[i]), r = cx.id(B[i]);
// cerr << "i : " << i << " y : " << y << " l : " << l << " r : " <<
// r << "\n";
for (int j = l; j < r; j++)
noY[y - 1].insert(j);
}
for (int i = 0; i < M; i++) {
int x = cx.id(D[i]), l = cy.id(E[i]), r = cy.id(F[i]);
for (int j = l; j < r; j++)
noX[x - 1].insert(j);
}
vec<ll> v;
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++) {
if (i + 1 < H && j + 1 < W) {
ll h = cx.val(i + 1) - cx.val(i), w = cy.val(j + 1) - cy.val(j);
v.push_back(h * w);
} else {
v.push_back(0);
}
}
UnionFind uf(H * W, v);
auto id = [&](int i, int j) { return i * W + j; };
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++) {
if (i + 1 < H && !noX[i].count(j))
uf.unite(id(i, j), id(i + 1, j));
if (j + 1 < W && !noY[j].count(i))
uf.unite(id(i, j), id(i, j + 1));
}
for (auto x : {0, H - 1})
for (auto y : {0, W - 1}) {
if (uf.is_same_set(id(sx, sy), id(x, y))) {
cout << "INF\n";
return 0;
}
}
// cerr << uf.size(id(sx,sy)) << "\n";
cout << uf.getval(id(sx, sy)) << "\n";
} | delete | 137 | 138 | 137 | 137 | 0 | |
p02680 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
struct Area {
ll area;
bool visited;
bool cango[4];
Area() {
area = 0;
visited = false;
rep(i, 4) cango[i] = true;
}
};
// down, up, right, left
int vx[4] = {1, -1, 0, 0};
int vy[4] = {0, 0, 1, -1};
Area field[2005][2005];
int main() {
int N, M;
cin >> N >> M;
vector<vector<ll>> v, w;
map<ll, int> zx, zy;
zx[-1000000005] = 1;
zx[0] = 1;
zx[1000000005] = 1;
zy[-1000000005] = 1;
zy[0] = 1;
zy[1000000005] = 1;
rep(i, N) {
ll a, b, c;
cin >> a >> b >> c;
v.push_back({a, b, c});
zx[a] = 1;
zx[b] = 1;
zy[c] = 1;
}
rep(i, M) {
ll d, e, f;
cin >> d >> e >> f;
w.push_back({d, e, f});
zx[d] = 1;
zy[e] = 1;
zy[f] = 1;
}
map<int, ll> rzx, rzy;
int height = 0, width = 0;
{FOR(it, zx){rzx[height] = it->first;
it->second = height++;
}
}
{
FOR(it, zy) {
rzy[width] = it->first;
it->second = width++;
}
}
rep(i, height) {
rep(j, width) {
if (i == 0 || j == 0 || i == height - 1 || j == width - 1) {
field[i][j].area = -1;
} else {
ll x = rzx[i];
ll y = rzy[j];
ll xx = rzx[i + 1];
ll yy = rzy[j + 1];
field[i][j].area = (xx - x) * (yy - y);
}
}
}
rep(i, N) {
int x = zx[v[i][0]];
int xx = zx[v[i][1]];
int y = zy[v[i][2]];
REP(j, x, xx) {
if (y - 1 >= 0)
field[j][y - 1].cango[2] = false;
field[j][y].cango[3] = false;
}
}
rep(i, M) {
int x = zx[w[i][0]];
int y = zy[w[i][1]];
int yy = zy[w[i][2]];
REP(j, y, yy) {
if (x - 1 >= 0)
field[x - 1][j].cango[0] = false;
field[x][j].cango[1] = false;
}
}
queue<pair<int, int>> que;
int zero_x = zx[0], zero_y = zy[0];
que.push(make_pair(zero_x - 1, zero_y - 1));
que.push(make_pair(zero_x - 1, zero_y));
que.push(make_pair(zero_x, zero_y - 1));
que.push(make_pair(zero_x, zero_y));
ll ret = 0;
while (!que.empty()) {
/*
rep(i,height){
rep(j,width){
if(field[i][j].visited) cout << "*";
else cout << ".";
}
cout << endl;
}
cout << endl;
*/
pair<int, int> p = que.front();
que.pop();
if (p.first < 0 || p.second < 0) {
ret = -1;
break;
}
if (field[p.first][p.second].visited)
continue;
field[p.first][p.second].visited = true;
if (field[p.first][p.second].area < 0) {
ret = -1;
break;
}
ret += field[p.first][p.second].area;
rep(k, 4) {
int nx = p.first + vx[k];
int ny = p.second + vy[k];
if (nx < 0 || ny < 0)
continue;
if (field[p.first][p.second].cango[k]) {
if (!field[nx][ny].visited) {
que.push(make_pair(nx, ny));
}
}
}
}
if (ret < 0) {
cout << "INF" << endl;
} else {
cout << ret << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
struct Area {
ll area;
bool visited;
bool cango[4];
Area() {
area = 0;
visited = false;
rep(i, 4) cango[i] = true;
}
};
// down, up, right, left
int vx[4] = {1, -1, 0, 0};
int vy[4] = {0, 0, 1, -1};
Area field[3005][3005];
int main() {
int N, M;
cin >> N >> M;
vector<vector<ll>> v, w;
map<ll, int> zx, zy;
zx[-1000000005] = 1;
zx[0] = 1;
zx[1000000005] = 1;
zy[-1000000005] = 1;
zy[0] = 1;
zy[1000000005] = 1;
rep(i, N) {
ll a, b, c;
cin >> a >> b >> c;
v.push_back({a, b, c});
zx[a] = 1;
zx[b] = 1;
zy[c] = 1;
}
rep(i, M) {
ll d, e, f;
cin >> d >> e >> f;
w.push_back({d, e, f});
zx[d] = 1;
zy[e] = 1;
zy[f] = 1;
}
map<int, ll> rzx, rzy;
int height = 0, width = 0;
{FOR(it, zx){rzx[height] = it->first;
it->second = height++;
}
}
{
FOR(it, zy) {
rzy[width] = it->first;
it->second = width++;
}
}
rep(i, height) {
rep(j, width) {
if (i == 0 || j == 0 || i == height - 1 || j == width - 1) {
field[i][j].area = -1;
} else {
ll x = rzx[i];
ll y = rzy[j];
ll xx = rzx[i + 1];
ll yy = rzy[j + 1];
field[i][j].area = (xx - x) * (yy - y);
}
}
}
rep(i, N) {
int x = zx[v[i][0]];
int xx = zx[v[i][1]];
int y = zy[v[i][2]];
REP(j, x, xx) {
if (y - 1 >= 0)
field[j][y - 1].cango[2] = false;
field[j][y].cango[3] = false;
}
}
rep(i, M) {
int x = zx[w[i][0]];
int y = zy[w[i][1]];
int yy = zy[w[i][2]];
REP(j, y, yy) {
if (x - 1 >= 0)
field[x - 1][j].cango[0] = false;
field[x][j].cango[1] = false;
}
}
queue<pair<int, int>> que;
int zero_x = zx[0], zero_y = zy[0];
que.push(make_pair(zero_x - 1, zero_y - 1));
que.push(make_pair(zero_x - 1, zero_y));
que.push(make_pair(zero_x, zero_y - 1));
que.push(make_pair(zero_x, zero_y));
ll ret = 0;
while (!que.empty()) {
/*
rep(i,height){
rep(j,width){
if(field[i][j].visited) cout << "*";
else cout << ".";
}
cout << endl;
}
cout << endl;
*/
pair<int, int> p = que.front();
que.pop();
if (p.first < 0 || p.second < 0) {
ret = -1;
break;
}
if (field[p.first][p.second].visited)
continue;
field[p.first][p.second].visited = true;
if (field[p.first][p.second].area < 0) {
ret = -1;
break;
}
ret += field[p.first][p.second].area;
rep(k, 4) {
int nx = p.first + vx[k];
int ny = p.second + vy[k];
if (nx < 0 || ny < 0)
continue;
if (field[p.first][p.second].cango[k]) {
if (!field[nx][ny].visited) {
que.push(make_pair(nx, ny));
}
}
}
}
if (ret < 0) {
cout << "INF" << endl;
} else {
cout << ret << endl;
}
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02680 | C++ | Runtime Error | #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;
#define INF (1LL << 59)
#define MV 200001
#define LMV 21
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define emp emplace
#define mp make_pair
#define ins insert
#define sz size
#define whoami(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
whi(_it, args); \
}
void whi(istream_iterator<string> it) { cerr << "\n"; }
template <typename T, typename... Args>
void whi(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " " << a << " ";
whi(++it, args...);
}
void FLASH() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void SETF() {
cout.ios_base::setf(ios_base::fixed);
cerr.ios_base::setf(ios_base::fixed);
}
void UNSETF() {
cout.ios_base::unsetf(ios_base::fixed);
cerr.ios_base::unsetf(ios_base::fixed);
}
typedef long long ll;
typedef long double ld;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<PII, int> PPII;
typedef pair<PLL, ll> PPLL;
typedef map<int, int> MII;
const int MOD = 1000000007;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,
tree_order_statistics_node_update>;
struct h_llint {
static uint64_t
splitmix64(uint64_t x) { // http://xorshift.di.unimi.it/splitmix64.c
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);
}
};
struct h_pair {
size_t operator()(const PLL &x) const {
return hash<ll>()(((ll)x.ff) ^ (((ll)x.ss) << 32));
}
};
typedef map<ll, ll> MLL;
typedef map<PII, int> MPII;
typedef map<PLL, ll> MPLL;
typedef set<int> SI;
typedef set<ll> SL;
// ordered_set = order_of_key(.)
// ordered_set = find_by_order(.)
typedef ordered_set<int> OSI;
typedef ordered_set<ll> OSL;
typedef ordered_multiset<int> MOSI;
typedef ordered_multiset<ll> MOSL;
typedef unordered_map<ll, int, h_llint> UMLI;
typedef unordered_map<ll, ll, h_llint> UMLL;
typedef unordered_map<PLL, int, h_pair> UMPI;
typedef unordered_map<PLL, ll, h_pair> UMPL;
PII NE[4] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
ll A[1001], B[1001], C[1001], D[1001], E[1001], F[1001];
VL xx, yy;
bool vis[3001][3001];
int gex[3001][3001];
void bfs_visit(int zx, int zy, int n, int m) {
queue<PII> Q;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
Q.emp(zx - i, zy - j);
vis[zx - i][zy - j] = 1;
}
}
while (!Q.empty()) {
PII px = Q.front();
// whoami(px.ff, px.ss);
Q.pop();
for (int i = 0; i < 4; i++) {
int cx = px.ff + NE[i].ff;
int cy = px.ss + NE[i].ss;
if ((cx >= 0) && (cx < n) && (cy >= 0) && (cy < m) && !vis[cx][cy] &&
(~gex[px.ff][px.ss] & (1 << i))) {
vis[cx][cy] = 1;
Q.emp(cx, cy);
}
}
}
return;
}
void solve(int T) {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
ll a, b, c;
cin >> a >> b >> c;
A[i] = a;
B[i] = b;
C[i] = c;
xx.pb(a);
xx.pb(b);
yy.pb(c);
}
for (int i = 0; i < m; i++) {
ll d, e, f;
cin >> d >> e >> f;
D[i] = d;
E[i] = e;
F[i] = f;
xx.pb(d);
yy.pb(e);
yy.pb(f);
}
xx.pb(-MOD);
xx.pb(MOD);
xx.pb(0);
yy.pb(-MOD);
yy.pb(MOD);
yy.pb(0);
sort(begin(xx), end(xx));
sort(begin(yy), end(yy));
xx.resize(unique(begin(xx), end(xx)) - begin(xx));
yy.resize(unique(begin(yy), end(yy)) - begin(yy));
for (int i = 0; i < n; i++) {
int a = lower_bound(begin(xx), end(xx), A[i]) - begin(xx);
int b = lower_bound(begin(xx), end(xx), B[i]) - begin(xx);
int c = lower_bound(begin(yy), end(yy), C[i]) - begin(yy);
// whoami(a, b, c);
for (int j = a; j < b; j++) {
gex[j][c] |= (1 << 2);
gex[j][c - 1] |= (1 << 0);
}
}
for (int i = 0; i < m; i++) {
int d = lower_bound(begin(xx), end(xx), D[i]) - begin(xx);
int e = lower_bound(begin(yy), end(yy), E[i]) - begin(yy);
int f = lower_bound(begin(yy), end(yy), F[i]) - begin(yy);
for (int j = e; j < f; j++) {
gex[d][j] |= (1 << 3);
gex[d - 1][j] |= (1 << 1);
}
}
n = (int)xx.sz();
m = (int)yy.sz();
int zx = lower_bound(begin(xx), end(xx), 0) - begin(xx);
int zy = lower_bound(begin(yy), end(yy), 0) - begin(yy);
bfs_visit(zx, zy, n, m);
for (int i = 0; i < n; i++) {
if (vis[i][0] || vis[i][m - 1]) {
cout << "INF\n";
return;
}
}
for (int i = 0; i < m; i++) {
if (vis[0][i] || vis[n - 1][i]) {
cout << "INF\n";
return;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (vis[i][j])
ans += (xx[i + 1] - xx[i]) * (yy[j + 1] - yy[j]);
}
}
cout << ans << "\n";
return;
}
int main(void) {
FLASH();
// freopen("cowjog.in", "r", stdin);
// freopen("cowjog.out", "w", stdout);
int T;
T = 1;
#ifndef ONLINE_JUDGE
time_t time_t1, time_t2;
time_t1 = clock();
#endif
// cin>>T;
while (T--)
solve(T);
#ifndef ONLINE_JUDGE
time_t2 = clock();
SETF();
cerr << "Time taken: " << setprecision(7)
<< (time_t2 - time_t1) / (double)CLOCKS_PER_SEC << "\n";
UNSETF();
#endif
return 0;
} | #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;
#define INF (1LL << 59)
#define MV 200001
#define LMV 21
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define emp emplace
#define mp make_pair
#define ins insert
#define sz size
#define whoami(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
whi(_it, args); \
}
void whi(istream_iterator<string> it) { cerr << "\n"; }
template <typename T, typename... Args>
void whi(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " " << a << " ";
whi(++it, args...);
}
void FLASH() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void SETF() {
cout.ios_base::setf(ios_base::fixed);
cerr.ios_base::setf(ios_base::fixed);
}
void UNSETF() {
cout.ios_base::unsetf(ios_base::fixed);
cerr.ios_base::unsetf(ios_base::fixed);
}
typedef long long ll;
typedef long double ld;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<PII, int> PPII;
typedef pair<PLL, ll> PPLL;
typedef map<int, int> MII;
const int MOD = 1000000007;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,
tree_order_statistics_node_update>;
struct h_llint {
static uint64_t
splitmix64(uint64_t x) { // http://xorshift.di.unimi.it/splitmix64.c
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);
}
};
struct h_pair {
size_t operator()(const PLL &x) const {
return hash<ll>()(((ll)x.ff) ^ (((ll)x.ss) << 32));
}
};
typedef map<ll, ll> MLL;
typedef map<PII, int> MPII;
typedef map<PLL, ll> MPLL;
typedef set<int> SI;
typedef set<ll> SL;
// ordered_set = order_of_key(.)
// ordered_set = find_by_order(.)
typedef ordered_set<int> OSI;
typedef ordered_set<ll> OSL;
typedef ordered_multiset<int> MOSI;
typedef ordered_multiset<ll> MOSL;
typedef unordered_map<ll, int, h_llint> UMLI;
typedef unordered_map<ll, ll, h_llint> UMLL;
typedef unordered_map<PLL, int, h_pair> UMPI;
typedef unordered_map<PLL, ll, h_pair> UMPL;
PII NE[4] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
ll A[1001], B[1001], C[1001], D[1001], E[1001], F[1001];
VL xx, yy;
bool vis[3501][3501];
int gex[3501][3501];
void bfs_visit(int zx, int zy, int n, int m) {
queue<PII> Q;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
Q.emp(zx - i, zy - j);
vis[zx - i][zy - j] = 1;
}
}
while (!Q.empty()) {
PII px = Q.front();
// whoami(px.ff, px.ss);
Q.pop();
for (int i = 0; i < 4; i++) {
int cx = px.ff + NE[i].ff;
int cy = px.ss + NE[i].ss;
if ((cx >= 0) && (cx < n) && (cy >= 0) && (cy < m) && !vis[cx][cy] &&
(~gex[px.ff][px.ss] & (1 << i))) {
vis[cx][cy] = 1;
Q.emp(cx, cy);
}
}
}
return;
}
void solve(int T) {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
ll a, b, c;
cin >> a >> b >> c;
A[i] = a;
B[i] = b;
C[i] = c;
xx.pb(a);
xx.pb(b);
yy.pb(c);
}
for (int i = 0; i < m; i++) {
ll d, e, f;
cin >> d >> e >> f;
D[i] = d;
E[i] = e;
F[i] = f;
xx.pb(d);
yy.pb(e);
yy.pb(f);
}
xx.pb(-MOD);
xx.pb(MOD);
xx.pb(0);
yy.pb(-MOD);
yy.pb(MOD);
yy.pb(0);
sort(begin(xx), end(xx));
sort(begin(yy), end(yy));
xx.resize(unique(begin(xx), end(xx)) - begin(xx));
yy.resize(unique(begin(yy), end(yy)) - begin(yy));
for (int i = 0; i < n; i++) {
int a = lower_bound(begin(xx), end(xx), A[i]) - begin(xx);
int b = lower_bound(begin(xx), end(xx), B[i]) - begin(xx);
int c = lower_bound(begin(yy), end(yy), C[i]) - begin(yy);
// whoami(a, b, c);
for (int j = a; j < b; j++) {
gex[j][c] |= (1 << 2);
gex[j][c - 1] |= (1 << 0);
}
}
for (int i = 0; i < m; i++) {
int d = lower_bound(begin(xx), end(xx), D[i]) - begin(xx);
int e = lower_bound(begin(yy), end(yy), E[i]) - begin(yy);
int f = lower_bound(begin(yy), end(yy), F[i]) - begin(yy);
for (int j = e; j < f; j++) {
gex[d][j] |= (1 << 3);
gex[d - 1][j] |= (1 << 1);
}
}
n = (int)xx.sz();
m = (int)yy.sz();
int zx = lower_bound(begin(xx), end(xx), 0) - begin(xx);
int zy = lower_bound(begin(yy), end(yy), 0) - begin(yy);
bfs_visit(zx, zy, n, m);
for (int i = 0; i < n; i++) {
if (vis[i][0] || vis[i][m - 1]) {
cout << "INF\n";
return;
}
}
for (int i = 0; i < m; i++) {
if (vis[0][i] || vis[n - 1][i]) {
cout << "INF\n";
return;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (vis[i][j])
ans += (xx[i + 1] - xx[i]) * (yy[j + 1] - yy[j]);
}
}
cout << ans << "\n";
return;
}
int main(void) {
FLASH();
// freopen("cowjog.in", "r", stdin);
// freopen("cowjog.out", "w", stdout);
int T;
T = 1;
#ifndef ONLINE_JUDGE
time_t time_t1, time_t2;
time_t1 = clock();
#endif
// cin>>T;
while (T--)
solve(T);
#ifndef ONLINE_JUDGE
time_t2 = clock();
SETF();
cerr << "Time taken: " << setprecision(7)
<< (time_t2 - time_t1) / (double)CLOCKS_PER_SEC << "\n";
UNSETF();
#endif
return 0;
} | replace | 106 | 108 | 106 | 108 | 0 | Time taken: 0.0002430
|
p02680 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ref(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define INF 1111111111
int n, m;
int a[1001], b[1001], c[1000], d[1000], e[1000], f[1000];
int U[3000][3000], L[3000][3000];
typedef pair<int, int> P;
vector<vector<bool>> vis;
typedef long long ll;
int id(vector<ll> h, ll a) {
return lower_bound(h.begin(), h.end(), a) - h.begin();
}
int main() {
cin >> n >> m;
vector<ll> h, w;
ref(i, n) {
cin >> a[i] >> b[i] >> c[i];
h.push_back(a[i]);
h.push_back(b[i]);
w.push_back(c[i]);
}
ref(i, m) {
cin >> d[i] >> e[i] >> f[i];
h.push_back(d[i]);
w.push_back(f[i]);
w.push_back(e[i]);
}
h.push_back(INF);
h.push_back(-INF);
w.push_back(INF);
w.push_back(-INF);
h.push_back(0);
w.push_back(0);
sort(h.begin(), h.end());
sort(w.begin(), w.end());
h.erase(unique(h.begin(), h.end()), h.end());
w.erase(unique(w.begin(), w.end()), w.end());
vis = vector<vector<bool>>(h.size(), vector<bool>(w.size(), false));
ref(i, n) {
L[id(h, a[i])][id(w, c[i])]++;
L[id(h, b[i])][id(w, c[i])]--;
}
ref(i, m) {
U[id(h, d[i])][id(w, e[i])]++;
U[id(h, d[i])][id(w, f[i])]--;
}
for (int i = 1; i < h.size(); i++) {
for (int j = 1; j < w.size(); j++) {
L[i][j] += L[i - 1][j];
U[i][j] += U[i][j - 1];
}
}
queue<P> q;
q.push({id(h, 0), id(w, 0)});
ll ans = 0;
while (!q.empty()) {
P p = q.front();
q.pop();
int x = p.first, y = p.second;
if (!x || !y || x == h.size() - 1 || y == w.size() - 1) {
cout << "INF";
return 0;
}
if (!vis[x][y]) {
vis[x][y] = 1;
ans += (h[x + 1] - h[x]) * (w[y + 1] - w[y]);
if (!U[x][y])
q.push({x - 1, y});
if (!L[x][y])
q.push({x, y - 1});
if (!U[x + 1][y])
q.push({x + 1, y});
if (!L[x][y + 1])
q.push({x, y + 1});
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define ref(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define INF 1111111111
int n, m;
int a[1001], b[1001], c[1000], d[1000], e[1000], f[1000];
int U[4000][4000], L[4000][4000];
typedef pair<int, int> P;
vector<vector<bool>> vis;
typedef long long ll;
int id(vector<ll> h, ll a) {
return lower_bound(h.begin(), h.end(), a) - h.begin();
}
int main() {
cin >> n >> m;
vector<ll> h, w;
ref(i, n) {
cin >> a[i] >> b[i] >> c[i];
h.push_back(a[i]);
h.push_back(b[i]);
w.push_back(c[i]);
}
ref(i, m) {
cin >> d[i] >> e[i] >> f[i];
h.push_back(d[i]);
w.push_back(f[i]);
w.push_back(e[i]);
}
h.push_back(INF);
h.push_back(-INF);
w.push_back(INF);
w.push_back(-INF);
h.push_back(0);
w.push_back(0);
sort(h.begin(), h.end());
sort(w.begin(), w.end());
h.erase(unique(h.begin(), h.end()), h.end());
w.erase(unique(w.begin(), w.end()), w.end());
vis = vector<vector<bool>>(h.size(), vector<bool>(w.size(), false));
ref(i, n) {
L[id(h, a[i])][id(w, c[i])]++;
L[id(h, b[i])][id(w, c[i])]--;
}
ref(i, m) {
U[id(h, d[i])][id(w, e[i])]++;
U[id(h, d[i])][id(w, f[i])]--;
}
for (int i = 1; i < h.size(); i++) {
for (int j = 1; j < w.size(); j++) {
L[i][j] += L[i - 1][j];
U[i][j] += U[i][j - 1];
}
}
queue<P> q;
q.push({id(h, 0), id(w, 0)});
ll ans = 0;
while (!q.empty()) {
P p = q.front();
q.pop();
int x = p.first, y = p.second;
if (!x || !y || x == h.size() - 1 || y == w.size() - 1) {
cout << "INF";
return 0;
}
if (!vis[x][y]) {
vis[x][y] = 1;
ans += (h[x + 1] - h[x]) * (w[y + 1] - w[y]);
if (!U[x][y])
q.push({x - 1, y});
if (!L[x][y])
q.push({x, y - 1});
if (!U[x + 1][y])
q.push({x + 1, y});
if (!L[x][y + 1])
q.push({x, y + 1});
}
}
cout << ans;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02680 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
vector<ll> fac;
void c_fac(int x = pow(10, 6) + 10) {
fac.resize(x, true);
rep(i, x) fac[i] = i ? (fac[i - 1] * i) % MOD : 1;
}
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
int d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return (x + m) % m;
}
ll nck(ll n, ll k) { return fac[n] * inv(fac[k] * fac[n - k] % MOD) % MOD; }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
struct query {
ll A, B, C;
};
vector<vector<vector<bool>>> adj;
vector<vector<bool>> used;
void dfs(int x, int y) {
if (used[x][y])
return;
// cout << x << "," << y << endl;
used[x][y] = true;
if (adj[x][y][0] && !used[x - 1][y])
dfs(x - 1, y);
if (adj[x][y][1] && !used[x][y - 1])
dfs(x, y - 1);
if (adj[x][y][2] && !used[x + 1][y])
dfs(x + 1, y);
if (adj[x][y][3] && !used[x][y + 1])
dfs(x, y + 1);
}
int main() {
int N, M;
cin >> N >> M;
vector<query> qx, qy;
set<ll> setx, sety;
rep(i, N) {
ll A, B, C;
cin >> A >> B >> C;
if (A > B)
swap(A, B);
qx.push_back({A, B, C});
sety.insert(A);
sety.insert(B);
setx.insert(C);
}
rep(i, M) {
ll A, B, C;
cin >> A >> B >> C;
if (B > C)
swap(B, C);
qy.push_back({B, C, A});
sety.insert(A);
setx.insert(B);
setx.insert(C);
}
vector<ll> vx, vy;
for (auto x : setx)
vx.push_back(x);
for (auto x : sety)
vy.push_back(x);
// debug(all(vx)); debug(all(vy));
ll sx = vy.size() + 1, sy = vx.size() + 1;
adj.resize(sx);
rep(i, sx) {
adj[i].resize(sy);
rep(j, sy) adj[i][j].resize(4, true);
}
used.resize(sx);
rep(i, sx) used[i].resize(sy, false);
rep(i, sx) rep(j, sy) {
if (i == 0)
adj[i][j][0] = false;
if (i == sx - 1)
adj[i][j][2] = false;
if (j == 0)
adj[i][j][1] = false;
if (j == sy - 1)
adj[i][j][3] = false;
}
rep(i, N) {
int pa = lower_bound(all(vy), qx[i].A) - vy.begin();
int pb = lower_bound(all(vy), qx[i].B) - vy.begin();
int pc = lower_bound(all(vx), qx[i].C) - vx.begin();
// cout << i << " " << pa << "-" << pb << ", " << pc << endl;
repr(j, pa + 1, pb + 1) {
adj[j][pc][3] = false;
adj[j][pc + 1][1] = false;
}
}
rep(i, M) {
int pa = lower_bound(all(vx), qy[i].A) - vx.begin();
int pb = lower_bound(all(vx), qy[i].B) - vx.begin();
int pc = lower_bound(all(vy), qy[i].C) - vy.begin();
// cout << i << " " << pa << "-" << pb << ", " << pc << endl;
repr(j, pa + 1, pb + 1) {
adj[pc][j][2] = false;
adj[pc + 1][j][0] = false;
}
}
// rep(i,sx) { rep(j,sy) cout << adj[i][j][2] << " "; cout << endl; }
int spx = lower_bound(all(vy), 0) - vy.begin();
int spy = lower_bound(all(vx), 0) - vx.begin();
dfs(spx, spy);
// rep(i,sx) debug(all(used[i]));
ll result = 0;
rep(i, sx) rep(j, sy) {
if (used[i][j]) {
if (i == 0 || i == sx - 1 || j == 0 || j == sy - 1) {
cout << "INF" << endl;
return 0;
} else
result += (vy[i] - vy[i - 1]) * (vx[j] - vx[j - 1]);
}
}
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
vector<ll> fac;
void c_fac(int x = pow(10, 6) + 10) {
fac.resize(x, true);
rep(i, x) fac[i] = i ? (fac[i - 1] * i) % MOD : 1;
}
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
int d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return (x + m) % m;
}
ll nck(ll n, ll k) { return fac[n] * inv(fac[k] * fac[n - k] % MOD) % MOD; }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
struct query {
ll A, B, C;
};
vector<vector<vector<bool>>> adj;
vector<vector<bool>> used;
void dfs(int x, int y) {
if (used[x][y])
return;
// cout << x << "," << y << endl;
used[x][y] = true;
if (adj[x][y][0] && !used[x - 1][y])
dfs(x - 1, y);
if (adj[x][y][1] && !used[x][y - 1])
dfs(x, y - 1);
if (adj[x][y][2] && !used[x + 1][y])
dfs(x + 1, y);
if (adj[x][y][3] && !used[x][y + 1])
dfs(x, y + 1);
}
int main() {
int N, M;
cin >> N >> M;
vector<query> qx, qy;
set<ll> setx, sety;
rep(i, N) {
ll A, B, C;
cin >> A >> B >> C;
if (A > B)
swap(A, B);
qx.push_back({A, B, C});
sety.insert(A);
sety.insert(B);
setx.insert(C);
}
rep(i, M) {
ll A, B, C;
cin >> A >> B >> C;
if (B > C)
swap(B, C);
qy.push_back({B, C, A});
sety.insert(A);
setx.insert(B);
setx.insert(C);
}
vector<ll> vx, vy;
for (auto x : setx)
vx.push_back(x);
for (auto x : sety)
vy.push_back(x);
// debug(all(vx)); debug(all(vy));
ll sx = vy.size() + 1, sy = vx.size() + 1;
adj.resize(sx);
rep(i, sx) {
adj[i].resize(sy);
rep(j, sy) adj[i][j].resize(4, true);
}
used.resize(sx);
rep(i, sx) used[i].resize(sy, false);
rep(i, sx) rep(j, sy) {
if (i == 0)
adj[i][j][0] = false;
if (i == sx - 1)
adj[i][j][2] = false;
if (j == 0)
adj[i][j][1] = false;
if (j == sy - 1)
adj[i][j][3] = false;
}
rep(i, N) {
int pa = lower_bound(all(vy), qx[i].A) - vy.begin();
int pb = lower_bound(all(vy), qx[i].B) - vy.begin();
int pc = lower_bound(all(vx), qx[i].C) - vx.begin();
// cout << i << " " << pa << "-" << pb << ", " << pc << endl;
repr(j, pa + 1, pb + 1) {
adj[j][pc][3] = false;
adj[j][pc + 1][1] = false;
}
}
rep(i, M) {
int pa = lower_bound(all(vx), qy[i].A) - vx.begin();
int pb = lower_bound(all(vx), qy[i].B) - vx.begin();
int pc = lower_bound(all(vy), qy[i].C) - vy.begin();
// cout << i << " " << pa << "-" << pb << ", " << pc << endl;
repr(j, pa + 1, pb + 1) {
adj[pc][j][2] = false;
adj[pc + 1][j][0] = false;
}
}
// rep(i,sx) { rep(j,sy) cout << adj[i][j][2] << " "; cout << endl; }
int spx = lower_bound(all(vy), 0) - vy.begin();
int spy = lower_bound(all(vx), 0) - vx.begin();
// dfs(spx,spy);
queue<p_ll> que;
que.push(make_pair(spx, spy));
used[spx][spy] = true;
while (que.size()) {
p_ll qt = que.front();
que.pop();
ll x = qt.first, y = qt.second;
if (adj[x][y][0] && !used[x - 1][y]) {
used[x - 1][y] = true;
que.push(make_pair(x - 1, y));
}
if (adj[x][y][1] && !used[x][y - 1]) {
used[x][y - 1] = true;
que.push(make_pair(x, y - 1));
}
if (adj[x][y][2] && !used[x + 1][y]) {
used[x + 1][y] = true;
que.push(make_pair(x + 1, y));
}
if (adj[x][y][3] && !used[x][y + 1]) {
used[x][y + 1] = true;
que.push(make_pair(x, y + 1));
}
}
// rep(i,sx) debug(all(used[i]));
ll result = 0;
rep(i, sx) rep(j, sy) {
if (used[i][j]) {
if (i == 0 || i == sx - 1 || j == 0 || j == sy - 1) {
cout << "INF" << endl;
return 0;
} else
result += (vy[i] - vy[i - 1]) * (vx[j] - vx[j - 1]);
}
}
cout << result << endl;
return 0;
} | replace | 145 | 146 | 145 | 171 | 0 | |
p02680 | C++ | Runtime Error | #ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
struct Point {
int x, y;
};
struct Bar {
Point a, b;
};
int main() {
int n, m;
cin >> n >> m;
auto vertical_bars = vector<Bar>(n);
auto horizontal_bars = vector<Bar>(m);
auto Sx = set<int>();
auto Sy = set<int>();
Sx.insert(0); // cow position
Sy.insert(0);
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
vertical_bars[i].a = {a, c};
vertical_bars[i].b = {b, c};
Sx.insert(a);
Sx.insert(b);
Sy.insert(c);
}
for (int i = 0; i < m; i++) {
int d, e, f;
cin >> d >> e >> f;
horizontal_bars[i].a = {d, e};
horizontal_bars[i].b = {d, f};
Sx.insert(d);
Sy.insert(e);
Sy.insert(f);
}
auto Qx_of = map<int, int>();
auto Qy_of = map<int, int>();
{
auto index = 0;
for (auto x : Sx)
Qx_of[x] = index++;
index = 0;
for (auto y : Sy)
Qy_of[y] = index++;
}
constexpr int Dim = 4096;
auto plain_ptr = make_unique<array<array<char, Dim>, Dim>>();
auto &plain = *plain_ptr;
for (auto bar : vertical_bars) {
auto x1 = Qx_of[bar.a.x] * 2 + 10;
auto x2 = Qx_of[bar.b.x] * 2 + 10;
auto y1 = Qy_of[bar.a.y] * 2 + 10;
for (auto x = x1; x <= x2; ++x) {
plain[x][y1] = 1;
}
}
for (auto bar : horizontal_bars) {
auto x1 = Qx_of[bar.a.x] * 2 + 10;
auto y1 = Qy_of[bar.a.y] * 2 + 10;
auto y2 = Qy_of[bar.b.y] * 2 + 10;
for (auto y = y1; y <= y2; ++y) {
plain[x1][y] = 1;
}
}
// quantize cow position
const auto cx = Qx_of[0] * 2 + 10;
const auto cy = Qy_of[0] * 2 + 10;
#ifdef _MSC_VER
for (int x = 10; x < 80; x++) {
for (int y = 10; y < 80; y++) {
if (cx == x && cy == y)
cerr << '@';
else
cerr << (".#c"[plain[x][y]]);
}
cerr << endl;
}
#endif
auto q = vector<Point>();
q.reserve(Dim * Dim);
auto pop = size_t{0};
auto unbounded = false;
q.emplace_back(Point{cx, cy});
const auto delta =
array<Point, 4>{Point{-1, 0}, Point{0, -1}, Point{1, 0}, Point{0, 1}};
while (pop < q.size() && !unbounded) {
auto [px, py] = q[pop++];
for (auto [dx, dy] : delta) {
auto nx = px + dx;
auto ny = py + dy;
if (nx < 0 || nx >= Dim || ny < 0 || ny >= Dim)
continue;
if (plain[nx][ny] != 0)
continue;
plain[nx][ny] = 2;
q.emplace_back(Point{nx, ny});
if (nx == 0 && ny == 0) {
unbounded = true;
break;
}
}
}
#ifdef _MSC_VER
for (int x = 10; x < 80; x++) {
for (int y = 10; y < 80; y++) {
if (cx == x && cy == y)
cerr << '@';
else
cerr << (".#c"[plain[x][y]]);
}
cerr << endl;
}
#endif
if (unbounded) {
cout << "INF";
return 0;
}
auto x_len = vector<int>();
{
auto itr = Sx.begin();
auto last_x = *itr++;
for (; itr != Sx.end(); ++itr) {
x_len.emplace_back(*itr - last_x);
last_x = *itr;
}
}
auto y_len = vector<int>();
{
auto itr = Sy.begin();
auto last_y = *itr++;
for (; itr != Sy.end(); ++itr) {
y_len.emplace_back(*itr - last_y);
last_y = *itr;
}
}
auto area = 0LL;
for (int x = 11; x < Dim; x += 2) {
for (int y = 11; y < Dim; y += 2) {
if (plain[x][y] != 2)
continue;
auto i = (x - 10) / 2;
auto j = (y - 10) / 2;
if (i >= x_len.size() || j >= y_len.size())
continue;
auto xval = x_len[(x - 10) / 2];
auto yval = y_len[(y - 10) / 2];
area += large(xval) * yval;
}
}
cout << area;
return 0;
}
| #ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
struct Point {
int x, y;
};
struct Bar {
Point a, b;
};
int main() {
int n, m;
cin >> n >> m;
auto vertical_bars = vector<Bar>(n);
auto horizontal_bars = vector<Bar>(m);
auto Sx = set<int>();
auto Sy = set<int>();
Sx.insert(0); // cow position
Sy.insert(0);
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
vertical_bars[i].a = {a, c};
vertical_bars[i].b = {b, c};
Sx.insert(a);
Sx.insert(b);
Sy.insert(c);
}
for (int i = 0; i < m; i++) {
int d, e, f;
cin >> d >> e >> f;
horizontal_bars[i].a = {d, e};
horizontal_bars[i].b = {d, f};
Sx.insert(d);
Sy.insert(e);
Sy.insert(f);
}
auto Qx_of = map<int, int>();
auto Qy_of = map<int, int>();
{
auto index = 0;
for (auto x : Sx)
Qx_of[x] = index++;
index = 0;
for (auto y : Sy)
Qy_of[y] = index++;
}
constexpr int Dim = 8192;
auto plain_ptr = make_unique<array<array<char, Dim>, Dim>>();
auto &plain = *plain_ptr;
for (auto bar : vertical_bars) {
auto x1 = Qx_of[bar.a.x] * 2 + 10;
auto x2 = Qx_of[bar.b.x] * 2 + 10;
auto y1 = Qy_of[bar.a.y] * 2 + 10;
for (auto x = x1; x <= x2; ++x) {
plain[x][y1] = 1;
}
}
for (auto bar : horizontal_bars) {
auto x1 = Qx_of[bar.a.x] * 2 + 10;
auto y1 = Qy_of[bar.a.y] * 2 + 10;
auto y2 = Qy_of[bar.b.y] * 2 + 10;
for (auto y = y1; y <= y2; ++y) {
plain[x1][y] = 1;
}
}
// quantize cow position
const auto cx = Qx_of[0] * 2 + 10;
const auto cy = Qy_of[0] * 2 + 10;
#ifdef _MSC_VER
for (int x = 10; x < 80; x++) {
for (int y = 10; y < 80; y++) {
if (cx == x && cy == y)
cerr << '@';
else
cerr << (".#c"[plain[x][y]]);
}
cerr << endl;
}
#endif
auto q = vector<Point>();
q.reserve(Dim * Dim);
auto pop = size_t{0};
auto unbounded = false;
q.emplace_back(Point{cx, cy});
const auto delta =
array<Point, 4>{Point{-1, 0}, Point{0, -1}, Point{1, 0}, Point{0, 1}};
while (pop < q.size() && !unbounded) {
auto [px, py] = q[pop++];
for (auto [dx, dy] : delta) {
auto nx = px + dx;
auto ny = py + dy;
if (nx < 0 || nx >= Dim || ny < 0 || ny >= Dim)
continue;
if (plain[nx][ny] != 0)
continue;
plain[nx][ny] = 2;
q.emplace_back(Point{nx, ny});
if (nx == 0 && ny == 0) {
unbounded = true;
break;
}
}
}
#ifdef _MSC_VER
for (int x = 10; x < 80; x++) {
for (int y = 10; y < 80; y++) {
if (cx == x && cy == y)
cerr << '@';
else
cerr << (".#c"[plain[x][y]]);
}
cerr << endl;
}
#endif
if (unbounded) {
cout << "INF";
return 0;
}
auto x_len = vector<int>();
{
auto itr = Sx.begin();
auto last_x = *itr++;
for (; itr != Sx.end(); ++itr) {
x_len.emplace_back(*itr - last_x);
last_x = *itr;
}
}
auto y_len = vector<int>();
{
auto itr = Sy.begin();
auto last_y = *itr++;
for (; itr != Sy.end(); ++itr) {
y_len.emplace_back(*itr - last_y);
last_y = *itr;
}
}
auto area = 0LL;
for (int x = 11; x < Dim; x += 2) {
for (int y = 11; y < Dim; y += 2) {
if (plain[x][y] != 2)
continue;
auto i = (x - 10) / 2;
auto j = (y - 10) / 2;
if (i >= x_len.size() || j >= y_len.size())
continue;
auto xval = x_len[(x - 10) / 2];
auto yval = y_len[(y - 10) / 2];
area += large(xval) * yval;
}
}
cout << area;
return 0;
}
| replace | 63 | 64 | 63 | 64 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02680 | C++ | Runtime Error |
#include <bits/stdc++.h>
// #include "bits/stdc++.h"
#include <algorithm>
#include <array>
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n))
x++;
return x;
}
// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
} // namespace internal
} // namespace atcoder
#include <utility>
namespace atcoder {
namespace internal {
// @param m `1 <= m`
// @return x mod m
constexpr long long safe_mod(long long x, long long m) {
x %= m;
if (x < 0)
x += m;
return x;
}
// Fast modular multiplication by barrett reduction
// Reference: https://en.wikipedia.org/wiki/Barrett_reduction
// NOTE: reconsider after Ice Lake
struct barrett {
unsigned int _m;
unsigned long long im;
// @param m `1 <= m < 2^31`
barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}
// @return m
unsigned int umod() const { return _m; }
// @param a `0 <= a < m`
// @param b `0 <= b < m`
// @return `a * b % m`
unsigned int mul(unsigned int a, unsigned int b) const {
// [1] m = 1
// a = b = im = 0, so okay
// [2] m >= 2
// im = ceil(2^64 / m)
// -> im * m = 2^64 + r (0 <= r < m)
// let z = a*b = c*m + d (0 <= c, d < m)
// a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im
// c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) <
// 2^64 * 2
// ((ab * im) >> 64) == c or c + 1
unsigned long long z = a;
z *= b;
#ifdef _MSC_VER
unsigned long long x;
_umul128(z, im, &x);
#else
unsigned long long x =
(unsigned long long)(((unsigned __int128)(z)*im) >> 64);
#endif
unsigned int v = (unsigned int)(z - x * _m);
if (_m <= v)
v += _m;
return v;
}
};
// @param n `0 <= n`
// @param m `1 <= m`
// @return `(x ** n) % m`
constexpr long long pow_mod_constexpr(long long x, long long n, int m) {
if (m == 1)
return 0;
unsigned int _m = (unsigned int)(m);
unsigned long long r = 1;
unsigned long long y = safe_mod(x, m);
while (n) {
if (n & 1)
r = (r * y) % _m;
y = (y * y) % _m;
n >>= 1;
}
return r;
}
// Reference:
// M. Forisek and J. Jancina,
// Fast Primality Testing for Integers That Fit into a Machine Word
// @param n `0 <= n`
constexpr bool is_prime_constexpr(int n) {
if (n <= 1)
return false;
if (n == 2 || n == 7 || n == 61)
return true;
if (n % 2 == 0)
return false;
long long d = n - 1;
while (d % 2 == 0)
d /= 2;
constexpr long long bases[3] = {2, 7, 61};
for (long long a : bases) {
long long t = d;
long long y = pow_mod_constexpr(a, t, n);
while (t != n - 1 && y != 1 && y != n - 1) {
y = y * y % n;
t <<= 1;
}
if (y != n - 1 && t % 2 == 0) {
return false;
}
}
return true;
}
template <int n> constexpr bool is_prime = is_prime_constexpr(n);
// @param b `1 <= b`
// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g
constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {
a = safe_mod(a, b);
if (a == 0)
return {b, 0};
// Contracts:
// [1] s - m0 * a = 0 (mod b)
// [2] t - m1 * a = 0 (mod b)
// [3] s * |m1| + t * |m0| <= b
long long s = b, t = a;
long long m0 = 0, m1 = 1;
while (t) {
long long u = s / t;
s -= t * u;
m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b
// [3]:
// (s - t * u) * |m1| + t * |m0 - m1 * u|
// <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)
// = s * |m1| + t * |m0| <= b
auto tmp = s;
s = t;
t = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
// by [3]: |m0| <= b/g
// by g != b: |m0| < b/g
if (m0 < 0)
m0 += b / s;
return {s, m0};
}
// Compile time primitive root
// @param m must be prime
// @return primitive root (and minimum in now)
constexpr int primitive_root_constexpr(int m) {
if (m == 2)
return 1;
if (m == 167772161)
return 3;
if (m == 469762049)
return 3;
if (m == 754974721)
return 11;
if (m == 998244353)
return 3;
int divs[20] = {};
divs[0] = 2;
int cnt = 1;
int x = (m - 1) / 2;
while (x % 2 == 0)
x /= 2;
for (int i = 3; (long long)(i)*i <= x; i += 2) {
if (x % i == 0) {
divs[cnt++] = i;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1) {
divs[cnt++] = x;
}
for (int g = 2;; g++) {
bool ok = true;
for (int i = 0; i < cnt; i++) {
if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {
ok = false;
break;
}
}
if (ok)
return g;
}
}
template <int m> constexpr int primitive_root = primitive_root_constexpr(m);
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <numeric>
#include <type_traits>
namespace atcoder {
namespace internal {
#ifndef _MSC_VER
template <class T>
using is_signed_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value ||
std::is_same<T, __int128>::value,
std::true_type, std::false_type>::type;
template <class T>
using is_unsigned_int128 =
typename std::conditional<std::is_same<T, __uint128_t>::value ||
std::is_same<T, unsigned __int128>::value,
std::true_type, std::false_type>::type;
template <class T>
using make_unsigned_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t,
unsigned __int128>;
template <class T>
using is_integral =
typename std::conditional<std::is_integral<T>::value ||
is_signed_int128<T>::value ||
is_unsigned_int128<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using is_signed_int =
typename std::conditional<(is_integral<T>::value &&
std::is_signed<T>::value) ||
is_signed_int128<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<(is_integral<T>::value &&
std::is_unsigned<T>::value) ||
is_unsigned_int128<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<
is_signed_int128<T>::value, make_unsigned_int128<T>,
typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,
std::common_type<T>>::type>::type;
#else
template <class T> using is_integral = typename std::is_integral<T>;
template <class T>
using is_signed_int =
typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<is_integral<T>::value &&
std::is_unsigned<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using to_unsigned =
typename std::conditional<is_signed_int<T>::value, std::make_unsigned<T>,
std::common_type<T>>::type;
#endif
template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;
template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;
template <class T> using to_unsigned_t = typename to_unsigned<T>::type;
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <numeric>
#include <type_traits>
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
struct modint_base {};
struct static_modint_base : modint_base {};
template <class T> using is_modint = std::is_base_of<modint_base, T>;
template <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;
} // namespace internal
template <int m, std::enable_if_t<(1 <= m)> * = nullptr>
struct static_modint : internal::static_modint_base {
using mint = static_modint;
public:
static constexpr int mod() { return m; }
static mint raw(int v) {
mint x;
x._v = v;
return x;
}
static_modint() : _v(0) {}
template <class T, internal::is_signed_int_t<T> * = nullptr>
static_modint(T v) {
long long x = (long long)(v % (long long)(umod()));
if (x < 0)
x += umod();
_v = (unsigned int)(x);
}
template <class T, internal::is_unsigned_int_t<T> * = nullptr>
static_modint(T v) {
_v = (unsigned int)(v % umod());
}
static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }
unsigned int val() const { return _v; }
mint &operator++() {
_v++;
if (_v == umod())
_v = 0;
return *this;
}
mint &operator--() {
if (_v == 0)
_v = umod();
_v--;
return *this;
}
mint operator++(int) {
mint result = *this;
++*this;
return result;
}
mint operator--(int) {
mint result = *this;
--*this;
return result;
}
mint &operator+=(const mint &rhs) {
_v += rhs._v;
if (_v >= umod())
_v -= umod();
return *this;
}
mint &operator-=(const mint &rhs) {
_v -= rhs._v;
if (_v >= umod())
_v += umod();
return *this;
}
mint &operator*=(const mint &rhs) {
unsigned long long z = _v;
z *= rhs._v;
_v = (unsigned int)(z % umod());
return *this;
}
mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }
mint operator+() const { return *this; }
mint operator-() const { return mint() - *this; }
mint pow(long long n) const {
assert(0 <= n);
mint x = *this, r = 1;
while (n) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
mint inv() const {
if (prime) {
assert(_v);
return pow(umod() - 2);
} else {
auto eg = internal::inv_gcd(_v, m);
assert(eg.first == 1);
return eg.second;
}
}
friend mint operator+(const mint &lhs, const mint &rhs) {
return mint(lhs) += rhs;
}
friend mint operator-(const mint &lhs, const mint &rhs) {
return mint(lhs) -= rhs;
}
friend mint operator*(const mint &lhs, const mint &rhs) {
return mint(lhs) *= rhs;
}
friend mint operator/(const mint &lhs, const mint &rhs) {
return mint(lhs) /= rhs;
}
friend bool operator==(const mint &lhs, const mint &rhs) {
return lhs._v == rhs._v;
}
friend bool operator!=(const mint &lhs, const mint &rhs) {
return lhs._v != rhs._v;
}
private:
unsigned int _v;
static constexpr unsigned int umod() { return m; }
static constexpr bool prime = internal::is_prime<m>;
};
template <int id> struct dynamic_modint : internal::modint_base {
using mint = dynamic_modint;
public:
static int mod() { return (int)(bt.umod()); }
static void set_mod(int m) {
assert(1 <= m);
bt = internal::barrett(m);
}
static mint raw(int v) {
mint x;
x._v = v;
return x;
}
dynamic_modint() : _v(0) {}
template <class T, internal::is_signed_int_t<T> * = nullptr>
dynamic_modint(T v) {
long long x = (long long)(v % (long long)(mod()));
if (x < 0)
x += mod();
_v = (unsigned int)(x);
}
template <class T, internal::is_unsigned_int_t<T> * = nullptr>
dynamic_modint(T v) {
_v = (unsigned int)(v % mod());
}
dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }
unsigned int val() const { return _v; }
mint &operator++() {
_v++;
if (_v == umod())
_v = 0;
return *this;
}
mint &operator--() {
if (_v == 0)
_v = umod();
_v--;
return *this;
}
mint operator++(int) {
mint result = *this;
++*this;
return result;
}
mint operator--(int) {
mint result = *this;
--*this;
return result;
}
mint &operator+=(const mint &rhs) {
_v += rhs._v;
if (_v >= umod())
_v -= umod();
return *this;
}
mint &operator-=(const mint &rhs) {
_v += mod() - rhs._v;
if (_v >= umod())
_v -= umod();
return *this;
}
mint &operator*=(const mint &rhs) {
_v = bt.mul(_v, rhs._v);
return *this;
}
mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }
mint operator+() const { return *this; }
mint operator-() const { return mint() - *this; }
mint pow(long long n) const {
assert(0 <= n);
mint x = *this, r = 1;
while (n) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
mint inv() const {
auto eg = internal::inv_gcd(_v, mod());
assert(eg.first == 1);
return eg.second;
}
friend mint operator+(const mint &lhs, const mint &rhs) {
return mint(lhs) += rhs;
}
friend mint operator-(const mint &lhs, const mint &rhs) {
return mint(lhs) -= rhs;
}
friend mint operator*(const mint &lhs, const mint &rhs) {
return mint(lhs) *= rhs;
}
friend mint operator/(const mint &lhs, const mint &rhs) {
return mint(lhs) /= rhs;
}
friend bool operator==(const mint &lhs, const mint &rhs) {
return lhs._v == rhs._v;
}
friend bool operator!=(const mint &lhs, const mint &rhs) {
return lhs._v != rhs._v;
}
private:
unsigned int _v;
static internal::barrett bt;
static unsigned int umod() { return bt.umod(); }
};
template <int id> internal::barrett dynamic_modint<id>::bt = 998244353;
using modint998244353 = static_modint<998244353>;
using modint1000000007 = static_modint<1000000007>;
using modint = dynamic_modint<-1>;
namespace internal {
template <class T>
using is_static_modint = std::is_base_of<internal::static_modint_base, T>;
template <class T>
using is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;
template <class> struct is_dynamic_modint : public std::false_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};
template <class T>
using is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <type_traits>
#include <vector>
namespace atcoder {
namespace internal {
template <class mint, internal::is_static_modint_t<mint> * = nullptr>
void butterfly(std::vector<mint> &a) {
static constexpr int g = internal::primitive_root<mint::mod()>;
int n = int(a.size());
int h = internal::ceil_pow2(n);
static bool first = true;
static mint sum_e[30]; // sum_e[i] = ies[0] * ... * ies[i - 1] * es[i]
if (first) {
first = false;
mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1
int cnt2 = bsf(mint::mod() - 1);
mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();
for (int i = cnt2; i >= 2; i--) {
// e^(2^i) == 1
es[i - 2] = e;
ies[i - 2] = ie;
e *= e;
ie *= ie;
}
mint now = 1;
for (int i = 0; i <= cnt2 - 2; i++) {
sum_e[i] = es[i] * now;
now *= ies[i];
}
}
for (int ph = 1; ph <= h; ph++) {
int w = 1 << (ph - 1), p = 1 << (h - ph);
mint now = 1;
for (int s = 0; s < w; s++) {
int offset = s << (h - ph + 1);
for (int i = 0; i < p; i++) {
auto l = a[i + offset];
auto r = a[i + offset + p] * now;
a[i + offset] = l + r;
a[i + offset + p] = l - r;
}
now *= sum_e[bsf(~(unsigned int)(s))];
}
}
}
template <class mint, internal::is_static_modint_t<mint> * = nullptr>
void butterfly_inv(std::vector<mint> &a) {
static constexpr int g = internal::primitive_root<mint::mod()>;
int n = int(a.size());
int h = internal::ceil_pow2(n);
static bool first = true;
static mint sum_ie[30]; // sum_ie[i] = es[0] * ... * es[i - 1] * ies[i]
if (first) {
first = false;
mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1
int cnt2 = bsf(mint::mod() - 1);
mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();
for (int i = cnt2; i >= 2; i--) {
// e^(2^i) == 1
es[i - 2] = e;
ies[i - 2] = ie;
e *= e;
ie *= ie;
}
mint now = 1;
for (int i = 0; i <= cnt2 - 2; i++) {
sum_ie[i] = ies[i] * now;
now *= es[i];
}
}
for (int ph = h; ph >= 1; ph--) {
int w = 1 << (ph - 1), p = 1 << (h - ph);
mint inow = 1;
for (int s = 0; s < w; s++) {
int offset = s << (h - ph + 1);
for (int i = 0; i < p; i++) {
auto l = a[i + offset];
auto r = a[i + offset + p];
a[i + offset] = l + r;
a[i + offset + p] =
(unsigned long long)(mint::mod() + l.val() - r.val()) * inow.val();
}
inow *= sum_ie[bsf(~(unsigned int)(s))];
}
}
}
} // namespace internal
template <class mint, internal::is_static_modint_t<mint> * = nullptr>
std::vector<mint> convolution(std::vector<mint> a, std::vector<mint> b) {
int n = int(a.size()), m = int(b.size());
if (!n || !m)
return {};
if (std::min(n, m) <= 60) {
if (n < m) {
std::swap(n, m);
std::swap(a, b);
}
std::vector<mint> ans(n + m - 1);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ans[i + j] += a[i] * b[j];
}
}
return ans;
}
int z = 1 << internal::ceil_pow2(n + m - 1);
a.resize(z);
internal::butterfly(a);
b.resize(z);
internal::butterfly(b);
for (int i = 0; i < z; i++) {
a[i] *= b[i];
}
internal::butterfly_inv(a);
a.resize(n + m - 1);
mint iz = mint(z).inv();
for (int i = 0; i < n + m - 1; i++)
a[i] *= iz;
return a;
}
template <unsigned int mod = 998244353, class T,
std::enable_if_t<internal::is_integral<T>::value> * = nullptr>
std::vector<T> convolution(const std::vector<T> &a, const std::vector<T> &b) {
int n = int(a.size()), m = int(b.size());
if (!n || !m)
return {};
using mint = static_modint<mod>;
std::vector<mint> a2(n), b2(m);
for (int i = 0; i < n; i++) {
a2[i] = mint(a[i]);
}
for (int i = 0; i < m; i++) {
b2[i] = mint(b[i]);
}
auto c2 = convolution(move(a2), move(b2));
std::vector<T> c(n + m - 1);
for (int i = 0; i < n + m - 1; i++) {
c[i] = c2[i].val();
}
return c;
}
std::vector<long long> convolution_ll(const std::vector<long long> &a,
const std::vector<long long> &b) {
int n = int(a.size()), m = int(b.size());
if (!n || !m)
return {};
static constexpr unsigned long long MOD1 = 754974721; // 2^24
static constexpr unsigned long long MOD2 = 167772161; // 2^25
static constexpr unsigned long long MOD3 = 469762049; // 2^26
static constexpr unsigned long long M2M3 = MOD2 * MOD3;
static constexpr unsigned long long M1M3 = MOD1 * MOD3;
static constexpr unsigned long long M1M2 = MOD1 * MOD2;
static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;
static constexpr unsigned long long i1 =
internal::inv_gcd(MOD2 * MOD3, MOD1).second;
static constexpr unsigned long long i2 =
internal::inv_gcd(MOD1 * MOD3, MOD2).second;
static constexpr unsigned long long i3 =
internal::inv_gcd(MOD1 * MOD2, MOD3).second;
auto c1 = convolution<MOD1>(a, b);
auto c2 = convolution<MOD2>(a, b);
auto c3 = convolution<MOD3>(a, b);
std::vector<long long> c(n + m - 1);
for (int i = 0; i < n + m - 1; i++) {
unsigned long long x = 0;
x += (c1[i] * i1) % MOD1 * M2M3;
x += (c2[i] * i2) % MOD2 * M1M3;
x += (c3[i] * i3) % MOD3 * M1M2;
// B = 2^63, -B <= x, r(real value) < B
// (x, x - M, x - 2M, or x - 3M) = r (mod 2B)
// r = c1[i] (mod MOD1)
// focus on MOD1
// r = x, x - M', x - 2M', x - 3M' (M' = M % 2^64) (mod 2B)
// r = x,
// x - M' + (0 or 2B),
// x - 2M' + (0, 2B or 4B),
// x - 3M' + (0, 2B, 4B or 6B) (without mod!)
// (r - x) = 0, (0)
// - M' + (0 or 2B), (1)
// -2M' + (0 or 2B or 4B), (2)
// -3M' + (0 or 2B or 4B or 6B) (3) (mod MOD1)
// we checked that
// ((1) mod MOD1) mod 5 = 2
// ((2) mod MOD1) mod 5 = 3
// ((3) mod MOD1) mod 5 = 4
long long diff =
c1[i] - internal::safe_mod((long long)(x), (long long)(MOD1));
if (diff < 0)
diff += MOD1;
static constexpr unsigned long long offset[5] = {0, 0, M1M2M3, 2 * M1M2M3,
3 * M1M2M3};
x -= offset[diff % 5];
c[i] = x;
}
return c;
}
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <vector>
namespace atcoder {
// Implement (union by size) + (path compression)
// Reference:
// Zvi Galil and Giuseppe F. Italiano,
// Data structures and algorithms for disjoint set union problems
struct dsu {
public:
dsu() : _n(0) {}
dsu(int n) : _n(n), parent_or_size(n, -1) {}
int merge(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
int x = leader(a), y = leader(b);
if (x == y)
return x;
if (-parent_or_size[x] < -parent_or_size[y])
std::swap(x, y);
parent_or_size[x] += parent_or_size[y];
parent_or_size[y] = x;
return x;
}
bool same(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
return leader(a) == leader(b);
}
int leader(int a) {
assert(0 <= a && a < _n);
if (parent_or_size[a] < 0)
return a;
return parent_or_size[a] = leader(parent_or_size[a]);
}
int size(int a) {
assert(0 <= a && a < _n);
return -parent_or_size[leader(a)];
}
std::vector<std::vector<int>> groups() {
std::vector<int> leader_buf(_n), group_size(_n);
for (int i = 0; i < _n; i++) {
leader_buf[i] = leader(i);
group_size[leader_buf[i]]++;
}
std::vector<std::vector<int>> result(_n);
for (int i = 0; i < _n; i++) {
result[i].reserve(group_size[i]);
}
for (int i = 0; i < _n; i++) {
result[leader_buf[i]].push_back(i);
}
result.erase(
std::remove_if(result.begin(), result.end(),
[&](const std::vector<int> &v) { return v.empty(); }),
result.end());
return result;
}
private:
int _n;
// root node: -1 * component size
// otherwise: parent
std::vector<int> parent_or_size;
};
} // namespace atcoder
#include <cassert>
#include <vector>
namespace atcoder {
// Reference: https://en.wikipedia.org/wiki/Fenwick_tree
template <class T> struct fenwick_tree {
using U = internal::to_unsigned_t<T>;
public:
fenwick_tree() : _n(0) {}
fenwick_tree(int n) : _n(n), data(n) {}
void add(int p, T x) {
assert(0 <= p && p < _n);
p++;
while (p <= _n) {
data[p - 1] += U(x);
p += p & -p;
}
}
T sum(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
return sum(r) - sum(l);
}
private:
int _n;
std::vector<U> data;
U sum(int r) {
U s = 0;
while (r > 0) {
s += data[r - 1];
r -= r & -r;
}
return s;
}
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),
F (*composition)(F, F), F (*id)()>
struct lazy_segtree {
public:
lazy_segtree() : lazy_segtree(0) {}
lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
lazy_segtree(const std::vector<S> &v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
lz = std::vector<F>(size, id());
for (int i = 0; i < _n; i++)
d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
d[p] = x;
for (int i = 1; i <= log; i++)
update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
return d[p];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
if (l == r)
return e();
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l)
push(l >> i);
if (((r >> i) << i) != r)
push(r >> i);
}
S sml = e(), smr = e();
while (l < r) {
if (l & 1)
sml = op(sml, d[l++]);
if (r & 1)
smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
void apply(int p, F f) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
d[p] = mapping(f, d[p]);
for (int i = 1; i <= log; i++)
update(p >> i);
}
void apply(int l, int r, F f) {
assert(0 <= l && l <= r && r <= _n);
if (l == r)
return;
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l)
push(l >> i);
if (((r >> i) << i) != r)
push((r - 1) >> i);
}
{
int l2 = l, r2 = r;
while (l < r) {
if (l & 1)
all_apply(l++, f);
if (r & 1)
all_apply(--r, f);
l >>= 1;
r >>= 1;
}
l = l2;
r = r2;
}
for (int i = 1; i <= log; i++) {
if (((l >> i) << i) != l)
update(l >> i);
if (((r >> i) << i) != r)
update((r - 1) >> i);
}
}
template <bool (*g)(S)> int max_right(int l) {
return max_right(l, [](S x) { return g(x); });
}
template <class G> int max_right(int l, G g) {
assert(0 <= l && l <= _n);
assert(g(e()));
if (l == _n)
return _n;
l += size;
for (int i = log; i >= 1; i--)
push(l >> i);
S sm = e();
do {
while (l % 2 == 0)
l >>= 1;
if (!g(op(sm, d[l]))) {
while (l < size) {
push(l);
l = (2 * l);
if (g(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*g)(S)> int min_left(int r) {
return min_left(r, [](S x) { return g(x); });
}
template <class G> int min_left(int r, G g) {
assert(0 <= r && r <= _n);
assert(g(e()));
if (r == 0)
return 0;
r += size;
for (int i = log; i >= 1; i--)
push((r - 1) >> i);
S sm = e();
do {
r--;
while (r > 1 && (r % 2))
r >>= 1;
if (!g(op(d[r], sm))) {
while (r < size) {
push(r);
r = (2 * r + 1);
if (g(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
std::vector<F> lz;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
void all_apply(int k, F f) {
d[k] = mapping(f, d[k]);
if (k < size)
lz[k] = composition(f, lz[k]);
}
void push(int k) {
all_apply(2 * k, lz[k]);
all_apply(2 * k + 1, lz[k]);
lz[k] = id();
}
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <tuple>
#include <vector>
namespace atcoder {
long long pow_mod(long long x, long long n, int m) {
assert(0 <= n && 1 <= m);
if (m == 1)
return 0;
internal::barrett bt((unsigned int)(m));
unsigned int r = 1, y = (unsigned int)(internal::safe_mod(x, m));
while (n) {
if (n & 1)
r = bt.mul(r, y);
y = bt.mul(y, y);
n >>= 1;
}
return r;
}
long long inv_mod(long long x, long long m) {
assert(1 <= m);
auto z = internal::inv_gcd(x, m);
assert(z.first == 1);
return z.second;
}
// (rem, mod)
std::pair<long long, long long> crt(const std::vector<long long> &r,
const std::vector<long long> &m) {
assert(r.size() == m.size());
int n = int(r.size());
// Contracts: 0 <= r0 < m0
long long r0 = 0, m0 = 1;
for (int i = 0; i < n; i++) {
assert(1 <= m[i]);
long long r1 = internal::safe_mod(r[i], m[i]), m1 = m[i];
if (m0 < m1) {
std::swap(r0, r1);
std::swap(m0, m1);
}
if (m0 % m1 == 0) {
if (r0 % m1 != r1)
return {0, 0};
continue;
}
// assume: m0 > m1, lcm(m0, m1) >= 2 * max(m0, m1)
// (r0, m0), (r1, m1) -> (r2, m2 = lcm(m0, m1));
// r2 % m0 = r0
// r2 % m1 = r1
// -> (r0 + x*m0) % m1 = r1
// -> x*u0*g % (u1*g) = (r1 - r0) (u0*g = m0, u1*g = m1)
// -> x = (r1 - r0) / g * inv(u0) (mod u1)
// im = inv(u0) (mod u1) (0 <= im < u1)
long long g, im;
std::tie(g, im) = internal::inv_gcd(m0, m1);
long long u1 = (m1 / g);
// |r1 - r0| < (m0 + m1) <= lcm(m0, m1)
if ((r1 - r0) % g)
return {0, 0};
// u1 * u1 <= m1 * m1 / g / g <= m0 * m1 / g = lcm(m0, m1)
long long x = (r1 - r0) / g % u1 * im % u1;
// |r0| + |m0 * x|
// < m0 + m0 * (u1 - 1)
// = m0 + m0 * m1 / g - m0
// = lcm(m0, m1)
r0 += x * m0;
m0 *= u1; // -> lcm(m0, m1)
if (r0 < 0)
r0 += m0;
}
return {r0, m0};
}
long long floor_sum(long long n, long long m, long long a, long long b) {
long long ans = 0;
if (a >= m) {
ans += (n - 1) * n * (a / m) / 2;
a %= m;
}
if (b >= m) {
ans += n * (b / m);
b %= m;
}
long long y_max = (a * n + b) / m, x_max = (y_max * m - b);
if (y_max == 0)
return ans;
ans += (n - (x_max + a - 1) / a) * y_max;
ans += floor_sum(y_max, a, m, (a - x_max % a) % a);
return ans;
}
} // namespace atcoder
#include <algorithm>
#include <vector>
namespace atcoder {
namespace internal {
template <class T> struct simple_queue {
std::vector<T> payload;
int pos = 0;
void reserve(int n) { payload.reserve(n); }
int size() const { return int(payload.size()) - pos; }
bool empty() const { return pos == int(payload.size()); }
void push(const T &t) { payload.push_back(t); }
T &front() { return payload[pos]; }
void clear() {
payload.clear();
pos = 0;
}
void pop() { pos++; }
};
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <limits>
#include <queue>
#include <vector>
namespace atcoder {
template <class Cap> struct mf_graph {
public:
mf_graph() : _n(0) {}
mf_graph(int n) : _n(n), g(n) {}
int add_edge(int from, int to, Cap cap) {
assert(0 <= from && from < _n);
assert(0 <= to && to < _n);
assert(0 <= cap);
int m = int(pos.size());
pos.push_back({from, int(g[from].size())});
int from_id = int(g[from].size());
int to_id = int(g[to].size());
if (from == to)
to_id++;
g[from].push_back(_edge{to, to_id, cap});
g[to].push_back(_edge{from, from_id, 0});
return m;
}
struct edge {
int from, to;
Cap cap, flow;
};
edge get_edge(int i) {
int m = int(pos.size());
assert(0 <= i && i < m);
auto _e = g[pos[i].first][pos[i].second];
auto _re = g[_e.to][_e.rev];
return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};
}
std::vector<edge> edges() {
int m = int(pos.size());
std::vector<edge> result;
for (int i = 0; i < m; i++) {
result.push_back(get_edge(i));
}
return result;
}
void change_edge(int i, Cap new_cap, Cap new_flow) {
int m = int(pos.size());
assert(0 <= i && i < m);
assert(0 <= new_flow && new_flow <= new_cap);
auto &_e = g[pos[i].first][pos[i].second];
auto &_re = g[_e.to][_e.rev];
_e.cap = new_cap - new_flow;
_re.cap = new_flow;
}
Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }
Cap flow(int s, int t, Cap flow_limit) {
assert(0 <= s && s < _n);
assert(0 <= t && t < _n);
assert(s != t);
std::vector<int> level(_n), iter(_n);
internal::simple_queue<int> que;
auto bfs = [&]() {
std::fill(level.begin(), level.end(), -1);
level[s] = 0;
que.clear();
que.push(s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto e : g[v]) {
if (e.cap == 0 || level[e.to] >= 0)
continue;
level[e.to] = level[v] + 1;
if (e.to == t)
return;
que.push(e.to);
}
}
};
auto dfs = [&](auto self, int v, Cap up) {
if (v == s)
return up;
Cap res = 0;
int level_v = level[v];
for (int &i = iter[v]; i < int(g[v].size()); i++) {
_edge &e = g[v][i];
if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0)
continue;
Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));
if (d <= 0)
continue;
g[v][i].cap += d;
g[e.to][e.rev].cap -= d;
res += d;
if (res == up)
break;
}
return res;
};
Cap flow = 0;
while (flow < flow_limit) {
bfs();
if (level[t] == -1)
break;
std::fill(iter.begin(), iter.end(), 0);
while (flow < flow_limit) {
Cap f = dfs(dfs, t, flow_limit - flow);
if (!f)
break;
flow += f;
}
}
return flow;
}
std::vector<bool> min_cut(int s) {
std::vector<bool> visited(_n);
internal::simple_queue<int> que;
que.push(s);
while (!que.empty()) {
int p = que.front();
que.pop();
visited[p] = true;
for (auto e : g[p]) {
if (e.cap && !visited[e.to]) {
visited[e.to] = true;
que.push(e.to);
}
}
}
return visited;
}
private:
int _n;
struct _edge {
int to, rev;
Cap cap;
};
std::vector<std::pair<int, int>> pos;
std::vector<std::vector<_edge>> g;
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <limits>
#include <queue>
#include <vector>
namespace atcoder {
template <class Cap, class Cost> struct mcf_graph {
public:
mcf_graph() {}
mcf_graph(int n) : _n(n), g(n) {}
int add_edge(int from, int to, Cap cap, Cost cost) {
assert(0 <= from && from < _n);
assert(0 <= to && to < _n);
int m = int(pos.size());
pos.push_back({from, int(g[from].size())});
int from_id = int(g[from].size());
int to_id = int(g[to].size());
if (from == to)
to_id++;
g[from].push_back(_edge{to, to_id, cap, cost});
g[to].push_back(_edge{from, from_id, 0, -cost});
return m;
}
struct edge {
int from, to;
Cap cap, flow;
Cost cost;
};
edge get_edge(int i) {
int m = int(pos.size());
assert(0 <= i && i < m);
auto _e = g[pos[i].first][pos[i].second];
auto _re = g[_e.to][_e.rev];
return edge{
pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,
};
}
std::vector<edge> edges() {
int m = int(pos.size());
std::vector<edge> result(m);
for (int i = 0; i < m; i++) {
result[i] = get_edge(i);
}
return result;
}
std::pair<Cap, Cost> flow(int s, int t) {
return flow(s, t, std::numeric_limits<Cap>::max());
}
std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {
return slope(s, t, flow_limit).back();
}
std::vector<std::pair<Cap, Cost>> slope(int s, int t) {
return slope(s, t, std::numeric_limits<Cap>::max());
}
std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {
assert(0 <= s && s < _n);
assert(0 <= t && t < _n);
assert(s != t);
// variants (C = maxcost):
// -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0
// reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge
std::vector<Cost> dual(_n, 0), dist(_n);
std::vector<int> pv(_n), pe(_n);
std::vector<bool> vis(_n);
auto dual_ref = [&]() {
std::fill(dist.begin(), dist.end(), std::numeric_limits<Cost>::max());
std::fill(pv.begin(), pv.end(), -1);
std::fill(pe.begin(), pe.end(), -1);
std::fill(vis.begin(), vis.end(), false);
struct Q {
Cost key;
int to;
bool operator<(Q r) const { return key > r.key; }
};
std::priority_queue<Q> que;
dist[s] = 0;
que.push(Q{0, s});
while (!que.empty()) {
int v = que.top().to;
que.pop();
if (vis[v])
continue;
vis[v] = true;
if (v == t)
break;
// dist[v] = shortest(s, v) + dual[s] - dual[v]
// dist[v] >= 0 (all reduced cost are positive)
// dist[v] <= (n-1)C
for (int i = 0; i < int(g[v].size()); i++) {
auto e = g[v][i];
if (vis[e.to] || !e.cap)
continue;
// |-dual[e.to] + dual[v]| <= (n-1)C
// cost <= C - -(n-1)C + 0 = nC
Cost cost = e.cost - dual[e.to] + dual[v];
if (dist[e.to] - dist[v] > cost) {
dist[e.to] = dist[v] + cost;
pv[e.to] = v;
pe[e.to] = i;
que.push(Q{dist[e.to], e.to});
}
}
}
if (!vis[t]) {
return false;
}
for (int v = 0; v < _n; v++) {
if (!vis[v])
continue;
// dual[v] = dual[v] - dist[t] + dist[v]
// = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +
// (shortest(s, v) + dual[s] - dual[v]) = - shortest(s, t) +
// dual[t] + shortest(s, v) = shortest(s, v) - shortest(s, t) >=
// 0 - (n-1)C
dual[v] -= dist[t] - dist[v];
}
return true;
};
Cap flow = 0;
Cost cost = 0, prev_cost_per_flow = -1;
std::vector<std::pair<Cap, Cost>> result;
result.push_back({flow, cost});
while (flow < flow_limit) {
if (!dual_ref())
break;
Cap c = flow_limit - flow;
for (int v = t; v != s; v = pv[v]) {
c = std::min(c, g[pv[v]][pe[v]].cap);
}
for (int v = t; v != s; v = pv[v]) {
auto &e = g[pv[v]][pe[v]];
e.cap -= c;
g[v][e.rev].cap += c;
}
Cost d = -dual[s];
flow += c;
cost += c * d;
if (prev_cost_per_flow == d) {
result.pop_back();
}
result.push_back({flow, cost});
prev_cost_per_flow = d;
}
return result;
}
private:
int _n;
struct _edge {
int to, rev;
Cap cap;
Cost cost;
};
std::vector<std::pair<int, int>> pos;
std::vector<std::vector<_edge>> g;
};
} // namespace atcoder
#include <algorithm>
#include <algorithm>
#include <utility>
#include <vector>
namespace atcoder {
namespace internal {
template <class E> struct csr {
std::vector<int> start;
std::vector<E> elist;
csr(int n, const std::vector<std::pair<int, E>> &edges)
: start(n + 1), elist(edges.size()) {
for (auto e : edges) {
start[e.first + 1]++;
}
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
auto counter = start;
for (auto e : edges) {
elist[counter[e.first]++] = e.second;
}
}
};
// Reference:
// R. Tarjan,
// Depth-First Search and Linear Graph Algorithms
struct scc_graph {
public:
scc_graph(int n) : _n(n) {}
int num_vertices() { return _n; }
void add_edge(int from, int to) { edges.push_back({from, {to}}); }
// @return pair of (# of scc, scc id)
std::pair<int, std::vector<int>> scc_ids() {
auto g = csr<edge>(_n, edges);
int now_ord = 0, group_num = 0;
std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);
visited.reserve(_n);
auto dfs = [&](auto self, int v) -> void {
low[v] = ord[v] = now_ord++;
visited.push_back(v);
for (int i = g.start[v]; i < g.start[v + 1]; i++) {
auto to = g.elist[i].to;
if (ord[to] == -1) {
self(self, to);
low[v] = std::min(low[v], low[to]);
} else {
low[v] = std::min(low[v], ord[to]);
}
}
if (low[v] == ord[v]) {
while (true) {
int u = visited.back();
visited.pop_back();
ord[u] = _n;
ids[u] = group_num;
if (u == v)
break;
}
group_num++;
}
};
for (int i = 0; i < _n; i++) {
if (ord[i] == -1)
dfs(dfs, i);
}
for (auto &x : ids) {
x = group_num - 1 - x;
}
return {group_num, ids};
}
std::vector<std::vector<int>> scc() {
auto ids = scc_ids();
int group_num = ids.first;
std::vector<int> counts(group_num);
for (auto x : ids.second)
counts[x]++;
std::vector<std::vector<int>> groups(ids.first);
for (int i = 0; i < group_num; i++) {
groups[i].reserve(counts[i]);
}
for (int i = 0; i < _n; i++) {
groups[ids.second[i]].push_back(i);
}
return groups;
}
private:
int _n;
struct edge {
int to;
};
std::vector<std::pair<int, edge>> edges;
};
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <vector>
namespace atcoder {
struct scc_graph {
public:
scc_graph() : internal(0) {}
scc_graph(int n) : internal(n) {}
void add_edge(int from, int to) {
int n = internal.num_vertices();
assert(0 <= from && from < n);
assert(0 <= to && to < n);
internal.add_edge(from, to);
}
std::vector<std::vector<int>> scc() { return internal.scc(); }
private:
internal::scc_graph internal;
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <vector>
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
segtree() : segtree(0) {}
segtree(int n) : segtree(std::vector<S>(n, e())) {}
segtree(const std::vector<S> &v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
for (int i = 0; i < _n; i++)
d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
d[p] = x;
for (int i = 1; i <= log; i++)
update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
return d[p + size];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
S sml = e(), smr = e();
l += size;
r += size;
while (l < r) {
if (l & 1)
sml = op(sml, d[l++]);
if (r & 1)
smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
template <bool (*f)(S)> int max_right(int l) {
return max_right(l, [](S x) { return f(x); });
}
template <class F> int max_right(int l, F f) {
assert(0 <= l && l <= _n);
assert(f(e()));
if (l == _n)
return _n;
l += size;
S sm = e();
do {
while (l % 2 == 0)
l >>= 1;
if (!f(op(sm, d[l]))) {
while (l < size) {
l = (2 * l);
if (f(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*f)(S)> int min_left(int r) {
return min_left(r, [](S x) { return f(x); });
}
template <class F> int min_left(int r, F f) {
assert(0 <= r && r <= _n);
assert(f(e()));
if (r == 0)
return 0;
r += size;
S sm = e();
do {
r--;
while (r > 1 && (r % 2))
r >>= 1;
if (!f(op(d[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (f(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <numeric>
#include <string>
#include <vector>
namespace atcoder {
namespace internal {
std::vector<int> sa_naive(const std::vector<int> &s) {
int n = int(s.size());
std::vector<int> sa(n);
std::iota(sa.begin(), sa.end(), 0);
std::sort(sa.begin(), sa.end(), [&](int l, int r) {
if (l == r)
return false;
while (l < n && r < n) {
if (s[l] != s[r])
return s[l] < s[r];
l++;
r++;
}
return l == n;
});
return sa;
}
std::vector<int> sa_doubling(const std::vector<int> &s) {
int n = int(s.size());
std::vector<int> sa(n), rnk = s, tmp(n);
std::iota(sa.begin(), sa.end(), 0);
for (int k = 1; k < n; k *= 2) {
auto cmp = [&](int x, int y) {
if (rnk[x] != rnk[y])
return rnk[x] < rnk[y];
int rx = x + k < n ? rnk[x + k] : -1;
int ry = y + k < n ? rnk[y + k] : -1;
return rx < ry;
};
std::sort(sa.begin(), sa.end(), cmp);
tmp[sa[0]] = 0;
for (int i = 1; i < n; i++) {
tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);
}
std::swap(tmp, rnk);
}
return sa;
}
// SA-IS, linear-time suffix array construction
// Reference:
// G. Nong, S. Zhang, and W. H. Chan,
// Two Efficient Algorithms for Linear Time Suffix Array Construction
template <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>
std::vector<int> sa_is(const std::vector<int> &s, int upper) {
int n = int(s.size());
if (n == 0)
return {};
if (n == 1)
return {0};
if (n == 2) {
if (s[0] < s[1]) {
return {0, 1};
} else {
return {1, 0};
}
}
if (n < THRESHOLD_NAIVE) {
return sa_naive(s);
}
if (n < THRESHOLD_DOUBLING) {
return sa_doubling(s);
}
std::vector<int> sa(n);
std::vector<bool> ls(n);
for (int i = n - 2; i >= 0; i--) {
ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);
}
std::vector<int> sum_l(upper + 1), sum_s(upper + 1);
for (int i = 0; i < n; i++) {
if (!ls[i]) {
sum_s[s[i]]++;
} else {
sum_l[s[i] + 1]++;
}
}
for (int i = 0; i <= upper; i++) {
sum_s[i] += sum_l[i];
if (i < upper)
sum_l[i + 1] += sum_s[i];
}
auto induce = [&](const std::vector<int> &lms) {
std::fill(sa.begin(), sa.end(), -1);
std::vector<int> buf(upper + 1);
std::copy(sum_s.begin(), sum_s.end(), buf.begin());
for (auto d : lms) {
if (d == n)
continue;
sa[buf[s[d]]++] = d;
}
std::copy(sum_l.begin(), sum_l.end(), buf.begin());
sa[buf[s[n - 1]]++] = n - 1;
for (int i = 0; i < n; i++) {
int v = sa[i];
if (v >= 1 && !ls[v - 1]) {
sa[buf[s[v - 1]]++] = v - 1;
}
}
std::copy(sum_l.begin(), sum_l.end(), buf.begin());
for (int i = n - 1; i >= 0; i--) {
int v = sa[i];
if (v >= 1 && ls[v - 1]) {
sa[--buf[s[v - 1] + 1]] = v - 1;
}
}
};
std::vector<int> lms_map(n + 1, -1);
int m = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms_map[i] = m++;
}
}
std::vector<int> lms;
lms.reserve(m);
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms.push_back(i);
}
}
induce(lms);
if (m) {
std::vector<int> sorted_lms;
sorted_lms.reserve(m);
for (int v : sa) {
if (lms_map[v] != -1)
sorted_lms.push_back(v);
}
std::vector<int> rec_s(m);
int rec_upper = 0;
rec_s[lms_map[sorted_lms[0]]] = 0;
for (int i = 1; i < m; i++) {
int l = sorted_lms[i - 1], r = sorted_lms[i];
int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;
int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;
bool same = true;
if (end_l - l != end_r - r) {
same = false;
} else {
while (l < end_l) {
if (s[l] != s[r]) {
break;
}
l++;
r++;
}
if (l == n || s[l] != s[r])
same = false;
}
if (!same)
rec_upper++;
rec_s[lms_map[sorted_lms[i]]] = rec_upper;
}
auto rec_sa = sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);
for (int i = 0; i < m; i++) {
sorted_lms[i] = lms[rec_sa[i]];
}
induce(sorted_lms);
}
return sa;
}
} // namespace internal
std::vector<int> suffix_array(const std::vector<int> &s, int upper) {
assert(0 <= upper);
for (int d : s) {
assert(0 <= d && d <= upper);
}
auto sa = internal::sa_is(s, upper);
return sa;
}
template <class T> std::vector<int> suffix_array(const std::vector<T> &s) {
int n = int(s.size());
std::vector<int> idx(n);
iota(idx.begin(), idx.end(), 0);
sort(idx.begin(), idx.end(), [&](int l, int r) { return s[l] < s[r]; });
std::vector<int> s2(n);
int now = 0;
for (int i = 0; i < n; i++) {
if (i && s[idx[i - 1]] != s[idx[i]])
now++;
s2[idx[i]] = now;
}
return internal::sa_is(s2, now);
}
std::vector<int> suffix_array(const std::string &s) {
int n = int(s.size());
std::vector<int> s2(n);
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return internal::sa_is(s2, 255);
}
// Reference:
// T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park,
// Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its
// Applications
template <class T>
std::vector<int> lcp_array(const std::vector<T> &s,
const std::vector<int> &sa) {
int n = int(s.size());
assert(n >= 1);
std::vector<int> rnk(n);
for (int i = 0; i < n; i++) {
rnk[sa[i]] = i;
}
std::vector<int> lcp(n - 1);
int h = 0;
for (int i = 0; i < n; i++) {
if (h > 0)
h--;
if (rnk[i] == 0)
continue;
int j = sa[rnk[i] - 1];
for (; j + h < n && i + h < n; h++) {
if (s[j + h] != s[i + h])
break;
}
lcp[rnk[i] - 1] = h;
}
return lcp;
}
std::vector<int> lcp_array(const std::string &s, const std::vector<int> &sa) {
int n = int(s.size());
std::vector<int> s2(n);
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return lcp_array(s2, sa);
}
// Reference:
// D. Gusfield,
// Algorithms on Strings, Trees, and Sequences: Computer Science and
// Computational Biology
template <class T> std::vector<int> z_algorithm(const std::vector<T> &s) {
int n = int(s.size());
if (n == 0)
return {};
std::vector<int> z(n);
z[0] = 0;
for (int i = 1, j = 0; i < n; i++) {
int &k = z[i];
k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k])
k++;
if (j + z[j] < i + z[i])
j = i;
}
z[0] = n;
return z;
}
std::vector<int> z_algorithm(const std::string &s) {
int n = int(s.size());
std::vector<int> s2(n);
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return z_algorithm(s2);
}
} // namespace atcoder
#include <cassert>
#include <vector>
namespace atcoder {
// Reference:
// B. Aspvall, M. Plass, and R. Tarjan,
// A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean
// Formulas
struct two_sat {
public:
two_sat() : _n(0), scc(0) {}
two_sat(int n) : _n(n), _answer(n), scc(2 * n) {}
void add_clause(int i, bool f, int j, bool g) {
assert(0 <= i && i < _n);
assert(0 <= j && j < _n);
scc.add_edge(2 * i + (f ? 0 : 1), 2 * j + (g ? 1 : 0));
scc.add_edge(2 * j + (g ? 0 : 1), 2 * i + (f ? 1 : 0));
}
bool satisfiable() {
auto id = scc.scc_ids().second;
for (int i = 0; i < _n; i++) {
if (id[2 * i] == id[2 * i + 1])
return false;
_answer[i] = id[2 * i] < id[2 * i + 1];
}
return true;
}
std::vector<bool> answer() { return _answer; }
private:
int _n;
std::vector<bool> _answer;
internal::scc_graph scc;
};
} // namespace atcoder
using namespace std;
using namespace atcoder;
typedef long long ll;
/*
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
void Add(ll &pos,ll val){pos=mod(pos+val);}
void mod_print(ll k){
ll P=50000;
rep(y,1,P){
ll x=mod(y*k);
if(abs(x)<=P||x+P>=i_7){
if(x+P>=i_7){
x-=i_7;
}
cout<<x<<"/"<<y<<endl;
//cout<<setprecision(5)<<(dd)x/(dd)y;
return;
}
}
cout<<"nun"<<endl;
}
*/
/*
#include "boost/multiprecision/cpp_dec_float.hpp"
#include "boost/multiprecision/cpp_int.hpp"
namespace mp = boost::multiprecision;
typedef mp::cpp_int LL;
typedef mp::number<mp::cpp_dec_float<1024>> DD;//
仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)
*/
typedef long double dd;
typedef pair<ll, ll> l_l;
typedef pair<dd, dd> d_d;
ll inf = (ll)1E16;
#define rep(i, l, r) for (ll i = l; i <= r; i++)
#define rrep(i, r, l) for (ll i = r; i >= l; i--)
#define pb push_back
ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
void Max(ll &pos, ll val) { pos = max(pos, val); } // Max(dp[n],dp[n-1]);
void Min(ll &pos, ll val) { pos = min(pos, val); }
dd EPS = 1E-12;
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fi first
#define se second
#define SORT(v) sort(v.begin(), v.end())
#define ERASE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define POSL(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define POSU(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
template <class T, class S> inline bool chmax(T &a, S b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class S> inline bool chmin(T &a, S b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define endl \
"\n" // インタラクティブで消す！！！！！！！！！！！！！！！！！！！！！
#define all(c) c.begin(), c.end()
typedef vector<ll> vl;
// using mint = modint998244353;
using mint = modint1000000007;
// using mint=modint;
// using mint=static_modint<100>;
typedef vector<mint> vi;
//////////////////////////
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
#define M 4050
// #define M 40
ll mp[M][M];
int main() {
fastio ll n, m;
cin >> n >> m;
ll a[n][3];
ll b[m][3];
vl cx, cy;
rep(i, 0, n - 1) rep(j, 0, 2) {
cin >> a[i][j];
if (j <= 1) {
cx.pb(a[i][j]);
} else {
cy.pb(a[i][j]);
}
}
rep(i, 0, m - 1) rep(j, 0, 2) {
cin >> b[i][j];
if (j <= 0) {
cx.pb(b[i][j]);
} else {
cy.pb(b[i][j]);
}
}
cx.pb(0);
cy.pb(0);
SORT(cx);
ERASE(cx);
SORT(cy);
ERASE(cy);
ll sx = 0, sy = 0;
sx = 2 * POSL(cx, sx);
sy = 2 * POSL(cy, sy);
ll mx = sx, my = sy;
rep(i, 0, n - 1) rep(j, 0, 2) {
if (j <= 1) {
a[i][j] = 2 * POSL(cx, a[i][j]);
chmax(mx, a[i][j]);
} else {
a[i][j] = 2 * POSL(cy, a[i][j]);
chmax(my, a[i][j]);
}
}
rep(i, 0, m - 1) rep(j, 0, 2) {
if (j <= 0) {
b[i][j] = 2 * POSL(cx, b[i][j]);
chmax(mx, b[i][j]);
} else {
b[i][j] = 2 * POSL(cy, b[i][j]);
chmax(my, b[i][j]);
}
}
/*
rep(i,0,n-1){
rep(j,0,2)cout<<a[i][j]<<" ";cout<<endl;
}cout<<endl;
rep(i,0,m-1){
rep(j,0,2)cout<<b[i][j]<<" ";cout<<endl;
}cout<<endl;
cout<<sx<<" "<<sy<<endl;
cout<<mx<<" "<<my<<endl;
*/
rep(i, 0, n - 1) {
rep(x, a[i][0], a[i][1]) { mp[a[i][2]][x] = 1; }
}
rep(i, 0, m - 1) {
rep(y, b[i][1], b[i][2]) { mp[y][b[i][0]] = 1; }
}
mp[sy][sx] = 2;
queue<l_l> q;
q.push({sy, sx});
while (!q.empty()) {
l_l t = q.front();
q.pop();
rep(z, 0, 3) {
ll nx = t.se + dx[z];
ll ny = t.fi + dy[z];
if (nx < 0 || nx > mx || ny < 0 || ny > my) {
/*rep(i,0,my){
rep(j,0,mx){
if(mp[i][j]==2){
cout<<"S";
}else if(mp[i][j]==0){
cout<<".";
}else{
cout<<"#";
}
}cout<<endl;
}*/
cout << "INF" << endl;
return 0;
}
if (mp[ny][nx] == 0) {
mp[ny][nx] = 2;
q.push({ny, nx});
}
}
}
/*
rep(i,0,my){
rep(j,0,mx){
if(mp[i][j]==2){
cout<<"S";
}else if(mp[i][j]==0){
cout<<".";
}else{
cout<<"#";
}
}cout<<endl;
}*/
ll ans = 0;
rep(i, 0, my) {
rep(j, 0, mx) {
if (i % 2 == 0 || j % 2 == 0)
continue;
if (mp[i][j] != 2)
continue;
ll pi = i / 2, pj = j / 2;
ll add = (cy[pi + 1] - cy[pi]) * (cx[pj + 1] - cx[pj]);
// cout<<i<<" "<<j<<" "<<add<<endl;
ans += add;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
// #include "bits/stdc++.h"
#include <algorithm>
#include <array>
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n))
x++;
return x;
}
// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
} // namespace internal
} // namespace atcoder
#include <utility>
namespace atcoder {
namespace internal {
// @param m `1 <= m`
// @return x mod m
constexpr long long safe_mod(long long x, long long m) {
x %= m;
if (x < 0)
x += m;
return x;
}
// Fast modular multiplication by barrett reduction
// Reference: https://en.wikipedia.org/wiki/Barrett_reduction
// NOTE: reconsider after Ice Lake
struct barrett {
unsigned int _m;
unsigned long long im;
// @param m `1 <= m < 2^31`
barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}
// @return m
unsigned int umod() const { return _m; }
// @param a `0 <= a < m`
// @param b `0 <= b < m`
// @return `a * b % m`
unsigned int mul(unsigned int a, unsigned int b) const {
// [1] m = 1
// a = b = im = 0, so okay
// [2] m >= 2
// im = ceil(2^64 / m)
// -> im * m = 2^64 + r (0 <= r < m)
// let z = a*b = c*m + d (0 <= c, d < m)
// a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im
// c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) <
// 2^64 * 2
// ((ab * im) >> 64) == c or c + 1
unsigned long long z = a;
z *= b;
#ifdef _MSC_VER
unsigned long long x;
_umul128(z, im, &x);
#else
unsigned long long x =
(unsigned long long)(((unsigned __int128)(z)*im) >> 64);
#endif
unsigned int v = (unsigned int)(z - x * _m);
if (_m <= v)
v += _m;
return v;
}
};
// @param n `0 <= n`
// @param m `1 <= m`
// @return `(x ** n) % m`
constexpr long long pow_mod_constexpr(long long x, long long n, int m) {
if (m == 1)
return 0;
unsigned int _m = (unsigned int)(m);
unsigned long long r = 1;
unsigned long long y = safe_mod(x, m);
while (n) {
if (n & 1)
r = (r * y) % _m;
y = (y * y) % _m;
n >>= 1;
}
return r;
}
// Reference:
// M. Forisek and J. Jancina,
// Fast Primality Testing for Integers That Fit into a Machine Word
// @param n `0 <= n`
constexpr bool is_prime_constexpr(int n) {
if (n <= 1)
return false;
if (n == 2 || n == 7 || n == 61)
return true;
if (n % 2 == 0)
return false;
long long d = n - 1;
while (d % 2 == 0)
d /= 2;
constexpr long long bases[3] = {2, 7, 61};
for (long long a : bases) {
long long t = d;
long long y = pow_mod_constexpr(a, t, n);
while (t != n - 1 && y != 1 && y != n - 1) {
y = y * y % n;
t <<= 1;
}
if (y != n - 1 && t % 2 == 0) {
return false;
}
}
return true;
}
template <int n> constexpr bool is_prime = is_prime_constexpr(n);
// @param b `1 <= b`
// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g
constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {
a = safe_mod(a, b);
if (a == 0)
return {b, 0};
// Contracts:
// [1] s - m0 * a = 0 (mod b)
// [2] t - m1 * a = 0 (mod b)
// [3] s * |m1| + t * |m0| <= b
long long s = b, t = a;
long long m0 = 0, m1 = 1;
while (t) {
long long u = s / t;
s -= t * u;
m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b
// [3]:
// (s - t * u) * |m1| + t * |m0 - m1 * u|
// <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)
// = s * |m1| + t * |m0| <= b
auto tmp = s;
s = t;
t = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
// by [3]: |m0| <= b/g
// by g != b: |m0| < b/g
if (m0 < 0)
m0 += b / s;
return {s, m0};
}
// Compile time primitive root
// @param m must be prime
// @return primitive root (and minimum in now)
constexpr int primitive_root_constexpr(int m) {
if (m == 2)
return 1;
if (m == 167772161)
return 3;
if (m == 469762049)
return 3;
if (m == 754974721)
return 11;
if (m == 998244353)
return 3;
int divs[20] = {};
divs[0] = 2;
int cnt = 1;
int x = (m - 1) / 2;
while (x % 2 == 0)
x /= 2;
for (int i = 3; (long long)(i)*i <= x; i += 2) {
if (x % i == 0) {
divs[cnt++] = i;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1) {
divs[cnt++] = x;
}
for (int g = 2;; g++) {
bool ok = true;
for (int i = 0; i < cnt; i++) {
if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {
ok = false;
break;
}
}
if (ok)
return g;
}
}
template <int m> constexpr int primitive_root = primitive_root_constexpr(m);
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <numeric>
#include <type_traits>
namespace atcoder {
namespace internal {
#ifndef _MSC_VER
template <class T>
using is_signed_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value ||
std::is_same<T, __int128>::value,
std::true_type, std::false_type>::type;
template <class T>
using is_unsigned_int128 =
typename std::conditional<std::is_same<T, __uint128_t>::value ||
std::is_same<T, unsigned __int128>::value,
std::true_type, std::false_type>::type;
template <class T>
using make_unsigned_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t,
unsigned __int128>;
template <class T>
using is_integral =
typename std::conditional<std::is_integral<T>::value ||
is_signed_int128<T>::value ||
is_unsigned_int128<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using is_signed_int =
typename std::conditional<(is_integral<T>::value &&
std::is_signed<T>::value) ||
is_signed_int128<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<(is_integral<T>::value &&
std::is_unsigned<T>::value) ||
is_unsigned_int128<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<
is_signed_int128<T>::value, make_unsigned_int128<T>,
typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>,
std::common_type<T>>::type>::type;
#else
template <class T> using is_integral = typename std::is_integral<T>;
template <class T>
using is_signed_int =
typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<is_integral<T>::value &&
std::is_unsigned<T>::value,
std::true_type, std::false_type>::type;
template <class T>
using to_unsigned =
typename std::conditional<is_signed_int<T>::value, std::make_unsigned<T>,
std::common_type<T>>::type;
#endif
template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;
template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;
template <class T> using to_unsigned_t = typename to_unsigned<T>::type;
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <numeric>
#include <type_traits>
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
struct modint_base {};
struct static_modint_base : modint_base {};
template <class T> using is_modint = std::is_base_of<modint_base, T>;
template <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;
} // namespace internal
template <int m, std::enable_if_t<(1 <= m)> * = nullptr>
struct static_modint : internal::static_modint_base {
using mint = static_modint;
public:
static constexpr int mod() { return m; }
static mint raw(int v) {
mint x;
x._v = v;
return x;
}
static_modint() : _v(0) {}
template <class T, internal::is_signed_int_t<T> * = nullptr>
static_modint(T v) {
long long x = (long long)(v % (long long)(umod()));
if (x < 0)
x += umod();
_v = (unsigned int)(x);
}
template <class T, internal::is_unsigned_int_t<T> * = nullptr>
static_modint(T v) {
_v = (unsigned int)(v % umod());
}
static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }
unsigned int val() const { return _v; }
mint &operator++() {
_v++;
if (_v == umod())
_v = 0;
return *this;
}
mint &operator--() {
if (_v == 0)
_v = umod();
_v--;
return *this;
}
mint operator++(int) {
mint result = *this;
++*this;
return result;
}
mint operator--(int) {
mint result = *this;
--*this;
return result;
}
mint &operator+=(const mint &rhs) {
_v += rhs._v;
if (_v >= umod())
_v -= umod();
return *this;
}
mint &operator-=(const mint &rhs) {
_v -= rhs._v;
if (_v >= umod())
_v += umod();
return *this;
}
mint &operator*=(const mint &rhs) {
unsigned long long z = _v;
z *= rhs._v;
_v = (unsigned int)(z % umod());
return *this;
}
mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }
mint operator+() const { return *this; }
mint operator-() const { return mint() - *this; }
mint pow(long long n) const {
assert(0 <= n);
mint x = *this, r = 1;
while (n) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
mint inv() const {
if (prime) {
assert(_v);
return pow(umod() - 2);
} else {
auto eg = internal::inv_gcd(_v, m);
assert(eg.first == 1);
return eg.second;
}
}
friend mint operator+(const mint &lhs, const mint &rhs) {
return mint(lhs) += rhs;
}
friend mint operator-(const mint &lhs, const mint &rhs) {
return mint(lhs) -= rhs;
}
friend mint operator*(const mint &lhs, const mint &rhs) {
return mint(lhs) *= rhs;
}
friend mint operator/(const mint &lhs, const mint &rhs) {
return mint(lhs) /= rhs;
}
friend bool operator==(const mint &lhs, const mint &rhs) {
return lhs._v == rhs._v;
}
friend bool operator!=(const mint &lhs, const mint &rhs) {
return lhs._v != rhs._v;
}
private:
unsigned int _v;
static constexpr unsigned int umod() { return m; }
static constexpr bool prime = internal::is_prime<m>;
};
template <int id> struct dynamic_modint : internal::modint_base {
using mint = dynamic_modint;
public:
static int mod() { return (int)(bt.umod()); }
static void set_mod(int m) {
assert(1 <= m);
bt = internal::barrett(m);
}
static mint raw(int v) {
mint x;
x._v = v;
return x;
}
dynamic_modint() : _v(0) {}
template <class T, internal::is_signed_int_t<T> * = nullptr>
dynamic_modint(T v) {
long long x = (long long)(v % (long long)(mod()));
if (x < 0)
x += mod();
_v = (unsigned int)(x);
}
template <class T, internal::is_unsigned_int_t<T> * = nullptr>
dynamic_modint(T v) {
_v = (unsigned int)(v % mod());
}
dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }
unsigned int val() const { return _v; }
mint &operator++() {
_v++;
if (_v == umod())
_v = 0;
return *this;
}
mint &operator--() {
if (_v == 0)
_v = umod();
_v--;
return *this;
}
mint operator++(int) {
mint result = *this;
++*this;
return result;
}
mint operator--(int) {
mint result = *this;
--*this;
return result;
}
mint &operator+=(const mint &rhs) {
_v += rhs._v;
if (_v >= umod())
_v -= umod();
return *this;
}
mint &operator-=(const mint &rhs) {
_v += mod() - rhs._v;
if (_v >= umod())
_v -= umod();
return *this;
}
mint &operator*=(const mint &rhs) {
_v = bt.mul(_v, rhs._v);
return *this;
}
mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }
mint operator+() const { return *this; }
mint operator-() const { return mint() - *this; }
mint pow(long long n) const {
assert(0 <= n);
mint x = *this, r = 1;
while (n) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
mint inv() const {
auto eg = internal::inv_gcd(_v, mod());
assert(eg.first == 1);
return eg.second;
}
friend mint operator+(const mint &lhs, const mint &rhs) {
return mint(lhs) += rhs;
}
friend mint operator-(const mint &lhs, const mint &rhs) {
return mint(lhs) -= rhs;
}
friend mint operator*(const mint &lhs, const mint &rhs) {
return mint(lhs) *= rhs;
}
friend mint operator/(const mint &lhs, const mint &rhs) {
return mint(lhs) /= rhs;
}
friend bool operator==(const mint &lhs, const mint &rhs) {
return lhs._v == rhs._v;
}
friend bool operator!=(const mint &lhs, const mint &rhs) {
return lhs._v != rhs._v;
}
private:
unsigned int _v;
static internal::barrett bt;
static unsigned int umod() { return bt.umod(); }
};
template <int id> internal::barrett dynamic_modint<id>::bt = 998244353;
using modint998244353 = static_modint<998244353>;
using modint1000000007 = static_modint<1000000007>;
using modint = dynamic_modint<-1>;
namespace internal {
template <class T>
using is_static_modint = std::is_base_of<internal::static_modint_base, T>;
template <class T>
using is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;
template <class> struct is_dynamic_modint : public std::false_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};
template <class T>
using is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <type_traits>
#include <vector>
namespace atcoder {
namespace internal {
template <class mint, internal::is_static_modint_t<mint> * = nullptr>
void butterfly(std::vector<mint> &a) {
static constexpr int g = internal::primitive_root<mint::mod()>;
int n = int(a.size());
int h = internal::ceil_pow2(n);
static bool first = true;
static mint sum_e[30]; // sum_e[i] = ies[0] * ... * ies[i - 1] * es[i]
if (first) {
first = false;
mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1
int cnt2 = bsf(mint::mod() - 1);
mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();
for (int i = cnt2; i >= 2; i--) {
// e^(2^i) == 1
es[i - 2] = e;
ies[i - 2] = ie;
e *= e;
ie *= ie;
}
mint now = 1;
for (int i = 0; i <= cnt2 - 2; i++) {
sum_e[i] = es[i] * now;
now *= ies[i];
}
}
for (int ph = 1; ph <= h; ph++) {
int w = 1 << (ph - 1), p = 1 << (h - ph);
mint now = 1;
for (int s = 0; s < w; s++) {
int offset = s << (h - ph + 1);
for (int i = 0; i < p; i++) {
auto l = a[i + offset];
auto r = a[i + offset + p] * now;
a[i + offset] = l + r;
a[i + offset + p] = l - r;
}
now *= sum_e[bsf(~(unsigned int)(s))];
}
}
}
template <class mint, internal::is_static_modint_t<mint> * = nullptr>
void butterfly_inv(std::vector<mint> &a) {
static constexpr int g = internal::primitive_root<mint::mod()>;
int n = int(a.size());
int h = internal::ceil_pow2(n);
static bool first = true;
static mint sum_ie[30]; // sum_ie[i] = es[0] * ... * es[i - 1] * ies[i]
if (first) {
first = false;
mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1
int cnt2 = bsf(mint::mod() - 1);
mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();
for (int i = cnt2; i >= 2; i--) {
// e^(2^i) == 1
es[i - 2] = e;
ies[i - 2] = ie;
e *= e;
ie *= ie;
}
mint now = 1;
for (int i = 0; i <= cnt2 - 2; i++) {
sum_ie[i] = ies[i] * now;
now *= es[i];
}
}
for (int ph = h; ph >= 1; ph--) {
int w = 1 << (ph - 1), p = 1 << (h - ph);
mint inow = 1;
for (int s = 0; s < w; s++) {
int offset = s << (h - ph + 1);
for (int i = 0; i < p; i++) {
auto l = a[i + offset];
auto r = a[i + offset + p];
a[i + offset] = l + r;
a[i + offset + p] =
(unsigned long long)(mint::mod() + l.val() - r.val()) * inow.val();
}
inow *= sum_ie[bsf(~(unsigned int)(s))];
}
}
}
} // namespace internal
template <class mint, internal::is_static_modint_t<mint> * = nullptr>
std::vector<mint> convolution(std::vector<mint> a, std::vector<mint> b) {
int n = int(a.size()), m = int(b.size());
if (!n || !m)
return {};
if (std::min(n, m) <= 60) {
if (n < m) {
std::swap(n, m);
std::swap(a, b);
}
std::vector<mint> ans(n + m - 1);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ans[i + j] += a[i] * b[j];
}
}
return ans;
}
int z = 1 << internal::ceil_pow2(n + m - 1);
a.resize(z);
internal::butterfly(a);
b.resize(z);
internal::butterfly(b);
for (int i = 0; i < z; i++) {
a[i] *= b[i];
}
internal::butterfly_inv(a);
a.resize(n + m - 1);
mint iz = mint(z).inv();
for (int i = 0; i < n + m - 1; i++)
a[i] *= iz;
return a;
}
template <unsigned int mod = 998244353, class T,
std::enable_if_t<internal::is_integral<T>::value> * = nullptr>
std::vector<T> convolution(const std::vector<T> &a, const std::vector<T> &b) {
int n = int(a.size()), m = int(b.size());
if (!n || !m)
return {};
using mint = static_modint<mod>;
std::vector<mint> a2(n), b2(m);
for (int i = 0; i < n; i++) {
a2[i] = mint(a[i]);
}
for (int i = 0; i < m; i++) {
b2[i] = mint(b[i]);
}
auto c2 = convolution(move(a2), move(b2));
std::vector<T> c(n + m - 1);
for (int i = 0; i < n + m - 1; i++) {
c[i] = c2[i].val();
}
return c;
}
std::vector<long long> convolution_ll(const std::vector<long long> &a,
const std::vector<long long> &b) {
int n = int(a.size()), m = int(b.size());
if (!n || !m)
return {};
static constexpr unsigned long long MOD1 = 754974721; // 2^24
static constexpr unsigned long long MOD2 = 167772161; // 2^25
static constexpr unsigned long long MOD3 = 469762049; // 2^26
static constexpr unsigned long long M2M3 = MOD2 * MOD3;
static constexpr unsigned long long M1M3 = MOD1 * MOD3;
static constexpr unsigned long long M1M2 = MOD1 * MOD2;
static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;
static constexpr unsigned long long i1 =
internal::inv_gcd(MOD2 * MOD3, MOD1).second;
static constexpr unsigned long long i2 =
internal::inv_gcd(MOD1 * MOD3, MOD2).second;
static constexpr unsigned long long i3 =
internal::inv_gcd(MOD1 * MOD2, MOD3).second;
auto c1 = convolution<MOD1>(a, b);
auto c2 = convolution<MOD2>(a, b);
auto c3 = convolution<MOD3>(a, b);
std::vector<long long> c(n + m - 1);
for (int i = 0; i < n + m - 1; i++) {
unsigned long long x = 0;
x += (c1[i] * i1) % MOD1 * M2M3;
x += (c2[i] * i2) % MOD2 * M1M3;
x += (c3[i] * i3) % MOD3 * M1M2;
// B = 2^63, -B <= x, r(real value) < B
// (x, x - M, x - 2M, or x - 3M) = r (mod 2B)
// r = c1[i] (mod MOD1)
// focus on MOD1
// r = x, x - M', x - 2M', x - 3M' (M' = M % 2^64) (mod 2B)
// r = x,
// x - M' + (0 or 2B),
// x - 2M' + (0, 2B or 4B),
// x - 3M' + (0, 2B, 4B or 6B) (without mod!)
// (r - x) = 0, (0)
// - M' + (0 or 2B), (1)
// -2M' + (0 or 2B or 4B), (2)
// -3M' + (0 or 2B or 4B or 6B) (3) (mod MOD1)
// we checked that
// ((1) mod MOD1) mod 5 = 2
// ((2) mod MOD1) mod 5 = 3
// ((3) mod MOD1) mod 5 = 4
long long diff =
c1[i] - internal::safe_mod((long long)(x), (long long)(MOD1));
if (diff < 0)
diff += MOD1;
static constexpr unsigned long long offset[5] = {0, 0, M1M2M3, 2 * M1M2M3,
3 * M1M2M3};
x -= offset[diff % 5];
c[i] = x;
}
return c;
}
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <vector>
namespace atcoder {
// Implement (union by size) + (path compression)
// Reference:
// Zvi Galil and Giuseppe F. Italiano,
// Data structures and algorithms for disjoint set union problems
struct dsu {
public:
dsu() : _n(0) {}
dsu(int n) : _n(n), parent_or_size(n, -1) {}
int merge(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
int x = leader(a), y = leader(b);
if (x == y)
return x;
if (-parent_or_size[x] < -parent_or_size[y])
std::swap(x, y);
parent_or_size[x] += parent_or_size[y];
parent_or_size[y] = x;
return x;
}
bool same(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
return leader(a) == leader(b);
}
int leader(int a) {
assert(0 <= a && a < _n);
if (parent_or_size[a] < 0)
return a;
return parent_or_size[a] = leader(parent_or_size[a]);
}
int size(int a) {
assert(0 <= a && a < _n);
return -parent_or_size[leader(a)];
}
std::vector<std::vector<int>> groups() {
std::vector<int> leader_buf(_n), group_size(_n);
for (int i = 0; i < _n; i++) {
leader_buf[i] = leader(i);
group_size[leader_buf[i]]++;
}
std::vector<std::vector<int>> result(_n);
for (int i = 0; i < _n; i++) {
result[i].reserve(group_size[i]);
}
for (int i = 0; i < _n; i++) {
result[leader_buf[i]].push_back(i);
}
result.erase(
std::remove_if(result.begin(), result.end(),
[&](const std::vector<int> &v) { return v.empty(); }),
result.end());
return result;
}
private:
int _n;
// root node: -1 * component size
// otherwise: parent
std::vector<int> parent_or_size;
};
} // namespace atcoder
#include <cassert>
#include <vector>
namespace atcoder {
// Reference: https://en.wikipedia.org/wiki/Fenwick_tree
template <class T> struct fenwick_tree {
using U = internal::to_unsigned_t<T>;
public:
fenwick_tree() : _n(0) {}
fenwick_tree(int n) : _n(n), data(n) {}
void add(int p, T x) {
assert(0 <= p && p < _n);
p++;
while (p <= _n) {
data[p - 1] += U(x);
p += p & -p;
}
}
T sum(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
return sum(r) - sum(l);
}
private:
int _n;
std::vector<U> data;
U sum(int r) {
U s = 0;
while (r > 0) {
s += data[r - 1];
r -= r & -r;
}
return s;
}
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),
F (*composition)(F, F), F (*id)()>
struct lazy_segtree {
public:
lazy_segtree() : lazy_segtree(0) {}
lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
lazy_segtree(const std::vector<S> &v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
lz = std::vector<F>(size, id());
for (int i = 0; i < _n; i++)
d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
d[p] = x;
for (int i = 1; i <= log; i++)
update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
return d[p];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
if (l == r)
return e();
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l)
push(l >> i);
if (((r >> i) << i) != r)
push(r >> i);
}
S sml = e(), smr = e();
while (l < r) {
if (l & 1)
sml = op(sml, d[l++]);
if (r & 1)
smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
void apply(int p, F f) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
d[p] = mapping(f, d[p]);
for (int i = 1; i <= log; i++)
update(p >> i);
}
void apply(int l, int r, F f) {
assert(0 <= l && l <= r && r <= _n);
if (l == r)
return;
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l)
push(l >> i);
if (((r >> i) << i) != r)
push((r - 1) >> i);
}
{
int l2 = l, r2 = r;
while (l < r) {
if (l & 1)
all_apply(l++, f);
if (r & 1)
all_apply(--r, f);
l >>= 1;
r >>= 1;
}
l = l2;
r = r2;
}
for (int i = 1; i <= log; i++) {
if (((l >> i) << i) != l)
update(l >> i);
if (((r >> i) << i) != r)
update((r - 1) >> i);
}
}
template <bool (*g)(S)> int max_right(int l) {
return max_right(l, [](S x) { return g(x); });
}
template <class G> int max_right(int l, G g) {
assert(0 <= l && l <= _n);
assert(g(e()));
if (l == _n)
return _n;
l += size;
for (int i = log; i >= 1; i--)
push(l >> i);
S sm = e();
do {
while (l % 2 == 0)
l >>= 1;
if (!g(op(sm, d[l]))) {
while (l < size) {
push(l);
l = (2 * l);
if (g(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*g)(S)> int min_left(int r) {
return min_left(r, [](S x) { return g(x); });
}
template <class G> int min_left(int r, G g) {
assert(0 <= r && r <= _n);
assert(g(e()));
if (r == 0)
return 0;
r += size;
for (int i = log; i >= 1; i--)
push((r - 1) >> i);
S sm = e();
do {
r--;
while (r > 1 && (r % 2))
r >>= 1;
if (!g(op(d[r], sm))) {
while (r < size) {
push(r);
r = (2 * r + 1);
if (g(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
std::vector<F> lz;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
void all_apply(int k, F f) {
d[k] = mapping(f, d[k]);
if (k < size)
lz[k] = composition(f, lz[k]);
}
void push(int k) {
all_apply(2 * k, lz[k]);
all_apply(2 * k + 1, lz[k]);
lz[k] = id();
}
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <tuple>
#include <vector>
namespace atcoder {
long long pow_mod(long long x, long long n, int m) {
assert(0 <= n && 1 <= m);
if (m == 1)
return 0;
internal::barrett bt((unsigned int)(m));
unsigned int r = 1, y = (unsigned int)(internal::safe_mod(x, m));
while (n) {
if (n & 1)
r = bt.mul(r, y);
y = bt.mul(y, y);
n >>= 1;
}
return r;
}
long long inv_mod(long long x, long long m) {
assert(1 <= m);
auto z = internal::inv_gcd(x, m);
assert(z.first == 1);
return z.second;
}
// (rem, mod)
std::pair<long long, long long> crt(const std::vector<long long> &r,
const std::vector<long long> &m) {
assert(r.size() == m.size());
int n = int(r.size());
// Contracts: 0 <= r0 < m0
long long r0 = 0, m0 = 1;
for (int i = 0; i < n; i++) {
assert(1 <= m[i]);
long long r1 = internal::safe_mod(r[i], m[i]), m1 = m[i];
if (m0 < m1) {
std::swap(r0, r1);
std::swap(m0, m1);
}
if (m0 % m1 == 0) {
if (r0 % m1 != r1)
return {0, 0};
continue;
}
// assume: m0 > m1, lcm(m0, m1) >= 2 * max(m0, m1)
// (r0, m0), (r1, m1) -> (r2, m2 = lcm(m0, m1));
// r2 % m0 = r0
// r2 % m1 = r1
// -> (r0 + x*m0) % m1 = r1
// -> x*u0*g % (u1*g) = (r1 - r0) (u0*g = m0, u1*g = m1)
// -> x = (r1 - r0) / g * inv(u0) (mod u1)
// im = inv(u0) (mod u1) (0 <= im < u1)
long long g, im;
std::tie(g, im) = internal::inv_gcd(m0, m1);
long long u1 = (m1 / g);
// |r1 - r0| < (m0 + m1) <= lcm(m0, m1)
if ((r1 - r0) % g)
return {0, 0};
// u1 * u1 <= m1 * m1 / g / g <= m0 * m1 / g = lcm(m0, m1)
long long x = (r1 - r0) / g % u1 * im % u1;
// |r0| + |m0 * x|
// < m0 + m0 * (u1 - 1)
// = m0 + m0 * m1 / g - m0
// = lcm(m0, m1)
r0 += x * m0;
m0 *= u1; // -> lcm(m0, m1)
if (r0 < 0)
r0 += m0;
}
return {r0, m0};
}
long long floor_sum(long long n, long long m, long long a, long long b) {
long long ans = 0;
if (a >= m) {
ans += (n - 1) * n * (a / m) / 2;
a %= m;
}
if (b >= m) {
ans += n * (b / m);
b %= m;
}
long long y_max = (a * n + b) / m, x_max = (y_max * m - b);
if (y_max == 0)
return ans;
ans += (n - (x_max + a - 1) / a) * y_max;
ans += floor_sum(y_max, a, m, (a - x_max % a) % a);
return ans;
}
} // namespace atcoder
#include <algorithm>
#include <vector>
namespace atcoder {
namespace internal {
template <class T> struct simple_queue {
std::vector<T> payload;
int pos = 0;
void reserve(int n) { payload.reserve(n); }
int size() const { return int(payload.size()) - pos; }
bool empty() const { return pos == int(payload.size()); }
void push(const T &t) { payload.push_back(t); }
T &front() { return payload[pos]; }
void clear() {
payload.clear();
pos = 0;
}
void pop() { pos++; }
};
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <limits>
#include <queue>
#include <vector>
namespace atcoder {
template <class Cap> struct mf_graph {
public:
mf_graph() : _n(0) {}
mf_graph(int n) : _n(n), g(n) {}
int add_edge(int from, int to, Cap cap) {
assert(0 <= from && from < _n);
assert(0 <= to && to < _n);
assert(0 <= cap);
int m = int(pos.size());
pos.push_back({from, int(g[from].size())});
int from_id = int(g[from].size());
int to_id = int(g[to].size());
if (from == to)
to_id++;
g[from].push_back(_edge{to, to_id, cap});
g[to].push_back(_edge{from, from_id, 0});
return m;
}
struct edge {
int from, to;
Cap cap, flow;
};
edge get_edge(int i) {
int m = int(pos.size());
assert(0 <= i && i < m);
auto _e = g[pos[i].first][pos[i].second];
auto _re = g[_e.to][_e.rev];
return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};
}
std::vector<edge> edges() {
int m = int(pos.size());
std::vector<edge> result;
for (int i = 0; i < m; i++) {
result.push_back(get_edge(i));
}
return result;
}
void change_edge(int i, Cap new_cap, Cap new_flow) {
int m = int(pos.size());
assert(0 <= i && i < m);
assert(0 <= new_flow && new_flow <= new_cap);
auto &_e = g[pos[i].first][pos[i].second];
auto &_re = g[_e.to][_e.rev];
_e.cap = new_cap - new_flow;
_re.cap = new_flow;
}
Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }
Cap flow(int s, int t, Cap flow_limit) {
assert(0 <= s && s < _n);
assert(0 <= t && t < _n);
assert(s != t);
std::vector<int> level(_n), iter(_n);
internal::simple_queue<int> que;
auto bfs = [&]() {
std::fill(level.begin(), level.end(), -1);
level[s] = 0;
que.clear();
que.push(s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto e : g[v]) {
if (e.cap == 0 || level[e.to] >= 0)
continue;
level[e.to] = level[v] + 1;
if (e.to == t)
return;
que.push(e.to);
}
}
};
auto dfs = [&](auto self, int v, Cap up) {
if (v == s)
return up;
Cap res = 0;
int level_v = level[v];
for (int &i = iter[v]; i < int(g[v].size()); i++) {
_edge &e = g[v][i];
if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0)
continue;
Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));
if (d <= 0)
continue;
g[v][i].cap += d;
g[e.to][e.rev].cap -= d;
res += d;
if (res == up)
break;
}
return res;
};
Cap flow = 0;
while (flow < flow_limit) {
bfs();
if (level[t] == -1)
break;
std::fill(iter.begin(), iter.end(), 0);
while (flow < flow_limit) {
Cap f = dfs(dfs, t, flow_limit - flow);
if (!f)
break;
flow += f;
}
}
return flow;
}
std::vector<bool> min_cut(int s) {
std::vector<bool> visited(_n);
internal::simple_queue<int> que;
que.push(s);
while (!que.empty()) {
int p = que.front();
que.pop();
visited[p] = true;
for (auto e : g[p]) {
if (e.cap && !visited[e.to]) {
visited[e.to] = true;
que.push(e.to);
}
}
}
return visited;
}
private:
int _n;
struct _edge {
int to, rev;
Cap cap;
};
std::vector<std::pair<int, int>> pos;
std::vector<std::vector<_edge>> g;
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <limits>
#include <queue>
#include <vector>
namespace atcoder {
template <class Cap, class Cost> struct mcf_graph {
public:
mcf_graph() {}
mcf_graph(int n) : _n(n), g(n) {}
int add_edge(int from, int to, Cap cap, Cost cost) {
assert(0 <= from && from < _n);
assert(0 <= to && to < _n);
int m = int(pos.size());
pos.push_back({from, int(g[from].size())});
int from_id = int(g[from].size());
int to_id = int(g[to].size());
if (from == to)
to_id++;
g[from].push_back(_edge{to, to_id, cap, cost});
g[to].push_back(_edge{from, from_id, 0, -cost});
return m;
}
struct edge {
int from, to;
Cap cap, flow;
Cost cost;
};
edge get_edge(int i) {
int m = int(pos.size());
assert(0 <= i && i < m);
auto _e = g[pos[i].first][pos[i].second];
auto _re = g[_e.to][_e.rev];
return edge{
pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,
};
}
std::vector<edge> edges() {
int m = int(pos.size());
std::vector<edge> result(m);
for (int i = 0; i < m; i++) {
result[i] = get_edge(i);
}
return result;
}
std::pair<Cap, Cost> flow(int s, int t) {
return flow(s, t, std::numeric_limits<Cap>::max());
}
std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {
return slope(s, t, flow_limit).back();
}
std::vector<std::pair<Cap, Cost>> slope(int s, int t) {
return slope(s, t, std::numeric_limits<Cap>::max());
}
std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {
assert(0 <= s && s < _n);
assert(0 <= t && t < _n);
assert(s != t);
// variants (C = maxcost):
// -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0
// reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge
std::vector<Cost> dual(_n, 0), dist(_n);
std::vector<int> pv(_n), pe(_n);
std::vector<bool> vis(_n);
auto dual_ref = [&]() {
std::fill(dist.begin(), dist.end(), std::numeric_limits<Cost>::max());
std::fill(pv.begin(), pv.end(), -1);
std::fill(pe.begin(), pe.end(), -1);
std::fill(vis.begin(), vis.end(), false);
struct Q {
Cost key;
int to;
bool operator<(Q r) const { return key > r.key; }
};
std::priority_queue<Q> que;
dist[s] = 0;
que.push(Q{0, s});
while (!que.empty()) {
int v = que.top().to;
que.pop();
if (vis[v])
continue;
vis[v] = true;
if (v == t)
break;
// dist[v] = shortest(s, v) + dual[s] - dual[v]
// dist[v] >= 0 (all reduced cost are positive)
// dist[v] <= (n-1)C
for (int i = 0; i < int(g[v].size()); i++) {
auto e = g[v][i];
if (vis[e.to] || !e.cap)
continue;
// |-dual[e.to] + dual[v]| <= (n-1)C
// cost <= C - -(n-1)C + 0 = nC
Cost cost = e.cost - dual[e.to] + dual[v];
if (dist[e.to] - dist[v] > cost) {
dist[e.to] = dist[v] + cost;
pv[e.to] = v;
pe[e.to] = i;
que.push(Q{dist[e.to], e.to});
}
}
}
if (!vis[t]) {
return false;
}
for (int v = 0; v < _n; v++) {
if (!vis[v])
continue;
// dual[v] = dual[v] - dist[t] + dist[v]
// = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +
// (shortest(s, v) + dual[s] - dual[v]) = - shortest(s, t) +
// dual[t] + shortest(s, v) = shortest(s, v) - shortest(s, t) >=
// 0 - (n-1)C
dual[v] -= dist[t] - dist[v];
}
return true;
};
Cap flow = 0;
Cost cost = 0, prev_cost_per_flow = -1;
std::vector<std::pair<Cap, Cost>> result;
result.push_back({flow, cost});
while (flow < flow_limit) {
if (!dual_ref())
break;
Cap c = flow_limit - flow;
for (int v = t; v != s; v = pv[v]) {
c = std::min(c, g[pv[v]][pe[v]].cap);
}
for (int v = t; v != s; v = pv[v]) {
auto &e = g[pv[v]][pe[v]];
e.cap -= c;
g[v][e.rev].cap += c;
}
Cost d = -dual[s];
flow += c;
cost += c * d;
if (prev_cost_per_flow == d) {
result.pop_back();
}
result.push_back({flow, cost});
prev_cost_per_flow = d;
}
return result;
}
private:
int _n;
struct _edge {
int to, rev;
Cap cap;
Cost cost;
};
std::vector<std::pair<int, int>> pos;
std::vector<std::vector<_edge>> g;
};
} // namespace atcoder
#include <algorithm>
#include <algorithm>
#include <utility>
#include <vector>
namespace atcoder {
namespace internal {
template <class E> struct csr {
std::vector<int> start;
std::vector<E> elist;
csr(int n, const std::vector<std::pair<int, E>> &edges)
: start(n + 1), elist(edges.size()) {
for (auto e : edges) {
start[e.first + 1]++;
}
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
auto counter = start;
for (auto e : edges) {
elist[counter[e.first]++] = e.second;
}
}
};
// Reference:
// R. Tarjan,
// Depth-First Search and Linear Graph Algorithms
struct scc_graph {
public:
scc_graph(int n) : _n(n) {}
int num_vertices() { return _n; }
void add_edge(int from, int to) { edges.push_back({from, {to}}); }
// @return pair of (# of scc, scc id)
std::pair<int, std::vector<int>> scc_ids() {
auto g = csr<edge>(_n, edges);
int now_ord = 0, group_num = 0;
std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);
visited.reserve(_n);
auto dfs = [&](auto self, int v) -> void {
low[v] = ord[v] = now_ord++;
visited.push_back(v);
for (int i = g.start[v]; i < g.start[v + 1]; i++) {
auto to = g.elist[i].to;
if (ord[to] == -1) {
self(self, to);
low[v] = std::min(low[v], low[to]);
} else {
low[v] = std::min(low[v], ord[to]);
}
}
if (low[v] == ord[v]) {
while (true) {
int u = visited.back();
visited.pop_back();
ord[u] = _n;
ids[u] = group_num;
if (u == v)
break;
}
group_num++;
}
};
for (int i = 0; i < _n; i++) {
if (ord[i] == -1)
dfs(dfs, i);
}
for (auto &x : ids) {
x = group_num - 1 - x;
}
return {group_num, ids};
}
std::vector<std::vector<int>> scc() {
auto ids = scc_ids();
int group_num = ids.first;
std::vector<int> counts(group_num);
for (auto x : ids.second)
counts[x]++;
std::vector<std::vector<int>> groups(ids.first);
for (int i = 0; i < group_num; i++) {
groups[i].reserve(counts[i]);
}
for (int i = 0; i < _n; i++) {
groups[ids.second[i]].push_back(i);
}
return groups;
}
private:
int _n;
struct edge {
int to;
};
std::vector<std::pair<int, edge>> edges;
};
} // namespace internal
} // namespace atcoder
#include <cassert>
#include <vector>
namespace atcoder {
struct scc_graph {
public:
scc_graph() : internal(0) {}
scc_graph(int n) : internal(n) {}
void add_edge(int from, int to) {
int n = internal.num_vertices();
assert(0 <= from && from < n);
assert(0 <= to && to < n);
internal.add_edge(from, to);
}
std::vector<std::vector<int>> scc() { return internal.scc(); }
private:
internal::scc_graph internal;
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <vector>
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
segtree() : segtree(0) {}
segtree(int n) : segtree(std::vector<S>(n, e())) {}
segtree(const std::vector<S> &v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
for (int i = 0; i < _n; i++)
d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
d[p] = x;
for (int i = 1; i <= log; i++)
update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
return d[p + size];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
S sml = e(), smr = e();
l += size;
r += size;
while (l < r) {
if (l & 1)
sml = op(sml, d[l++]);
if (r & 1)
smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
template <bool (*f)(S)> int max_right(int l) {
return max_right(l, [](S x) { return f(x); });
}
template <class F> int max_right(int l, F f) {
assert(0 <= l && l <= _n);
assert(f(e()));
if (l == _n)
return _n;
l += size;
S sm = e();
do {
while (l % 2 == 0)
l >>= 1;
if (!f(op(sm, d[l]))) {
while (l < size) {
l = (2 * l);
if (f(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*f)(S)> int min_left(int r) {
return min_left(r, [](S x) { return f(x); });
}
template <class F> int min_left(int r, F f) {
assert(0 <= r && r <= _n);
assert(f(e()));
if (r == 0)
return 0;
r += size;
S sm = e();
do {
r--;
while (r > 1 && (r % 2))
r >>= 1;
if (!f(op(d[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (f(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
} // namespace atcoder
#include <algorithm>
#include <cassert>
#include <numeric>
#include <string>
#include <vector>
namespace atcoder {
namespace internal {
std::vector<int> sa_naive(const std::vector<int> &s) {
int n = int(s.size());
std::vector<int> sa(n);
std::iota(sa.begin(), sa.end(), 0);
std::sort(sa.begin(), sa.end(), [&](int l, int r) {
if (l == r)
return false;
while (l < n && r < n) {
if (s[l] != s[r])
return s[l] < s[r];
l++;
r++;
}
return l == n;
});
return sa;
}
std::vector<int> sa_doubling(const std::vector<int> &s) {
int n = int(s.size());
std::vector<int> sa(n), rnk = s, tmp(n);
std::iota(sa.begin(), sa.end(), 0);
for (int k = 1; k < n; k *= 2) {
auto cmp = [&](int x, int y) {
if (rnk[x] != rnk[y])
return rnk[x] < rnk[y];
int rx = x + k < n ? rnk[x + k] : -1;
int ry = y + k < n ? rnk[y + k] : -1;
return rx < ry;
};
std::sort(sa.begin(), sa.end(), cmp);
tmp[sa[0]] = 0;
for (int i = 1; i < n; i++) {
tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);
}
std::swap(tmp, rnk);
}
return sa;
}
// SA-IS, linear-time suffix array construction
// Reference:
// G. Nong, S. Zhang, and W. H. Chan,
// Two Efficient Algorithms for Linear Time Suffix Array Construction
template <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>
std::vector<int> sa_is(const std::vector<int> &s, int upper) {
int n = int(s.size());
if (n == 0)
return {};
if (n == 1)
return {0};
if (n == 2) {
if (s[0] < s[1]) {
return {0, 1};
} else {
return {1, 0};
}
}
if (n < THRESHOLD_NAIVE) {
return sa_naive(s);
}
if (n < THRESHOLD_DOUBLING) {
return sa_doubling(s);
}
std::vector<int> sa(n);
std::vector<bool> ls(n);
for (int i = n - 2; i >= 0; i--) {
ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);
}
std::vector<int> sum_l(upper + 1), sum_s(upper + 1);
for (int i = 0; i < n; i++) {
if (!ls[i]) {
sum_s[s[i]]++;
} else {
sum_l[s[i] + 1]++;
}
}
for (int i = 0; i <= upper; i++) {
sum_s[i] += sum_l[i];
if (i < upper)
sum_l[i + 1] += sum_s[i];
}
auto induce = [&](const std::vector<int> &lms) {
std::fill(sa.begin(), sa.end(), -1);
std::vector<int> buf(upper + 1);
std::copy(sum_s.begin(), sum_s.end(), buf.begin());
for (auto d : lms) {
if (d == n)
continue;
sa[buf[s[d]]++] = d;
}
std::copy(sum_l.begin(), sum_l.end(), buf.begin());
sa[buf[s[n - 1]]++] = n - 1;
for (int i = 0; i < n; i++) {
int v = sa[i];
if (v >= 1 && !ls[v - 1]) {
sa[buf[s[v - 1]]++] = v - 1;
}
}
std::copy(sum_l.begin(), sum_l.end(), buf.begin());
for (int i = n - 1; i >= 0; i--) {
int v = sa[i];
if (v >= 1 && ls[v - 1]) {
sa[--buf[s[v - 1] + 1]] = v - 1;
}
}
};
std::vector<int> lms_map(n + 1, -1);
int m = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms_map[i] = m++;
}
}
std::vector<int> lms;
lms.reserve(m);
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms.push_back(i);
}
}
induce(lms);
if (m) {
std::vector<int> sorted_lms;
sorted_lms.reserve(m);
for (int v : sa) {
if (lms_map[v] != -1)
sorted_lms.push_back(v);
}
std::vector<int> rec_s(m);
int rec_upper = 0;
rec_s[lms_map[sorted_lms[0]]] = 0;
for (int i = 1; i < m; i++) {
int l = sorted_lms[i - 1], r = sorted_lms[i];
int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;
int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;
bool same = true;
if (end_l - l != end_r - r) {
same = false;
} else {
while (l < end_l) {
if (s[l] != s[r]) {
break;
}
l++;
r++;
}
if (l == n || s[l] != s[r])
same = false;
}
if (!same)
rec_upper++;
rec_s[lms_map[sorted_lms[i]]] = rec_upper;
}
auto rec_sa = sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);
for (int i = 0; i < m; i++) {
sorted_lms[i] = lms[rec_sa[i]];
}
induce(sorted_lms);
}
return sa;
}
} // namespace internal
std::vector<int> suffix_array(const std::vector<int> &s, int upper) {
assert(0 <= upper);
for (int d : s) {
assert(0 <= d && d <= upper);
}
auto sa = internal::sa_is(s, upper);
return sa;
}
template <class T> std::vector<int> suffix_array(const std::vector<T> &s) {
int n = int(s.size());
std::vector<int> idx(n);
iota(idx.begin(), idx.end(), 0);
sort(idx.begin(), idx.end(), [&](int l, int r) { return s[l] < s[r]; });
std::vector<int> s2(n);
int now = 0;
for (int i = 0; i < n; i++) {
if (i && s[idx[i - 1]] != s[idx[i]])
now++;
s2[idx[i]] = now;
}
return internal::sa_is(s2, now);
}
std::vector<int> suffix_array(const std::string &s) {
int n = int(s.size());
std::vector<int> s2(n);
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return internal::sa_is(s2, 255);
}
// Reference:
// T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park,
// Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its
// Applications
template <class T>
std::vector<int> lcp_array(const std::vector<T> &s,
const std::vector<int> &sa) {
int n = int(s.size());
assert(n >= 1);
std::vector<int> rnk(n);
for (int i = 0; i < n; i++) {
rnk[sa[i]] = i;
}
std::vector<int> lcp(n - 1);
int h = 0;
for (int i = 0; i < n; i++) {
if (h > 0)
h--;
if (rnk[i] == 0)
continue;
int j = sa[rnk[i] - 1];
for (; j + h < n && i + h < n; h++) {
if (s[j + h] != s[i + h])
break;
}
lcp[rnk[i] - 1] = h;
}
return lcp;
}
std::vector<int> lcp_array(const std::string &s, const std::vector<int> &sa) {
int n = int(s.size());
std::vector<int> s2(n);
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return lcp_array(s2, sa);
}
// Reference:
// D. Gusfield,
// Algorithms on Strings, Trees, and Sequences: Computer Science and
// Computational Biology
template <class T> std::vector<int> z_algorithm(const std::vector<T> &s) {
int n = int(s.size());
if (n == 0)
return {};
std::vector<int> z(n);
z[0] = 0;
for (int i = 1, j = 0; i < n; i++) {
int &k = z[i];
k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k])
k++;
if (j + z[j] < i + z[i])
j = i;
}
z[0] = n;
return z;
}
std::vector<int> z_algorithm(const std::string &s) {
int n = int(s.size());
std::vector<int> s2(n);
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return z_algorithm(s2);
}
} // namespace atcoder
#include <cassert>
#include <vector>
namespace atcoder {
// Reference:
// B. Aspvall, M. Plass, and R. Tarjan,
// A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean
// Formulas
struct two_sat {
public:
two_sat() : _n(0), scc(0) {}
two_sat(int n) : _n(n), _answer(n), scc(2 * n) {}
void add_clause(int i, bool f, int j, bool g) {
assert(0 <= i && i < _n);
assert(0 <= j && j < _n);
scc.add_edge(2 * i + (f ? 0 : 1), 2 * j + (g ? 1 : 0));
scc.add_edge(2 * j + (g ? 0 : 1), 2 * i + (f ? 1 : 0));
}
bool satisfiable() {
auto id = scc.scc_ids().second;
for (int i = 0; i < _n; i++) {
if (id[2 * i] == id[2 * i + 1])
return false;
_answer[i] = id[2 * i] < id[2 * i + 1];
}
return true;
}
std::vector<bool> answer() { return _answer; }
private:
int _n;
std::vector<bool> _answer;
internal::scc_graph scc;
};
} // namespace atcoder
using namespace std;
using namespace atcoder;
typedef long long ll;
/*
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
void Add(ll &pos,ll val){pos=mod(pos+val);}
void mod_print(ll k){
ll P=50000;
rep(y,1,P){
ll x=mod(y*k);
if(abs(x)<=P||x+P>=i_7){
if(x+P>=i_7){
x-=i_7;
}
cout<<x<<"/"<<y<<endl;
//cout<<setprecision(5)<<(dd)x/(dd)y;
return;
}
}
cout<<"nun"<<endl;
}
*/
/*
#include "boost/multiprecision/cpp_dec_float.hpp"
#include "boost/multiprecision/cpp_int.hpp"
namespace mp = boost::multiprecision;
typedef mp::cpp_int LL;
typedef mp::number<mp::cpp_dec_float<1024>> DD;//
仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)
*/
typedef long double dd;
typedef pair<ll, ll> l_l;
typedef pair<dd, dd> d_d;
ll inf = (ll)1E16;
#define rep(i, l, r) for (ll i = l; i <= r; i++)
#define rrep(i, r, l) for (ll i = r; i >= l; i--)
#define pb push_back
ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
void Max(ll &pos, ll val) { pos = max(pos, val); } // Max(dp[n],dp[n-1]);
void Min(ll &pos, ll val) { pos = min(pos, val); }
dd EPS = 1E-12;
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fi first
#define se second
#define SORT(v) sort(v.begin(), v.end())
#define ERASE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define POSL(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define POSU(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
template <class T, class S> inline bool chmax(T &a, S b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class S> inline bool chmin(T &a, S b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define endl \
"\n" // インタラクティブで消す！！！！！！！！！！！！！！！！！！！！！
#define all(c) c.begin(), c.end()
typedef vector<ll> vl;
// using mint = modint998244353;
using mint = modint1000000007;
// using mint=modint;
// using mint=static_modint<100>;
typedef vector<mint> vi;
//////////////////////////
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
#define M 6050
ll mp[M][M];
int main() {
fastio ll n, m;
cin >> n >> m;
ll a[n][3];
ll b[m][3];
vl cx, cy;
rep(i, 0, n - 1) rep(j, 0, 2) {
cin >> a[i][j];
if (j <= 1) {
cx.pb(a[i][j]);
} else {
cy.pb(a[i][j]);
}
}
rep(i, 0, m - 1) rep(j, 0, 2) {
cin >> b[i][j];
if (j <= 0) {
cx.pb(b[i][j]);
} else {
cy.pb(b[i][j]);
}
}
cx.pb(0);
cy.pb(0);
SORT(cx);
ERASE(cx);
SORT(cy);
ERASE(cy);
ll sx = 0, sy = 0;
sx = 2 * POSL(cx, sx);
sy = 2 * POSL(cy, sy);
ll mx = sx, my = sy;
rep(i, 0, n - 1) rep(j, 0, 2) {
if (j <= 1) {
a[i][j] = 2 * POSL(cx, a[i][j]);
chmax(mx, a[i][j]);
} else {
a[i][j] = 2 * POSL(cy, a[i][j]);
chmax(my, a[i][j]);
}
}
rep(i, 0, m - 1) rep(j, 0, 2) {
if (j <= 0) {
b[i][j] = 2 * POSL(cx, b[i][j]);
chmax(mx, b[i][j]);
} else {
b[i][j] = 2 * POSL(cy, b[i][j]);
chmax(my, b[i][j]);
}
}
/*
rep(i,0,n-1){
rep(j,0,2)cout<<a[i][j]<<" ";cout<<endl;
}cout<<endl;
rep(i,0,m-1){
rep(j,0,2)cout<<b[i][j]<<" ";cout<<endl;
}cout<<endl;
cout<<sx<<" "<<sy<<endl;
cout<<mx<<" "<<my<<endl;
*/
rep(i, 0, n - 1) {
rep(x, a[i][0], a[i][1]) { mp[a[i][2]][x] = 1; }
}
rep(i, 0, m - 1) {
rep(y, b[i][1], b[i][2]) { mp[y][b[i][0]] = 1; }
}
mp[sy][sx] = 2;
queue<l_l> q;
q.push({sy, sx});
while (!q.empty()) {
l_l t = q.front();
q.pop();
rep(z, 0, 3) {
ll nx = t.se + dx[z];
ll ny = t.fi + dy[z];
if (nx < 0 || nx > mx || ny < 0 || ny > my) {
/*rep(i,0,my){
rep(j,0,mx){
if(mp[i][j]==2){
cout<<"S";
}else if(mp[i][j]==0){
cout<<".";
}else{
cout<<"#";
}
}cout<<endl;
}*/
cout << "INF" << endl;
return 0;
}
if (mp[ny][nx] == 0) {
mp[ny][nx] = 2;
q.push({ny, nx});
}
}
}
/*
rep(i,0,my){
rep(j,0,mx){
if(mp[i][j]==2){
cout<<"S";
}else if(mp[i][j]==0){
cout<<".";
}else{
cout<<"#";
}
}cout<<endl;
}*/
ll ans = 0;
rep(i, 0, my) {
rep(j, 0, mx) {
if (i % 2 == 0 || j % 2 == 0)
continue;
if (mp[i][j] != 2)
continue;
ll pi = i / 2, pj = j / 2;
ll add = (cy[pi + 1] - cy[pi]) * (cx[pj + 1] - cx[pj]);
// cout<<i<<" "<<j<<" "<<add<<endl;
ans += add;
}
}
cout << ans << endl;
return 0;
}
| replace | 2,267 | 2,269 | 2,267 | 2,268 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.