problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02925 | C++ | Runtime Error | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <i... | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <i... | replace | 277 | 281 | 277 | 281 | -11 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (i... | replace | 61 | 62 | 61 | 62 | TLE | |
p02925 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int N = 1e6 + 6;
int n, in[N], nxt[N][2], b[1001];
inline int idx(int a, int b) {
if (a > b)
swap(a, b);
return a * n + b;
}
int main(... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int N = 1e6 + 6;
int n, in[N], nxt[N][2], b[1001];
inline int idx(int a, int b) {
if (a > b)
swap(a, b);
return a * n + b;
}
int main(... | replace | 21 | 22 | 21 | 22 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<vector<int>> edge(10000000, vector<int>());
vector<int> indeg(10000000, 0);
int n, a;
cin >> n;
for (int i = 1; i <= n; i++) {
int s, t;
for (int j = 0; j < n ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<vector<int>> edge(10000000, vector<int>());
vector<int> indeg(10000000, 0);
int n, a;
cin >> n;
for (int i = 1; i <= n; i++) {
int s, t;
for (int j = 0; j < n ... | replace | 38 | 39 | 38 | 39 | TLE | |
p02925 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | replace | 75 | 76 | 75 | 76 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tup... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tup... | replace | 97 | 98 | 97 | 98 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | replace | 60 | 61 | 60 | 61 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// chmax, chmin
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// chmax, chmin
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, ... | replace | 47 | 48 | 47 | 48 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
// #include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <... | #include <algorithm>
#include <bitset>
// #include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <... | replace | 85 | 87 | 85 | 89 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define INPUT_INT(valName) \
int valName; \
cin >> valName
#define INPUT_LLINT(valName) ... | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define INPUT_INT(valName) \
int valName; \
cin >> valName
#define INPUT_LLINT(valName) ... | insert | 124 | 124 | 124 | 126 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// 型alias
template <class T> using vec =... | #include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// 型alias
template <class T> using vec =... | replace | 45 | 52 | 45 | 56 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | replace | 24 | 26 | 24 | 26 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | replace | 28 | 29 | 28 | 29 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<vector<int>> a(N, vector<int>(N - 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<vector<int>> a(N, vector<int>(N - 1... | replace | 41 | 42 | 41 | 42 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, n;
cin >> N;
vector<queue<int>> stacks(N, queue<int>());
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> n;
stacks.at(i).push(n);
}
}
int count = 1;
int pop_count = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, n;
cin >> N;
vector<queue<int>> stacks(N, queue<int>());
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> n;
stacks.at(i).push(n);
}
}
int count = 1;
int pop_count = 0;
... | insert | 40 | 40 | 40 | 41 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#def... | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#def... | replace | 91 | 97 | 91 | 92 | TLE | |
p02925 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int n;
int a[1000][999];
int g[1000];
int check[1001];
int day;
int f;
int i, j;
int match;
int index;
scanf("%d", &n);
// プレイヤー番号は下駄をはかせて使う；
for (i = 1; i < n + 1; i++) {
g[i] = 0;
for (j = 0; j < n - 1; j++) {
scanf("%d", &a[i][j]);
}... | #include <stdio.h>
int main(void) {
int n;
int a[1001][1000];
int g[1001];
int check[1002];
int day;
int f;
int i, j;
int match;
int index;
scanf("%d", &n);
// プレイヤー番号は下駄をはかせて使う；
for (i = 1; i < n + 1; i++) {
g[i] = 0;
for (j = 0; j < n - 1; j++) {
scanf("%d", &a[i][j]);
... | replace | 5 | 8 | 5 | 8 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, a[1005][1005], now[1005], ans = 0, tmp[1005], ok;
int read() {
int s = 0;
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
s = s * 10 + c - '0', c = getchar();
return s;
}
... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, a[10005][10005], now[10005], ans = 0, tmp[10005], ok;
int read() {
int s = 0;
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
s = s * 10 + c - '0', c = getchar();
return s... | replace | 5 | 6 | 5 | 6 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (... | replace | 99 | 100 | 99 | 100 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No... | #include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No... | replace | 71 | 78 | 71 | 74 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n - 1));
vector<int> head(n);
rep(i, n) {
rep(j, n - 1) {
int x;
cin >> x;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
int a[1010][1010] = {};
int head[1010] = {};
rep(i, n) {
rep(j, n - 1) {
int x;
cin >> x;
x--;
a[i]... | replace | 9 | 11 | 9 | 11 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define sz(c) (int)c.size()
#define fr f... | #include <bits/stdc++.h>
// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define sz(c) (int)c.size()
#define fr f... | replace | 49 | 50 | 49 | 50 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
int id[MAX_N][MAX_N];
int a[MAX_N][MAX_N];
vector<int> edge[MAX_V];
int toId(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
int depth[MAX_V];
int dfs(int v) {
depth[v] = 1;
for (int... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
int id[MAX_N][MAX_N];
int a[MAX_N][MAX_N];
vector<int> edge[MAX_V];
int toId(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
int depth[MAX_V];
int dfs(int v) {
if (depth[v] > 0)
re... | insert | 17 | 17 | 17 | 19 | TLE | |
p02925 | C++ | Time Limit Exceeded | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#... | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#... | replace | 194 | 195 | 194 | 195 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define enter putchar('\n')
#define Mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll read() {
ll x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= (ch == '-'), ch = getchar();
while (ch >= '... | #include <bits/stdc++.h>
#define enter putchar('\n')
#define Mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll read() {
ll x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= (ch == '-'), ch = getchar();
while (ch >= '... | replace | 100 | 104 | 100 | 101 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | replace | 717 | 718 | 717 | 718 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef int64_t Int;
typedef pair<int, int> P;
int N;
vector<deque<int>> A(N);
vector<P> match;
// kさんが試合をできればmatchに代入する
void check(int i) {
if (A[i].size() == 0)
return;
int j = A[i].front();
if (A[j].front... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef int64_t Int;
typedef pair<int, int> P;
int N;
vector<deque<int>> A(1010);
vector<P> match;
// kさんが試合をできればmatchに代入する
void check(int i) {
if (A[i].size() == 0)
return;
int j = A[i].front();
if (A[j].fr... | replace | 7 | 8 | 7 | 8 | -11 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
template <typename T> void print(const T &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << ' ';
cout << v[i];
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
template <typename T> void print(const T &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << ' ';
cout << v[i];
}
... | replace | 63 | 64 | 63 | 64 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
static const int MAXN = 1e+3;
static const int MAXV = MAXN * (MAXN - 1) / 2;
int mat[MAXN][MAXN], dp[MAXV];
vector<int> adj[MAXN];
bool visited[MAXV], calculated[MAXV];
// max length of path from s
int dfs(int u) {
if (vis... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
static const int MAXN = 1e+3;
static const int MAXV = MAXN * (MAXN - 1) / 2;
int mat[MAXN][MAXN], dp[MAXV];
vector<int> adj[MAXV];
bool visited[MAXV], calculated[MAXV];
// max length of path from s
int dfs(int u) {
if (vis... | replace | 7 | 8 | 7 | 8 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define ... | insert | 85 | 85 | 85 | 90 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | replace | 47 | 48 | 47 | 48 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
vector<queue<int>> q(n + 1);
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
vector<queue<int>> q(n + 1);
i... | replace | 26 | 27 | 26 | 27 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | replace | 47 | 49 | 47 | 49 | TLE | |
p02925 | C++ | Time Limit Exceeded | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin()... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin()... | replace | 79 | 80 | 79 | 80 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define dom 998244353
#define all(c) begin(c), end(c)
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
template <typename T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define dom 998244353
#define all(c) begin(c), end(c)
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
template <typename T> bool chmax(T &a, const T &b) {
... | insert | 46 | 46 | 46 | 50 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n - 1));
rep(i, n) {
rep(j, n - 1) {
cin >> a[i][j];
a[i][j]--;
}
reverse(a[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n - 1));
rep(i, n) {
rep(j, n - 1) {
cin >> a[i][j];
a[i][j]--;
}
reverse(a[i]... | insert | 38 | 38 | 38 | 39 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> A[i][j];
A[i][j]--;
}
}
vector<int> cnt(N, ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(N - 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N - 1; j++) {
cin >> A[i][j];
A[i][j]--;
}
}
vector<int> cnt(N, ... | replace | 23 | 24 | 23 | 24 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define radrad(a) 180.0 * a / M_PI
#define pow(x) x *x
#define ll long long
static const int MAX = 100010;
static const ll INFTY = 1e12;
static const int NUMMAX = 300;
int change(int N, int a, int b) {
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define radrad(a) 180.0 * a / M_PI
#define pow(x) x *x
#define ll long long
static const int MAX = 1000010;
static const ll INFTY = 1e12;
static const int NUMMAX = 300;
int change(int N, int a, int b) {
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
queue<int> a[1001];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j < n; j++) {
int x;
cin >> x;
a[i].push(x);
}
}
int sc = n * (n - 1) / 2;
// cout<<sc<<endl;
int cnt = 0;
while (sc > 0) {
// cou... | #include <bits/stdc++.h>
using namespace std;
queue<int> a[1001];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j < n; j++) {
int x;
cin >> x;
a[i].push(x);
}
}
int sc = n * (n - 1) / 2;
// cout<<sc<<endl;
int cnt = 0;
while (sc > 0) {
// cou... | insert | 27 | 27 | 27 | 28 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define loop(n) \
for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); \
ngtkana_is_genius++)
#define rep(i, begin, end) for (int i = int(begin); i < int(end); i++)
#define lint long long
auto cmn = ... | #include <bits/stdc++.h>
#define loop(n) \
for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); \
ngtkana_is_genius++)
#define rep(i, begin, end) for (int i = int(begin); i < int(end); i++)
#define lint long long
auto cmn = ... | insert | 138 | 138 | 138 | 140 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
int main() {
int n;
cin >> n;
vector<deque<int>> a(n);
REP(i, n) {
REP(j, n ... | #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
int main() {
int n;
cin >> n;
vector<deque<int>> a(n);
REP(i, n) {
REP(j, n ... | replace | 62 | 63 | 62 | 63 | TLE | |
p02925 | C++ | Runtime Error | // https://atcoder.jp/contests/abc139/tasks/abc139_e
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i ... | // https://atcoder.jp/contests/abc139/tasks/abc139_e
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i ... | replace | 49 | 51 | 49 | 55 | -11 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e3;
vector<vector<int>> G((MAX_N + 1) * (MAX_N + 1));
vector<int> dis(MAX_N, -1);
vector<bool> start(MAX_N, false);
vector<bool> done(MAX_N, false);
int dfs(int obj) {
if (start[obj]) {
if (!done[obj])
return -1;
return dis[obj];
} els... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000;
vector<vector<int>> G(MAX_N *(MAX_N - 1) / 2 + 1);
vector<int> dis(MAX_N *(MAX_N - 1) / 2 + 1, -1);
vector<bool> start(MAX_N *(MAX_N - 1) / 2 + 1, false);
vector<bool> done(MAX_N *(MAX_N - 1) / 2 + 1, false);
int dfs(int obj) {
if (start[obj]) {
... | replace | 3 | 8 | 3 | 8 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sst... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sst... | insert | 54 | 54 | 54 | 118 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | replace | 151 | 152 | 151 | 152 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | replace | 44 | 45 | 44 | 45 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define lfs << fixed << setprecision(10) <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define MP make_pair
#define rep(i, n, m) for (ll i = n;... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define lfs << fixed << setprecision(10) <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define MP make_pair
#define rep(i, n, m) for (ll i = n;... | delete | 139 | 141 | 139 | 139 | TLE | |
p02925 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>;
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 7;
map<pair<int, int>, int> mp;
int cnt = 1;
int head[... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>;
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
map<pair<int, int>, int> mp;
int cnt = 1;
int head[... | replace | 13 | 14 | 13 | 14 | 0 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define int long long int
#define sync \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define int long long int
#define sync \
ios_base::sync_with_stdio(false); ... | replace | 72 | 74 | 72 | 75 | -11 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
template <typename T> bo... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
template <typename T> bo... | replace | 33 | 34 | 33 | 34 | 0 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
bool seen[2000000]{};
bool finished[2000000]{};
int d... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
bool seen[2000000]{};
bool finished[2000000]{};
int d... | replace | 39 | 40 | 39 | 40 | 0 | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 1001;
int n, A[M][M];
int id[M][M], tot;
vector<int> d[500001];
int dp[M], ans;
bool fl;
int dfs(int x) {
if (dp[x])
return dp[x];
int res = 0;
for (int i = 0; i < (int)d[x].size(); i++) {
int y = d[x][i];
res = max(res, dfs(y));
}
dp[x] ... | #include <bits/stdc++.h>
using namespace std;
const int M = 1001;
int n, A[M][M];
int id[M][M], tot;
vector<int> d[500001];
int dp[500001], ans;
bool fl;
int dfs(int x) {
if (dp[x])
return dp[x];
int res = 0;
for (int i = 0; i < (int)d[x].size(); i++) {
int y = d[x][i];
res = max(res, dfs(y));
}
d... | replace | 6 | 7 | 6 | 7 | 0 | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define mod 1000000007;
int main() {
int n, a[1010][1010], now[1010];
cin >> n;
ll hoge = 0, en = (n * (n - 1)) / 2;
for (... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define mod 1000000007;
int main() {
int n, a[1010][1010], now[1010];
cin >> n;
ll hoge = 0, en = (n * (n - 1)) / 2;
for (... | replace | 36 | 52 | 36 | 49 | TLE | |
p02925 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes... | insert | 46 | 46 | 46 | 48 | TLE | |
p02925 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes... | replace | 37 | 38 | 37 | 38 | TLE | |
p02925 | C++ | Time Limit Exceeded | #define DEBUG 1
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long lon... | #define DEBUG 1
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long lon... | replace | 132 | 140 | 132 | 139 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Table = vector<vector<int>>;
const bool DEBUG = false;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
Table A(N, vector<int>(N - 1));
for (size_t i = 0; i < N; i++) {
for (size_t j = 0; j < N - 1; j++) {
cin >> A[i][j];
}
}
if (... | #include <bits/stdc++.h>
using namespace std;
using Table = vector<vector<int>>;
const bool DEBUG = false;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
Table A(N, vector<int>(N - 1));
for (size_t i = 0; i < N; i++) {
for (size_t j = 0; j < N - 1; j++) {
cin >> A[i][j];
}
}
if (... | replace | 39 | 43 | 39 | 43 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, start, end) for (ll i = start; i < end; ++i)
#define dwn(i, n) for (int i = n; i >= 0; --i)
#define dwn2(i, start, end) for (ll i = start; i >= end; --i)
#define pll pair<ll, ll>
#define mk(x... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, start, end) for (ll i = start; i < end; ++i)
#define dwn(i, n) for (int i = n; i >= 0; --i)
#define dwn2(i, start, end) for (ll i = start; i >= end; --i)
#define pll pair<ll, ll>
#define mk(x... | replace | 30 | 31 | 30 | 31 | TLE | |
p02925 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi>... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi>... | insert | 36 | 36 | 36 | 37 | TLE | |
p02925 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 1e3 + 3;
int n, a[M][M];
map<pair<int, int>, int> mp;
vector<int> adj[M];
int in[M * M], vis[M * M], ans;
int main() {
scanf("%d", &n);
int k = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
int x;
scanf("%d", &a[i]... | #include <bits/stdc++.h>
using namespace std;
const int M = 1e3 + 3;
int n, a[M][M];
map<pair<int, int>, int> mp;
vector<int> adj[M * M];
int in[M * M], vis[M * M], ans = 1;
int main() {
scanf("%d", &n);
int k = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
int x;
scanf("%d... | replace | 7 | 9 | 7 | 9 | 0 | |
p02926 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <tim... | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <tim... | replace | 47 | 48 | 47 | 48 | 0 | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | replace | 50 | 51 | 50 | 51 | TLE | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define X first
#define Y second
#define mp make_pair
#define pb pop_back
#define eb emplace_back
#define sz(v) (int)v.size()
using namespace std;
typedef long long LL;
typedef long double LD;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int MAX_N = 105;
int ... | #include <bits/stdc++.h>
#define X first
#define Y second
#define mp make_pair
#define pb pop_back
#define eb emplace_back
#define sz(v) (int)v.size()
using namespace std;
typedef long long LL;
typedef long double LD;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int MAX_N = 105;
int ... | replace | 29 | 30 | 29 | 30 | TLE | |
p02926 | C++ | Runtime Error | #ifndef OUUAN
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#endif
#include <bits/stdc++.h>
#define int LoveLive
// #define FAST_IOSTREAM 1
#define For(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define FOR(i, r, l) for (int i = (r), i##end = (l); i >= i##end; --i)
#define SO... | #ifndef OUUAN
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#endif
#include <bits/stdc++.h>
#define int LoveLive
// #define FAST_IOSTREAM 1
#define For(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define FOR(i, r, l) for (int i = (r), i##end = (l); i >= i##end; --i)
#define SO... | replace | 210 | 213 | 210 | 214 | 0 | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | replace | 142 | 148 | 142 | 150 | TLE | |
p02926 | C++ | Runtime Error | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline ll read() {
ll x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >= '... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline ll read() {
ll x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >= '... | replace | 28 | 34 | 28 | 29 | 0 | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MOD = 1e9 + 7;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (int i = (l); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MOD = 1e9 + 7;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (int i = (l); ... | replace | 32 | 34 | 32 | 33 | 0 | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define Inf 0x3f3f3f3f
#define rg register
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 105;
inline int read() {
rg int res = 0, sign = 1;
rg char ch = getchar();
while (... | #include <bits/stdc++.h>
#define Inf 0x3f3f3f3f
#define rg register
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 105;
inline int read() {
rg int res = 0, sign = 1;
rg char ch = getchar();
while (... | replace | 54 | 55 | 54 | 55 | TLE | |
p02926 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct ele {
double x, y;
};
bool cmp(const ele &a, const ele &b) {
if (a.x < 0 && b.x < 0)
return cmp(b, a);
if (a.x < 0)
return false;
if (b.x < 0)
return true;
double ap, bp;
if (a.x == 0) {
if (a.y < 0) {
ap = INT... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct ele {
double x, y;
};
bool cmp(const ele &a, const ele &b) {
return atan2(a.x, a.y) < atan2(b.x, b.y);
}
int main() {
int N;
cin >> N;
vector<ele> e;
int k = 0;
for (int i = 0; i < N; ++i) {
double x, y;
cin >> x >> y;
... | replace | 8 | 34 | 8 | 9 | TLE | |
p02926 | C++ | Time Limit Exceeded | // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
// 区間削除は出来ない
templat... | // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
// 区間削除は出来ない
templat... | replace | 3,909 | 3,910 | 3,909 | 3,910 | TLE | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi first
#define se second
const ll INF = 999999999999999;
const ll MOD = ... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi first
#define se second
const ll INF = 999999999999999;
const ll MOD = ... | insert | 38 | 38 | 38 | 40 | 0 | |
p02926 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class... | replace | 29 | 42 | 29 | 30 | TLE | |
p02926 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
//<editor-fold desc="definitions">
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n"
using namespace std;
using ll = ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
//<editor-fold desc="definitions">
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n"
using namespace std;
using ll = ... | insert | 195 | 195 | 195 | 196 | 0 | |
p02926 | C++ | Time Limit Exceeded | #if __has_include("../library/Basic/Debug.hpp")
#include "../library/Basic/Debug.hpp"
#else
/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <bitset>
#include <com... | #if __has_include("../library/Basic/Debug.hpp")
#include "../library/Basic/Debug.hpp"
#else
/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <bitset>
#include <com... | replace | 170 | 171 | 170 | 171 | TLE | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using lli = long long;
struct vec {
lli x, y;
vec() {}
vec(lli x, lli y) : x(x), y(y) {}
vec operator+(const vec &rhs) const { return vec(x + rhs.x, y + rhs.y); }
void read() { scanf("%lld %lld", &x, ... | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using lli = long long;
struct vec {
lli x, y;
vec() {}
vec(lli x, lli y) : x(x), y(y) {}
vec operator+(const vec &rhs) const { return vec(x + rhs.x, y + rhs.y); }
void read() { scanf("%lld %lld", &x, ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02926 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define pb push_back
#define fi first
#define se second
#define FF first
#define SS second
#define INF 2e18;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define... | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define pb push_back
#define fi first
#define se second
#define FF first
#define SS second
#define INF 2e18;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define... | replace | 25 | 27 | 25 | 27 | 0 | |
p02926 | C++ | Time Limit Exceeded | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | replace | 101 | 102 | 101 | 102 | TLE | |
p02926 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<... | insert | 80 | 80 | 80 | 82 | TLE | |
p02926 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <unistd.h>
#inclu... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <unistd.h>
#inclu... | replace | 98 | 99 | 98 | 99 | TLE | |
p02926 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double ep... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double ep... | replace | 172 | 174 | 172 | 174 | TLE | |
p02926 | C++ | Runtime Error | /* while(!cin.eof()) */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)(1e9 + 7)
#define MAXI (int)(1e18 + 100)
#define N 1000200
int fre[N];
// Driver code to test above functions
int32_t main() {
#ifndef ONLINE_JUDGE
// for getting input from inpu.txt
freopen("input.txt",... | /* while(!cin.eof()) */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)(1e9 + 7)
#define MAXI (int)(1e18 + 100)
#define N 1000200
int fre[N];
// Driver code to test above functions
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
c... | delete | 13 | 20 | 13 | 13 | 0 | |
p02926 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#includ... | insert | 122 | 122 | 122 | 123 | 0 | |
p02926 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<pair<int, int>> v;
long double maxAns;
inline bool cmp(const pair<int, int> A, const pair<int, int> B) {
long long f = (1LL * A.second * B.first) - (1LL * B.second * A.first);
if (f... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<pair<int, int>> v;
long double maxAns;
inline bool cmp(const pair<int, int> A, const pair<int, int> B) {
return atan2(A.second, A.first) < atan2(B.second, B.first);
}
int main() {
c... | replace | 14 | 26 | 14 | 15 | 0 | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
const double eps = 1e-9;
struct V {
double x, y;
V(double x = 0, double y = 0) : x(x), y(y) {}
V &operator+=(const V &v) {
x += v.x;
y += v.y;
return *this;
}
V operator+(const V &v)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
const double eps = 1e-9;
struct V {
double x, y;
V(double x = 0, double y = 0) : x(x), y(y) {}
V &operator+=(const V &v) {
x += v.x;
y += v.y;
return *this;
}
V operator+(const V &v)... | replace | 18 | 19 | 18 | 19 | 0 | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
const int N = 105;
int n;
long long x[N], y[N];
int per[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 0; i < n; i++)
per[i]... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
const int N = 105;
int n;
long long x[N], y[N];
int per[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 0; i < n; i++)
per[i]... | delete | 19 | 21 | 19 | 19 | 0 | |
p02926 | C++ | Time Limit Exceeded | // For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456
// a.cpp -o a.exe in cmd
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvi v... | // For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456
// a.cpp -o a.exe in cmd
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvi v... | replace | 112 | 113 | 112 | 113 | TLE | |
p02926 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | replace | 61 | 62 | 61 | 62 | 0 | |
p02927 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (int j = 1; j <= D; i++) {
if (M == (D / 10) * (D % 10))
ans++;
}
}
cout << ans << e... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (int j = 2; j <= D; j++) {
if ((i == (j / 10) * (j % 10)) && j / 10 >= 2 && j % 10 >= 2)
ans... | replace | 11 | 13 | 11 | 13 | TLE | |
p02927 | C++ | Time Limit Exceeded | // #pragma GCC optimize("O3", "unroll-loops")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | // #pragma GCC optimize("O3", "unroll-loops")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | delete | 121 | 125 | 121 | 121 | TLE | |
p02927 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
int main() {
ll m, d;
cin >> m >> d;
ll ans = 0;
for (ll i = 1; i <= m; ++m) {
for (ll j = 1; j <= d; ++d) {
const auto j1 = j % 10;
const auto j10 = j / 10;
if (j1 >= 2 && j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
int main() {
ll m, d;
cin >> m >> d;
ll ans = 0;
for (ll i = 1; i <= m; ++i) {
for (ll j = 1; j <= d; ++j) {
const auto j1 = j % 10;
const auto j10 = j / 10;
if (j1 >= 2 && j... | replace | 9 | 11 | 9 | 11 | TLE | |
p02927 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int M, D;
int solve();
int main() {
cin >> M >> D;
int count = 0;
int d10 = D / 10;
int d1 = D % 10;
for (int ans = 1; ans <= M; ans++) {
for (int a10 = 2; a10 < d10; a10++) {
if (ans % a10 == 0) {
if (ans / a10 < 10) {
if (ans / a10 ... | #include <bits/stdc++.h>
using namespace std;
int M, D;
int solve();
int main() {
cin >> M >> D;
int count = 0;
int d10 = D / 10;
int d1 = D % 10;
for (int ans = 1; ans <= M; ans++) {
for (int a10 = 2; a10 < d10; a10++) {
if (ans % a10 == 0) {
if (ans / a10 < 10) {
if (ans / a10 ... | replace | 22 | 27 | 22 | 29 | 0 | |
p02927 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ff first
#define ss second
const int MAXN = 1e3 + 7;
const ll INF = 1e18 + 7;
const ll MOD = 998244353;
const ll P = 311;
const int BLOCK = 720;
int main() {
#ifdef ____FILE_defined
freopen("in.txt", "r", stdin);
freopen("out.txt", "w... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ff first
#define ss second
const int MAXN = 1e3 + 7;
const ll INF = 1e18 + 7;
const ll MOD = 998244353;
const ll P = 311;
const int BLOCK = 720;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int m, d;
cin ... | delete | 16 | 21 | 16 | 16 | TLE | |
p02927 | C++ | Time Limit Exceeded | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
// const long long mod = 1000000007;
// const long long mod = 998244353;
long long c[64];
int main() {
int M, D;
scanf("%d %d", &M, &D);
int res = 0;
for (int m = 1; m <= M; m++) {
for (int d = 22; d <= D; d++) {
if (d % 10 ... | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
// const long long mod = 1000000007;
// const long long mod = 998244353;
long long c[64];
int main() {
int M, D;
scanf("%d %d", &M, &D);
int res = 0;
for (int m = 1; m <= M; m++) {
for (int d = 22; d <= D; d++) {
if (d % 10 ... | delete | 21 | 23 | 21 | 21 | TLE | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
// ループマクロ
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; 0 <= i; i--)
#define ROP(i, n) for (int i = 1; i <= n; i++)
... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
// ループマクロ
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; 0 <= i; i--)
#define ROP(i, n) for (int i = 1; i <= n; i++)
... | replace | 44 | 45 | 44 | 45 | TLE | |
p02928 | C++ | Runtime Error | #include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll b, ll p = 1e9 + 7) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = modpow(a, b / 2, p);
return (d * d) % p;
} else {
return (a % p * modpow(a, b - 1, p)) %... | #include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll b, ll p = 1e9 + 7) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = modpow(a, b / 2, p);
return (d * d) % p;
} else {
return (a % p * modpow(a, b - 1, p)) %... | replace | 44 | 45 | 44 | 45 | -11 | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | replace | 103 | 108 | 103 | 105 | TLE | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll NUM = pow(10, 9) + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i(0); i < N; ++i) {
cin >> A[i];
}
vector<int> left(N, 0), right(N, 0);
for (int i(0); i < N; ++i) {
if (i >= 1) {
for (int j(0); j < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll NUM = pow(10, 9) + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i(0); i < N; ++i) {
cin >> A[i];
}
vector<int> left(N, 0), right(N, 0);
for (int i(0); i < N; ++i) {
if (i >= 1) {
for (int j(0); j < ... | replace | 28 | 36 | 28 | 31 | TLE | |
p02928 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
return res;
}
int main() ... | #include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
return res;
}
int main() ... | delete | 22 | 24 | 22 | 22 | 0 | |
p02928 | Python | Runtime Error | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt = 0
cnt2 = 0
for i, ai in enumerate(a):
for j in range(i, n):
if ai > a[j]:
cnt += 1
if i > 0:
for j in range(i):
if ai > a[j]:
cnt2 += 1
if k % 2 == 0:
mul = (1 + k) * (k ... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt = 0
cnt2 = 0
for i, ai in enumerate(a):
for j in range(i, n):
if ai > a[j]:
cnt += 1
if i > 0:
for j in range(i):
if ai > a[j]:
cnt2 += 1
if k % 2 == 0:
mul = (1 + k) * (k ... | insert | 17 | 17 | 17 | 18 | 0 | |
p02928 | C++ | Runtime Error | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | replace | 52 | 54 | 52 | 53 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.