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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02772 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define R(i, n) for (int i = 0; i < n; i++)
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define S3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define P(a) printf("%d", a)
#define INF 1000000000
using namespace std;
using ll = long long;
using IR = pair<int, int>;
int N, A[100];
int main() {
S(N);
R(i, N) {
S(A + i);
if (A[i] % 2 == 0) {
if (A[i] % 3 != 0 && A[i] % 5 != 0) {
printf("DENIED");
return 0;
}
}
}
printf("APPROVED");
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define R(i, n) for (int i = 0; i < n; i++)
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define S3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define P(a) printf("%d", a)
#define INF 1000000000
using namespace std;
using ll = long long;
using IR = pair<int, int>;
int N, A[100];
int main() {
S(N);
R(i, N) {
S(A[i]);
if (A[i] % 2 == 0) {
if (A[i] % 3 != 0 && A[i] % 5 != 0) {
printf("DENIED");
return 0;
}
}
}
printf("APPROVED");
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k, mx, i;
string b[100005];
string s[100005];
map<string, int> m, f;
int main() {
cin >> n;
for (k = 1; k <= n; k++) {
cin >> s[k];
m[s[k]]++;
mx = max(m[s[k]], mx);
}
for (k = 1; k <= n; k++) {
if (m[s[k]] == mx && f[s[k]] == 0) {
i++;
f[s[k]] = 1;
b[i] = s[k];
}
}
sort(b + 1, b + i + 1);
for (k = 1; k <= i; k++) {
if (k != i)
cout << b[k] << endl;
else
cout << b[k];
}
} | #include <bits/stdc++.h>
using namespace std;
int n, k, mx, i;
string b[200005];
string s[200005];
map<string, int> m, f;
int main() {
cin >> n;
for (k = 1; k <= n; k++) {
cin >> s[k];
m[s[k]]++;
mx = max(m[s[k]], mx);
}
for (k = 1; k <= n; k++) {
if (m[s[k]] == mx && f[s[k]] == 0) {
i++;
f[s[k]] = 1;
b[i] = s[k];
}
}
sort(b + 1, b + i + 1);
for (k = 1; k <= i; k++) {
if (k != i)
cout << b[k] << endl;
else
cout << b[k];
}
} | replace | 3 | 5 | 3 | 5 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int N;
vector<string> s(20000);
unordered_map<string, int> mp;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s[i];
}
mp[s[0]] = 1;
for (int i = 1; i < N; i++) {
if (mp.find(s[i]) == mp.end()) {
mp[s[i]] = 1;
} else {
mp[mp.find(s[i])->first]++;
}
}
int max = 1;
vector<string> maxs;
for (auto it = mp.begin(); it != mp.end(); it++) {
if (it->second > max) {
max = it->second;
}
}
for (auto it = mp.begin(); it != mp.end(); it++) {
if (it->second == max) {
maxs.push_back(it->first);
}
}
sort(maxs.begin(), maxs.end());
for (int k = 0; k < maxs.size(); k++) {
cout << maxs[k] << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int N;
vector<string> s(200000);
unordered_map<string, int> mp;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s[i];
}
mp[s[0]] = 1;
for (int i = 1; i < N; i++) {
if (mp.find(s[i]) == mp.end()) {
mp[s[i]] = 1;
} else {
mp[mp.find(s[i])->first]++;
}
}
int max = 1;
vector<string> maxs;
for (auto it = mp.begin(); it != mp.end(); it++) {
if (it->second > max) {
max = it->second;
}
}
for (auto it = mp.begin(); it != mp.end(); it++) {
if (it->second == max) {
maxs.push_back(it->first);
}
}
sort(maxs.begin(), maxs.end());
for (int k = 0; k < maxs.size(); k++) {
cout << maxs[k] << endl;
}
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <stdio.h>
using namespace std;
string vote[200000], temp;
int cot[200000];
int sol[200000];
string ans[200000];
int main() {
int n, i, j, k, ma;
cin >> n;
for (i = 0; i < n; i++)
cot[i] = 1;
for (i = 0; i < n; i++) {
cin >> vote[i];
}
sort(vote, vote + i);
j = 0;
for (i = 0; i < n; i++) {
while (vote[i + 1] == vote[i]) {
cot[j]++;
i++;
}
if (cot[j] > 1)
sol[j] = i - 1;
else
sol[j] = i;
j++;
}
ma = cot[0];
for (i = 0; i < n; i++) {
ma = max(cot[i], ma);
}
j = 0;
for (i = 0; i < n; i++) {
if (cot[i] == ma) {
ans[j] = vote[sol[i]];
j++;
}
}
sort(ans, ans + j);
for (i = 0; i < j; i++)
cout << ans[i] << endl;
}
| #include <algorithm>
#include <cstring>
#include <iostream>
#include <stdio.h>
using namespace std;
string vote[2000000], temp;
int cot[2000000];
int sol[2000000];
string ans[2000000];
int main() {
int n, i, j, k, ma;
cin >> n;
for (i = 0; i < n; i++)
cot[i] = 1;
for (i = 0; i < n; i++) {
cin >> vote[i];
}
sort(vote, vote + i);
j = 0;
for (i = 0; i < n; i++) {
while (vote[i + 1] == vote[i]) {
cot[j]++;
i++;
}
if (cot[j] > 1)
sol[j] = i - 1;
else
sol[j] = i;
j++;
}
ma = cot[0];
for (i = 0; i < n; i++) {
ma = max(cot[i], ma);
}
j = 0;
for (i = 0; i < n; i++) {
if (cot[i] == ma) {
ans[j] = vote[sol[i]];
j++;
}
}
sort(ans, ans + j);
for (i = 0; i < j; i++)
cout << ans[i] << endl;
}
| replace | 5 | 9 | 5 | 9 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e8, cnt;
string c[1000];
ll idx;
int main() {
ll n;
cin >> n;
map<string, ll> mp;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
mp[s]++;
}
for (auto i : mp) {
mx = max(mx, i.second);
}
for (auto i : mp) {
if (i.second == mx)
c[idx++] = i.first;
}
sort(c, c + idx);
for (ll i = 0; i < idx; i++) {
cout << c[i] << endl;
}
} | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e8, cnt;
string c[200001];
ll idx;
int main() {
ll n;
cin >> n;
map<string, ll> mp;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
mp[s]++;
}
for (auto i : mp) {
mx = max(mx, i.second);
}
for (auto i : mp) {
if (i.second == mx)
c[idx++] = i.first;
}
sort(c, c + idx);
for (ll i = 0; i < idx; i++) {
cout << c[i] << endl;
}
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (auto &&a : s)
cin >> a;
sort(s.begin(), s.end());
// for(auto&& a : s)cout << a << endl;
int count = 0, max = 0, j = 0;
int memo[200000][2];
for (int i = 0; i < n; i++) {
count++;
if (s[i] != s[i + 1]) {
memo[j][0] = i;
memo[j][1] = count;
j++;
if (count > max) {
max = count;
}
count = 0;
}
}
for (int i = 0; i < j; i++) {
if (memo[i][1] == max) {
cout << s[memo[i][0]] << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (auto &&a : s)
cin >> a;
sort(s.begin(), s.end());
// for(auto&& a : s)cout << a << endl;
int count = 0, max = 0, j = 0;
int memo[200000][2];
for (int i = 0; i < n; i++) {
count++;
if (i + 1 < n) {
if (s[i] != s[i + 1]) {
memo[j][0] = i;
memo[j][1] = count;
j++;
if (count > max) {
max = count;
}
count = 0;
}
} else {
memo[j][0] = i;
memo[j][1] = count;
j++;
if (count > max) {
max = count;
}
count = 0;
}
}
for (int i = 0; i < j; i++) {
if (memo[i][1] == max) {
cout << s[memo[i][0]] << endl;
}
}
} | replace | 15 | 16 | 15 | 26 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fs first
#define se second
#define M 1000000007
vector<ll> tree(100000, LLONG_MAX);
void build(ll s, ll e, ll p, vector<ll> &arr) {
if (s == e) {
tree[p] = arr[s];
return;
}
ll mid = (s + e) / 2;
build(s, mid, 2 * p + 1, arr);
build(mid + 1, e, 2 * p + 2, arr);
tree[p] = min(tree[2 * p + 1], tree[2 * p + 2]);
}
ll query(ll s, ll e, ll l, ll u, ll p) {
if (e < l || s > u)
return LLONG_MAX;
else if (s <= l && u <= e && l <= u)
return tree[p];
ll mid = (l + u) / 2;
ll left = query(s, e, l, mid, 2 * p + 1);
ll right = query(s, e, mid + 1, u, 2 * p + 2);
return min(left, right);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
unordered_map<string, ll> um;
ll m = 0;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
um[s]++;
m = max(m, um[s]);
}
vector<pair<ll, string>> h;
for (auto i : um) {
string st = i.fs;
ll num = i.se;
h.pb({num, st});
}
sort(h.begin(), h.end());
for (ll i = 0; i < n; i++) {
if (h[i].fs == m)
cout << h[i].se << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fs first
#define se second
#define M 1000000007
vector<ll> tree(100000, LLONG_MAX);
void build(ll s, ll e, ll p, vector<ll> &arr) {
if (s == e) {
tree[p] = arr[s];
return;
}
ll mid = (s + e) / 2;
build(s, mid, 2 * p + 1, arr);
build(mid + 1, e, 2 * p + 2, arr);
tree[p] = min(tree[2 * p + 1], tree[2 * p + 2]);
}
ll query(ll s, ll e, ll l, ll u, ll p) {
if (e < l || s > u)
return LLONG_MAX;
else if (s <= l && u <= e && l <= u)
return tree[p];
ll mid = (l + u) / 2;
ll left = query(s, e, l, mid, 2 * p + 1);
ll right = query(s, e, mid + 1, u, 2 * p + 2);
return min(left, right);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
unordered_map<string, ll> um;
ll m = 0;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
um[s]++;
m = max(m, um[s]);
}
vector<pair<ll, string>> h;
for (auto i : um) {
string st = i.fs;
ll num = i.se;
h.pb({num, st});
}
sort(h.begin(), h.end());
for (ll i = 0; i < h.size(); i++) {
if (h[i].fs == m)
cout << h[i].se << endl;
}
} | replace | 53 | 54 | 53 | 54 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int n, m = -1, a = 0, aa[110000], cnt = 0;
pair<int, string> p[220000];
string s, ss[220000];
char c;
signed main() {
cin >> n;
rep(i, n) { cin >> ss[i]; }
sort(ss, ss + n);
rep(i, n) {
if (p[m].second != ss[i]) {
p[m].first = cnt;
a = max(a, cnt);
m++;
p[m].second = ss[i];
cnt = 1;
} else {
cnt++;
}
}
p[m].first = cnt;
a = max(a, cnt);
rep(i, m + 1) {
if (p[i].first == a) {
cout << p[i].second << endl;
}
}
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int n, m = 0, a = 0, aa[110000], cnt = 0;
pair<int, string> p[220000];
string s, ss[220000];
char c;
signed main() {
cin >> n;
rep(i, n) { cin >> ss[i]; }
sort(ss, ss + n);
rep(i, n) {
if (p[m].second != ss[i]) {
p[m].first = cnt;
a = max(a, cnt);
m++;
p[m].second = ss[i];
cnt = 1;
} else {
cnt++;
}
}
p[m].first = cnt;
a = max(a, cnt);
rep(i, m + 1) {
if (p[i].first == a) {
cout << p[i].second << endl;
}
}
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
// #define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define GOODBYE \
do { \
cout << "0" << endl; \
return 0; \
} while (false)
#define MM << " " <<
#define Endl endl
signed main(void) {
int N;
string S[114514];
cin >> N;
REP(i, N) { cin >> S[i]; }
sort(S, S + N);
map<string, int> M;
REP(i, N) { M[S[i]]++; }
int mx = 0;
REP(i, N) { mx = max(mx, M[S[i]]); }
REP(i, N) {
if (M[S[i]] == mx) {
M[S[i]] = 0;
cout << S[i] << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
// #define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define GOODBYE \
do { \
cout << "0" << endl; \
return 0; \
} while (false)
#define MM << " " <<
#define Endl endl
signed main(void) {
int N;
string S[214514];
cin >> N;
REP(i, N) { cin >> S[i]; }
sort(S, S + N);
map<string, int> M;
REP(i, N) { M[S[i]]++; }
int mx = 0;
REP(i, N) { mx = max(mx, M[S[i]]); }
REP(i, N) {
if (M[S[i]] == mx) {
M[S[i]] = 0;
cout << S[i] << endl;
}
}
return 0;
}
| replace | 24 | 25 | 24 | 25 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n;
string s[N];
map<string, int> mp;
int main() {
cin >> n;
int ma = 0;
for (int i = 1; i <= n; i++) {
cin >> s[i];
mp[s[i]]++;
ma = max(ma, mp[s[i]]);
}
for (auto it = mp.begin(); it != mp.end(); it++) {
if (it->second == ma)
cout << it->first << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int n;
string s[N];
map<string, int> mp;
int main() {
cin >> n;
int ma = 0;
for (int i = 1; i <= n; i++) {
cin >> s[i];
mp[s[i]]++;
ma = max(ma, mp[s[i]]);
}
for (auto it = mp.begin(); it != mp.end(); it++) {
if (it->second == ma)
cout << it->first << endl;
}
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02773 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < int(vec.size()); i++) {
cout << vec[i] << " ";
}
return;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table.at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < int(table.size()); i++) {
for (int j = 0; j < int(table.at(0).size()); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n, r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) { return comb(n + r - 1, n - 1); }
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool isprime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
vector<long long> divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
res.push_back(N / i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
/*long long N;
cin >> N;
vector<long long> res = divisors(N);
for (int i = 0; i < res.size(); ++i) {
cout << res[i] << " ";
}
cout << endl;*/
}
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
void Yes(bool f) {
if (f) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
void YES(bool f) {
if (f) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
bool leapyear(int y) {
// 閏年かどうかを判定
if (y % 4 == 0) {
if (y % 100 == 0) {
if (y % 400 == 0) {
return true;
} else {
return false;
}
} else {
return true;
}
} else {
return false;
}
}
tuple<int, int, int> dayplus(int y, int m, int d) {
// 次の日を返す
// 31日まである月
if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12) {
if (d != 31) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
if (m == 12) {
m = 1;
y++;
return make_tuple(y, m, d);
} else {
m++;
return make_tuple(y, m, d);
}
}
}
// 30日まである月
else if (m == 4 || m == 6 || m == 9 || m == 11) {
if (d != 30) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
// 2月
else {
// 閏年の場合
if (leapyear(y)) {
if (d != 29) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
// 閏年ではない場合
else {
if (d != 28) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
}
}
tuple<int, int, int> monplus(int y, int m, int d) {
// 月を一つ先に、日を一日にする
d = 1;
if (m == 12) {
m = 1;
y++;
return make_tuple(y, m, d);
} else {
m++;
return make_tuple(y, m, d);
}
}
bool in(vector<int> a, int x) {
if (find(a.begin(), a.end(), x) != a.end()) {
return true;
} else {
return false;
}
}
bool inmap(map<string, int> mp, string s) {
if (mp.find(s) != mp.end()) {
return true;
} else {
return false;
}
}
int count_bool(vector<bool> flag) {
int count = 0;
for (int i = 0; i < int(flag.size()); i++) {
if (flag[i]) {
count++;
}
}
return count;
}
int main() {
map<string, int> vote;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (inmap(vote, s)) {
vote[s]++;
} else {
vote[s] = 0;
}
}
int ma = 0;
for (auto i = vote.begin(); i != vote.end(); i++) {
if (i->second > ma) {
ma = i->second;
}
}
for (auto i = vote.begin(); i != vote.end(); i++) {
if (i->second == ma) {
cout << i->first << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < int(vec.size()); i++) {
cout << vec[i] << " ";
}
return;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table.at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < int(table.size()); i++) {
for (int j = 0; j < int(table.at(0).size()); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n, r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) { return comb(n + r - 1, n - 1); }
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool isprime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
vector<long long> divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
res.push_back(N / i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
/*long long N;
cin >> N;
vector<long long> res = divisors(N);
for (int i = 0; i < res.size(); ++i) {
cout << res[i] << " ";
}
cout << endl;*/
}
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
void Yes(bool f) {
if (f) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
void YES(bool f) {
if (f) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
bool leapyear(int y) {
// 閏年かどうかを判定
if (y % 4 == 0) {
if (y % 100 == 0) {
if (y % 400 == 0) {
return true;
} else {
return false;
}
} else {
return true;
}
} else {
return false;
}
}
tuple<int, int, int> dayplus(int y, int m, int d) {
// 次の日を返す
// 31日まである月
if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12) {
if (d != 31) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
if (m == 12) {
m = 1;
y++;
return make_tuple(y, m, d);
} else {
m++;
return make_tuple(y, m, d);
}
}
}
// 30日まである月
else if (m == 4 || m == 6 || m == 9 || m == 11) {
if (d != 30) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
// 2月
else {
// 閏年の場合
if (leapyear(y)) {
if (d != 29) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
// 閏年ではない場合
else {
if (d != 28) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
}
}
tuple<int, int, int> monplus(int y, int m, int d) {
// 月を一つ先に、日を一日にする
d = 1;
if (m == 12) {
m = 1;
y++;
return make_tuple(y, m, d);
} else {
m++;
return make_tuple(y, m, d);
}
}
bool in(vector<int> a, int x) {
if (find(a.begin(), a.end(), x) != a.end()) {
return true;
} else {
return false;
}
}
bool inmap(map<string, int> mp, string s) {
if (mp.find(s) != mp.end()) {
return true;
} else {
return false;
}
}
int count_bool(vector<bool> flag) {
int count = 0;
for (int i = 0; i < int(flag.size()); i++) {
if (flag[i]) {
count++;
}
}
return count;
}
int main() {
map<string, int> vote;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
vote[s]++;
}
int ma = 0;
for (auto i = vote.begin(); i != vote.end(); i++) {
if (i->second > ma) {
ma = i->second;
}
}
for (auto i = vote.begin(); i != vote.end(); i++) {
if (i->second == ma) {
cout << i->first << endl;
}
}
} | replace | 261 | 266 | 261 | 262 | TLE | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
x = 0;
char c = getchar();
while (!isdigit(c))
c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
}
map<string, int> mp;
set<pair<int, string>> s;
string tp[1005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> tp[i], ++mp[tp[i]];
for (int i = 1; i <= n; ++i)
s.insert(make_pair(-mp[tp[i]], tp[i]));
int num = (*s.begin()).first;
for (auto it = s.begin(); it != s.end(); ++it) {
if ((*it).first != num)
break;
cout << (*it).second << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
x = 0;
char c = getchar();
while (!isdigit(c))
c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
}
map<string, int> mp;
set<pair<int, string>> s;
string tp[200005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> tp[i], ++mp[tp[i]];
for (int i = 1; i <= n; ++i)
s.insert(make_pair(-mp[tp[i]], tp[i]));
int num = (*s.begin()).first;
for (auto it = s.begin(); it != s.end(); ++it) {
if ((*it).first != num)
break;
cout << (*it).second << endl;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define INF 0x3f3f3f3f;
using namespace std;
string s[200005];
bool cmp(string a, string b) { return a.compare(b) < 1; }
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n, cmp);
int m = 1, cnt = 1;
for (i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0)
cnt++;
else
cnt = 1;
m = max(cnt, m);
}
cnt = 1;
if (m == 1)
cout << s[0] << endl;
for (i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0)
cnt++;
else
cnt = 1;
if (cnt == m)
cout << s[i] << endl;
}
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define INF 0x3f3f3f3f;
using namespace std;
string s[200005];
bool cmp(string a, string b) { return a.compare(b) < 0; }
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n, cmp);
int m = 1, cnt = 1;
for (i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0)
cnt++;
else
cnt = 1;
m = max(cnt, m);
}
cnt = 1;
if (m == 1)
cout << s[0] << endl;
for (i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0)
cnt++;
else
cnt = 1;
if (cnt == m)
cout << s[i] << endl;
}
} | replace | 11 | 12 | 11 | 13 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long s = 0, w = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
s = s * 10 + ch - '0';
ch = getchar();
}
return s * w;
}
const int MAX_N = 1e5 + 10;
map<string, int> pq;
struct xcj {
string nam;
int num;
} q[MAX_N];
int n, cnt;
bool cmp(xcj x, xcj y) {
if (x.num != y.num) {
return x.num > y.num;
}
return x.nam < y.nam;
}
int main() {
n = read();
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
if (pq[s] == 0) {
cnt++;
q[cnt].nam = s;
}
pq[s]++;
}
for (int i = 1; i <= cnt; i++) {
q[i].num = pq[q[i].nam];
}
sort(q + 1, q + 1 + cnt, cmp);
int Max = q[1].num;
for (int i = 1; i <= cnt; i++) {
if (q[i].num < Max) {
break;
}
cout << q[i].nam << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long s = 0, w = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
s = s * 10 + ch - '0';
ch = getchar();
}
return s * w;
}
const int MAX_N = 1e6;
map<string, int> pq;
struct xcj {
string nam;
int num;
} q[MAX_N];
int n, cnt;
bool cmp(xcj x, xcj y) {
if (x.num != y.num) {
return x.num > y.num;
}
return x.nam < y.nam;
}
int main() {
n = read();
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
if (pq[s] == 0) {
cnt++;
q[cnt].nam = s;
}
pq[s]++;
}
for (int i = 1; i <= cnt; i++) {
q[i].num = pq[q[i].nam];
}
sort(q + 1, q + 1 + cnt, cmp);
int Max = q[1].num;
for (int i = 1; i <= cnt; i++) {
if (q[i].num < Max) {
break;
}
cout << q[i].nam << endl;
}
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
string word;
vector<string> v1;
vector<string> v2;
vector<int> c1;
for (int i = 0; i < N; i++) {
cin >> word;
v1.push_back(word);
}
sort(v1.begin(), v1.end());
int count = 0;
int maxlen = 0;
for (int i = 0; i < N; i++) {
if (v1[i] != v1[i + 1]) {
if (maxlen < count)
maxlen = count;
v2.push_back(v1[i]);
c1.push_back(count);
count = 0;
} else {
count++;
}
}
for (int i = 0; i < c1.size(); i++) {
if (c1[i] == maxlen) {
cout << v2[i] << endl;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
string word;
vector<string> v1;
vector<string> v2;
vector<int> c1;
for (int i = 0; i < N; i++) {
cin >> word;
v1.push_back(word);
}
sort(v1.begin(), v1.end());
int count = 0;
int maxlen = 0;
for (int i = 0; i < N; i++) {
if (v1[i] != v1[i + 1]) {
if (maxlen < count)
maxlen = count;
v2.push_back(v1[i]);
c1.push_back(count);
count = 0;
} else {
count++;
}
}
for (int i = 0; i < c1.size(); i++) {
if (c1[i] == maxlen) {
cout << v2[i] << endl;
}
}
return 0;
} | delete | 45 | 46 | 45 | 45 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constexpr int INF = 1000000007;
const int 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;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
//----------------------------------------------------------------
int main() {
map<string, int> dict;
int n;
cin >> n;
vector<string> a(n);
int ans = -INF;
int i = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
dict[a[i]]++;
chmax(ans, dict[a[i]]);
}
vector<string> out;
int j = 0;
for (int i = 0; i < n; i++) {
if (dict[a[i]] == ans) {
out.push_back(a[i]);
}
}
sort(out.begin(), out.end());
out.push_back("{{{{{");
for (int i = 0; i < out.size(); i++) {
if (out[i] != out[i + 1]) {
cout << out[i] << endl;
}
}
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constexpr int INF = 1000000007;
const int 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;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
//----------------------------------------------------------------
int main() {
map<string, int> dict;
int n;
cin >> n;
vector<string> a(n);
int ans = -INF;
int i = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
dict[a[i]]++;
chmax(ans, dict[a[i]]);
}
vector<string> out;
int j = 0;
for (int i = 0; i < n; i++) {
if (dict[a[i]] == ans) {
out.push_back(a[i]);
}
}
sort(out.begin(), out.end());
out.push_back("{{{{{");
for (int i = 0; i < out.size() - 1; i++) {
if (out[i] != out[i + 1]) {
cout << out[i] << endl;
}
}
} | replace | 67 | 68 | 67 | 68 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<string> vec(N);
for (ll i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
ll a = 0;
vector<ll> veco(1);
vector<string> ve(1);
ve.at(0) = vec.at(0);
for (ll i = 1; i < N; i++) {
if (vec.at(i - 1) == vec.at(i)) {
veco.at(veco.size() - 1) += 1;
a = max(veco.at(veco.size() - 1), a);
} else {
veco.push_back(0);
ve.push_back(vec.at(i));
}
}
vector<string> result(0);
for (ll i = 0; i < N; i++) {
if (veco.at(i) == a) {
result.push_back(ve.at(i));
}
}
sort(result.begin(), result.end());
for (ll i = 0; i < result.size(); i++) {
cout << result.at(i) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<string> vec(N);
for (ll i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
ll a = 0;
vector<ll> veco(1);
vector<string> ve(1);
ve.at(0) = vec.at(0);
for (ll i = 1; i < N; i++) {
if (vec.at(i - 1) == vec.at(i)) {
veco.at(veco.size() - 1) += 1;
a = max(veco.at(veco.size() - 1), a);
} else {
veco.push_back(0);
ve.push_back(vec.at(i));
}
}
vector<string> result(0);
for (ll i = 0; i < veco.size(); i++) {
if (veco.at(i) == a) {
result.push_back(ve.at(i));
}
}
sort(result.begin(), result.end());
for (ll i = 0; i < result.size(); i++) {
cout << result.at(i) << endl;
}
} | replace | 25 | 26 | 25 | 26 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ios::sync_with_stdio(false);
int n;
cin >> n;
string arr[n];
int i = 0;
int j = 0;
int max = 0;
string winner[n + 1];
int count = 1;
while (i < n)
cin >> arr[i++];
sort(arr, arr + n);
arr[n] = "";
i = 1;
while (i <= n) {
if (arr[i - 1] == arr[i])
count++;
else
count = 1;
if (count >= max) {
if (count > max)
j = 0;
max = count;
winner[j] = arr[i - 1];
winner[++j] = "";
}
i++;
}
i = 0;
while (winner[i] != "")
cout << winner[i++] << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ios::sync_with_stdio(false);
int n;
cin >> n;
string arr[n + 1];
int i = 0;
int j = 0;
int max = 0;
string winner[n + 1];
int count = 1;
while (i < n)
cin >> arr[i++];
sort(arr, arr + n);
arr[n] = "";
i = 1;
while (i <= n) {
if (arr[i - 1] == arr[i])
count++;
else
count = 1;
if (count >= max) {
if (count > max)
j = 0;
max = count;
winner[j] = arr[i - 1];
winner[++j] = "";
}
i++;
}
i = 0;
while (winner[i] != "")
cout << winner[i++] << '\n';
}
| replace | 8 | 9 | 8 | 9 | -11 | |
p02773 | 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;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<string> s(n);
vector<pair<int, string>> a;
rep(i, n) { cin >> s[i]; }
sort(s.begin(), s.end());
int cnt = 1, cntmax = 1;
rep(i, n) {
if (s[i] == s[i + 1])
cnt++;
else {
pair<int, string> p = make_pair(cnt, s[i]);
a.push_back(p);
cntmax = max(cnt, cntmax);
cnt = 1;
}
}
sort(a.begin(), a.end());
rep(i, a.size()) {
if (a[i].first == cntmax)
cout << a[i].second << endl;
}
} | #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;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<string> s(n);
vector<pair<int, string>> a;
rep(i, n) { cin >> s[i]; }
sort(s.begin(), s.end());
s.push_back(" ");
int cnt = 1, cntmax = 1;
rep(i, n) {
if (s[i] == s[i + 1])
cnt++;
else {
pair<int, string> p = make_pair(cnt, s[i]);
a.push_back(p);
cntmax = max(cnt, cntmax);
cnt = 1;
}
}
sort(a.begin(), a.end());
rep(i, a.size()) {
if (a[i].first == cntmax)
cout << a[i].second << endl;
}
}
| insert | 14 | 14 | 14 | 16 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using namespace std;
using vi = vector<int64_t>;
using vvi = vector<vi>;
bool func(pair<int64_t, string> a, pair<int64_t, string> b) {
if (a.first > b.first) {
return true;
} else if (a.first == b.first) {
return a.second < b.second;
} else {
return false;
}
}
int main(int argc, const char *argv[]) {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
int64_t n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
sort(s.begin(), s.end());
vector<pair<int64_t, string>> pair;
pair.push_back(make_pair(1, s.at(0)));
for (int64_t i = 0; i < n - 1; i++) {
if (s.at(i + 1) == s.at(i)) {
pair.at(pair.size() - 1).first++;
} else {
pair.push_back(make_pair(1, s.at(i + 1)));
}
}
sort(pair.begin(), pair.end(), func);
rep(i, pair.size()) {
cout << pair.at(i).second << endl;
if (i == n - 1)
break;
if (pair.at(i + 1).first < pair.at(i).first)
break;
}
}
| #include <algorithm>
#include <bitset>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using namespace std;
using vi = vector<int64_t>;
using vvi = vector<vi>;
bool func(pair<int64_t, string> a, pair<int64_t, string> b) {
if (a.first > b.first) {
return true;
} else if (a.first == b.first) {
return a.second < b.second;
} else {
return false;
}
}
int main(int argc, const char *argv[]) {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
int64_t n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
sort(s.begin(), s.end());
vector<pair<int64_t, string>> pair;
pair.push_back(make_pair(1, s.at(0)));
for (int64_t i = 0; i < n - 1; i++) {
if (s.at(i + 1) == s.at(i)) {
pair.at(pair.size() - 1).first++;
} else {
pair.push_back(make_pair(1, s.at(i + 1)));
}
}
sort(pair.begin(), pair.end(), func);
rep(i, pair.size()) {
cout << pair.at(i).second << endl;
if (i == pair.size() - 1)
break;
if (pair.at(i + 1).first < pair.at(i).first)
break;
}
}
| replace | 52 | 53 | 52 | 53 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rb(a, b, c) for (int a = b; a <= c; a++)
#define rl(a, b, c) for (int a = b; a >= c; a--)
#define vbe(v) v.begin()
#define ven(v) v.end()
#define all(v) v.begin(), v.end()
#define ll long long
#define vi vector<int>
#define vf vector<float>
#define vd vector<double>
#define vs vector<string>
#define vl vector<long>
#define PB push_back
#define POB pop_back
using namespace std;
const int INF = 1e9, MOD = 1e9 + 7;
int main() {
ll n, max = 0;
string s;
cin >> n;
vs S;
map<string, ll> mp;
rep(i, n) {
cin >> s;
if (mp[s] == 0)
S.PB(s);
mp[s] += 1;
if (max < mp[s])
max = mp[s];
}
rep(i, n) {
if (max == mp[S[i]])
cout << S[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rb(a, b, c) for (int a = b; a <= c; a++)
#define rl(a, b, c) for (int a = b; a >= c; a--)
#define vbe(v) v.begin()
#define ven(v) v.end()
#define all(v) v.begin(), v.end()
#define ll long long
#define vi vector<int>
#define vf vector<float>
#define vd vector<double>
#define vs vector<string>
#define vl vector<long>
#define PB push_back
#define POB pop_back
using namespace std;
const int INF = 1e9, MOD = 1e9 + 7;
int main() {
ll n, max = 0;
string s;
cin >> n;
vs S;
map<string, ll> mp;
rep(i, n) {
cin >> s;
if (mp[s] == 0)
S.PB(s);
mp[s] += 1;
if (max < mp[s])
max = mp[s];
}
sort(all(S));
rep(i, S.size()) {
if (max == mp[S[i]])
cout << S[i] << endl;
}
return 0;
} | replace | 33 | 34 | 33 | 35 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <map>
#include <string.h>
char s1[100000][15];
int main() {
ll test, i, j = 0, k, m;
map<string, ll> mp;
cin >> k;
for (i = 0; i < k; i++) {
cin >> s1[i];
mp[s1[i]]++;
}
ll mx = 0;
for (i = 0; i < k; i++) {
mx = max(mx, mp[s1[i]]);
}
set<string> st;
ll cnt = 0;
for (i = 0; i < k; i++) {
if (mp[s1[i]] == mx) {
st.insert(s1[i]);
}
}
set<string>::iterator it;
string c;
for (it = st.begin(); it != st.end(); it++) {
c = *it;
cout << c << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <map>
#include <string.h>
char s1[300000][15];
int main() {
ll test, i, j = 0, k, m;
map<string, ll> mp;
cin >> k;
for (i = 0; i < k; i++) {
cin >> s1[i];
mp[s1[i]]++;
}
ll mx = 0;
for (i = 0; i < k; i++) {
mx = max(mx, mp[s1[i]]);
}
set<string> st;
ll cnt = 0;
for (i = 0; i < k; i++) {
if (mp[s1[i]] == mx) {
st.insert(s1[i]);
}
}
set<string>::iterator it;
string c;
for (it = st.begin(); it != st.end(); it++) {
c = *it;
cout << c << endl;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s[200000], a[20000];
int num[200000];
for (int i = 0; i < n; i++) {
cin >> s[i];
num[i] = 0;
}
sort(s, s + n);
int j = 0;
for (int i = 0; i < n; i++) {
if (i == 0) {
a[j] = s[i];
num[j] += 1;
} else if (s[i] == s[i - 1]) {
num[j] += 1;
} else {
j++;
a[j] = s[i];
num[j] += 1;
}
}
j++;
// cout<<j;
int max = *max_element(num, num + j);
for (int i = 0; i < j; i++) {
// cout<<num[i]<<a[i];
if (num[i] == max) {
cout << a[i] << endl;
}
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s[200000], a[200000];
int num[200000];
for (int i = 0; i < n; i++) {
cin >> s[i];
num[i] = 0;
}
sort(s, s + n);
int j = 0;
for (int i = 0; i < n; i++) {
if (i == 0) {
a[j] = s[i];
num[j] += 1;
} else if (s[i] == s[i - 1]) {
num[j] += 1;
} else {
j++;
a[j] = s[i];
num[j] += 1;
}
}
j++;
// cout<<j;
int max = *max_element(num, num + j);
for (int i = 0; i < j; i++) {
// cout<<num[i]<<a[i];
if (num[i] == max) {
cout << a[i] << endl;
}
}
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define reprev(i, n) for (int i = (n - 1LL); i >= 0; --i)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef long double ld;
typedef pair<int, string> PP;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
map<string, int> m;
rep(i, n) {
string s;
cin >> s;
m[s]++;
}
string ans;
vector<PP> sm;
for (auto i : m) {
sm.emplace_back(i.second, i.first);
}
sort(all(sm), [](PP a, PP b) {
if (a.first != b.first)
return a.first > b.first;
else
a.second < b.second;
});
int best = sm[0].first;
for (auto p : sm) {
if (best == p.first)
cout << p.second << "\n";
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define reprev(i, n) for (int i = (n - 1LL); i >= 0; --i)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef long double ld;
typedef pair<int, string> PP;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
map<string, int> m;
rep(i, n) {
string s;
cin >> s;
m[s]++;
}
int best = 0;
for (auto i : m)
chmax(best, i.second);
vector<string> ans;
for (auto i : m)
if (i.second == best)
ans.push_back(i.first);
sort(all(ans));
for (string i : ans)
cout << i << "\n";
return 0;
} | replace | 66 | 82 | 66 | 76 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
using namespace std;
typedef long long ll;
ll ans;
ll N;
string S[20005];
vector<ll> A;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
sort(S, S + N);
int cnt = 1;
int cntm = 0;
string a = S[0];
for (int i = 1; i < N; i++) {
if (S[i] == a) {
cnt += 1;
} else {
if (cnt > cntm) {
A = {i - 1};
cntm = cnt;
} else if (cnt == cntm) {
A.push_back(i - 1);
}
a = S[i];
cnt = 1;
}
}
if (cnt > cntm) {
A = {N - 1};
cntm = cnt;
} else if (cnt == cntm) {
A.push_back(N - 1);
}
int M = A.size();
for (int i = 0; i < M; i++) {
cout << S[A[i]] << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
using namespace std;
typedef long long ll;
ll ans;
ll N;
string S[200005];
vector<ll> A;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
sort(S, S + N);
int cnt = 1;
int cntm = 0;
string a = S[0];
for (int i = 1; i < N; i++) {
if (S[i] == a) {
cnt += 1;
} else {
if (cnt > cntm) {
A = {i - 1};
cntm = cnt;
} else if (cnt == cntm) {
A.push_back(i - 1);
}
a = S[i];
cnt = 1;
}
}
if (cnt > cntm) {
A = {N - 1};
cntm = cnt;
} else if (cnt == cntm) {
A.push_back(N - 1);
}
int M = A.size();
for (int i = 0; i < M; i++) {
cout << S[A[i]] << endl;
}
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02773 | C++ | Runtime Error | // #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define String std::string
#define fi first
#define se second
#define mp std::make_pair
#define Pair std::pair<int, int>
#define Map std::map<int, int>
#define Vector std::vector<int>
using std::cin;
using std::cout;
using std::endl;
typedef long long ll;
typedef unsigned long long ull;
const int N = 100000 + 5;
const int M = 1000 + 5;
const int K = 1e7 + 5;
const int MOD = 1e9 + 7;
const int inv2 = 500000004;
const int LOG = 40;
const ull BASE = 19260817;
const int dx[] = {0, 1, -1, 0, 1, -1, 1, -1};
const int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
const double PI = acos(-1);
template <class T> inline T readT() {
T res = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
res = (res << 1) + (res << 3) + ch - '0';
return res * f;
}
#define read readT<int>
struct Edge {
int u, v, w;
bool operator<(const Edge &other) const { return w < other.w; }
} e[N];
std::map<String, int> map;
int end, n;
std::pair<int, String> a[N];
inline bool cmp(const std::pair<int, String> &a,
const std::pair<int, String> &b) {
if (a.fi != b.fi)
return a.fi > b.fi;
else
return a.se < b.se;
}
int main() {
std::ios::sync_with_stdio(false);
// scanf("%d", &n);
cin >> n;
for (int i = 1; i <= n; i++) {
String tmp;
cin >> tmp;
if (!map.count(tmp)) {
map[tmp] = ++end;
a[map[tmp]].se = tmp;
a[map[tmp]].fi = 1;
} else {
a[map[tmp]].fi++;
}
}
std::sort(a + 1, a + end + 1, cmp);
int max = a[1].fi;
for (int i = 1; i <= end; i++) {
if (a[i].fi != max)
break;
cout << a[i].se << endl;
}
return 0;
} | // #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define String std::string
#define fi first
#define se second
#define mp std::make_pair
#define Pair std::pair<int, int>
#define Map std::map<int, int>
#define Vector std::vector<int>
using std::cin;
using std::cout;
using std::endl;
typedef long long ll;
typedef unsigned long long ull;
const int N = 100000 + 5;
const int M = 1000 + 5;
const int K = 1e7 + 5;
const int MOD = 1e9 + 7;
const int inv2 = 500000004;
const int LOG = 40;
const ull BASE = 19260817;
const int dx[] = {0, 1, -1, 0, 1, -1, 1, -1};
const int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
const double PI = acos(-1);
template <class T> inline T readT() {
T res = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
res = (res << 1) + (res << 3) + ch - '0';
return res * f;
}
#define read readT<int>
struct Edge {
int u, v, w;
bool operator<(const Edge &other) const { return w < other.w; }
} e[N];
std::map<String, int> map;
int end, n;
std::pair<int, String> a[N * 2];
inline bool cmp(const std::pair<int, String> &a,
const std::pair<int, String> &b) {
if (a.fi != b.fi)
return a.fi > b.fi;
else
return a.se < b.se;
}
int main() {
std::ios::sync_with_stdio(false);
// scanf("%d", &n);
cin >> n;
for (int i = 1; i <= n; i++) {
String tmp;
cin >> tmp;
if (!map.count(tmp)) {
map[tmp] = ++end;
a[map[tmp]].se = tmp;
a[map[tmp]].fi = 1;
} else {
a[map[tmp]].fi++;
}
}
std::sort(a + 1, a + end + 1, cmp);
int max = a[1].fi;
for (int i = 1; i <= end; i++) {
if (a[i].fi != max)
break;
cout << a[i].se << endl;
}
return 0;
} | replace | 47 | 48 | 47 | 48 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
map<string, int> d;
string a[100010];
set<string> q;
int n, j, maxn;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
string x;
cin >> x;
if (q.count(x) == 0)
a[++j] = x;
q.insert(a[j]);
d[x]++;
maxn = max(d[x], maxn);
}
sort(a + 1, a + j + 1);
for (int i = 1; i <= j; i++) {
if (d[a[i]] == maxn) {
cout << a[i] << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
map<string, int> d;
string a[1000010];
set<string> q;
int n, j, maxn;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
string x;
cin >> x;
if (q.count(x) == 0)
a[++j] = x;
q.insert(a[j]);
d[x]++;
maxn = max(d[x], maxn);
}
sort(a + 1, a + j + 1);
for (int i = 1; i <= j; i++) {
if (d[a[i]] == maxn) {
cout << a[i] << endl;
}
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02773 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
void sort(int n, string *a) {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
string temp;
temp = a[j];
a[j] = a[i];
a[i] = temp;
}
}
}
return;
}
int main() {
int n;
cin >> n;
string a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(n, a);
int counter = 1;
int temp_counter = 1;
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1]) {
temp_counter++;
if (i == n - 2 && temp_counter > counter) {
counter = temp_counter;
}
} else {
if (temp_counter > counter) {
counter = temp_counter;
}
temp_counter = 1;
}
}
temp_counter = 1;
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1]) {
temp_counter++;
} else {
temp_counter = 1;
}
if (temp_counter == counter) {
cout << a[i] << endl;
}
}
if (counter == 1) {
cout << a[n - 1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void sort(int n, string *a) {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
string temp;
temp = a[j];
a[j] = a[i];
a[i] = temp;
}
}
}
return;
}
int main() {
int n;
cin >> n;
string a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
std::sort(a, a + n);
int counter = 1;
int temp_counter = 1;
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1]) {
temp_counter++;
if (i == n - 2 && temp_counter > counter) {
counter = temp_counter;
}
} else {
if (temp_counter > counter) {
counter = temp_counter;
}
temp_counter = 1;
}
}
temp_counter = 1;
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1]) {
temp_counter++;
} else {
temp_counter = 1;
}
if (temp_counter == counter) {
cout << a[i] << endl;
}
}
if (counter == 1) {
cout << a[n - 1] << endl;
}
return 0;
} | replace | 26 | 27 | 26 | 27 | TLE | |
p02773 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iostream>
#include <string>
#include <unordered_map>
int main(void) {
int n;
std::cin >> n;
std::unordered_map<std::string, int> mapCount;
std::string name;
int maxNumber = 0;
for (int count = 0; n > count; ++n) {
std::cin >> name;
int &c = mapCount[name];
c += 1;
maxNumber = (std::max)(maxNumber, c);
}
std::deque<std::string> nameList;
for (const std::pair<const std::string, int> &nameToCount : mapCount) {
if (maxNumber != nameToCount.second) {
continue;
}
nameList.emplace_back(nameToCount.first);
}
std::sort(nameList.begin(), nameList.end());
for (const std::string &s : nameList) {
std::cout << s << std::endl;
}
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <string>
#include <unordered_map>
int main(void) {
int n;
std::cin >> n;
std::unordered_map<std::string, int> mapCount;
std::string name;
int maxNumber = 0;
for (int count = 0; n > count; ++count) {
std::cin >> name;
int &c = mapCount[name];
c += 1;
maxNumber = (std::max)(maxNumber, c);
}
std::deque<std::string> nameList;
for (const std::pair<const std::string, int> &nameToCount : mapCount) {
if (maxNumber != nameToCount.second) {
continue;
}
nameList.emplace_back(nameToCount.first);
}
std::sort(nameList.begin(), nameList.end());
for (const std::string &s : nameList) {
std::cout << s << std::endl;
}
} | replace | 13 | 14 | 13 | 14 | TLE | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
const int maxn = 1e5 + 10;
string ans[maxn];
int let = 0, rigt = 0;
int main() {
int n, m = 0;
cin >> n;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
if (!mp[s])
mp[s] = 1;
else
mp[s]++;
if (mp[s] > m) {
m = mp[s];
ans[rigt] = s;
let = rigt;
rigt++;
} else if (mp[s] == m) {
ans[rigt] = s;
rigt++;
}
// cout<<s<<" "<<mp[s]<<endl;
}
sort(ans + let, ans + rigt);
for (int i = let; i < rigt; i++)
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
const int maxn = 2e5 + 10;
string ans[maxn];
int let = 0, rigt = 0;
int main() {
int n, m = 0;
cin >> n;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
if (!mp[s])
mp[s] = 1;
else
mp[s]++;
if (mp[s] > m) {
m = mp[s];
ans[rigt] = s;
let = rigt;
rigt++;
} else if (mp[s] == m) {
ans[rigt] = s;
rigt++;
}
// cout<<s<<" "<<mp[s]<<endl;
}
sort(ans + let, ans + rigt);
for (int i = let; i < rigt; i++)
cout << ans[i] << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02773 | C++ | Runtime Error | #include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
for (int i = 0; i < N; i++) {
cin >> S[i];
}
std::map<string, int> map;
for (int i = 0; i < N; i++) {
auto iter = map.find((S[i]));
if (iter != map.end()) {
iter->second = iter->second + 1;
} else {
map.insert(make_pair(S[i], 1));
}
}
int max = 0;
for (auto iter = map.begin(); iter != map.end(); iter++) {
max = std::max(max, iter->second);
}
for (auto iter = map.begin(); iter != map.end(); iter++) {
if (iter->second == max) {
cout << iter->first << endl;
}
}
return 1;
} | #include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
for (int i = 0; i < N; i++) {
cin >> S[i];
}
std::map<string, int> map;
for (int i = 0; i < N; i++) {
auto iter = map.find((S[i]));
if (iter != map.end()) {
iter->second = iter->second + 1;
} else {
map.insert(make_pair(S[i], 1));
}
}
int max = 0;
for (auto iter = map.begin(); iter != map.end(); iter++) {
max = std::max(max, iter->second);
}
for (auto iter = map.begin(); iter != map.end(); iter++) {
if (iter->second == max) {
cout << iter->first << endl;
}
}
return 0;
} | replace | 33 | 34 | 33 | 34 | 1 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
int mx = 1, cnt = 1;
for (int i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0) {
cnt++;
} else {
mx = max(cnt, mx);
cnt = 1;
}
}
mx = max(cnt, mx);
cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0 || i == 0) {
cnt++;
} else {
mx = max(cnt, mx);
cnt = 1;
}
if (cnt == mx) {
cout << s[i] << "\n";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
int mx = 1, cnt = 1;
for (int i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0) {
cnt++;
} else {
mx = max(cnt, mx);
cnt = 1;
}
}
mx = max(cnt, mx);
cnt = 0;
for (int i = 0; i < n; i++) {
if (i == 0 || s[i].compare(s[i - 1]) == 0) {
cnt++;
} else {
mx = max(cnt, mx);
cnt = 1;
}
if (cnt == mx) {
cout << s[i] << "\n";
}
}
return 0;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p02773 | C++ | Runtime Error | //
// じょえチャンネル
// 高評価・チャンネル登録よろしくお願いします！
// https://www.youtube.com/watch?v=gPFr7q7eLL8
//
/*------------------------------------
∧＿∧
∧＿∧ （´<_｀ ）
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
-------------------------------------*/
#include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define Rep(i, n) for (ll i = 1; i <= n; ++i)
#define loop(i, m, n) for (ll i = m; i < n; ++i)
#define rev(i, n) for (ll i = n - 1; i >= 0; --i)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define pie 3.141592653589793238462643383279
#define elif else if
#define P pair<ll, ll>
#define prique priority_queue<ll>
#define all(a) (a).begin(), (a).end()
const int mod = 1000000007;
const int mod2 = 998244353;
const int inf = 1 << 30;
const int MOD = 1e9 + 7;
long long fac[510000], finv[510000], inv[510000];
long long MAX = 510000;
bool COMinited = false;
long long COM(int n, int k) {
if (COMinited == false) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
COMinited = true;
}
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long 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;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<1000000007>;
int bin(int bina) {
int ans = 0;
for (int i = 0; bina > 0; i++) {
ans = ans + (bina % 2) * pow(10, i);
bina = bina / 2;
}
return ans;
}
bool prime(int n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int jo(int x, int y) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x;
}
x = x * x;
y >>= 1;
}
return res;
}
int per(int n, int r) {
r = n - r;
int sum = 1;
int i;
for (i = n; i >= r + 1; i--)
sum *= i;
return sum;
}
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
void add(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
#define F first
#define S second
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;
}
// cout << fixed << setprecision(10) << num << endl;
string s[100010];
map<string, int> mp;
signed main() {
int n;
cin >> n;
rep(i, n) cin >> s[i];
rep(i, n) { mp[s[i]]++; }
int max = 0;
for (auto p : mp) {
if (p.second > max) {
max = p.second;
}
}
for (auto p : mp) {
if (p.second == max) {
cout << p.first << endl;
}
}
} | //
// じょえチャンネル
// 高評価・チャンネル登録よろしくお願いします！
// https://www.youtube.com/watch?v=gPFr7q7eLL8
//
/*------------------------------------
∧＿∧
∧＿∧ （´<_｀ ）
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
-------------------------------------*/
#include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define Rep(i, n) for (ll i = 1; i <= n; ++i)
#define loop(i, m, n) for (ll i = m; i < n; ++i)
#define rev(i, n) for (ll i = n - 1; i >= 0; --i)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define pie 3.141592653589793238462643383279
#define elif else if
#define P pair<ll, ll>
#define prique priority_queue<ll>
#define all(a) (a).begin(), (a).end()
const int mod = 1000000007;
const int mod2 = 998244353;
const int inf = 1 << 30;
const int MOD = 1e9 + 7;
long long fac[510000], finv[510000], inv[510000];
long long MAX = 510000;
bool COMinited = false;
long long COM(int n, int k) {
if (COMinited == false) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
COMinited = true;
}
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long 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;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<1000000007>;
int bin(int bina) {
int ans = 0;
for (int i = 0; bina > 0; i++) {
ans = ans + (bina % 2) * pow(10, i);
bina = bina / 2;
}
return ans;
}
bool prime(int n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int jo(int x, int y) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x;
}
x = x * x;
y >>= 1;
}
return res;
}
int per(int n, int r) {
r = n - r;
int sum = 1;
int i;
for (i = n; i >= r + 1; i--)
sum *= i;
return sum;
}
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
void add(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
#define F first
#define S second
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;
}
// cout << fixed << setprecision(10) << num << endl;
string s[200010];
map<string, int> mp;
signed main() {
int n;
cin >> n;
rep(i, n) cin >> s[i];
rep(i, n) { mp[s[i]]++; }
int max = 0;
for (auto p : mp) {
if (p.second > max) {
max = p.second;
}
}
for (auto p : mp) {
if (p.second == max) {
cout << p.first << endl;
}
}
} | replace | 262 | 263 | 262 | 263 | 0 | |
p02773 | C++ | Runtime Error | //
#include <iostream>
#include <list>
#include <map>
using namespace std;
int main(int argc, const char *argv[]) {
int N = 0;
int count = 0;
int resultCount = 0;
int nameSaveCount = 0;
string nameSave[1000] = {};
list<string> list = {};
string s = "";
map<string, int> result;
// 入力
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s;
list.push_front(s);
}
list.push_front("zzzzzzzzzzzzzzzzz");
list.sort();
string monitoringS = list.front();
// カウント処理
for (int i = 0; i < N + 1; i++) {
s = list.front();
list.pop_front();
if (monitoringS == s) {
count++;
} else {
nameSave[nameSaveCount] = monitoringS;
nameSaveCount++;
result[monitoringS] = count;
if (resultCount < count) {
resultCount = count;
}
count = 1;
monitoringS = s;
}
}
// 書かれた回数が多いものを出力する処理。
for (int i = 0; i < nameSaveCount; i++) {
if (resultCount == result[nameSave[i]]) {
cout << nameSave[i] + "\n";
}
}
return 0;
}
| //
#include <iostream>
#include <list>
#include <map>
using namespace std;
int main(int argc, const char *argv[]) {
int N = 0;
int count = 0;
int resultCount = 0;
int nameSaveCount = 0;
string nameSave[200000] = {};
list<string> list = {};
string s = "";
map<string, int> result;
// 入力
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s;
list.push_front(s);
}
list.push_front("zzzzzzzzzzzzzzzzz");
list.sort();
string monitoringS = list.front();
// カウント処理
for (int i = 0; i < N + 1; i++) {
s = list.front();
list.pop_front();
if (monitoringS == s) {
count++;
} else {
nameSave[nameSaveCount] = monitoringS;
nameSaveCount++;
result[monitoringS] = count;
if (resultCount < count) {
resultCount = count;
}
count = 1;
monitoringS = s;
}
}
// 書かれた回数が多いものを出力する処理。
for (int i = 0; i < nameSaveCount; i++) {
if (resultCount == result[nameSave[i]]) {
cout << nameSave[i] + "\n";
}
}
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02773 | C++ | Runtime Error | #include "algorithm"
#include "cmath"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int n;
cin >> n;
string s[2100];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
vector<pair<string, int>> p(0);
int check = 1;
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1]) {
check++;
} else {
p.push_back(make_pair(s[i - 1], check));
check = 1;
}
}
p.push_back(make_pair(s[n - 1], check));
int MAX = 0;
for (pair<string, int> q : p) {
MAX = max(MAX, q.second);
}
for (pair<string, int> q : p) {
if (q.second == MAX) {
cout << q.first << "\n";
}
}
} | #include "algorithm"
#include "cmath"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int n;
cin >> n;
string s[200100];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
vector<pair<string, int>> p(0);
int check = 1;
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1]) {
check++;
} else {
p.push_back(make_pair(s[i - 1], check));
check = 1;
}
}
p.push_back(make_pair(s[n - 1], check));
int MAX = 0;
for (pair<string, int> q : p) {
MAX = max(MAX, q.second);
}
for (pair<string, int> q : p) {
if (q.second == MAX) {
cout << q.first << "\n";
}
}
} | replace | 20 | 21 | 20 | 21 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
#define vector2(a, b, c) \
vector<vector<int>> a(b /*縦！w*/, vector<int>(c /*横！w*/))
#define INF 1e10
#define MOD 1e9 + 7
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;
}
using Graph = vector<vector<int>>;
signed main() {
int a;
cin >> a;
vector<string> b(a), g(a);
vector<pair<int, string>> c(a);
rep(i, a) cin >> b[i];
sort(all(b));
b.push_back(" ");
int d = 0;
int f = 0;
rep(i, a) {
d++;
if (b[i] != b[i + 1]) {
c[f].second = b[i];
c[f].first = d;
f++;
d = 0;
}
}
sort(all(c));
reverse(all(c));
int e = c[0].first;
int t = 0;
rep(i, a) {
if (c[i].first == e)
g[t] = c[i].second;
t++;
}
sort(all(g));
rep(i, t + 1) {
if (g[i] != "")
cout << g[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
#define vector2(a, b, c) \
vector<vector<int>> a(b /*縦！w*/, vector<int>(c /*横！w*/))
#define INF 1e10
#define MOD 1e9 + 7
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;
}
using Graph = vector<vector<int>>;
signed main() {
int a;
cin >> a;
vector<string> b(a), g(a);
vector<pair<int, string>> c(a);
rep(i, a) cin >> b[i];
sort(all(b));
b.push_back(" ");
int d = 0;
int f = 0;
rep(i, a) {
d++;
if (b[i] != b[i + 1]) {
c[f].second = b[i];
c[f].first = d;
f++;
d = 0;
}
}
sort(all(c));
reverse(all(c));
int e = c[0].first;
int t = 0;
rep(i, a) {
if (c[i].first == e)
g[t] = c[i].second;
t++;
}
sort(all(g));
rep(i, t) {
if (g[i] != "")
cout << g[i] << endl;
}
} | replace | 58 | 59 | 58 | 59 | -11 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
int main() {
int n;
cin >> n;
string a;
vector<string> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
int co[n];
co[0] = 0;
int p = -1;
rep1(i, n) {
if (v[i - 1] == v[i]) {
co[i] = 1 + co[i - 1];
} else {
co[i] = 0;
}
p = max(co[i], p);
}
rep(i, n) {
if (co[i] == p) {
cout << string(v[i]) << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
int main() {
int n;
cin >> n;
string a;
vector<string> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
int co[n];
co[0] = 0;
int p = -1;
rep11(i, n) {
if (v[i - 1] == v[i]) {
co[i] = 1 + co[i - 1];
} else {
co[i] = 0;
}
p = max(co[i], p);
}
rep(i, n) {
if (co[i] == p) {
cout << string(v[i]) << endl;
}
}
return 0;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int N;
cin >> N;
map<string, int> m;
m["fa"] = 0;
string s;
rep(i, N) {
cin >> s;
m[s]++;
}
priority_queue<pair<int, string>> pq;
pair<int, string> q;
for (auto p : m) {
auto k = p.first;
auto v = p.second;
q = make_pair(v, k);
pq.push(q);
}
q = pq.top();
pq.pop();
int w = pq.top().first;
stack<string> v;
v.push(q.second);
while (q.first == w) {
v.push(pq.top().second);
pq.pop();
w = pq.top().first;
}
string g;
while (v.empty() == 0) {
cout << v.top() << endl;
v.pop();
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int N;
cin >> N;
map<string, int> m;
m["fahigigiyfghgjhkjghfgdhgj"] = 0;
string s;
rep(i, N) {
cin >> s;
m[s]++;
}
priority_queue<pair<int, string>> pq;
pair<int, string> q;
for (auto p : m) {
auto k = p.first;
auto v = p.second;
q = make_pair(v, k);
pq.push(q);
}
q = pq.top();
pq.pop();
int w = pq.top().first;
stack<string> v;
v.push(q.second);
while (q.first == w) {
v.push(pq.top().second);
pq.pop();
w = pq.top().first;
}
string g;
while (v.empty() == 0) {
cout << v.top() << endl;
v.pop();
}
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02773 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
// #ifdef DEBUG
// #define _GLIBCXX_DEBUG
// #endif
// -Ofast
// -O3
// -O2
// -fsanitize=address
// -fsanitize=undefined
// add_compile_options()
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <random>
#include <unordered_map>
using namespace std;
// using namesparsace __gnu_pbds;
mt19937 rnd;
int solve();
int main() {
srand(time(0));
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
solve();
return 0;
}
int max(int a, int b) { return a > b ? a : b; }
const int maxN = 2e5 + 10;
int n, mx;
map<string, int> ma;
vector<string> a;
int solve() {
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
ma[s]++;
mx = max(mx, ma[s]);
}
for (auto it = ma.begin(); it != ma.end(); it++) {
if (it->second == mx) {
a.push_back(it->first);
}
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
cout << a[i] << '\n';
}
} | // #pragma GCC optimize("Ofast")
// #ifdef DEBUG
// #define _GLIBCXX_DEBUG
// #endif
// -Ofast
// -O3
// -O2
// -fsanitize=address
// -fsanitize=undefined
// add_compile_options()
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <random>
#include <unordered_map>
using namespace std;
// using namesparsace __gnu_pbds;
mt19937 rnd;
int solve();
int main() {
srand(time(0));
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
solve();
return 0;
}
int max(int a, int b) { return a > b ? a : b; }
const int maxN = 2e5 + 10;
int n, mx;
map<string, int> ma;
vector<string> a;
int solve() {
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
ma[s]++;
mx = max(mx, ma[s]);
}
for (auto it = ma.begin(); it != ma.end(); it++) {
if (it->second == mx) {
a.push_back(it->first);
}
}
sort(a.begin(), a.end());
for (int i = 0; i < a.size(); i++) {
cout << a[i] << '\n';
}
} | replace | 70 | 71 | 70 | 71 | 0 | |
p02773 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
static const int INF = 1000000007;
#define mp make_pair
#define sz(x) int(x.xise())
#define mod 1000000007
#define reps(i, s, n) for (int i = s; i < n; i++)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
deque<int> deq;
#define fi first
#define se second
// #define int long long
// cerrはコメントアウトしなくても通る//ただしTLEを引き起こすことがある
ll N, M, H, W, K, Q, A, B;
string S;
// const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
// const ll INF = 1LL << 60;
// typedef pair<ll,ll> P;
typedef pair<int, int> P;
bool chmx(int &a, int b) {
if (b > a) {
a = b;
return true;
}
return false;
}
bool chmn(int &a, int b) {
if (b < a) {
a = b;
return true;
}
return false;
}
vector<string> SS;
int main() {
int n;
cin >> n;
string s[n];
rep(i, n) {
cin >> s[i];
SS.push_back(s[i]);
}
sort(SS.begin(), SS.end());
cerr << endl;
rep(i, n) { cerr << SS[i] << endl; }
ll k = 0;
string kk = "-1";
vector<pair<ll, string>> PP;
rep(i, n) {
if (SS[i] == kk) {
k++;
if (i == n - 1) {
PP.push_back(mp(k, kk));
}
} else {
PP.push_back(mp(k, kk));
cerr << k << ' ' << kk << endl;
k = 1;
kk = SS[i];
if (i == n - 1) {
PP.push_back(mp(k, kk));
}
}
}
sort(PP.begin(), PP.end(), greater<pair<ll, string>>());
ll kkk = PP[0].first;
cerr << kkk << endl;
ll i = 0;
cerr << endl;
vector<string> SSS;
while (PP[i].first == kkk) {
SSS.push_back(PP[i].second);
i++;
}
rep(j, SSS.size()) { cout << SSS[SSS.size() - j - 1] << endl; }
/*
pair<int,string> p[n];
rep(i,SS.size()){
p[i]=pair(SS[i].second,SS[i].first);
PP.push_back(p[i]);
}
PP.sort();
int k=PP[0].first;
int i=0;
while(PP[i].first==k){
cout<<PP[i].second<<endl;
i++;
}
*/
return 0;
}
| #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
static const int INF = 1000000007;
#define mp make_pair
#define sz(x) int(x.xise())
#define mod 1000000007
#define reps(i, s, n) for (int i = s; i < n; i++)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
deque<int> deq;
#define fi first
#define se second
// #define int long long
// cerrはコメントアウトしなくても通る//ただしTLEを引き起こすことがある
ll N, M, H, W, K, Q, A, B;
string S;
// const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
// const ll INF = 1LL << 60;
// typedef pair<ll,ll> P;
typedef pair<int, int> P;
bool chmx(int &a, int b) {
if (b > a) {
a = b;
return true;
}
return false;
}
bool chmn(int &a, int b) {
if (b < a) {
a = b;
return true;
}
return false;
}
vector<string> SS;
int main() {
int n;
cin >> n;
string s[n];
rep(i, n) {
cin >> s[i];
SS.push_back(s[i]);
}
sort(SS.begin(), SS.end());
cerr << endl;
/*
rep(i,n){
cerr<<SS[i]<<endl;
}
*/
ll k = 0;
string kk = "-1";
vector<pair<ll, string>> PP;
rep(i, n) {
if (SS[i] == kk) {
k++;
if (i == n - 1) {
PP.push_back(mp(k, kk));
}
} else {
PP.push_back(mp(k, kk));
cerr << k << ' ' << kk << endl;
k = 1;
kk = SS[i];
if (i == n - 1) {
PP.push_back(mp(k, kk));
}
}
}
sort(PP.begin(), PP.end(), greater<pair<ll, string>>());
ll kkk = PP[0].first;
cerr << kkk << endl;
ll i = 0;
cerr << endl;
vector<string> SSS;
while (PP[i].first == kkk) {
SSS.push_back(PP[i].second);
i++;
}
rep(j, SSS.size()) { cout << SSS[SSS.size() - j - 1] << endl; }
/*
pair<int,string> p[n];
rep(i,SS.size()){
p[i]=pair(SS[i].second,SS[i].first);
PP.push_back(p[i]);
}
PP.sort();
int k=PP[0].first;
int i=0;
while(PP[i].first==k){
cout<<PP[i].second<<endl;
i++;
}
*/
return 0;
}
| replace | 67 | 70 | 67 | 72 | TLE | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define f(i, x, n) for (i = x; i < n; i++)
#define fr(i, x, n) for (i = x; i >= n; i--)
#define pu push_back
#define pp pop_back
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define SP(x) fixed << setprecision(x)
#define IOS() \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const long long MOD = 1e9 + 7;
const long double PI = acos(-1);
const long long INF = INT_MAX;
const long long LINF = LLONG_MAX;
const long long N = 2e5 + 1;
typedef long long ll;
typedef long double ld;
void test_case() {
ll n, i, j;
cin >> n;
map<string, ll> m;
f(i, 0, n) {
string s;
cin >> s;
m[s]++;
}
vector<string> v;
ll mx = 0;
for (auto u : m) {
mx = max(mx, u.S);
}
for (auto u : m) {
if (u.S == mx)
v.pu(u.F);
}
sort(all(v));
f(i, 0, n) { cout << v[i] << '\n'; }
}
int main() {
IOS();
int tc = 1;
while (tc--)
test_case();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define f(i, x, n) for (i = x; i < n; i++)
#define fr(i, x, n) for (i = x; i >= n; i--)
#define pu push_back
#define pp pop_back
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define SP(x) fixed << setprecision(x)
#define IOS() \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const long long MOD = 1e9 + 7;
const long double PI = acos(-1);
const long long INF = INT_MAX;
const long long LINF = LLONG_MAX;
const long long N = 2e5 + 1;
typedef long long ll;
typedef long double ld;
void test_case() {
ll n, i, j;
cin >> n;
map<string, ll> m;
f(i, 0, n) {
string s;
cin >> s;
m[s]++;
}
vector<string> v;
ll mx = 0;
for (auto u : m) {
mx = max(mx, u.S);
}
for (auto u : m) {
if (u.S == mx)
v.pu(u.F);
}
sort(all(v));
f(i, 0, v.size()) { cout << v[i] << '\n'; }
}
int main() {
IOS();
int tc = 1;
while (tc--)
test_case();
return 0;
} | replace | 45 | 46 | 45 | 46 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <string>
#include <utility>
#include <vector>
int main(int argc, char *argv[]) {
int n;
std::vector<std::string> s;
std::vector<std::pair<int, std::string>> scnt;
std::cin >> n;
s.resize(n);
for (int i = 0; i < n; i++) {
std::cin >> s[i];
}
std::sort(s.begin(), s.end());
std::string scur = "";
for (int i = 0; i < n; i++) {
if (s[i] != scur) {
scur = s[i];
scnt.push_back(std::pair<int, std::string>(0, scur));
}
scnt.back().first++;
}
std::sort(scnt.begin(), scnt.end());
const int maxcnt = scnt.back().first;
std::vector<std::string> smax;
// smax.reserve(n);
for (int i = 0; i < n; i++) {
if (scnt[i].first == maxcnt) {
smax.push_back(scnt[i].second);
}
}
std::sort(smax.begin(), smax.end());
for (int i = 0; i < smax.size(); i++) {
std::cout << smax[i] << std::endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <string>
#include <utility>
#include <vector>
int main(int argc, char *argv[]) {
int n;
std::vector<std::string> s;
std::vector<std::pair<int, std::string>> scnt;
std::cin >> n;
s.resize(n);
for (int i = 0; i < n; i++) {
std::cin >> s[i];
}
std::sort(s.begin(), s.end());
std::string scur = "";
for (int i = 0; i < n; i++) {
if (s[i] != scur) {
scur = s[i];
scnt.push_back(std::pair<int, std::string>(0, scur));
}
scnt.back().first++;
}
std::sort(scnt.begin(), scnt.end());
const int maxcnt = scnt.back().first;
std::vector<std::string> smax;
// smax.reserve(n);
for (int i = 0; i < scnt.size(); i++) {
if (scnt[i].first == maxcnt) {
smax.push_back(scnt[i].second);
}
}
std::sort(smax.begin(), smax.end());
for (int i = 0; i < smax.size(); i++) {
std::cout << smax[i] << std::endl;
}
return 0;
}
| replace | 40 | 41 | 40 | 41 | 0 | |
p02773 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int vector_finder(std::vector<string> vec, string number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
int main() {
int n;
cin >> n;
vector<string> a;
vector<string> b;
map<string, int> m;
for (int i = 0; i < n; i++) {
a.push_back("");
cin >> a[i];
}
int max_size = 0;
for (int i = 0; i < n; i++) {
int res = vector_finder(b, a[i]);
if (res == 0) {
b.push_back(a[i]);
m.insert(make_pair(a[i], 1));
} else {
m[a[i]] += 1;
}
if (m[a[i]] > max_size) {
max_size = m[a[i]];
}
}
// cout<<"---"<<endl;
pair<string, int> item;
for (map<string, int>::iterator it = m.begin(); it != m.end(); it++) {
item = *it;
if (item.second == max_size) {
cout << item.first << endl;
}
}
} | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int vector_finder(std::vector<string> vec, string number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
int main() {
int n;
cin >> n;
vector<string> a;
vector<string> b;
map<string, int> m;
for (int i = 0; i < n; i++) {
a.push_back("");
cin >> a[i];
}
int max_size = 0;
for (int i = 0; i < n; i++) {
int res = m.count(a[i]);
if (res == 0) {
b.push_back(a[i]);
m.insert(make_pair(a[i], 1));
} else {
m[a[i]] += 1;
}
if (m[a[i]] > max_size) {
max_size = m[a[i]];
}
}
// cout<<"---"<<endl;
pair<string, int> item;
for (map<string, int>::iterator it = m.begin(); it != m.end(); it++) {
item = *it;
if (item.second == max_size) {
cout << item.first << endl;
}
}
} | replace | 31 | 32 | 31 | 32 | TLE | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sint(a) scanf("%d", &a)
#define sint2(a, b) scanf("%d %d", &a, &b)
#define sll(a) scanf("%lld", &a)
#define sll2(a, b) scanf("%lld %lld", &a, &b)
#define mem(a, i) memset(a, i, sizeof(a))
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int maxn = 1e4 + 10;
string ss[maxn], ans[maxn];
map<string, int> mp;
int main() {
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (!mp[s])
ss[sum++] = s;
mp[s]++;
}
int m = -1;
for (int i = 0; i < sum; i++)
if (m < mp[ss[i]]) {
m = mp[ss[i]];
}
int k = 0;
for (int i = 0; i < sum; i++)
if (m == mp[ss[i]])
ans[k++] = ss[i];
sort(ans, ans + k);
for (int i = 0; i < k; i++)
cout << ans[i] << endl;
;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sint(a) scanf("%d", &a)
#define sint2(a, b) scanf("%d %d", &a, &b)
#define sll(a) scanf("%lld", &a)
#define sll2(a, b) scanf("%lld %lld", &a, &b)
#define mem(a, i) memset(a, i, sizeof(a))
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int maxn = 1e6 + 10;
string ss[maxn], ans[maxn];
map<string, int> mp;
int main() {
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (!mp[s])
ss[sum++] = s;
mp[s]++;
}
int m = -1;
for (int i = 0; i < sum; i++)
if (m < mp[ss[i]]) {
m = mp[ss[i]];
}
int k = 0;
for (int i = 0; i < sum; i++)
if (m == mp[ss[i]])
ans[k++] = ss[i];
sort(ans, ans + k);
for (int i = 0; i < k; i++)
cout << ans[i] << endl;
;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02773 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
std::cin >> n;
map<string, int> m;
int max = 0;
while (n--) {
string str;
cin >> str;
if (m.find(str) == m.end()) {
m[str] = 1;
max = max > m[str] ? max : m[str];
} else {
m[str] += 1;
max = max > m[str] ? max : m[str];
}
}
vector<string> res;
auto it = m.begin();
while (it != m.end()) {
if (it->second == max) {
res.push_back(it->first);
}
++it;
}
for (int i = 0; i < res.size(); i++) {
for (int j = 0; j < res.size() - 1; j++) {
if (res.at(j) > res.at(j + 1)) {
string tmp = res.at(j);
res.at(j) = res.at(j + 1);
res.at(j + 1) = tmp;
}
}
}
auto itt = res.begin();
while (itt != res.end()) {
std::cout << *itt << std::endl;
++itt;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
std::cin >> n;
map<string, int> m;
int max = 0;
while (n--) {
string str;
cin >> str;
if (m.find(str) == m.end()) {
m[str] = 1;
max = max > m[str] ? max : m[str];
} else {
m[str] += 1;
max = max > m[str] ? max : m[str];
}
}
vector<string> res;
auto it = m.begin();
while (it != m.end()) {
if (it->second == max) {
res.push_back(it->first);
}
++it;
}
sort(res.begin(), res.end());
auto itt = res.begin();
while (itt != res.end()) {
std::cout << *itt << std::endl;
++itt;
}
return 0;
} | replace | 33 | 42 | 33 | 35 | TLE | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
vector<int> count(0);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n; i++) {
if (i == 0) {
count[i] = 1;
} else if (s[i - 1] == s[i]) {
count[i] = count[i - 1] + 1;
} else {
count[i] = 1;
}
}
int m = 0;
for (int i = 0; i < n; i++) {
m = max(m, count[i]);
}
for (int i = 0; i < n; i++) {
if (count[i] == m) {
cout << s[i] << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
vector<int> count(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n; i++) {
if (i == 0) {
count[i] = 1;
} else if (s[i - 1] == s[i]) {
count[i] = count[i - 1] + 1;
} else {
count[i] = 1;
}
}
int m = 0;
for (int i = 0; i < n; i++) {
m = max(m, count[i]);
}
for (int i = 0; i < n; i++) {
if (count[i] == m) {
cout << s[i] << endl;
}
}
} | replace | 7 | 8 | 7 | 8 | -11 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll n, a;
in(n);
vector<string> c(n);
vector<ll> d(n, 1);
rep(i, n) in(c[i]);
sort(all(c));
rep(i, n - 1) {
if (c[i - 1] == c[i])
d[i] = d[i - 1] + 1;
}
a = 0;
rep(i, n) a = max(a, d[i]);
rep(i, n) {
if (d[i] == a) {
out(c[i]);
memi;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll n, a;
in(n);
vector<string> c(n);
vector<ll> d(n, 1);
rep(i, n) in(c[i]);
sort(all(c));
rep(i, n - 1) {
if (c[i + 1] == c[i])
d[i + 1] = d[i] + 1;
}
a = 0;
rep(i, n) a = max(a, d[i]);
rep(i, n) {
if (d[i] == a) {
out(c[i]);
memi;
}
}
} | replace | 24 | 26 | 24 | 26 | 0 | |
p02773 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#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 repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
bool CoutYN(bool a, string y = "Yes", string n = "No") {
cout << (a ? y : n) << "\n";
return a;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
#define psi pair<string, int>
bool mycomp(psi a, psi b) {
return a.second != b.second ? a.second > b.second : a.first < b.first;
}
void solve() {
int n;
cin >> n;
vector<string> s;
cin >> s;
unordered_map<string, int> ump;
for (auto t : s)
++ump[t];
vector<psi> vec;
for (auto p : ump)
vec.push_back(p);
sort(ALL(vec), mycomp);
auto itr = vec.begin();
int cnt = itr->second;
do {
cout << itr->first << "\n";
} while (++itr != vec.end() && itr->second == cnt);
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#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 repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
bool CoutYN(bool a, string y = "Yes", string n = "No") {
cout << (a ? y : n) << "\n";
return a;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
#define psi pair<string, int>
bool mycomp(psi a, psi b) {
return a.second != b.second ? a.second > b.second : a.first < b.first;
}
void solve() {
int n;
cin >> n;
vector<string> s(n);
cin >> s;
unordered_map<string, int> ump;
for (auto t : s)
++ump[t];
vector<psi> vec;
for (auto p : ump)
vec.push_back(p);
sort(ALL(vec), mycomp);
auto itr = vec.begin();
int cnt = itr->second;
do {
cout << itr->first << "\n";
} while (++itr != vec.end() && itr->second == cnt);
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| replace | 112 | 113 | 112 | 113 | -11 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, MAX;
string s[100007];
vector<string> v;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> s[i];
sort(s + 1, s + n + 1);
int cnt = 0;
for (int i = 1; i <= n; ++i) {
cnt++;
if (s[i] != s[i + 1]) {
MAX = max(MAX, cnt);
cnt = 0;
}
}
for (int i = 1; i <= n; ++i) {
cnt++;
if (s[i] != s[i + 1]) {
if (cnt == MAX)
v.push_back(s[i]);
cnt = 0;
}
}
sort(v.begin(), v.end());
for (auto x : v)
cout << x << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, MAX;
string s[200007];
vector<string> v;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> s[i];
sort(s + 1, s + n + 1);
int cnt = 0;
for (int i = 1; i <= n; ++i) {
cnt++;
if (s[i] != s[i + 1]) {
MAX = max(MAX, cnt);
cnt = 0;
}
}
for (int i = 1; i <= n; ++i) {
cnt++;
if (s[i] != s[i + 1]) {
if (cnt == MAX)
v.push_back(s[i]);
cnt = 0;
}
}
sort(v.begin(), v.end());
for (auto x : v)
cout << x << '\n';
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, maxnum = 0, m = 0;
cin >> n;
string t;
vector<string> s(n), ans;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n;) {
t = s[i];
while (s[i] == t) {
i++;
m++;
}
if (m == maxnum)
ans.push_back(t);
if (m > maxnum) {
maxnum = m;
ans.clear();
ans.shrink_to_fit();
ans.push_back(t);
}
m = 0;
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, maxnum = 0, m = 0;
cin >> n;
string t;
vector<string> s(n), ans;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n;) {
t = s[i];
while (i < n && s[i] == t) {
i++;
m++;
}
if (m == maxnum)
ans.push_back(t);
if (m > maxnum) {
maxnum = m;
ans.clear();
ans.shrink_to_fit();
ans.push_back(t);
}
m = 0;
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02773 | Python | Time Limit Exceeded | import collections
N = int(input())
data = [input() for i in range(N)]
dicdata = collections.Counter(data)
newdata = [k for k, v in dicdata.items() if v == max(dicdata.values())]
newdata.sort()
[print(i) for i in newdata]
| import collections
N = int(input())
data = [input() for i in range(N)]
dicdata = collections.Counter(data)
m = max(dicdata.values())
newdata = [k for k, v in dicdata.items() if v == m]
newdata.sort()
[print(i) for i in newdata]
| replace | 7 | 8 | 7 | 10 | TLE | |
p02773 | Python | Time Limit Exceeded | N = int(input())
input_line = [input() for _ in range(N)]
count = {}
for w in input_line:
if w in count:
count[w] += 1
else:
count[w] = 1
keys = [k for k, v in count.items() if v == max(count.values())]
for w in sorted(keys):
print(w)
| N = int(input())
input_line = [input() for _ in range(N)]
count = {}
for w in input_line:
if w in count:
count[w] += 1
else:
count[w] = 1
max_values = max(count.values())
keys = [k for k, v in count.items() if v == max_values]
for w in sorted(keys):
print(w)
| replace | 8 | 10 | 8 | 10 | TLE | |
p02773 | Python | Time Limit Exceeded | n = int(input())
str_dic = {}
for _ in range(n):
inp = input()
if inp in str_dic:
str_dic[inp] += 1
else:
str_dic[inp] = 1
max_str = [s[0] for s in str_dic.items() if s[1] == max(str_dic.values())]
for s in sorted(max_str):
print(s)
| n = int(input())
str_dic = {}
for _ in range(n):
inp = input()
if inp in str_dic:
str_dic[inp] += 1
else:
str_dic[inp] = 1
max_num = max(str_dic.values())
max_str = [s[0] for s in str_dic.items() if s[1] == max_num]
for s in sorted(max_str):
print(s)
| replace | 9 | 10 | 9 | 12 | TLE | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool my_compare(pair<int, string> a, pair<int, string> b) {
// 基本はfirstで比較
if (a.first != b.first) {
// return a.first < b.first; // 昇順
return a.first > b.first; // 降順
}
// それ以外はsecondで比較
if (a.second != b.second) {
return a.second < b.second;
} else {
// どちらも同じ
return true;
}
}
int main() {
int N, i, num = 0;
cin >> N;
vector<string> S(N);
map<string, int> cnt;
vector<pair<int, string>> V;
for (i = 0; i < N; i++)
cin >> S.at(i);
sort(S.begin(), S.end());
for (i = 0; i < N; i++) {
if (cnt.count(S.at(i)))
cnt[S.at(i)]++;
else
cnt[S.at(i)] = 1;
}
for (auto p : cnt) {
auto k = p.first;
auto v = p.first;
V.push_back(make_pair(p.second, p.first));
}
sort(V.begin(), V.end(), my_compare);
for (i = 0; i < N; i++) {
if (i == 0)
num = V.at(i).first;
if (num == V.at(i).first)
cout << V.at(i).second << endl;
else
break;
}
} | #include <bits/stdc++.h>
using namespace std;
bool my_compare(pair<int, string> a, pair<int, string> b) {
// 基本はfirstで比較
if (a.first != b.first) {
// return a.first < b.first; // 昇順
return a.first > b.first; // 降順
}
// それ以外はsecondで比較
if (a.second != b.second) {
return a.second < b.second;
} else {
// どちらも同じ
return true;
}
}
int main() {
int N, i, num = 0;
cin >> N;
vector<string> S(N);
map<string, int> cnt;
vector<pair<int, string>> V;
for (i = 0; i < N; i++)
cin >> S.at(i);
sort(S.begin(), S.end());
for (i = 0; i < N; i++) {
if (cnt.count(S.at(i)))
cnt[S.at(i)]++;
else
cnt[S.at(i)] = 1;
}
for (auto p : cnt) {
auto k = p.first;
auto v = p.first;
V.push_back(make_pair(p.second, p.first));
}
sort(V.begin(), V.end(), my_compare);
for (i = 0; i < V.size(); i++) {
if (i == 0)
num = V.at(i).first;
if (num == V.at(i).first)
cout << V.at(i).second << endl;
else
break;
}
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02773 | Python | Time Limit Exceeded | n = int(input())
d = {}
for i in range(n):
s = input()
if s in d:
d[s] += 1
else:
d[s] = 1
max_d_list = [kv[0] for kv in d.items() if kv[1] == max(d.values())]
ans = sorted(max_d_list)
for i in ans:
print(i)
| n = int(input())
d = {}
for i in range(n):
s = input()
if s in d:
d[s] += 1
else:
d[s] = 1
max_d = max(d.values())
max_d_list = [kv[0] for kv in d.items() if kv[1] == max_d]
ans = sorted(max_d_list)
for i in ans:
print(i)
| replace | 9 | 10 | 9 | 11 | TLE | |
p02773 | Python | Runtime Error | import collections
n = int(input())
s_ = [input() for i in range(n)]
cnt = collections.Counter(s_)
cntList = list(cnt.most_common())
cnt_f = cnt.most_common()[0][1]
resList = []
for i in range(n):
if cntList[i][1] == cnt_f:
resList.append(cntList[i][0])
else:
break
resList.sort()
for i in resList:
print(i)
| import collections
n = int(input())
s_ = [input() for i in range(n)]
cnt = collections.Counter(s_)
cntList = list(cnt.most_common())
cnt_f = cnt.most_common()[0][1]
resList = []
for i in range(len(cntList)):
if cntList[i][1] == cnt_f:
resList.append(cntList[i][0])
else:
break
resList.sort()
for i in resList:
print(i)
| replace | 10 | 11 | 10 | 11 | 0 | |
p02773 | Python | Runtime Error | import sys
from collections import Counter
read = sys.stdin.read
N, *S = map(str, read().split())
s = Counter(S)
n = max(s.values())
answer = [i for i, j in s if j == n]
answer.sort()
print("\n".join(answer))
| import sys
from collections import Counter
read = sys.stdin.read
N, *S = map(str, read().split())
s = Counter(S)
n = max(s.values())
answer = [i for i, j in s.items() if j == n]
answer.sort()
print("\n".join(answer))
| replace | 8 | 9 | 8 | 9 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02773/Python/s963425667.py", line 9, in <module>
answer = [i for i, j in s if j == n]
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02773/Python/s963425667.py", line 9, in <listcomp>
answer = [i for i, j in s if j == n]
ValueError: too many values to unpack (expected 2)
|
p02773 | Python | Time Limit Exceeded | from collections import Counter
n = int(input())
S = [input() for i in range(n)]
L = Counter(S)
K = sorted([kv[0] for kv in L.items() if kv[1] == max(L.values())])
for i in range(len(K)):
print(K[i])
| from collections import Counter
n = int(input())
S = [input() for i in range(n)]
L = Counter(S)
m = 0
for v in L.values():
m = max(m, v)
ans = []
for k, v in L.items():
if v == m:
ans.append(k)
ans.sort()
print(*ans, sep="\n")
| replace | 6 | 10 | 6 | 15 | TLE | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define INF 0x3f3f3f3f;
using namespace std;
string s[200005];
bool cmp(string a, string b) { return a <= b; }
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n, cmp);
int m = 1, cnt = 1;
for (i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0)
cnt++;
else
cnt = 1;
m = max(cnt, m);
}
cnt = 1;
if (m == 1)
cout << s[0] << endl;
for (i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0)
cnt++;
else
cnt = 1;
if (cnt == m)
cout << s[i] << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define INF 0x3f3f3f3f;
using namespace std;
string s[200005];
bool cmp(string a, string b) { return a < b; }
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n, cmp);
int m = 1, cnt = 1;
for (i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0)
cnt++;
else
cnt = 1;
m = max(cnt, m);
}
cnt = 1;
if (m == 1)
cout << s[0] << endl;
for (i = 1; i < n; i++) {
if (s[i].compare(s[i - 1]) == 0)
cnt++;
else
cnt = 1;
if (cnt == m)
cout << s[i] << endl;
}
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int, int>::iterator
#define sit set<int>::iterator
#define itrm(g, x) for (mit g = x.begin(); g != x.end(); g++)
#define itrs(g, x) for (sit g = x.begin(); g != x.end(); g++)
#define ltype int
#define rep(i, j, k) for (ltype(i) = (j); (i) <= (k); (i)++)
#define rap(i, j, k) for (ltype(i) = (j); (i) < (k); (i)++)
#define per(i, j, k) for (ltype(i) = (j); (i) >= (k); (i)--)
#define pii pair<int, int>
#define fi first
#define se second
#define mpr make_pair
#define pb push_back
#define fastio ios::sync_with_stdio(false)
const int inf = 0x3f3f3f3f, mod = 1000000007;
const double pi = 3.1415926535897932, eps = 1e-6;
int n, mx;
string s[100005];
map<string, int> m;
vector<string> ans;
int main() {
scanf("%d", &n);
rep(i, 1, n) {
cin >> s[i];
m[s[i]]++;
mx = max(mx, m[s[i]]);
}
rep(i, 1, n) {
if (mx == m[s[i]]) {
m[s[i]]--;
ans.pb(s[i]);
}
}
sort(ans.begin(), ans.end());
rap(i, 0, ans.size()) { cout << ans[i] << '\n'; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int, int>::iterator
#define sit set<int>::iterator
#define itrm(g, x) for (mit g = x.begin(); g != x.end(); g++)
#define itrs(g, x) for (sit g = x.begin(); g != x.end(); g++)
#define ltype int
#define rep(i, j, k) for (ltype(i) = (j); (i) <= (k); (i)++)
#define rap(i, j, k) for (ltype(i) = (j); (i) < (k); (i)++)
#define per(i, j, k) for (ltype(i) = (j); (i) >= (k); (i)--)
#define pii pair<int, int>
#define fi first
#define se second
#define mpr make_pair
#define pb push_back
#define fastio ios::sync_with_stdio(false)
const int inf = 0x3f3f3f3f, mod = 1000000007;
const double pi = 3.1415926535897932, eps = 1e-6;
int n, mx;
string s[200005];
map<string, int> m;
vector<string> ans;
int main() {
scanf("%d", &n);
rep(i, 1, n) {
cin >> s[i];
m[s[i]]++;
mx = max(mx, m[s[i]]);
}
rep(i, 1, n) {
if (mx == m[s[i]]) {
m[s[i]]--;
ans.pb(s[i]);
}
}
sort(ans.begin(), ans.end());
rap(i, 0, ans.size()) { cout << ans[i] << '\n'; }
return 0;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p02773 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
sort(a.begin(), a.end());
vector<int> b(n);
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (a.at(i) == a.at(j) && i != j) {
b.at(i)++;
}
}
}
int k = 0;
for (int i = 0; i < n; i++)
k = max(k, b.at(i));
for (int i = 0; i < n; i++) {
if (b.at(i) == k)
cout << a.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
sort(a.begin(), a.end());
vector<int> b(n);
for (int i = n - 1; i > 0; i--) {
if (a.at(i) == a.at(i - 1)) {
b.at(i - 1)++;
b.at(i - 1) += b.at(i);
a.at(i) = ' ';
}
}
int k = 0;
for (int i = 0; i < n; i++)
k = max(k, b.at(i));
for (int i = 0; i < n; i++) {
if (b.at(i) == k)
cout << a.at(i) << endl;
}
} | replace | 14 | 19 | 14 | 19 | TLE | |
p02773 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
// while(cin>>n){
cin >> n;
map<string, int> mp;
int res(0);
string s;
for (int i = 0; i < n; ++i)
cin >> s, mp[s]++, res = max(res, mp[s]);
for (auto x : mp)
if (x.second == res)
cout << x.first << endl;
// }
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
// while(cin>>n){
cin >> n;
map<string, int> mp;
int res(0);
string s;
for (int i = 0; i < n; ++i)
cin >> s, mp[s]++, res = max(res, mp[s]);
for (auto x : mp)
if (x.second == res)
cout << x.first << endl;
// }
return 0;
} | replace | 5 | 9 | 5 | 6 | 0 | |
p02773 | Python | Time Limit Exceeded | N = int(input())
# 文字列の出現回数を格納
S = {}
for _ in range(N):
s = input()
if s in S:
S[s] += 1
else:
S[s] = 1
# 出現回数が最大の文字列をansに格納し、昇順にソートする
ans = [k for k, v in S.items() if v == max(S.values())]
ans.sort()
# 出力
for a in ans:
print(a)
| N = int(input())
# 文字列の出現回数を格納
S = {}
for _ in range(N):
s = input()
if s in S:
S[s] += 1
else:
S[s] = 1
# 出現回数が最大の文字列をansに格納し、昇順にソートする
# ans = [k for k, v in S.items() if v == max(S.values())]
# ans.sort()
max_value = max(S.values())
ans = sorted([k for k, v in S.items() if v == max_value])
# 出力
for a in ans:
print(a)
| replace | 12 | 14 | 12 | 16 | TLE | |
p02773 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define all(v) (v).begin(), (v).end()
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define int long long
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define lll __int128
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) (v).begin(), (v).end()
const int mod = 1e9 + 7;
inline int ksm(int a, int b) {
int ans = 1;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1)
ans = ans * a % mod;
return ans;
}
vector<string> ans;
signed main() {
ios::sync_with_stdio(0);
vector<string> v;
int n;
cin >> n;
rep(i, 1, n) {
string s;
cin >> s;
v.pb(s);
}
sort(all(v));
int mx = 0;
for (int i = 0; i < v.size(); i++) {
int p = i;
while (p + 1 < v.size() && v[p + 1] == v[p])
p++;
int cnt = p - i + 1;
if (cnt > mx) {
ans.clear();
ans.push_back(v[p]);
mx = cnt;
} else if (cnt == mx)
ans.push_back(v[p]);
}
for (auto i : ans)
cout << i << endl;
getchar();
getchar();
} | #include "bits/stdc++.h"
#define all(v) (v).begin(), (v).end()
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define int long long
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define lll __int128
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) (v).begin(), (v).end()
const int mod = 1e9 + 7;
inline int ksm(int a, int b) {
int ans = 1;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1)
ans = ans * a % mod;
return ans;
}
vector<string> ans;
signed main() {
ios::sync_with_stdio(0);
vector<string> v;
int n;
cin >> n;
rep(i, 1, n) {
string s;
cin >> s;
v.pb(s);
}
sort(all(v));
int mx = 0;
for (int i = 0; i < v.size(); i++) {
int p = i;
while (p + 1 < v.size() && v[p + 1] == v[p])
p++;
int cnt = p - i + 1;
if (cnt > mx) {
ans.clear();
ans.push_back(v[p]);
mx = cnt;
} else if (cnt == mx)
ans.push_back(v[p]);
i = p;
}
for (auto i : ans)
cout << i << endl;
getchar();
getchar();
} | insert | 47 | 47 | 47 | 48 | TLE | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> M;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (!M.count(s))
M.at(s) = 1;
else
M.at(s) += 1;
}
int Max = 0;
for (auto p : M) {
auto k = p.first;
auto v = p.second;
if (Max <= v)
Max = v;
}
for (auto p : M) {
auto k = p.first;
auto v = p.second;
if (v == Max)
cout << k << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> M;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (!M.count(s))
M[s] = 1;
else
M.at(s) += 1;
}
int Max = 0;
for (auto p : M) {
auto k = p.first;
auto v = p.second;
if (Max <= v)
Max = v;
}
for (auto p : M) {
auto k = p.first;
auto v = p.second;
if (v == Max)
cout << k << endl;
}
return 0;
} | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): map::at
|
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string s[100005], an[1000005];
map<string, int> mp;
int main() {
int n, ans = 0, cnt = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> s[i];
++mp[s[i]];
ans = max(ans, mp[s[i]]);
}
for (int i = 1; i <= n; ++i)
if (mp[s[i]] == ans) {
--mp[s[i]];
an[++cnt] = s[i];
}
sort(an + 1, an + 1 + cnt);
for (int i = 1; i <= cnt; ++i)
cout << an[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s[200005], an[1000005];
map<string, int> mp;
int main() {
int n, ans = 0, cnt = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> s[i];
++mp[s[i]];
ans = max(ans, mp[s[i]]);
}
for (int i = 1; i <= n; ++i)
if (mp[s[i]] == ans) {
--mp[s[i]];
an[++cnt] = s[i];
}
sort(an + 1, an + 1 + cnt);
for (int i = 1; i <= cnt; ++i)
cout << an[i] << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
using namespace std;
// Library
// モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % mod;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
double kyori(pair<int, int> f, pair<int, int> s) {
double ans = 0;
double t = fabs(f.first - s.first);
double y = fabs(f.second - s.second);
ans = sqrt(t * t + y * y);
return ans;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// Union-Find Tree
class Union_Find {
vector<int> par;
vector<int> rankmy;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
} else {
par[y] = x;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
// SegTree
template <class T> class SegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
// Seg-Tree-End
// dfs
// vector<int> v[100004];
// bool went[100004];
// void dfs(int x) {
// went[x] = true;
// for (int i = 0; i < (int)v[x].size(); i++) {
// if (!went[v[x][i]]) {
// dfs(v[x][i]);
// }
// }
// }
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
int fukugen(vector<int> l) {
int ans = 0;
for (int i = 0; i < (int)l.size(); i++) {
ans *= 10;
ans += l[i];
}
return ans;
}
int nanjyo(int n) {
int ans = 0;
while (n > 1) {
ans++;
n /= 2;
}
return ans;
}
bool intersect(pair<pair<int, int>, pair<int, int>> p1,
pair<pair<int, int>, pair<int, int>> p2) {
int men11 =
(p2.first.first - p1.first.first) * (p2.second.second - p1.first.second) -
(p2.second.first - p1.first.first) * (p2.first.second - p1.first.second);
int men12 = (p2.first.first - p1.second.first) *
(p2.second.second - p1.second.second) -
(p2.second.first - p1.second.first) *
(p2.first.second - p1.second.second);
int men21 =
(p1.first.first - p2.first.first) * (p1.second.second - p2.first.second) -
(p1.second.first - p2.first.first) * (p1.first.second - p2.first.second);
int men22 = (p1.first.first - p2.second.first) *
(p1.second.second - p2.second.second) -
(p1.second.first - p2.second.first) *
(p1.first.second - p2.second.second);
return ((signbit(men11)) ^ (signbit(men12))) &&
((signbit(men21)) ^ (signbit(men22)));
}
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;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
// Library-End
int n, big;
string s[100004];
signed main() {
cin >> n;
rep(i, n) { cin >> s[i]; }
sort(s, s + n);
int now = 1;
REP(i, n - 1) {
if (s[i - 1] != s[i]) {
chmax(big, now);
now = 1;
} else {
now++;
}
}
chmax(big, now);
now = 1;
REP(i, n - 1) {
if (s[i - 1] != s[i]) {
if (now == big) {
cout << s[i - 1] << endl;
}
now = 1;
} else {
now++;
}
}
if (now == big) {
cout << s[n - 1] << endl;
}
}
| #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
using namespace std;
// Library
// モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % mod;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
double kyori(pair<int, int> f, pair<int, int> s) {
double ans = 0;
double t = fabs(f.first - s.first);
double y = fabs(f.second - s.second);
ans = sqrt(t * t + y * y);
return ans;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// Union-Find Tree
class Union_Find {
vector<int> par;
vector<int> rankmy;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
} else {
par[y] = x;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
// SegTree
template <class T> class SegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
// Seg-Tree-End
// dfs
// vector<int> v[100004];
// bool went[100004];
// void dfs(int x) {
// went[x] = true;
// for (int i = 0; i < (int)v[x].size(); i++) {
// if (!went[v[x][i]]) {
// dfs(v[x][i]);
// }
// }
// }
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
int fukugen(vector<int> l) {
int ans = 0;
for (int i = 0; i < (int)l.size(); i++) {
ans *= 10;
ans += l[i];
}
return ans;
}
int nanjyo(int n) {
int ans = 0;
while (n > 1) {
ans++;
n /= 2;
}
return ans;
}
bool intersect(pair<pair<int, int>, pair<int, int>> p1,
pair<pair<int, int>, pair<int, int>> p2) {
int men11 =
(p2.first.first - p1.first.first) * (p2.second.second - p1.first.second) -
(p2.second.first - p1.first.first) * (p2.first.second - p1.first.second);
int men12 = (p2.first.first - p1.second.first) *
(p2.second.second - p1.second.second) -
(p2.second.first - p1.second.first) *
(p2.first.second - p1.second.second);
int men21 =
(p1.first.first - p2.first.first) * (p1.second.second - p2.first.second) -
(p1.second.first - p2.first.first) * (p1.first.second - p2.first.second);
int men22 = (p1.first.first - p2.second.first) *
(p1.second.second - p2.second.second) -
(p1.second.first - p2.second.first) *
(p1.first.second - p2.second.second);
return ((signbit(men11)) ^ (signbit(men12))) &&
((signbit(men21)) ^ (signbit(men22)));
}
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;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
// Library-End
int n, big;
string s[200004];
signed main() {
cin >> n;
rep(i, n) { cin >> s[i]; }
sort(s, s + n);
int now = 1;
REP(i, n - 1) {
if (s[i - 1] != s[i]) {
chmax(big, now);
now = 1;
} else {
now++;
}
}
chmax(big, now);
now = 1;
REP(i, n - 1) {
if (s[i - 1] != s[i]) {
if (now == big) {
cout << s[i - 1] << endl;
}
now = 1;
} else {
now++;
}
}
if (now == big) {
cout << s[n - 1] << endl;
}
}
| replace | 290 | 291 | 290 | 291 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main(void) {
int N;
int max = 0;
string s[100000];
map<string, int> m;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s[i];
m[s[i]]++;
if (max < m[s[i]])
max = m[s[i]];
}
sort(s, s + N);
string s1 = s[0];
if (m[s[0]] == max)
cout << s1 << endl;
for (int i = 0; i < N; i++) {
if (s1 == s[i])
continue;
s1 = s[i];
if (m[s[i]] == max)
cout << s[i] << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main(void) {
int N;
int max = 0;
string s[200002];
map<string, int> m;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s[i];
m[s[i]]++;
if (max < m[s[i]])
max = m[s[i]];
}
sort(s, s + N);
string s1 = s[0];
if (m[s[0]] == max)
cout << s1 << endl;
for (int i = 0; i < N; i++) {
if (s1 == s[i])
continue;
s1 = s[i];
if (m[s[i]] == max)
cout << s[i] << endl;
}
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int n;
string s[100001], ans[100001];
int cnt;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> s[i];
sort(s + 1, s + 1 + n);
int cur = 1, maxx = 0;
for (int i = 2; i <= n; ++i) {
if (s[i] != s[i - 1]) {
if (cur > maxx)
maxx = cur, cnt = 1, ans[cnt] = s[i - 1];
else if (cur == maxx)
ans[++cnt] = s[i - 1];
cur = 1;
} else
++cur;
}
if (cur > maxx)
maxx = cur, cnt = 1, ans[cnt] = s[n];
else if (cur == maxx)
ans[++cnt] = s[n];
cur = 1;
for (int i = 1; i <= cnt; ++i)
cout << ans[i] << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int n;
string s[200001], ans[200001];
int cnt;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> s[i];
sort(s + 1, s + 1 + n);
int cur = 1, maxx = 0;
for (int i = 2; i <= n; ++i) {
if (s[i] != s[i - 1]) {
if (cur > maxx)
maxx = cur, cnt = 1, ans[cnt] = s[i - 1];
else if (cur == maxx)
ans[++cnt] = s[i - 1];
cur = 1;
} else
++cur;
}
if (cur > maxx)
maxx = cur, cnt = 1, ans[cnt] = s[n];
else if (cur == maxx)
ans[++cnt] = s[n];
cur = 1;
for (int i = 1; i <= cnt; ++i)
cout << ans[i] << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02773 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, maxj = 1;
cin >> n;
string s;
map<string, int> mapj;
for (int i = 0; i < n; i++) {
cin >> s;
if (mapj.count(s)) {
mapj.at(s)++;
maxj = max(maxj, mapj.at(s));
} else {
mapj.insert(make_pair(s, 1));
}
}
for (pair<string, int> i : mapj) {
if (i.second == maxj) {
cout << i.first << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, maxj = 1;
cin >> n;
string s;
map<string, int> mapj;
for (int i = 0; i < n; i++) {
cin >> s;
if (mapj.count(s)) {
mapj.at(s)++;
maxj = max(maxj, mapj.at(s));
} else {
mapj.insert(make_pair(s, 1));
}
}
for (map<string, int>::iterator i = mapj.begin(); i != mapj.end(); i++) {
if (i->second == maxj) {
cout << i->first << endl;
}
}
return 0;
} | replace | 18 | 21 | 18 | 21 | TLE | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string s[100005];
map<string, int> mp;
vector<string> v;
int main() {
ios::sync_with_stdio(false);
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
mp[s[i]]++;
ans = max(ans, mp[s[i]]);
}
for (int i = 1; i <= n; i++) {
if (mp[s[i]] == ans) {
// cout<<s[i]<<'\n';
v.push_back(s[i]);
mp[s[i]] = 0;
}
}
sort(v.begin(), v.end());
for (auto s : v) {
cout << s << '\n';
}
}
| #include <bits/stdc++.h>
using namespace std;
string s[200005];
map<string, int> mp;
vector<string> v;
int main() {
ios::sync_with_stdio(false);
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
mp[s[i]]++;
ans = max(ans, mp[s[i]]);
}
for (int i = 1; i <= n; i++) {
if (mp[s[i]] == ans) {
// cout<<s[i]<<'\n';
v.push_back(s[i]);
mp[s[i]] = 0;
}
}
sort(v.begin(), v.end());
for (auto s : v) {
cout << s << '\n';
}
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<string> S;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
S.push_back(s);
}
sort(S.begin(), S.end());
int count = 1;
int count_max = 1;
deque<string> ans;
ans.push_back(S[0]);
for (int i = 1; i <= N; ++i) {
if (S[i] == ans.back() && i != N) {
++count;
} else {
if (count < count_max) {
ans.pop_back();
} else if (count > count_max) {
ans.clear();
ans.push_back(S[i - 1]);
count_max = count;
}
if (i == N)
break;
count = 1;
ans.push_back(S[i]);
}
}
for_each(ans.begin(), ans.end(), [](string s) { cout << s << '\n'; });
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<string> S;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
S.push_back(s);
}
sort(S.begin(), S.end());
int count = 1;
int count_max = 1;
deque<string> ans;
ans.push_back(S[0]);
for (int i = 1; i <= N; ++i) {
if (i != N && S[i] == ans.back()) {
++count;
} else {
if (count < count_max) {
ans.pop_back();
} else if (count > count_max) {
ans.clear();
ans.push_back(S[i - 1]);
count_max = count;
}
if (i == N)
break;
count = 1;
ans.push_back(S[i]);
}
}
for_each(ans.begin(), ans.end(), [](string s) { cout << s << '\n'; });
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define cube(x) ((x) * (x) * (x))
#define GCD(a, b) __gcd(a, b)
#define LCM(a, b) ((a) * (b) / GCD(a, b))
#define PI (3.141592653589793238462643383279502884197169399375105820974944)
#define MP make_pair
#define n1 first
#define n2 second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define SI set<int>
#define SL set<ll>
#define MS multiset
#define MSI multiset<int>
#define MSLL multiset<ll>
#define PB push_back
#define PF push_front
#define VI vector<int>
#define VPI vector<pair<int, int>>
#define VLL vector<ll>
#define VS vector<string>
#define SZ(x) ((int)x.size())
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const int N = 150555;
const int M = 1155;
VS v[N];
void solve() {
int n;
cin >> n;
map<string, int> m;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
m[s]++;
}
for (auto now : m) {
string x = now.n1;
int y = now.n2;
v[y].PB(x);
}
for (int i = n; i >= 1; i--) {
if (v[i].empty())
continue;
sort(v[i].begin(), v[i].end());
for (auto now : v[i]) {
cout << now << endl;
}
return;
}
}
int main() {
ios_base::sync_with_stdio(false);
#ifdef dxz05
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
int T = 1;
// cin >> T;
while (T--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define cube(x) ((x) * (x) * (x))
#define GCD(a, b) __gcd(a, b)
#define LCM(a, b) ((a) * (b) / GCD(a, b))
#define PI (3.141592653589793238462643383279502884197169399375105820974944)
#define MP make_pair
#define n1 first
#define n2 second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define SI set<int>
#define SL set<ll>
#define MS multiset
#define MSI multiset<int>
#define MSLL multiset<ll>
#define PB push_back
#define PF push_front
#define VI vector<int>
#define VPI vector<pair<int, int>>
#define VLL vector<ll>
#define VS vector<string>
#define SZ(x) ((int)x.size())
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const int N = 250555;
const int M = 1155;
VS v[N];
void solve() {
int n;
cin >> n;
map<string, int> m;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
m[s]++;
}
for (auto now : m) {
string x = now.n1;
int y = now.n2;
v[y].PB(x);
}
for (int i = n; i >= 1; i--) {
if (v[i].empty())
continue;
sort(v[i].begin(), v[i].end());
for (auto now : v[i]) {
cout << now << endl;
}
return;
}
}
int main() {
ios_base::sync_with_stdio(false);
#ifdef dxz05
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
int T = 1;
// cin >> T;
while (T--) {
solve();
}
return 0;
} | replace | 35 | 36 | 35 | 36 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
// #define int long long int
const int MOD = 1000000007;
const ll LINF = (ll)1e18 - 1;
const int INF = 1e9 - 1;
const double EPS = 0.000000001;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void print(const vector<int> &v) {
for (auto x : v) {
cout << x << " ";
}
cout << endl;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<string> s;
map<string, int> mp;
rep(i, n) {
string a;
cin >> a;
s.push_back(a);
}
rep(i, n) mp[s[i]] = 0;
rep(i, n) mp[s[i]]++;
int k = 0;
for (auto m : mp) {
k = max(k, m.second);
}
sort(all(s));
int p, q;
p = q = 0;
while (q < n) {
while (s[p] == s[q] && q < n)
q++;
if (k == (q - p)) {
out(s[p]);
}
p = q;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
// #define int long long int
const int MOD = 1000000007;
const ll LINF = (ll)1e18 - 1;
const int INF = 1e9 - 1;
const double EPS = 0.000000001;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void print(const vector<int> &v) {
for (auto x : v) {
cout << x << " ";
}
cout << endl;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<string> s;
map<string, int> mp;
rep(i, n) {
string a;
cin >> a;
s.push_back(a);
}
rep(i, n) mp[s[i]] = 0;
rep(i, n) mp[s[i]]++;
int k = 0;
for (auto m : mp) {
k = max(k, m.second);
}
sort(all(s));
int p, q;
p = q = 0;
while (q < n) {
while (q < n && s[p] == s[q])
q++;
if (k == (q - p)) {
out(s[p]);
}
p = q;
}
return 0;
}
| replace | 53 | 54 | 53 | 54 | 0 | |
p02773 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i < (ll)(n2); i++)
#define RFOR(i, n1, n2) for (ll i = ((ll)(n1)-1); i >= (ll)(n2); i--)
#define all(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define oorret 0
#define oor(x) \
[&]() { \
try { \
x; \
} catch (const out_of_range &oor) { \
return oorret; \
} \
return x; \
}()
#define IOS cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<ll, ll> P;
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> struct is_vector : std::false_type {};
template <class ValueType, class Alloc>
struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
template <typename T>
inline std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
if (v.empty())
return out;
constexpr bool is_vector_v = is_vector<T>::value;
if (is_vector_v)
for (auto itr = v.begin(); itr != v.end();)
out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
else
for (auto itr = v.begin(); itr != v.end();)
out << (*itr), out << ((++itr != v.end()) ? " " : "");
return out;
}
inline void put() {}
template <class T> inline void put(const T &first) {
std::cout << first << "\n";
}
template <class T, class... N>
inline void put(const T &first, const N &...rest) {
std::cout << first << " ";
put(rest...);
}
inline void putn() {}
template <class T, class... N>
inline void putn(const T &first, const N &...rest) {
std::cout << first << "\n";
putn(rest...);
}
int main() {
IOS;
int n;
cin >> n;
vector<string> s(n);
map<string, int> mp;
REP(i, n) {
cin >> s[i];
mp[s[i]]++;
}
using pr = pair<int, string>;
vector<pr> p;
for (auto v : mp) {
p.push_back(pr(v.second, v.first));
}
sort(all(p));
reverse(all(p));
int m = p[0].first;
vector<string> res;
REP(i, p.size()) {
if (p[i].first == m) {
res.push_back(p[i].second);
}
}
sort(all(res));
REP(i, n) { put(res[i]); }
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i < (ll)(n2); i++)
#define RFOR(i, n1, n2) for (ll i = ((ll)(n1)-1); i >= (ll)(n2); i--)
#define all(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define oorret 0
#define oor(x) \
[&]() { \
try { \
x; \
} catch (const out_of_range &oor) { \
return oorret; \
} \
return x; \
}()
#define IOS cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<ll, ll> P;
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> struct is_vector : std::false_type {};
template <class ValueType, class Alloc>
struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
template <typename T>
inline std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
if (v.empty())
return out;
constexpr bool is_vector_v = is_vector<T>::value;
if (is_vector_v)
for (auto itr = v.begin(); itr != v.end();)
out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
else
for (auto itr = v.begin(); itr != v.end();)
out << (*itr), out << ((++itr != v.end()) ? " " : "");
return out;
}
inline void put() {}
template <class T> inline void put(const T &first) {
std::cout << first << "\n";
}
template <class T, class... N>
inline void put(const T &first, const N &...rest) {
std::cout << first << " ";
put(rest...);
}
inline void putn() {}
template <class T, class... N>
inline void putn(const T &first, const N &...rest) {
std::cout << first << "\n";
putn(rest...);
}
int main() {
IOS;
int n;
cin >> n;
vector<string> s(n);
map<string, int> mp;
REP(i, n) {
cin >> s[i];
mp[s[i]]++;
}
using pr = pair<int, string>;
vector<pr> p;
for (auto v : mp) {
p.push_back(pr(v.second, v.first));
}
sort(all(p));
reverse(all(p));
int m = p[0].first;
vector<string> res;
REP(i, p.size()) {
if (p[i].first == m) {
res.push_back(p[i].second);
}
}
sort(all(res));
REP(i, res.size()) { put(res[i]); }
return 0;
} | replace | 95 | 96 | 95 | 96 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> S(N);
rep(i, N) cin >> S[i];
sort(all(S));
vector<int> s;
int sum = 0;
// rep(i, N)
// cout << S[i] << ' ';
// cout << endl;
int cnt = 0;
rep(i, N) {
cnt++;
if (S[i] != S[i + 1] || i == N - 1) {
sum = max(cnt, sum);
cnt = 0;
s.pb(i);
}
}
// rep(i, s.size())
// cout << s[i] << ' ';
// cout << endl;
rep(i, s.size()) {
if (i == 0) {
if (s[i] + 1 == sum)
cout << S[s[i]] << endl;
} else {
if (s[i] - s[i - 1] == sum) {
cout << S[s[i]] << endl;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> S(N);
rep(i, N) cin >> S[i];
sort(all(S));
vector<int> s;
int sum = 0;
// rep(i, N)
// cout << S[i] << ' ';
// cout << endl;
int cnt = 0;
rep(i, N) {
cnt++;
if ((i != N - 1 && S[i] != S[i + 1]) || i == N - 1) {
sum = max(cnt, sum);
cnt = 0;
s.pb(i);
}
}
// rep(i, s.size())
// cout << s[i] << ' ';
// cout << endl;
rep(i, s.size()) {
if (i == 0) {
if (s[i] + 1 == sum)
cout << S[s[i]] << endl;
} else {
if (s[i] - s[i - 1] == sum) {
cout << S[s[i]] << endl;
}
}
}
}
| replace | 40 | 41 | 40 | 41 | 0 | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define dbg cout << "Freak" << endl;
#define dbgg(i) cout << i << endl;
#define N 1e9 + 7
#define pb push_back
#define pi acos(-1)
using namespace std;
ll arr[100005];
ll t;
vector<string> v, v1;
map<string, ll> mp;
map<string, string> np;
int main() {
ll a, b, c, d, e, f = 0, i, j;
cin >> a;
string s;
for (i = 0; i < a; i++) {
cin >> s;
mp[s]++;
if (mp[s] == 1)
v.pb(s);
}
for (i = 0; i < v.size(); i++) {
f = max(f, mp[v[i]]);
}
for (i = 0; i < v.size(); i++) {
if (mp[v[i]] != f)
mp[v[i]] = 0;
else
v1.pb(v[i]);
}
sort(v1.begin(), v1.end());
for (i = 0; i < v.size(); i++)
cout << v1[i] << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define dbg cout << "Freak" << endl;
#define dbgg(i) cout << i << endl;
#define N 1e9 + 7
#define pb push_back
#define pi acos(-1)
using namespace std;
ll arr[100005];
ll t;
vector<string> v, v1;
map<string, ll> mp;
map<string, string> np;
int main() {
ll a, b, c, d, e, f = 0, i, j;
cin >> a;
string s;
for (i = 0; i < a; i++) {
cin >> s;
mp[s]++;
if (mp[s] == 1)
v.pb(s);
}
for (i = 0; i < v.size(); i++) {
f = max(f, mp[v[i]]);
}
for (i = 0; i < v.size(); i++) {
if (mp[v[i]] != f)
mp[v[i]] = 0;
else
v1.pb(v[i]);
}
sort(v1.begin(), v1.end());
for (i = 0; i < v1.size(); i++)
cout << v1[i] << endl;
}
| replace | 33 | 34 | 33 | 34 | -11 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define _GLIBCXX_DEBUG
#define int long long
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1) {
unsigned day;
if (dow < dow1)
dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
unsigned DayToWeekNumber(unsigned day) { return (day - 1) / 7 + 1; }
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0) {
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int N;
cin >> N;
vector<string> A(N);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end());
int ans = 1;
vector<int> B(N + 1);
REP(i, N) {
if (A[i] == A[i - 1])
ans++;
else {
B[i] = ans;
ans = 1;
}
}
if (ans != 1)
B[N - 1] = ans;
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
ans = 1;
rep(i, N) {
if (A[i] == A[i - 1])
ans++;
else {
if (ans == B[0])
cout << A[i - 1] << endl;
ans = 1;
}
}
if (ans == B[0])
cout << A[N - 1] << endl;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define _GLIBCXX_DEBUG
#define int long long
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1) {
unsigned day;
if (dow < dow1)
dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
unsigned DayToWeekNumber(unsigned day) { return (day - 1) / 7 + 1; }
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0) {
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int N;
cin >> N;
vector<string> A(N);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end());
int ans = 1;
vector<int> B(N + 1);
REP(i, N) {
if (A[i] == A[i - 1])
ans++;
else {
B[i] = ans;
ans = 1;
}
}
if (ans != 1)
B[N - 1] = ans;
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
ans = 1;
REP(i, N) {
if (A[i] == A[i - 1])
ans++;
else {
if (ans == B[0])
cout << A[i - 1] << endl;
ans = 1;
}
}
if (ans == B[0])
cout << A[N - 1] << endl;
} | replace | 75 | 76 | 75 | 76 | 0 | |
p02773 | Python | Time Limit Exceeded | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import Counter
def main():
N = int(input())
S = [input() for _ in range(N)]
S = Counter(S)
result = []
for key, value in S.items():
if value == S.most_common()[0][1]:
result.append(key)
result.sort()
for r in result:
print(r)
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import Counter
def main():
N = int(input())
S = [input() for _ in range(N)]
S = Counter(S)
SM = S.most_common()[0][1]
S = sorted(S.items(), key=lambda x: [-x[1], x[0]])
for key, value in S:
if value == SM:
print(key)
else:
break
if __name__ == "__main__":
main()
| replace | 10 | 17 | 10 | 17 | TLE | |
p02773 | Python | Runtime Error | def main():
n = int(input())
words = {}
for _ in range(n):
a = input()
if a in words:
words[a] += 1
else:
words[a] = 1
max_val = max(words.values())
# words_sorted = sorted(words.items(), key=lambda x: x[0])
for key, value in sorted(words):
if value != max_val:
continue
else:
print(key)
# key valueを両方printするとき
# print('{}:{}'.format(key, value))
if __name__ == "__main__":
main()
| def main():
n = int(input())
words = {}
for _ in range(n):
a = input()
if a in words:
words[a] += 1
else:
words[a] = 1
max_val = max(words.values())
# words_sorted = sorted(words.items(), key=lambda x: x[0])
for key, value in sorted(words.items()):
if value != max_val:
continue
else:
print(key)
# key valueを両方printするとき
# print('{}:{}'.format(key, value))
if __name__ == "__main__":
main()
| replace | 12 | 13 | 12 | 13 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02773/Python/s861205933.py", line 23, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02773/Python/s861205933.py", line 13, in main
for key, value in sorted(words):
ValueError: too many values to unpack (expected 2)
|
p02773 | Python | Time Limit Exceeded | import collections
import sys
input = sys.stdin.readline
q = int(input())
a = [input().rstrip() for _ in range(q)]
dic = collections.Counter(a)
keys = [k for k, v in dic.items() if v == max(dic.values())]
keys_s = sorted(keys)
for i in keys_s:
print(i)
| import collections
import sys
input = sys.stdin.readline
q = int(input())
a = [input().rstrip() for _ in range(q)]
dic = collections.Counter(a)
ma = max(dic.values())
keys = [k for k, v in dic.items() if v == ma]
keys_s = sorted(keys)
for i in keys_s:
print(i)
| replace | 10 | 11 | 10 | 12 | TLE | |
p02773 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long int n;
scanf("%ld", &n);
string s[n];
long int i, max = 0, cnt = 0;
for (i = 0; i < n; ++i)
cin >> s[i];
sort(s, s + n);
for (i = 0; i < n - 1; ++i) {
if (s[i] == s[i + 1])
cnt++;
else {
if (max < cnt)
max = cnt;
cnt = 0;
}
}
if (max < cnt)
max = cnt;
cnt = 0;
for (i = 0; i < n; ++i) {
if (s[i] == s[i + 1])
cnt++;
else {
if (max == cnt)
cout << s[i] << endl;
cnt = 0;
}
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long int n;
scanf("%ld", &n);
string s[n];
long int i, max = 0, cnt = 0;
for (i = 0; i < n; ++i)
cin >> s[i];
sort(s, s + n);
for (i = 0; i < n - 1; ++i) {
if (s[i] == s[i + 1])
cnt++;
else {
if (max < cnt)
max = cnt;
cnt = 0;
}
}
if (max < cnt)
max = cnt;
cnt = 0;
for (i = 0; i < n; ++i) {
if (i != n - 1 && s[i] == s[i + 1])
cnt++;
else {
if (max == cnt)
cout << s[i] << endl;
cnt = 0;
}
}
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02773 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#define mem(i, a) memset(i, a, sizeof(i))
#define PI acos(-1.0)
#define DMAX 100000 + 5
#define MOD 20190823
#define eps 1e-8
#define mp make_pair
#define INF 1000000000 + 9
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
inline void read(int &f) {
f = 0;
ll x = 1;
char ch = getchar();
while (ch < 48 || ch > 57) {
if (ch == '-') {
x = -1;
}
ch = getchar();
}
while (ch <= 57 && ch >= 48) {
f = f * 10 + ch - '0';
ch = getchar();
}
f *= x;
}
int n;
string s[DMAX];
map<string, int> ma;
int ans = 0;
int main() {
read(n);
for (int i = 1; i <= n; i++) {
cin >> s[i];
ma[s[i]]++;
ans = max(ans, ma[s[i]]);
}
sort(s + 1, s + n + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == s[i - 1]) {
continue;
} else {
if (ma[s[i]] == ans) {
cout << s[i] << endl;
}
}
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#define mem(i, a) memset(i, a, sizeof(i))
#define PI acos(-1.0)
#define DMAX 200000 + 5
#define MOD 20190823
#define eps 1e-8
#define mp make_pair
#define INF 1000000000 + 9
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
inline void read(int &f) {
f = 0;
ll x = 1;
char ch = getchar();
while (ch < 48 || ch > 57) {
if (ch == '-') {
x = -1;
}
ch = getchar();
}
while (ch <= 57 && ch >= 48) {
f = f * 10 + ch - '0';
ch = getchar();
}
f *= x;
}
int n;
string s[DMAX];
map<string, int> ma;
int ans = 0;
int main() {
read(n);
for (int i = 1; i <= n; i++) {
cin >> s[i];
ma[s[i]]++;
ans = max(ans, ma[s[i]]);
}
sort(s + 1, s + n + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == s[i - 1]) {
continue;
} else {
if (ma[s[i]] == ans) {
cout << s[i] << endl;
}
}
}
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02774 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
ll K;
cin >> N >> K;
ll A;
vector<ll> B;
vector<ll> C;
ll z = 0;
for (int i = 0; i < N; i++) {
cin >> A;
if (A == 0)
z++;
else if (A < 0)
B.push_back(A);
else
C.push_back(A);
}
ll nb = B.size();
ll nc = C.size();
ll f0 = nb * nc;
ll f1 = f0 + z * (nb + nc) + (z * (z - 1)) / 2;
sort(B.begin(), B.end());
if (K <= f0) {
sort(C.begin(), C.end(), greater<ll>());
ll l = -1e18 - 1ll;
ll r = 0;
while (r - l > 1) {
ll m = (l + r) / 2;
ll sum = 0;
for (int i = 0; i < nb; i++) {
int j = 0;
while (j < nc && B[i] * C[j] <= m)
j++;
if (j == 0)
break;
// cout << i << " " << j << " " << m << endl;
sum += j;
}
// cout << sum << " " << m << "\n";
if (sum < K)
l = m;
else
r = m;
}
cout << r << "\n";
} else if (K <= f1) {
cout << "0\n";
} else {
sort(C.begin(), C.end());
ll l = 0;
ll r = 1e18 + 1ll;
while (r - l > 1) {
ll m = (l + r) / 2;
ll sum = f1;
int j = nb - 1;
for (int i = 0; i < nb - 1; i++) {
while (j >= 0 && B[i] * B[j] <= m)
j--;
sum += min((int)nb - j - 1, (int)nb - i - 1);
}
j = 0;
for (int i = nc - 1; i >= 1; i--) {
while (j < nc && C[i] * C[j] <= m)
j++;
sum += min(i, j);
}
// cout << sum << " " << m << "\n";
if (sum < K)
l = m;
else
r = m;
}
cout << r << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
ll K;
cin >> N >> K;
ll A;
vector<ll> B;
vector<ll> C;
ll z = 0;
for (int i = 0; i < N; i++) {
cin >> A;
if (A == 0)
z++;
else if (A < 0)
B.push_back(A);
else
C.push_back(A);
}
ll nb = B.size();
ll nc = C.size();
ll f0 = nb * nc;
ll f1 = f0 + z * (nb + nc) + (z * (z - 1)) / 2;
sort(B.begin(), B.end());
if (K <= f0) {
sort(C.begin(), C.end(), greater<ll>());
ll l = -1e18 - 1ll;
ll r = 0;
while (r - l > 1) {
ll m = (l + r) / 2;
ll sum = 0;
int j = nb;
for (int i = 0; i < nc; i++) {
j = upper_bound(B.begin(), B.begin() + j,
m / C[i] - (m % C[i] ? 1 : 0)) -
B.begin();
// while (j < nc && B[i] * C[j] <= m)
// j++;
if (j == 0)
break;
// cout << i << " " << j << " " << m << endl;
sum += j;
}
// cout << sum << " " << m << "\n";
if (sum < K)
l = m;
else
r = m;
}
cout << r << "\n";
} else if (K <= f1) {
cout << "0\n";
} else {
sort(C.begin(), C.end());
ll l = 0;
ll r = 1e18 + 1ll;
while (r - l > 1) {
ll m = (l + r) / 2;
ll sum = f1;
int j = nb - 1;
for (int i = 0; i < nb - 1; i++) {
while (j >= 0 && B[i] * B[j] <= m)
j--;
sum += min((int)nb - j - 1, (int)nb - i - 1);
}
j = 0;
for (int i = nc - 1; i >= 1; i--) {
while (j < nc && C[i] * C[j] <= m)
j++;
sum += min(i, j);
}
// cout << sum << " " << m << "\n";
if (sum < K)
l = m;
else
r = m;
}
cout << r << "\n";
}
return 0;
}
| replace | 32 | 36 | 32 | 39 | TLE | |
p02774 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<long long> a;
long long check(long long x) {
long long ret = 0, n = a.size();
for (int i = 0; i < n; ++i) {
if (a[i] == 0) {
ret += n - 1;
} else if (a[i] < 0) {
int l = 0, r = n - 1;
while (l <= r) {
int mid = (l + r) / 2;
if (a[i] * a[mid] > x)
l = mid + 1;
else
r = mid - 1;
}
ret += n - l;
if (a[i] * a[i] <= x)
ret--;
} else {
int l = 0, r = n - 1;
while (l <= r) {
int mid = (l + r) / 2;
if (a[i] * a[mid] <= x)
l = mid + 1;
else
r = mid - 1;
}
ret += l;
if (a[i] * a[i] <= x)
ret--;
}
}
assert(ret % 2 == 0);
return ret / 2;
}
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
long long n, k;
cin >> n >> k;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a.begin(), a.end());
long long l = -1e18, r = 1e18;
while (l < r) {
long long mid = (l + r) >> 1;
if (check(mid) >= k)
r = mid;
else
l = mid + 1;
}
cout << r << '\n';
} | #include <bits/stdc++.h>
using namespace std;
vector<long long> a;
long long check(long long x) {
long long ret = 0, n = a.size();
for (int i = 0; i < n; ++i) {
if (a[i] == 0) {
if (0 <= x)
ret += n - 1;
} else if (a[i] < 0) {
int l = 0, r = n - 1;
while (l <= r) {
int mid = (l + r) / 2;
if (a[i] * a[mid] > x)
l = mid + 1;
else
r = mid - 1;
}
ret += n - l;
if (a[i] * a[i] <= x)
ret--;
} else {
int l = 0, r = n - 1;
while (l <= r) {
int mid = (l + r) / 2;
if (a[i] * a[mid] <= x)
l = mid + 1;
else
r = mid - 1;
}
ret += l;
if (a[i] * a[i] <= x)
ret--;
}
}
assert(ret % 2 == 0);
return ret / 2;
}
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
long long n, k;
cin >> n >> k;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a.begin(), a.end());
long long l = -1e18, r = 1e18;
while (l < r) {
long long mid = (l + r) >> 1;
if (check(mid) >= k)
r = mid;
else
l = mid + 1;
}
cout << r << '\n';
} | replace | 8 | 9 | 8 | 10 | 0 | |
p02774 | C++ | Runtime Error | // Etavioxy
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#define il inline
#define ll long long
#define rep(i, s, t) for (register int i = (s); i <= (t); i++)
#define rev_rep(i, s, t) for (register int i = (s); i >= (t); i--)
#define each(i, u) for (int i = head[u]; i; i = bow[i].nxt)
#define file(s) freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)
#define pt(x) putchar(x)
using namespace std;
il int ci() {
register char ch;
int f = 1;
while (!isdigit(ch = getchar()))
f = ch == '-' ? -1 : 1;
register int x = ch ^ '0';
while (isdigit(ch = getchar()))
x = (x * 10) + (ch ^ '0');
return f * x;
}
enum { N = 100023 };
ll a[N];
ll n;
il ll *lower(ll *l, ll *r, ll x, ll k) {
while (l < r) {
ll *w = l + (r - l) / 2;
if (x * (*w) <= k)
r = w;
else
l = w + 1;
}
return l;
}
il ll *upper(ll *l, ll *r, ll x, ll k) {
while (l < r) {
ll *w = l + (r - l + 1) / 2;
if (x * (*w) <= k)
l = w;
else
r = w - 1;
}
return l;
}
il ll calc(ll w) {
ll ans = 0;
rep(i, 1, n) {
if (a[i] == 0)
ans += w >= 0 ? n - i : 0;
else if (a[i] > 0) {
ans += max(0ll, (ll)(upper(a + i, a + n, a[i], w) - a - i));
} else {
ans += max(0ll, (ll)(n - (lower(a + i + 1, a + n + 1, a[i], w) - a) + 1));
}
// printf("[%d] : %lld\n",i,ans);
}
return ans;
}
int main() {
n = ci();
ll k;
scanf("%lld", &k);
rep(i, 1, n) a[i] = ci();
sort(a + 1, a + n + 1);
ll l = -1e18, r = 1e18;
// rep(i,-12,9) printf("%d : %lld\n",i,calc(i));
// return 0;
while (l < r) {
ll w = l + (r - l) / 2;
if (calc(w) < k)
l = w + 1;
else
r = w;
}
printf("%lld\n", l);
return 0;
}
| // Etavioxy
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#define il inline
#define ll long long
#define rep(i, s, t) for (register int i = (s); i <= (t); i++)
#define rev_rep(i, s, t) for (register int i = (s); i >= (t); i--)
#define each(i, u) for (int i = head[u]; i; i = bow[i].nxt)
#define file(s) freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)
#define pt(x) putchar(x)
using namespace std;
il int ci() {
register char ch;
int f = 1;
while (!isdigit(ch = getchar()))
f = ch == '-' ? -1 : 1;
register int x = ch ^ '0';
while (isdigit(ch = getchar()))
x = (x * 10) + (ch ^ '0');
return f * x;
}
enum { N = 200023 };
ll a[N];
ll n;
il ll *lower(ll *l, ll *r, ll x, ll k) {
while (l < r) {
ll *w = l + (r - l) / 2;
if (x * (*w) <= k)
r = w;
else
l = w + 1;
}
return l;
}
il ll *upper(ll *l, ll *r, ll x, ll k) {
while (l < r) {
ll *w = l + (r - l + 1) / 2;
if (x * (*w) <= k)
l = w;
else
r = w - 1;
}
return l;
}
il ll calc(ll w) {
ll ans = 0;
rep(i, 1, n) {
if (a[i] == 0)
ans += w >= 0 ? n - i : 0;
else if (a[i] > 0) {
ans += max(0ll, (ll)(upper(a + i, a + n, a[i], w) - a - i));
} else {
ans += max(0ll, (ll)(n - (lower(a + i + 1, a + n + 1, a[i], w) - a) + 1));
}
// printf("[%d] : %lld\n",i,ans);
}
return ans;
}
int main() {
n = ci();
ll k;
scanf("%lld", &k);
rep(i, 1, n) a[i] = ci();
sort(a + 1, a + n + 1);
ll l = -1e18, r = 1e18;
// rep(i,-12,9) printf("%d : %lld\n",i,calc(i));
// return 0;
while (l < r) {
ll w = l + (r - l) / 2;
if (calc(w) < k)
l = w + 1;
else
r = w;
}
printf("%lld\n", l);
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02774 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 100005
typedef long long ll;
using namespace std;
int a[N], b[N];
vector<int> v1, v2;
ll k;
bool check1(ll mid) {
ll num = 0;
for (int i = 0; i < v1.size(); i++) {
ll x = mid / v1[i];
if (mid % v1[i])
x++;
int p = lower_bound(v1.begin(), v1.end(), x) - v1.begin();
p = max(i + 1, p);
num += v1.size() - p;
}
// cout<<num<<endl;
for (int i = 0; i < v2.size(); i++) {
ll x = mid / v2[i];
if (mid % v2[i])
x++;
int p = lower_bound(v2.begin(), v2.end(), x) - v2.begin();
p = max(i + 1, p);
num += v2.size() - p;
}
// cout<<num<<endl;
return (num >= k);
}
bool check2(ll mid) {
ll num = 0;
for (int i = 0; i < v1.size(); i++) {
ll x = mid / v1[i];
if (mid % v1[i])
x++;
int p = lower_bound(v2.begin(), v2.end(), x) - v2.begin();
num += v2.size() - p;
}
return (num >= k);
}
int main() {
int n, m;
scanf("%d%lld", &n, &k);
k = 1ll * (n - 1) * n / 2 - k + 1;
// cout<<k<<endl;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int a0 = 0;
for (int i = 1; i <= n; i++) {
if (a[i] > 0) {
v1.push_back(a[i]);
} else if (a[i] < 0) {
v2.push_back(-a[i]);
} else {
a0++;
}
}
ll sum0 = 1ll * a0 * (n - a0) + 1ll * a0 * (a0 - 1) / 2;
ll sum1 = 1ll * (int)v1.size() * ((int)v1.size() - 1) / 2 +
1ll * (int)v2.size() * ((int)v2.size() - 1) / 2;
ll sum2 = 1ll * (int)v2.size() * (int)v1.size();
// cout<<sum1<<" "<<sum0<<" "<<sum2<<endl;
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
if (k <= sum1) {
// cout<<check1(10)<<endl;
ll l = 1, r = 1e18, ans = 1;
while (l <= r) {
ll mid = (l + r) / 2;
if (check1(mid))
l = (ans = mid) + 1;
else
r = mid - 1;
}
printf("%lld\n", ans);
} else if (k > sum1 && k <= sum0 + sum1) {
puts("0");
} else {
k = sum0 + sum1 + sum2 - k + 1;
ll l = -1e18, r = -1, ans = -1;
while (l <= r) {
ll mid = (l + r) / 2;
if (check2(-mid))
r = (ans = mid) - 1;
else
l = mid + 1;
}
printf("%lld\n", ans);
}
}
/*
3 3 3
2 3 4
4 5 6
3 3 7
-2 -3 -4
4 5 6
*/
| #include <bits/stdc++.h>
#define N 200005
typedef long long ll;
using namespace std;
int a[N], b[N];
vector<int> v1, v2;
ll k;
bool check1(ll mid) {
ll num = 0;
for (int i = 0; i < v1.size(); i++) {
ll x = mid / v1[i];
if (mid % v1[i])
x++;
int p = lower_bound(v1.begin(), v1.end(), x) - v1.begin();
p = max(i + 1, p);
num += v1.size() - p;
}
// cout<<num<<endl;
for (int i = 0; i < v2.size(); i++) {
ll x = mid / v2[i];
if (mid % v2[i])
x++;
int p = lower_bound(v2.begin(), v2.end(), x) - v2.begin();
p = max(i + 1, p);
num += v2.size() - p;
}
// cout<<num<<endl;
return (num >= k);
}
bool check2(ll mid) {
ll num = 0;
for (int i = 0; i < v1.size(); i++) {
ll x = mid / v1[i];
if (mid % v1[i])
x++;
int p = lower_bound(v2.begin(), v2.end(), x) - v2.begin();
num += v2.size() - p;
}
return (num >= k);
}
int main() {
int n, m;
scanf("%d%lld", &n, &k);
k = 1ll * (n - 1) * n / 2 - k + 1;
// cout<<k<<endl;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int a0 = 0;
for (int i = 1; i <= n; i++) {
if (a[i] > 0) {
v1.push_back(a[i]);
} else if (a[i] < 0) {
v2.push_back(-a[i]);
} else {
a0++;
}
}
ll sum0 = 1ll * a0 * (n - a0) + 1ll * a0 * (a0 - 1) / 2;
ll sum1 = 1ll * (int)v1.size() * ((int)v1.size() - 1) / 2 +
1ll * (int)v2.size() * ((int)v2.size() - 1) / 2;
ll sum2 = 1ll * (int)v2.size() * (int)v1.size();
// cout<<sum1<<" "<<sum0<<" "<<sum2<<endl;
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
if (k <= sum1) {
// cout<<check1(10)<<endl;
ll l = 1, r = 1e18, ans = 1;
while (l <= r) {
ll mid = (l + r) / 2;
if (check1(mid))
l = (ans = mid) + 1;
else
r = mid - 1;
}
printf("%lld\n", ans);
} else if (k > sum1 && k <= sum0 + sum1) {
puts("0");
} else {
k = sum0 + sum1 + sum2 - k + 1;
ll l = -1e18, r = -1, ans = -1;
while (l <= r) {
ll mid = (l + r) / 2;
if (check2(-mid))
r = (ans = mid) - 1;
else
l = mid + 1;
}
printf("%lld\n", ans);
}
}
/*
3 3 3
2 3 4
4 5 6
3 3 7
-2 -3 -4
4 5 6
*/
| replace | 1 | 2 | 1 | 2 | 0 | |
p02774 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
// [a -> b-1]
#define reps(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
// [0 -> a-1]
#define rep(i, a) reps(i, 0, (a))
// [a-1 -> b]
#define rreps(i, a, b) for (int i = (int)((a)-1); i >= (int)(b); i--)
// [a-1 -> 0]
#define rrep(i, a) rreps(i, a, 0)
#define all(v) (v).begin(), (v).end()
// next_permutation(all(v))
#define PERM(v) next_permutation(all(v))
/*sort(all(v));
* (v).erase(unique(all(v)), v.end())*/
#define UNIQUE(v) \
sort(all(v)); \
(v).erase(unique(all(v)), v.end())
// b is [a, c)
#define RANGE(a, b, c) ((a) <= (b) && (b) < (c))
// c is [a, e) && d is [b, f)
#define RANGE2D(a, b, c, d, e, f) (RANGE((a), (c), (e)) && RANGE((b), (d), (f)))
#define chmin(a, b) a = min(a, (b))
#define chmax(a, b) a = max(a, (b))
#define fcout cout << fixed << setprecision(15)
#define YES(f) cout << ((f) ? YES_STR : NO_STR) << endl;
#ifdef LOCAL_DEBUG_OPTION
namespace debug_print_n {
struct DebugPrint {
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_integral<U>::value && !is_same<U, bool>::value &&
!is_same<U, char>::value>
DUMP_SUB_FUNCTION(T x) {
cerr << x;
}
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_same<U, bool>::value> DUMP_SUB_FUNCTION(T x) {
if (x)
cerr << "True";
else
cerr << "False";
}
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_same<U, char>::value> DUMP_SUB_FUNCTION(T x) {
cerr << '\'' << x << '\'';
}
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_same<U, string>::value> DUMP_SUB_FUNCTION(T x) {
cerr << '\"' << x << '\"';
}
template <class T>
static enable_if_t<is_same<T, const char *>::value> DUMP_SUB_FUNCTION(T x) {
cerr << string(x);
}
template <class T> static enable_if_t<true> DUMP_SUB_FUNCTION(vector<T> x) {
cerr << '{';
for (size_t i = 0; i < x.size(); i++) {
if (i)
cerr << ", ";
DUMP_SUB_FUNCTION(x[i]);
}
cerr << '}';
}
template <class T, size_t N>
static enable_if_t<true> DUMP_SUB_FUNCTION(array<T, N> x) {
cerr << '{';
for (size_t i = 0; i < x.size(); i++) {
if (i)
cerr << ", ";
DUMP_SUB_FUNCTION(x[i]);
}
cerr << '}';
}
template <class T> static enable_if_t<true> DUMP_SUB_FUNCTION(set<T> x) {
cerr << '[';
size_t i = 0;
for (auto itr = x.begin(); itr != x.end(); itr++, i++) {
if (i)
cerr << ", ";
DUMP_SUB_FUNCTION(*itr);
}
cerr << ']';
}
template <class T, class U>
static enable_if_t<true> DUMP_SUB_FUNCTION(map<T, U> x) {
cerr << '[';
size_t i = 0;
for (auto itr = x.begin(); itr != x.end(); itr++, i++) {
if (i)
cerr << ", ";
DUMP_SUB_FUNCTION(itr->first);
cerr << " : ";
DUMP_SUB_FUNCTION(itr->second);
}
cerr << ']';
}
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_floating_point<U>::value> DUMP_SUB_FUNCTION(T x) {
cerr << fixed << setprecision(5) << x;
}
template <class T, class U>
static enable_if_t<true> DUMP_SUB_FUNCTION(pair<T, U> p) {
cerr << '(';
DUMP_SUB_FUNCTION(p.first);
cerr << ", ";
DUMP_SUB_FUNCTION(p.second);
cerr << ')';
}
template <int num = 0, class... Args>
static enable_if_t<num == sizeof...(Args)>
DUMP_SUB_FUNCTION(tuple<Args...> t) {
if (num)
cerr << ')';
}
template <int num = 0, class... Args>
static enable_if_t <
num<sizeof...(Args)> DUMP_SUB_FUNCTION(tuple<Args...> t) {
if (num == 0)
cerr << '(';
DUMP_SUB_FUNCTION(get<num>(t));
if (num + 1 < sizeof...(Args))
cerr << ", ";
DUMP_SUB_FUNCTION<num + 1>(t);
}
template <long unsigned N>
static enable_if_t<true> DUMP_SUB_FUNCTION(bitset<N> x) {
cerr << x;
}
};
void dump() { cerr << endl; }
template <class Head, class... Tail> void dump(Head &&head, Tail &&...tail) {
DebugPrint::DUMP_SUB_FUNCTION(head);
if (sizeof...(Tail) != 0) {
cerr << ' ';
}
dump(forward<Tail>(tail)...);
}
} // namespace debug_print_n
using debug_print_n::dump;
#else
template <class... Args> void dump(Args &&...args) {}
#endif
// meguru<T>(ok, ng, isok)で呼ぶ
template <class T> T meguru(T ok, T ng, function<bool(T)> isok) {
while (abs(ok - ng) > 1) {
T mid = (ok + ng) / 2;
(isok(mid) ? ok : ng) = mid;
}
return ok;
}
signed main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
auto cnt = [&](int mid) -> int { // mid 以下の数
int res = 0;
rep(i, N) {
if (A[i] < 0) {
res +=
i - meguru<int>(i, -1, [&](int p) { return A[p] * A[i] <= mid; });
} else if (A[i] == 0) {
if (mid >= 0)
res += i;
} else {
res += meguru<int>(i, -1, [&](int p) { return A[p] * A[i] > mid; });
}
}
return res;
};
cout << meguru<int>(2e18, -2e18, [&](auto mid) { return cnt(mid) >= K; })
<< endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
// [a -> b-1]
#define reps(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
// [0 -> a-1]
#define rep(i, a) reps(i, 0, (a))
// [a-1 -> b]
#define rreps(i, a, b) for (int i = (int)((a)-1); i >= (int)(b); i--)
// [a-1 -> 0]
#define rrep(i, a) rreps(i, a, 0)
#define all(v) (v).begin(), (v).end()
// next_permutation(all(v))
#define PERM(v) next_permutation(all(v))
/*sort(all(v));
* (v).erase(unique(all(v)), v.end())*/
#define UNIQUE(v) \
sort(all(v)); \
(v).erase(unique(all(v)), v.end())
// b is [a, c)
#define RANGE(a, b, c) ((a) <= (b) && (b) < (c))
// c is [a, e) && d is [b, f)
#define RANGE2D(a, b, c, d, e, f) (RANGE((a), (c), (e)) && RANGE((b), (d), (f)))
#define chmin(a, b) a = min(a, (b))
#define chmax(a, b) a = max(a, (b))
#define fcout cout << fixed << setprecision(15)
#define YES(f) cout << ((f) ? YES_STR : NO_STR) << endl;
#ifdef LOCAL_DEBUG_OPTION
namespace debug_print_n {
struct DebugPrint {
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_integral<U>::value && !is_same<U, bool>::value &&
!is_same<U, char>::value>
DUMP_SUB_FUNCTION(T x) {
cerr << x;
}
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_same<U, bool>::value> DUMP_SUB_FUNCTION(T x) {
if (x)
cerr << "True";
else
cerr << "False";
}
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_same<U, char>::value> DUMP_SUB_FUNCTION(T x) {
cerr << '\'' << x << '\'';
}
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_same<U, string>::value> DUMP_SUB_FUNCTION(T x) {
cerr << '\"' << x << '\"';
}
template <class T>
static enable_if_t<is_same<T, const char *>::value> DUMP_SUB_FUNCTION(T x) {
cerr << string(x);
}
template <class T> static enable_if_t<true> DUMP_SUB_FUNCTION(vector<T> x) {
cerr << '{';
for (size_t i = 0; i < x.size(); i++) {
if (i)
cerr << ", ";
DUMP_SUB_FUNCTION(x[i]);
}
cerr << '}';
}
template <class T, size_t N>
static enable_if_t<true> DUMP_SUB_FUNCTION(array<T, N> x) {
cerr << '{';
for (size_t i = 0; i < x.size(); i++) {
if (i)
cerr << ", ";
DUMP_SUB_FUNCTION(x[i]);
}
cerr << '}';
}
template <class T> static enable_if_t<true> DUMP_SUB_FUNCTION(set<T> x) {
cerr << '[';
size_t i = 0;
for (auto itr = x.begin(); itr != x.end(); itr++, i++) {
if (i)
cerr << ", ";
DUMP_SUB_FUNCTION(*itr);
}
cerr << ']';
}
template <class T, class U>
static enable_if_t<true> DUMP_SUB_FUNCTION(map<T, U> x) {
cerr << '[';
size_t i = 0;
for (auto itr = x.begin(); itr != x.end(); itr++, i++) {
if (i)
cerr << ", ";
DUMP_SUB_FUNCTION(itr->first);
cerr << " : ";
DUMP_SUB_FUNCTION(itr->second);
}
cerr << ']';
}
template <class T, class U = remove_const_t<remove_reference_t<T>>>
static enable_if_t<is_floating_point<U>::value> DUMP_SUB_FUNCTION(T x) {
cerr << fixed << setprecision(5) << x;
}
template <class T, class U>
static enable_if_t<true> DUMP_SUB_FUNCTION(pair<T, U> p) {
cerr << '(';
DUMP_SUB_FUNCTION(p.first);
cerr << ", ";
DUMP_SUB_FUNCTION(p.second);
cerr << ')';
}
template <int num = 0, class... Args>
static enable_if_t<num == sizeof...(Args)>
DUMP_SUB_FUNCTION(tuple<Args...> t) {
if (num)
cerr << ')';
}
template <int num = 0, class... Args>
static enable_if_t <
num<sizeof...(Args)> DUMP_SUB_FUNCTION(tuple<Args...> t) {
if (num == 0)
cerr << '(';
DUMP_SUB_FUNCTION(get<num>(t));
if (num + 1 < sizeof...(Args))
cerr << ", ";
DUMP_SUB_FUNCTION<num + 1>(t);
}
template <long unsigned N>
static enable_if_t<true> DUMP_SUB_FUNCTION(bitset<N> x) {
cerr << x;
}
};
void dump() { cerr << endl; }
template <class Head, class... Tail> void dump(Head &&head, Tail &&...tail) {
DebugPrint::DUMP_SUB_FUNCTION(head);
if (sizeof...(Tail) != 0) {
cerr << ' ';
}
dump(forward<Tail>(tail)...);
}
} // namespace debug_print_n
using debug_print_n::dump;
#else
template <class... Args> void dump(Args &&...args) {}
#endif
// meguru<T>(ok, ng, isok)で呼ぶ
template <class T> T meguru(T ok, T ng, function<bool(T)> isok) {
while (abs(ok - ng) > 1) {
T mid = (ok + ng) / 2;
(isok(mid) ? ok : ng) = mid;
}
return ok;
}
signed main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) scanf("%lld", &A[i]);
sort(all(A));
auto cnt = [&](int mid) -> int { // mid 以下の数
int res = 0;
rep(i, N) {
if (A[i] < 0) {
res +=
i - meguru<int>(i, -1, [&](int p) { return A[p] * A[i] <= mid; });
} else if (A[i] == 0) {
if (mid >= 0)
res += i;
} else {
res += meguru<int>(i, -1, [&](int p) { return A[p] * A[i] > mid; });
}
}
return res;
};
cout << meguru<int>(2e18, -2e18, [&](auto mid) { return cnt(mid) >= K; })
<< endl;
}
| replace | 161 | 162 | 161 | 162 | TLE | |
p02774 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 INF (ll)2e9
#define MOD ((ll)1e9 + 7)
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define bit(n) (1LL << (n))
#define cauto const auto &
#define println(v) cout << v << "\n";
void show(vector<ll> &arr, int w = 4) {
REP(i, arr.size()) { cout << right << setw(w) << i; }
cout << endl;
REP(i, arr.size()) {
if (abs(INF - arr[i]) < 1e5) {
cout << right << setw(w) << (arr[i] == INF ? "INF" : "inf");
} else {
cout << right << setw(w) << arr[i];
}
}
cout << endl;
}
void show(vector<vector<ll>> &arr, int w = 4) {
cout << right << setw(w) << "#";
REP(i, SZ(arr[0])) { cout << right << setw(w) << i; }
cout << endl;
REP(i, SZ(arr)) {
cout << right << setw(w) << i;
REP(j, SZ(arr[0])) {
if (abs(INF - arr[i][j]) < 1e5) {
cout << right << setw(w) << (arr[i][j] == INF ? "INF" : "inf");
} else {
cout << right << setw(w) << arr[i][j];
}
}
cout << endl;
}
}
void show(vector<vector<vector<ll>>> &arr, int w = 4) {
REP(i, arr.size()) {
println("i: " + to_string(i));
show(arr[i], w);
println("");
}
}
inline vector<vector<vector<ll>>> make_vector(ll i, ll j, ll k) {
vector<vector<vector<ll>>> v(i, vector<vector<ll>>(j, vector<ll>(k, 0)));
return v;
}
inline vector<vector<ll>> make_vector(ll i, ll j) {
vector<vector<ll>> v(i, vector<ll>(j, 0));
return v;
}
template <class InputIterator>
InputIterator
adv(InputIterator x,
typename std::iterator_traits<InputIterator>::difference_type n) {
advance(x, n);
return x;
}
class mod {
static ll fact[];
public:
template <class... A> static ll mul(A... args) {
ll res = 1;
for (ll i : std::initializer_list<ll>{args...}) {
res = (res * i) % MOD;
}
return res;
}
static ll power(ll base, ll exp) {
if (exp == 0)
return 1;
if (exp & 1) {
return mul(base, power(base, exp - 1));
} else {
ll p = power(base, exp / 2);
return mul(p, p);
}
}
static void calc_factorial(int n) {
fact[0] = 1;
FOR(i, 1, n + 1) { fact[i] = mul(fact[i - 1], i); }
}
static ll factorial(int n) {
if (fact[n] != 0)
return fact[n];
if (n == 0)
return 1;
return fact[n] = mul(n, factorial(n - 1));
}
static ll inverse(int n) { return power(n, MOD - 2); }
static ll comb(int n, int r) {
if (r < 0 || r > n)
return 0;
return mul(factorial(n), inverse(factorial(n - r)), inverse(factorial(r)));
}
template <class... A> static ll div(ll dividend, A... args) {
ll res = dividend;
for (ll i : std::initializer_list<ll>{args...}) {
res = mul(res, inverse(i));
}
return res;
}
template <class... A> static ll add(A... args) {
ll res = 0;
for (ll i : std::initializer_list<ll>{args...}) {
res = (res + i) % MOD;
}
return res;
}
template <class... A> static ll sub(ll l, A... args) {
ll res = l;
for (ll i : std::initializer_list<ll>{args...}) {
res = (res - i + MOD) % MOD;
}
return res;
}
};
ll mod::fact[(int)2e6 + 1];
int ni() {
int i;
cin >> i;
return i;
}
ll nll() {
ll l;
cin >> l;
return l;
}
class math {
public:
/*
* n <= a/b なる最大の整数nを返す
*/
static ll floor(ll a, ll b) {
if (b < 0) {
a *= -1;
b *= -1;
}
if (a > 0) {
// 絶対値の小さい方に丸められる(正なら負の方向)
return a / b;
} else {
// よくある切り上げのテクニックの切り捨て版
return (a - b + 1) / b;
}
}
/*
* n >= a/b なる最小の整数nを返す
*/
static ll ceil(ll a, ll b) {
if (b < 0) {
a *= -1;
b *= -1;
}
if (a > 0) {
// よくある切り上げのテクニック
return (a + b - 1) / b;
} else {
// 絶対値の小さい方に丸められる(負なら正の方向)
return a / b;
}
}
/*
* aとbの最大公約数を求める
*/
static ll gcd(ll a, ll b) {
long M = max(a, b);
long m = min(a, b);
if (m == 0) {
return M;
}
return gcd(m, M % m);
}
/*
* aとbの最小公倍数を求める
*/
static ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
/*
* n(2^62以下)の平方根の整数部分を返す
* doubleの精度には限界があるので整数の二分探索で求める
*/
static ll sqrt(ll n) {
ll high = bit(31) + 1;
ll low = 0;
ll mid;
while (high - low > 1) {
mid = (high + low) / 2;
if (mid * mid <= n) {
low = mid;
} else {
high = mid;
}
}
return low;
}
};
template <class T, class F> ll binary_count(vector<T> A, F f) {
int N = SZ(A);
bool first = f(A[0]);
bool last = f(A[N - 1]);
if (first && last)
return N;
if (!first && !last)
return 0;
int ok, ng, mid;
if (last) {
ok = N - 1;
ng = 0;
} else {
ok = 0;
ng = N - 1;
}
while (abs(ok - ng) > 1) {
mid = (ok + ng) / 2;
if (f(A[mid])) {
ok = mid;
} else {
ng = mid;
}
}
return (first ? ok + 1 : N - ok);
}
int main() {
int N = ni();
ll K = nll();
vector<ll> A(N);
REP(i, N) A[i] = nll();
sort(ALL(A));
ll ok = -1e18;
ll ng = 1e18 + 1;
ll mid;
while (abs(ok - ng) > 1) {
mid = (ok + ng) / 2;
ll sum = 0;
REP(i, N) {
ll a = A[i];
ll c = binary_count(A, [mid, a](ll b) { return a * b < mid; });
if (a * a < mid)
c--;
sum += c;
}
sum /= 2;
if (sum < K) {
ok = mid;
} else {
ng = mid;
}
}
println(ok);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 INF (ll)2e9
#define MOD ((ll)1e9 + 7)
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define bit(n) (1LL << (n))
#define cauto const auto &
#define println(v) cout << v << "\n";
void show(vector<ll> &arr, int w = 4) {
REP(i, arr.size()) { cout << right << setw(w) << i; }
cout << endl;
REP(i, arr.size()) {
if (abs(INF - arr[i]) < 1e5) {
cout << right << setw(w) << (arr[i] == INF ? "INF" : "inf");
} else {
cout << right << setw(w) << arr[i];
}
}
cout << endl;
}
void show(vector<vector<ll>> &arr, int w = 4) {
cout << right << setw(w) << "#";
REP(i, SZ(arr[0])) { cout << right << setw(w) << i; }
cout << endl;
REP(i, SZ(arr)) {
cout << right << setw(w) << i;
REP(j, SZ(arr[0])) {
if (abs(INF - arr[i][j]) < 1e5) {
cout << right << setw(w) << (arr[i][j] == INF ? "INF" : "inf");
} else {
cout << right << setw(w) << arr[i][j];
}
}
cout << endl;
}
}
void show(vector<vector<vector<ll>>> &arr, int w = 4) {
REP(i, arr.size()) {
println("i: " + to_string(i));
show(arr[i], w);
println("");
}
}
inline vector<vector<vector<ll>>> make_vector(ll i, ll j, ll k) {
vector<vector<vector<ll>>> v(i, vector<vector<ll>>(j, vector<ll>(k, 0)));
return v;
}
inline vector<vector<ll>> make_vector(ll i, ll j) {
vector<vector<ll>> v(i, vector<ll>(j, 0));
return v;
}
template <class InputIterator>
InputIterator
adv(InputIterator x,
typename std::iterator_traits<InputIterator>::difference_type n) {
advance(x, n);
return x;
}
class mod {
static ll fact[];
public:
template <class... A> static ll mul(A... args) {
ll res = 1;
for (ll i : std::initializer_list<ll>{args...}) {
res = (res * i) % MOD;
}
return res;
}
static ll power(ll base, ll exp) {
if (exp == 0)
return 1;
if (exp & 1) {
return mul(base, power(base, exp - 1));
} else {
ll p = power(base, exp / 2);
return mul(p, p);
}
}
static void calc_factorial(int n) {
fact[0] = 1;
FOR(i, 1, n + 1) { fact[i] = mul(fact[i - 1], i); }
}
static ll factorial(int n) {
if (fact[n] != 0)
return fact[n];
if (n == 0)
return 1;
return fact[n] = mul(n, factorial(n - 1));
}
static ll inverse(int n) { return power(n, MOD - 2); }
static ll comb(int n, int r) {
if (r < 0 || r > n)
return 0;
return mul(factorial(n), inverse(factorial(n - r)), inverse(factorial(r)));
}
template <class... A> static ll div(ll dividend, A... args) {
ll res = dividend;
for (ll i : std::initializer_list<ll>{args...}) {
res = mul(res, inverse(i));
}
return res;
}
template <class... A> static ll add(A... args) {
ll res = 0;
for (ll i : std::initializer_list<ll>{args...}) {
res = (res + i) % MOD;
}
return res;
}
template <class... A> static ll sub(ll l, A... args) {
ll res = l;
for (ll i : std::initializer_list<ll>{args...}) {
res = (res - i + MOD) % MOD;
}
return res;
}
};
ll mod::fact[(int)2e6 + 1];
int ni() {
int i;
cin >> i;
return i;
}
ll nll() {
ll l;
cin >> l;
return l;
}
class math {
public:
/*
* n <= a/b なる最大の整数nを返す
*/
static ll floor(ll a, ll b) {
if (b < 0) {
a *= -1;
b *= -1;
}
if (a > 0) {
// 絶対値の小さい方に丸められる(正なら負の方向)
return a / b;
} else {
// よくある切り上げのテクニックの切り捨て版
return (a - b + 1) / b;
}
}
/*
* n >= a/b なる最小の整数nを返す
*/
static ll ceil(ll a, ll b) {
if (b < 0) {
a *= -1;
b *= -1;
}
if (a > 0) {
// よくある切り上げのテクニック
return (a + b - 1) / b;
} else {
// 絶対値の小さい方に丸められる(負なら正の方向)
return a / b;
}
}
/*
* aとbの最大公約数を求める
*/
static ll gcd(ll a, ll b) {
long M = max(a, b);
long m = min(a, b);
if (m == 0) {
return M;
}
return gcd(m, M % m);
}
/*
* aとbの最小公倍数を求める
*/
static ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
/*
* n(2^62以下)の平方根の整数部分を返す
* doubleの精度には限界があるので整数の二分探索で求める
*/
static ll sqrt(ll n) {
ll high = bit(31) + 1;
ll low = 0;
ll mid;
while (high - low > 1) {
mid = (high + low) / 2;
if (mid * mid <= n) {
low = mid;
} else {
high = mid;
}
}
return low;
}
};
template <class T, class F> ll binary_count(const vector<T> &A, const F &f) {
int N = SZ(A);
bool first = f(A[0]);
bool last = f(A[N - 1]);
if (first && last)
return N;
if (!first && !last)
return 0;
int ok, ng, mid;
if (last) {
ok = N - 1;
ng = 0;
} else {
ok = 0;
ng = N - 1;
}
while (abs(ok - ng) > 1) {
mid = (ok + ng) / 2;
if (f(A[mid])) {
ok = mid;
} else {
ng = mid;
}
}
return (first ? ok + 1 : N - ok);
}
int main() {
int N = ni();
ll K = nll();
vector<ll> A(N);
REP(i, N) A[i] = nll();
sort(ALL(A));
ll ok = -1e18;
ll ng = 1e18 + 1;
ll mid;
while (abs(ok - ng) > 1) {
mid = (ok + ng) / 2;
ll sum = 0;
REP(i, N) {
ll a = A[i];
ll c = binary_count(A, [mid, a](ll b) { return a * b < mid; });
if (a * a < mid)
c--;
sum += c;
}
sum /= 2;
if (sum < K) {
ok = mid;
} else {
ng = mid;
}
}
println(ok);
return 0;
} | replace | 240 | 241 | 240 | 241 | TLE | |
p02774 | Python | Runtime Error | import numpy as np
from bisect import bisect
DEBUG = False
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
A = np.array(A, dtype=np.int64)
neg = A[A < 0]
zero = A[A == 0]
pos = A[A > 0]
# Only keep the abs value of the negatives and flip so it's sorted
revAbsNeg = np.flip(-neg)
def countDistinctPairsLessThan(arr, prod):
# Given a sorted array find the number of distinct pairs that are < prod
# O(N * log(N)) where N = len(arr)
N = arr.shape[0]
assert arr.shape == (N,)
count3 = np.sum(
np.minimum(np.arange(N), np.searchsorted(arr, (prod - 1) // arr, side="right"))
)
if DEBUG:
count = 0
for i, x in enumerate(arr):
count += bisect(arr, (prod - 1) // x, 0, i)
count2 = 0
for i in range(len(arr)):
for j in range(i + 1, len(arr)):
if arr[i] * arr[j] < prod:
count2 += 1
assert count == count2 == count3
return count3
def countPairsLessThanOrEqual(arr1, arr2, prod):
# Given two sorted arrays containing *positive* numbers only,
# find the number of pairs between the two arrays that are <= prod
# O(N * log(M)) where N = len(arr1), M = len(arr2)
if len(arr1) > len(arr2):
arr1, arr2 = arr2, arr1
count3 = np.sum(np.searchsorted(arr2, prod // arr1, side="right"))
if DEBUG:
count = 0
for x in arr1:
count += bisect(arr2, prod // x)
count2 = 0
for x in arr1:
for y in arr2:
if x * y <= prod:
count2 += 1
assert count == count2 == count3
return count3
def getIndex(prod):
# Count number of pairs strictly less than prod
count = 0
if prod < 0:
# All negatives except for the negatives with abs value less than or equal -prod
count += len(pos) * len(neg)
count -= countPairsLessThanOrEqual(pos, revAbsNeg, -prod)
elif prod >= 0:
# All negatives
count += len(pos) * len(neg)
if prod > 0:
# All zeroes
count += len(zero) * len(neg)
count += (len(zero) * (len(zero) - 1)) // 2
count += len(zero) * len(pos)
# Positives with positives
count += countDistinctPairsLessThan(pos, prod)
# Negatives with negatives
count += countDistinctPairsLessThan(revAbsNeg, prod)
if DEBUG:
count2 = 0
for i in range(N):
for j in range(i + 1, N):
if A[i] * A[j] < prod:
count2 += 1
assert count == count2
return count
def bisect_f(f, lo, hi):
if DEBUG:
assert f(lo) and not f(hi)
while hi - lo > 1:
mid = (lo + hi) // 2
if f(mid):
lo = mid
else:
hi = mid
if DEBUG:
assert f(lo) and not f(hi)
if DEBUG:
assert hi - lo == 1
assert f(lo) and not f(hi)
return lo
def solve(K):
lo = -(10**18)
hi = 10**18 + 1
if DEBUG:
assert getIndex(lo) <= K < getIndex(hi)
prod = bisect_f(lambda prod: getIndex(prod) <= K, lo, hi)
if DEBUG:
assert getIndex(prod) <= K < getIndex(prod + 1)
return prod
if DEBUG:
for k in range((N * (N - 1)) // 2):
print("k", k, solve(k))
print(solve(K - 1)) # K is 1-indexed
| import numpy as np
from bisect import bisect
DEBUG = False
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
A = np.array(A, dtype=np.int64)
neg = A[A < 0]
zero = A[A == 0]
pos = A[A > 0]
# Only keep the abs value of the negatives and flip so it's sorted
revAbsNeg = -neg[::-1]
def countDistinctPairsLessThan(arr, prod):
# Given a sorted array find the number of distinct pairs that are < prod
# O(N * log(N)) where N = len(arr)
N = arr.shape[0]
assert arr.shape == (N,)
count3 = np.sum(
np.minimum(np.arange(N), np.searchsorted(arr, (prod - 1) // arr, side="right"))
)
if DEBUG:
count = 0
for i, x in enumerate(arr):
count += bisect(arr, (prod - 1) // x, 0, i)
count2 = 0
for i in range(len(arr)):
for j in range(i + 1, len(arr)):
if arr[i] * arr[j] < prod:
count2 += 1
assert count == count2 == count3
return count3
def countPairsLessThanOrEqual(arr1, arr2, prod):
# Given two sorted arrays containing *positive* numbers only,
# find the number of pairs between the two arrays that are <= prod
# O(N * log(M)) where N = len(arr1), M = len(arr2)
if len(arr1) > len(arr2):
arr1, arr2 = arr2, arr1
count3 = np.sum(np.searchsorted(arr2, prod // arr1, side="right"))
if DEBUG:
count = 0
for x in arr1:
count += bisect(arr2, prod // x)
count2 = 0
for x in arr1:
for y in arr2:
if x * y <= prod:
count2 += 1
assert count == count2 == count3
return count3
def getIndex(prod):
# Count number of pairs strictly less than prod
count = 0
if prod < 0:
# All negatives except for the negatives with abs value less than or equal -prod
count += len(pos) * len(neg)
count -= countPairsLessThanOrEqual(pos, revAbsNeg, -prod)
elif prod >= 0:
# All negatives
count += len(pos) * len(neg)
if prod > 0:
# All zeroes
count += len(zero) * len(neg)
count += (len(zero) * (len(zero) - 1)) // 2
count += len(zero) * len(pos)
# Positives with positives
count += countDistinctPairsLessThan(pos, prod)
# Negatives with negatives
count += countDistinctPairsLessThan(revAbsNeg, prod)
if DEBUG:
count2 = 0
for i in range(N):
for j in range(i + 1, N):
if A[i] * A[j] < prod:
count2 += 1
assert count == count2
return count
def bisect_f(f, lo, hi):
if DEBUG:
assert f(lo) and not f(hi)
while hi - lo > 1:
mid = (lo + hi) // 2
if f(mid):
lo = mid
else:
hi = mid
if DEBUG:
assert f(lo) and not f(hi)
if DEBUG:
assert hi - lo == 1
assert f(lo) and not f(hi)
return lo
def solve(K):
lo = -(10**18)
hi = 10**18 + 1
if DEBUG:
assert getIndex(lo) <= K < getIndex(hi)
prod = bisect_f(lambda prod: getIndex(prod) <= K, lo, hi)
if DEBUG:
assert getIndex(prod) <= K < getIndex(prod + 1)
return prod
if DEBUG:
for k in range((N * (N - 1)) // 2):
print("k", k, solve(k))
print(solve(K - 1)) # K is 1-indexed
| replace | 17 | 18 | 17 | 18 | TLE | |
p02774 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define aut(r, v) __typeof(v) r = (v)
#define each(it, o) for (aut(it, (o).begin()); it != (o).end(); ++it)
#define reach(it, o) for (aut(it, (o).rbegin()); it != (o).rend(); ++it)
#define fi first
#define se second
#define debug(...) \
{ \
cerr << "[L" << __LINE__ << "] "; \
_debug(__VA_ARGS__); \
}
template <typename T1, typename T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
return o << "(" << p.first << ", " << p.second << ")";
}
template <typename T> string join(const vector<T> &v, string del = ", ") {
stringstream s;
rep(i, v.size()) s << del << v[i];
return s.str().substr(del.size());
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
if (v.size())
o << "[" << join(v) << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const vector<vector<T>> &vv) {
int l = vv.size();
if (l) {
o << endl;
rep(i, l) {
o << (i == 0 ? "[ " : ",\n ") << vv[i] << (i == l - 1 ? " ]" : "");
}
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &st) {
vector<T> v(st.begin(), st.end());
o << "{ " << join(v) << " }";
return o;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &o, const map<T1, T2> &m) {
each(p, m) {
o << (p == m.begin() ? "{ " : ",\n ") << *p
<< (p == --m.end() ? " }" : "");
}
return o;
}
inline void _debug() { cerr << endl; }
template <class First, class... Rest>
void _debug(const First &first, const Rest &...rest) {
cerr << first << " ";
_debug(rest...);
}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
const double PI = (1 * acos(0.0));
const double EPS = 1e-9;
const ll INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 1e9 + 7;
inline void finput(string filename) { freopen(filename.c_str(), "r", stdin); }
int main() {
ios_base::sync_with_stdio(0);
finput("./input");
ll n, k;
cin >> n >> k;
vl A(n);
rep(i, n) cin >> A[i];
sort(all(A));
auto check = [&](ll x) {
ll cnt = 0ll;
rep(i, n) {
if (A[i] < 0) {
int l = -1, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
if (A[m] * A[i] < x)
r = m;
else
l = m;
}
cnt += n - r;
} else {
int l = -1, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
if (A[m] * A[i] < x)
l = m;
else
r = m;
}
cnt += r;
}
if (A[i] * A[i] < x)
cnt--;
}
return cnt < 2 * k;
};
ll MX = ll(1e18) + 1;
ll l = -MX, r = MX;
while (r - l > 1) {
ll m = (l + r) / 2;
if (check(m))
l = m;
else
r = m;
}
cout << l << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define aut(r, v) __typeof(v) r = (v)
#define each(it, o) for (aut(it, (o).begin()); it != (o).end(); ++it)
#define reach(it, o) for (aut(it, (o).rbegin()); it != (o).rend(); ++it)
#define fi first
#define se second
#define debug(...) \
{ \
cerr << "[L" << __LINE__ << "] "; \
_debug(__VA_ARGS__); \
}
template <typename T1, typename T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
return o << "(" << p.first << ", " << p.second << ")";
}
template <typename T> string join(const vector<T> &v, string del = ", ") {
stringstream s;
rep(i, v.size()) s << del << v[i];
return s.str().substr(del.size());
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
if (v.size())
o << "[" << join(v) << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const vector<vector<T>> &vv) {
int l = vv.size();
if (l) {
o << endl;
rep(i, l) {
o << (i == 0 ? "[ " : ",\n ") << vv[i] << (i == l - 1 ? " ]" : "");
}
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &st) {
vector<T> v(st.begin(), st.end());
o << "{ " << join(v) << " }";
return o;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &o, const map<T1, T2> &m) {
each(p, m) {
o << (p == m.begin() ? "{ " : ",\n ") << *p
<< (p == --m.end() ? " }" : "");
}
return o;
}
inline void _debug() { cerr << endl; }
template <class First, class... Rest>
void _debug(const First &first, const Rest &...rest) {
cerr << first << " ";
_debug(rest...);
}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
const double PI = (1 * acos(0.0));
const double EPS = 1e-9;
const ll INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 1e9 + 7;
inline void finput(string filename) { freopen(filename.c_str(), "r", stdin); }
int main() {
ios_base::sync_with_stdio(0);
// finput("./input");
ll n, k;
cin >> n >> k;
vl A(n);
rep(i, n) cin >> A[i];
sort(all(A));
auto check = [&](ll x) {
ll cnt = 0ll;
rep(i, n) {
if (A[i] < 0) {
int l = -1, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
if (A[m] * A[i] < x)
r = m;
else
l = m;
}
cnt += n - r;
} else {
int l = -1, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
if (A[m] * A[i] < x)
l = m;
else
r = m;
}
cnt += r;
}
if (A[i] * A[i] < x)
cnt--;
}
return cnt < 2 * k;
};
ll MX = ll(1e18) + 1;
ll l = -MX, r = MX;
while (r - l > 1) {
ll m = (l + r) / 2;
if (check(m))
l = m;
else
r = m;
}
cout << l << endl;
return 0;
} | replace | 82 | 83 | 82 | 83 | 0 | |
p02774 | Python | Runtime Error | # https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155#toc3
# https://atcoder.jp/contests/abc155/submissions/10152895
# 写経
# 条件を満たす要素を抽出
# ndarray[条件式]
def binary_search(*, ok, ng, func):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if func(mid):
ok = mid
else:
ng = mid
return ok
def main():
import sys
import numpy as np
inf = 10**18 + 1
input = sys.stdin.readline
N, K = map(int, input().split())
A = np.array(input().split(), dtype=np.int64)
A.sort()
zero = A[A == 0]
pos = A[A > 0]
neg = A[A < 0]
def count(x):
"""
定数cに対して Ai*Aj<=c となる(i,j)の数え上げ
順序制約 i<j -> 順序制約のない(i,j)からi==jの場合の個数を引いて2で割る
iを固定して a=Ai とする
a=0
ax=0(<=c?),解なしまたは任意のx
a>0
ax<=c
<-> x<=c/a
<-> x<=c//a
a<0
ax<=c
<-> (-a)x>=(-c)
否定をとり,aの対候補全体=Nから引く
(-a)x<(-c)
<-> (-a)x<=(-c-1)
<-> x<=(-c-1)//(-a)
"""
cnt = 0
cnt += zero.size * N # (a:=0)*v<=x
cnt += np.searchsorted(a=A, v=x // pos, side="right").sum() # (a:>0)*v<=x
cnt += (
N - np.searchsorted(a=A, v=(-x - 1) // (-neg), side="right")
).sum() # (a:<0)*v<=x
cnt -= ((A * A) <= x).sum() # i==j
assert cnt % 2 == 0
return cnt // 2
ans = binary_search(ng=-inf, ok=inf, func=lambda x: count(x) >= K)
print(ans)
if __name__ == "__main__":
main()
| # https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155#toc3
# https://atcoder.jp/contests/abc155/submissions/10152895
# 写経
# 条件を満たす要素を抽出
# ndarray[条件式]
def binary_search(*, ok, ng, func):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if func(mid):
ok = mid
else:
ng = mid
return ok
def main():
import sys
import numpy as np
inf = 10**18 + 1
input = sys.stdin.readline
N, K = map(int, input().split())
A = np.array(input().split(), dtype=np.int64)
A.sort()
zero = A[A == 0]
pos = A[A > 0]
neg = A[A < 0]
def count(x):
"""
定数cに対して Ai*Aj<=c となる(i,j)の数え上げ
順序制約 i<j -> 順序制約のない(i,j)からi==jの場合の個数を引いて2で割る
iを固定して a=Ai とする
a=0
ax=0(<=c?),解なしまたは任意のx
a>0
ax<=c
<-> x<=c/a
<-> x<=c//a
a<0
ax<=c
<-> (-a)x>=(-c)
否定をとり,aの対候補全体=Nから引く
(-a)x<(-c)
<-> (-a)x<=(-c-1)
<-> x<=(-c-1)//(-a)
"""
cnt = 0
if x >= 0:
cnt += zero.size * N # (a:=0)*v<=x
cnt += np.searchsorted(a=A, v=x // pos, side="right").sum() # (a:>0)*v<=x
cnt += (
N - np.searchsorted(a=A, v=(-x - 1) // (-neg), side="right")
).sum() # (a:<0)*v<=x
cnt -= ((A * A) <= x).sum() # i==j
assert cnt % 2 == 0
return cnt // 2
ans = binary_search(ng=-inf, ok=inf, func=lambda x: count(x) >= K)
print(ans)
if __name__ == "__main__":
main()
| replace | 57 | 58 | 57 | 59 | TLE | |
p02774 | C++ | Runtime Error | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
// #include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1000000000000000000ll)
// typedef pair < int, int> P;
ll gcd(ll a, ll b) { // 最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { // 最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int keta(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
ll N, K, A[100000];
int main() {
cin >> N >> K;
rep(i, N) { cin >> A[i]; }
sort(A, A + N);
ll ub = LINF, lb = -LINF;
while (ub - lb > 1) {
ll x = (ub + lb) / 2;
// x = -7;
bool ok = [&] {
ll res = 0;
rep(i, N) {
ll l = -1, r = N;
if (A[i] >= 0) {
while (r - l > 1) {
ll mid = (l + r) / 2;
if (A[i] * A[mid] < x) {
l = mid; // use this
} else {
r = mid;
}
}
res += r;
} else {
while (r - l > 1) {
ll mid = (l + r) / 2;
if (A[i] * A[mid] >= x) {
l = mid;
} else {
r = mid;
}
}
res += (N - r);
}
if (A[i] * A[i] < x)
res--;
}
res /= 2;
if (res < K) {
return true;
} else {
return false;
}
}();
/// break;
if (ok) {
lb = x;
} else {
ub = x;
}
}
cout << lb << endl;
} | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
// #include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1000000000000000000ll)
// typedef pair < int, int> P;
ll gcd(ll a, ll b) { // 最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { // 最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int keta(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
ll N, K, A[200005];
int main() {
cin >> N >> K;
rep(i, N) { cin >> A[i]; }
sort(A, A + N);
ll ub = LINF, lb = -LINF;
while (ub - lb > 1) {
ll x = (ub + lb) / 2;
// x = -7;
bool ok = [&] {
ll res = 0;
rep(i, N) {
ll l = -1, r = N;
if (A[i] >= 0) {
while (r - l > 1) {
ll mid = (l + r) / 2;
if (A[i] * A[mid] < x) {
l = mid; // use this
} else {
r = mid;
}
}
res += r;
} else {
while (r - l > 1) {
ll mid = (l + r) / 2;
if (A[i] * A[mid] >= x) {
l = mid;
} else {
r = mid;
}
}
res += (N - r);
}
if (A[i] * A[i] < x)
res--;
}
res /= 2;
if (res < K) {
return true;
} else {
return false;
}
}();
/// break;
if (ok) {
lb = x;
} else {
ub = x;
}
}
cout << lb << endl;
} | replace | 81 | 82 | 81 | 82 | 0 | |
p02774 | C++ | Runtime Error | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define ll long long
#define mod (int)1000000007
#define P pair<int, int>
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define all(V) V.begin(), V.end()
#ifdef int
constexpr int INF = LLONG_MAX / 5;
#else
constexpr int INF = INT_MAX / 10;
#endif
constexpr double eps = DBL_EPSILON;
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;
}
using namespace std;
inline int gcd(int a, int b) {
while (b) {
int c = a;
a = b;
b = c % b;
}
return a;
}
inline int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool isprime(int n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int mypow(int a, int b) {
if (!b)
return 1;
if (b & 1)
return mypow(a, b - 1) * a;
int memo = mypow(a, b >> 1);
return memo * memo;
}
int modpow(int a, int b, int m = mod) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
int memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
int n, k, a[100010], b, c;
vector<int> vec[2];
signed main() {
cin >> n >> k;
rep(i, n) {
cin >> a[i];
if (a[i] < 0) {
b++;
vec[0].push_back(-a[i]);
}
if (a[i] > 0) {
c++;
vec[1].push_back(a[i]);
}
}
sort(all(vec[0]));
sort(all(vec[1]));
if (b * c >= k) {
int mi = 0, ma = INF;
while (mi + 1 < ma) {
int md = (mi + ma) / 2;
int cnt = 0;
for (int i : vec[0]) {
cnt += vec[1].end() - lower_bound(all(vec[1]), (md + i - 1) / i);
}
if (cnt < k)
ma = md;
else
mi = md;
}
cout << -mi << endl;
} else if (b * c + (n - b - c) * (b + c) +
(n - b - c) * (n - b - c - 1) / 2 >=
k) {
cout << 0 << endl;
} else {
k -= b * c + (n - b - c) * (b + c) + (n - b - c) * (n - b - c - 1) / 2;
int mi = 0, ma = INF;
while (mi + 1 < ma) {
int md = (mi + ma) / 2;
int cnt = 0;
rep(i, vec[0].size()) {
cnt +=
upper_bound(vec[0].begin() + i + 1, vec[0].end(), md / vec[0][i]) -
vec[0].begin() - i - 1;
}
rep(i, vec[1].size()) {
cnt +=
upper_bound(vec[1].begin() + i + 1, vec[1].end(), md / vec[1][i]) -
vec[1].begin() - i - 1;
}
if (cnt < k)
mi = md;
else
ma = md;
}
cout << ma << endl;
}
return 0;
} | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define ll long long
#define mod (int)1000000007
#define P pair<int, int>
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define all(V) V.begin(), V.end()
#ifdef int
constexpr int INF = LLONG_MAX / 5;
#else
constexpr int INF = INT_MAX / 10;
#endif
constexpr double eps = DBL_EPSILON;
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;
}
using namespace std;
inline int gcd(int a, int b) {
while (b) {
int c = a;
a = b;
b = c % b;
}
return a;
}
inline int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool isprime(int n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int mypow(int a, int b) {
if (!b)
return 1;
if (b & 1)
return mypow(a, b - 1) * a;
int memo = mypow(a, b >> 1);
return memo * memo;
}
int modpow(int a, int b, int m = mod) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
int memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
int n, k, a[200010], b, c;
vector<int> vec[2];
signed main() {
cin >> n >> k;
rep(i, n) {
cin >> a[i];
if (a[i] < 0) {
b++;
vec[0].push_back(-a[i]);
}
if (a[i] > 0) {
c++;
vec[1].push_back(a[i]);
}
}
sort(all(vec[0]));
sort(all(vec[1]));
if (b * c >= k) {
int mi = 0, ma = INF;
while (mi + 1 < ma) {
int md = (mi + ma) / 2;
int cnt = 0;
for (int i : vec[0]) {
cnt += vec[1].end() - lower_bound(all(vec[1]), (md + i - 1) / i);
}
if (cnt < k)
ma = md;
else
mi = md;
}
cout << -mi << endl;
} else if (b * c + (n - b - c) * (b + c) +
(n - b - c) * (n - b - c - 1) / 2 >=
k) {
cout << 0 << endl;
} else {
k -= b * c + (n - b - c) * (b + c) + (n - b - c) * (n - b - c - 1) / 2;
int mi = 0, ma = INF;
while (mi + 1 < ma) {
int md = (mi + ma) / 2;
int cnt = 0;
rep(i, vec[0].size()) {
cnt +=
upper_bound(vec[0].begin() + i + 1, vec[0].end(), md / vec[0][i]) -
vec[0].begin() - i - 1;
}
rep(i, vec[1].size()) {
cnt +=
upper_bound(vec[1].begin() + i + 1, vec[1].end(), md / vec[1][i]) -
vec[1].begin() - i - 1;
}
if (cnt < k)
mi = md;
else
ma = md;
}
cout << ma << endl;
}
return 0;
} | replace | 90 | 91 | 90 | 91 | 0 | |
p02774 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template <class F> auto recursive(F f) {
return [f](auto... a) { return f(f, a...); };
}
template <class I, class V = typename I::value_type>
V sum_up(const I &l, const I &r) {
V v;
for (I i = l; i != r; i++)
v = i == l ? *i : v + *i;
return v;
}
template <class I, class T = iterator_traits<I>> I operator+(I it, int n) {
for (int i = 0; i < n; i++)
it++;
return it;
}
template <class I, class T = iterator_traits<I>> I operator-(I it, int n) {
for (int i = 0; i < n; i++)
it--;
return it;
}
template <class T>
using rev_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vector2d = vector<vector<T>>;
struct fixprec {
int x;
fixprec(int d) : x(d) {}
};
ostream &operator<<(ostream &o, fixprec f) {
return o << fixed << setprecision(f.x);
}
void R_YESNO(bool p) { cout << (p ? "YES" : "NO") << endl; }
void R_YesNo(bool p) { cout << (p ? "Yes" : "No") << endl; }
/*!* [binsearch] *!*/
/*+* 二分探索 *+*/
// judge を満たすような下限を求める
// l:[X] 定義域外部の上限
// r:[X] 定義域外部の下限
// judge:[X -> bool] X を評価する関数
// lower:[bool] falseにすると代わりに上限を求める
// eps:[X] 終了距離
template <typename X>
X BinSearch(X l, X r, function<bool(X)> judge, bool lower = true, X eps = 1) {
while (r - l > eps) {
X m = (r + l) / 2;
if (judge(m) == lower) {
r = m;
} else {
l = m;
}
}
return lower ? r : l;
}
// O(NlogNlogK) = O(N(logN)^2)
int main() {
i64 N, K;
cin >> N >> K;
vector<i64> V(N);
for (i64 &a : V)
cin >> a;
sort(WHOLE(V));
i64 A[int(2e5)];
for (int i = 0; i < N; i++)
A[i] = V[i];
i64 ans = BinSearch<i64>(-1.1e18, 1.1e18, [&](i64 X) -> bool {
// X |-> M:積ペアのうちX以下のものの数
i64 M = 0;
// O(NlogN)
for (int i = 0; i < N; i++) {
// k : A[i] と積を取ってX以下になる限界
int k = BinSearch<int>(
-1, N, [&A, i, X](int j) -> bool { return A[i] * A[j] <= X; },
A[i] < 0);
if (A[i] < 0) {
M += N - k;
} else {
M += k + 1;
}
// 自乗が含まれているなら削除
if (A[i] * A[i] <= X)
M--;
}
// ダブルカウンティングを解消
return M >= 2 * K;
});
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template <class F> auto recursive(F f) {
return [f](auto... a) { return f(f, a...); };
}
template <class I, class V = typename I::value_type>
V sum_up(const I &l, const I &r) {
V v;
for (I i = l; i != r; i++)
v = i == l ? *i : v + *i;
return v;
}
template <class I, class T = iterator_traits<I>> I operator+(I it, int n) {
for (int i = 0; i < n; i++)
it++;
return it;
}
template <class I, class T = iterator_traits<I>> I operator-(I it, int n) {
for (int i = 0; i < n; i++)
it--;
return it;
}
template <class T>
using rev_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vector2d = vector<vector<T>>;
struct fixprec {
int x;
fixprec(int d) : x(d) {}
};
ostream &operator<<(ostream &o, fixprec f) {
return o << fixed << setprecision(f.x);
}
void R_YESNO(bool p) { cout << (p ? "YES" : "NO") << endl; }
void R_YesNo(bool p) { cout << (p ? "Yes" : "No") << endl; }
/*!* [binsearch] *!*/
/*+* 二分探索 *+*/
// judge を満たすような下限を求める
// l:[X] 定義域外部の上限
// r:[X] 定義域外部の下限
// judge:[X -> bool] X を評価する関数
// lower:[bool] falseにすると代わりに上限を求める
// eps:[X] 終了距離
template <typename X>
X BinSearch(X l, X r, function<bool(X)> judge, bool lower = true, X eps = 1) {
while (r - l > eps) {
X m = (r + l) / 2;
if (judge(m) == lower) {
r = m;
} else {
l = m;
}
}
return lower ? r : l;
}
// O(NlogNlogK) = O(N(logN)^2)
int main() {
i64 N, K;
cin >> N >> K;
vector<i64> V(N);
for (i64 &a : V)
cin >> a;
sort(WHOLE(V));
i64 A[int(2e5)];
for (int i = 0; i < N; i++)
A[i] = V[i];
i64 ans = BinSearch<i64>(-1.1e18, 1.1e18, [&](i64 X) -> bool {
// X |-> M:積ペアのうちX以下のものの数
i64 M = 0;
// O(NlogN)
for (int i = 0; i < N; i++) {
// k : A[i] と積を取ってX以下になる限界
// int k = BinSearch<int>(-1, N, [&A, i, X](int j) -> bool {
// return A[i] * A[j] <= X;
// }, A[i] < 0);
int k = 0;
{
{
{
int l = -1, r = N, eps = 1;
bool lower = A[i] < 0;
while (r - l > eps) {
int m = (r + l) / 2;
if ((A[i] * A[m] <= X) == lower) {
r = m;
} else {
l = m;
}
}
k = lower ? r : l;
}
}
}
if (A[i] < 0) {
M += N - k;
} else {
M += k + 1;
}
// 自乗が含まれているなら削除
if (A[i] * A[i] <= X)
M--;
}
// ダブルカウンティングを解消
return M >= 2 * K;
});
cout << ans << endl;
return 0;
}
| replace | 77 | 80 | 77 | 99 | TLE | |
p02774 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i <= (n); i++)
#define zep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x, m, n) \
for (ll i = (m); i <= n; i++) { \
cout << (x[i]) << " "; \
} \
cout << endl;
ll n, k, a[100008];
ll f(ll i, ll mid) {
ll res;
if (a[i] < 0) {
if (a[i] * a[0] <= mid) {
return n - 1;
}
if (a[i] * a[n - 1] > mid) {
return 0;
}
ll yes = n - 1;
ll no = 0;
while (yes - no > 1) {
ll m = (yes + no) / 2;
if (a[i] * a[m] <= mid) {
yes = m;
} else {
no = m;
}
}
res = n - yes;
if (yes <= i) {
res--;
}
} else {
if (a[i] * a[0] > mid) {
return 0;
}
if (a[i] * a[n - 1] <= mid) {
return n - 1;
}
ll yes = 0;
ll no = n - 1;
while (no - yes > 1) {
ll m = (yes + no) / 2;
if (a[i] * a[m] <= mid) {
yes = m;
} else {
no = m;
}
}
res = yes + 1;
if (yes >= i) {
res--;
}
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
zep(i, 0, n) { cin >> a[i]; }
sort(a, a + n);
ll ok = 1e18;
ll ng = -1e18 - 1;
while (ok - ng > 1) {
ll mid = (ok + ng) / 2;
ll sm = 0;
zep(i, 0, n) { sm += f(i, mid); }
sm /= 2;
if (sm >= k) {
ok = mid;
} else {
ng = mid;
}
}
print(ok)
// print(f(3, -12))
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i <= (n); i++)
#define zep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x, m, n) \
for (ll i = (m); i <= n; i++) { \
cout << (x[i]) << " "; \
} \
cout << endl;
ll n, k, a[200008];
ll f(ll i, ll mid) {
ll res;
if (a[i] < 0) {
if (a[i] * a[0] <= mid) {
return n - 1;
}
if (a[i] * a[n - 1] > mid) {
return 0;
}
ll yes = n - 1;
ll no = 0;
while (yes - no > 1) {
ll m = (yes + no) / 2;
if (a[i] * a[m] <= mid) {
yes = m;
} else {
no = m;
}
}
res = n - yes;
if (yes <= i) {
res--;
}
} else {
if (a[i] * a[0] > mid) {
return 0;
}
if (a[i] * a[n - 1] <= mid) {
return n - 1;
}
ll yes = 0;
ll no = n - 1;
while (no - yes > 1) {
ll m = (yes + no) / 2;
if (a[i] * a[m] <= mid) {
yes = m;
} else {
no = m;
}
}
res = yes + 1;
if (yes >= i) {
res--;
}
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
zep(i, 0, n) { cin >> a[i]; }
sort(a, a + n);
ll ok = 1e18;
ll ng = -1e18 - 1;
while (ok - ng > 1) {
ll mid = (ok + ng) / 2;
ll sm = 0;
zep(i, 0, n) { sm += f(i, mid); }
sm /= 2;
if (sm >= k) {
ok = mid;
} else {
ng = mid;
}
}
print(ok)
// print(f(3, -12))
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02774 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <tuple>
#include <vector>
constexpr long long int inf = 1e18 + 334 + 810 + 1919;
namespace MyInputAndOutput {
// 入力関係 (cin)
class user_input {
public:
inline const user_input &operator>>(int &int_arg) const {
scanf("%d", &int_arg);
return *this;
}
inline const user_input &operator>>(long long int &llint_arg) const {
scanf("%lld", &llint_arg);
return *this;
}
inline const user_input &operator>>(unsigned int &uint_arg) const {
scanf("%u", &uint_arg);
return *this;
}
inline const user_input &
operator>>(unsigned long long int &ullint_arg) const {
scanf("%llu", &ullint_arg);
return *this;
}
inline const user_input &operator>>(unsigned long &ullint_arg) const {
scanf("%lu", &ullint_arg);
return *this;
}
inline const user_input &operator>>(char *str_arg) const {
scanf("%s", str_arg);
return *this;
}
inline const user_input &operator>>(char &char_arg) const {
scanf("%*c%c", &char_arg);
return *this;
}
template <typename S, typename T>
inline const user_input &operator>>(std::pair<S, T> &pair_arg) const {
(*this) >> pair_arg.first >> pair_arg.second;
return *this;
}
template <typename T>
inline const user_input &operator>>(std::vector<T> &vec) const {
for (T &ele : vec)
(*this) >> ele;
return *this;
}
} cin;
// 出力関係 (cout)
class user_output {
public:
user_output(void) {}
inline const user_output &operator<<(const int int_arg) const {
printf("%d", int_arg);
return *this;
}
inline const user_output &operator<<(const unsigned int uint_arg) const {
printf("%u", uint_arg);
return *this;
}
inline const user_output &operator<<(const long long int llint_arg) const {
printf("%lld", llint_arg);
return *this;
}
inline const user_output &
operator<<(const unsigned long long int ullint_arg) const {
printf("%llu", ullint_arg);
return *this;
}
inline const user_output &operator<<(const unsigned long ulint_arg) const {
printf("%lu", ulint_arg);
return *this;
}
inline const user_output &operator<<(const double ld_arg) const {
printf("%.16lf", ld_arg);
return *this;
}
inline const user_output &operator<<(const long double ld_arg) const {
printf("%.16Lf", ld_arg);
return *this;
}
inline const user_output &operator<<(const char char_arg) const {
putchar(char_arg);
return *this;
}
inline const user_output &operator<<(const unsigned char uchar_arg) const {
putchar(uchar_arg);
return *this;
}
inline const user_output &operator<<(const char *str_arg) const {
fputs(str_arg, stdout);
return *this;
}
template <typename S, typename T>
inline const user_output &operator<<(const std::pair<S, T> &pair_arg) const {
(*this) << pair_arg.first << ' ' << pair_arg.second;
return *this;
}
template <typename Tp_name>
inline const user_output &operator<<(const std::vector<Tp_name> &vec) const {
const size_t size_of_vec = vec.size();
if (size_of_vec <= 0)
return *this;
(*this) << vec[0];
for (size_t index = 1; index < size_of_vec; ++index)
(*this) << ' ' << vec[index];
return *this;
}
} cout;
// その他出力関数
void binary_output(int64_t value, size_t length = 64) {
char out[length + 1];
for (size_t i = 0; i < length; ++i)
out[length - 1 - i] = ((value >> i) & 1) ? '1' : '0';
out[length] = '\0';
puts(out);
}
template <typename InputType>
void print(InputType first, InputType last, const char separate_c = ' ',
const char end_c = '\n') {
InputType it = first;
while (true) {
MyInputAndOutput::cout << *it;
if (++it == last) {
MyInputAndOutput::cout << end_c;
return;
}
MyInputAndOutput::cout << separate_c;
}
}
}; // namespace MyInputAndOutput
namespace MIO = MyInputAndOutput;
// 大小関係のある配列について, 個数を数える |
// クエリ形式の場合はクエリ先読みBITを使え
template <typename element_type> class CountingVector {
private:
unsigned int size_of_vec; // 座圧済み配列の長さ
const unsigned int
size_of_arg_vec; // 元の引数の配列の長さ | = counter[size_of_vec-1]
std::vector<element_type> vec; // ソート & 座標圧縮 済み配列
std::vector<unsigned int> counter; // 累積和 counter[i] = vec[0, i)の数
using const_itr_type = typename std::vector<element_type>::const_iterator;
public:
// コンストラクタ : 破壊的操作を行うので引数はコピー
template <typename element_type_castable>
CountingVector(std::vector<element_type_castable> arg_vec)
: size_of_arg_vec(arg_vec.size()) {
const unsigned int arg_size = arg_vec.size();
counter.reserve(arg_size + 1);
counter.push_back(0);
vec.reserve(arg_size);
std::sort(arg_vec.begin(), arg_vec.end());
unsigned int idx = 0;
while (idx < arg_size) {
unsigned int cnt = 1;
vec.push_back(arg_vec[idx]);
while (idx + cnt < arg_size and arg_vec[idx] == arg_vec[idx + cnt])
cnt++;
unsigned int p = counter.back() + cnt;
counter.push_back(p);
idx += cnt;
}
size_of_vec = vec.size();
}
// arg_vec[i] < val なる i の個数を数える
inline unsigned int
count_smallerThan(const element_type &val) const noexcept {
unsigned int idx =
std::lower_bound(vec.begin(), vec.end(), val) - vec.begin();
return counter[idx];
}
inline unsigned int
count_smallerThan(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return counter[idx];
}
// arg_vec[i] ≤ val なる i の個数を数える
inline unsigned int
count_notGreaterThan(const element_type &val) const noexcept {
unsigned int idx =
std::upper_bound(vec.begin(), vec.end(), val) - vec.begin();
return counter[idx];
}
inline unsigned int
count_notGreaterThan(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return counter[idx + 1];
}
// arg_vec[i] > val なる i の個数を数える
inline unsigned int
count_greaterThan(const element_type &val) const noexcept {
unsigned int idx =
std::upper_bound(vec.begin(), vec.end(), val) - vec.begin();
return size_of_arg_vec - counter[idx];
}
inline unsigned int
count_greaterThan(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return size_of_arg_vec - counter[idx + 1];
}
// arg_vec[i] ≥ val なる i の個数を数える
inline unsigned int
count_notSmallerThan(const element_type &val) const noexcept {
unsigned int idx =
std::lower_bound(vec.begin(), vec.end(), val) - vec.begin();
return size_of_arg_vec - counter[idx];
}
inline unsigned int
count_notSmallerThan(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return size_of_arg_vec - counter[idx];
}
// vec[idx] = val なる idx を返す (存在しない場合は -1を返す)
inline int key(const element_type &val) const noexcept {
int idx = std::lower_bound(vec.begin(), vec.end(), val) - vec.begin();
return (vec[idx] == val) ? idx : -1;
}
inline int key(const const_itr_type &itr) const noexcept {
return itr - vec.cbegin();
}
// arg_vec[i] = val なる i の個数を数える (存在しないなら 0)
inline unsigned int count(const element_type &val) const noexcept {
unsigned int idx =
std::lower_bound(vec.begin(), vec.end(), val) - vec.begin();
return (vec[idx] == val) ? counter[idx + 1] - counter[idx] : 0;
}
inline unsigned int count(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return counter[idx + 1] - counter[idx];
}
// lower_bound, upper_bound
inline const_itr_type lower_bound(const element_type &val) const noexcept {
return std::lower_bound(vec.cbegin(), vec.cend(), val);
}
inline const_itr_type upper_bound(const element_type &val) const noexcept {
return std::upper_bound(vec.cbegin(), vec.cend(), val);
}
// イテレーター関係
const_itr_type cbegin(void) const noexcept { return vec.cbegin(); }
const_itr_type cend(void) const noexcept { return vec.cend(); }
};
int main(void) {
int n;
long long int k;
MIO::cin >> n >> k;
std::vector<int> Pos, Neg;
Pos.reserve(n);
Neg.reserve(n);
unsigned long long zero = 0;
for (int i = 0; i < n; ++i) {
int a;
MIO::cin >> a;
if (a < 0)
Neg.push_back(-a);
else if (a == 0)
zero++;
else
Pos.push_back(a);
}
CountingVector<long long int> CNeg(Neg), CPos(Pos);
unsigned long long pos = Pos.size(), neg = Neg.size();
if (k <= pos * neg) {
long long int ok = 0, ng = inf;
while (ng - ok > 1) {
long long int num = (ok + ng) / 2;
long long int cnt = 0;
// Ai * (-Aj) ≤ -num -> Ai * Aj ≥ num
for (auto itr = CPos.cbegin(); itr != CPos.cend(); ++itr) {
long long int need = num / *itr;
if (num % (*itr) != 0)
need++;
cnt += CNeg.count_notSmallerThan(need) * CPos.count(itr);
if (cnt >= k)
break;
}
if (cnt >= k)
ok = num;
else
ng = num;
}
MIO::cout << -ok << '\n';
return 0;
}
k -= pos * neg;
if (k <= (pos + neg) * zero + zero * (zero - 1) / 2) {
MIO::cout << "0\n";
return 0;
}
k -= (pos + neg) * zero + zero * (zero - 1) / 2;
long long int ok = inf, ng = 0;
while (ok - ng > 1) {
long long int num = (ok + ng) / 2;
long long int cnt = 0;
// ai * aj ≤ num : ai ≤ (num / aj)
for (auto itr = CNeg.cbegin(); itr != CNeg.cend(); ++itr) {
long long int need = num / *itr;
long long int kazu = CNeg.count(itr);
const auto itr2 = CNeg.upper_bound(need);
if (itr < itr2) {
cnt += CNeg.count_smallerThan(itr) * kazu;
cnt += kazu * (kazu - 1) / 2;
} else
cnt += CNeg.count_smallerThan(itr2) * kazu;
if (cnt >= k)
break;
}
for (auto itr = CPos.cbegin(); itr != CPos.cend(); ++itr) {
long long int need = num / *itr;
long long int kazu = CNeg.count(itr);
const auto itr2 = CPos.upper_bound(need);
if (itr < itr2) {
cnt += CPos.count_smallerThan(itr) * kazu;
cnt += kazu * (kazu - 1) / 2;
} else
cnt += CPos.count_smallerThan(itr2) * kazu;
if (cnt >= k)
break;
}
if (cnt >= k)
ok = num;
else
ng = num;
}
MIO::cout << ok << '\n';
return 0;
} | #include <algorithm>
#include <cstdio>
#include <tuple>
#include <vector>
constexpr long long int inf = 1e18 + 334 + 810 + 1919;
namespace MyInputAndOutput {
// 入力関係 (cin)
class user_input {
public:
inline const user_input &operator>>(int &int_arg) const {
scanf("%d", &int_arg);
return *this;
}
inline const user_input &operator>>(long long int &llint_arg) const {
scanf("%lld", &llint_arg);
return *this;
}
inline const user_input &operator>>(unsigned int &uint_arg) const {
scanf("%u", &uint_arg);
return *this;
}
inline const user_input &
operator>>(unsigned long long int &ullint_arg) const {
scanf("%llu", &ullint_arg);
return *this;
}
inline const user_input &operator>>(unsigned long &ullint_arg) const {
scanf("%lu", &ullint_arg);
return *this;
}
inline const user_input &operator>>(char *str_arg) const {
scanf("%s", str_arg);
return *this;
}
inline const user_input &operator>>(char &char_arg) const {
scanf("%*c%c", &char_arg);
return *this;
}
template <typename S, typename T>
inline const user_input &operator>>(std::pair<S, T> &pair_arg) const {
(*this) >> pair_arg.first >> pair_arg.second;
return *this;
}
template <typename T>
inline const user_input &operator>>(std::vector<T> &vec) const {
for (T &ele : vec)
(*this) >> ele;
return *this;
}
} cin;
// 出力関係 (cout)
class user_output {
public:
user_output(void) {}
inline const user_output &operator<<(const int int_arg) const {
printf("%d", int_arg);
return *this;
}
inline const user_output &operator<<(const unsigned int uint_arg) const {
printf("%u", uint_arg);
return *this;
}
inline const user_output &operator<<(const long long int llint_arg) const {
printf("%lld", llint_arg);
return *this;
}
inline const user_output &
operator<<(const unsigned long long int ullint_arg) const {
printf("%llu", ullint_arg);
return *this;
}
inline const user_output &operator<<(const unsigned long ulint_arg) const {
printf("%lu", ulint_arg);
return *this;
}
inline const user_output &operator<<(const double ld_arg) const {
printf("%.16lf", ld_arg);
return *this;
}
inline const user_output &operator<<(const long double ld_arg) const {
printf("%.16Lf", ld_arg);
return *this;
}
inline const user_output &operator<<(const char char_arg) const {
putchar(char_arg);
return *this;
}
inline const user_output &operator<<(const unsigned char uchar_arg) const {
putchar(uchar_arg);
return *this;
}
inline const user_output &operator<<(const char *str_arg) const {
fputs(str_arg, stdout);
return *this;
}
template <typename S, typename T>
inline const user_output &operator<<(const std::pair<S, T> &pair_arg) const {
(*this) << pair_arg.first << ' ' << pair_arg.second;
return *this;
}
template <typename Tp_name>
inline const user_output &operator<<(const std::vector<Tp_name> &vec) const {
const size_t size_of_vec = vec.size();
if (size_of_vec <= 0)
return *this;
(*this) << vec[0];
for (size_t index = 1; index < size_of_vec; ++index)
(*this) << ' ' << vec[index];
return *this;
}
} cout;
// その他出力関数
void binary_output(int64_t value, size_t length = 64) {
char out[length + 1];
for (size_t i = 0; i < length; ++i)
out[length - 1 - i] = ((value >> i) & 1) ? '1' : '0';
out[length] = '\0';
puts(out);
}
template <typename InputType>
void print(InputType first, InputType last, const char separate_c = ' ',
const char end_c = '\n') {
InputType it = first;
while (true) {
MyInputAndOutput::cout << *it;
if (++it == last) {
MyInputAndOutput::cout << end_c;
return;
}
MyInputAndOutput::cout << separate_c;
}
}
}; // namespace MyInputAndOutput
namespace MIO = MyInputAndOutput;
// 大小関係のある配列について, 個数を数える |
// クエリ形式の場合はクエリ先読みBITを使え
template <typename element_type> class CountingVector {
private:
unsigned int size_of_vec; // 座圧済み配列の長さ
const unsigned int
size_of_arg_vec; // 元の引数の配列の長さ | = counter[size_of_vec-1]
std::vector<element_type> vec; // ソート & 座標圧縮 済み配列
std::vector<unsigned int> counter; // 累積和 counter[i] = vec[0, i)の数
using const_itr_type = typename std::vector<element_type>::const_iterator;
public:
// コンストラクタ : 破壊的操作を行うので引数はコピー
template <typename element_type_castable>
CountingVector(std::vector<element_type_castable> arg_vec)
: size_of_arg_vec(arg_vec.size()) {
const unsigned int arg_size = arg_vec.size();
counter.reserve(arg_size + 1);
counter.push_back(0);
vec.reserve(arg_size);
std::sort(arg_vec.begin(), arg_vec.end());
unsigned int idx = 0;
while (idx < arg_size) {
unsigned int cnt = 1;
vec.push_back(arg_vec[idx]);
while (idx + cnt < arg_size and arg_vec[idx] == arg_vec[idx + cnt])
cnt++;
unsigned int p = counter.back() + cnt;
counter.push_back(p);
idx += cnt;
}
size_of_vec = vec.size();
}
// arg_vec[i] < val なる i の個数を数える
inline unsigned int
count_smallerThan(const element_type &val) const noexcept {
unsigned int idx =
std::lower_bound(vec.begin(), vec.end(), val) - vec.begin();
return counter[idx];
}
inline unsigned int
count_smallerThan(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return counter[idx];
}
// arg_vec[i] ≤ val なる i の個数を数える
inline unsigned int
count_notGreaterThan(const element_type &val) const noexcept {
unsigned int idx =
std::upper_bound(vec.begin(), vec.end(), val) - vec.begin();
return counter[idx];
}
inline unsigned int
count_notGreaterThan(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return counter[idx + 1];
}
// arg_vec[i] > val なる i の個数を数える
inline unsigned int
count_greaterThan(const element_type &val) const noexcept {
unsigned int idx =
std::upper_bound(vec.begin(), vec.end(), val) - vec.begin();
return size_of_arg_vec - counter[idx];
}
inline unsigned int
count_greaterThan(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return size_of_arg_vec - counter[idx + 1];
}
// arg_vec[i] ≥ val なる i の個数を数える
inline unsigned int
count_notSmallerThan(const element_type &val) const noexcept {
unsigned int idx =
std::lower_bound(vec.begin(), vec.end(), val) - vec.begin();
return size_of_arg_vec - counter[idx];
}
inline unsigned int
count_notSmallerThan(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return size_of_arg_vec - counter[idx];
}
// vec[idx] = val なる idx を返す (存在しない場合は -1を返す)
inline int key(const element_type &val) const noexcept {
int idx = std::lower_bound(vec.begin(), vec.end(), val) - vec.begin();
return (vec[idx] == val) ? idx : -1;
}
inline int key(const const_itr_type &itr) const noexcept {
return itr - vec.cbegin();
}
// arg_vec[i] = val なる i の個数を数える (存在しないなら 0)
inline unsigned int count(const element_type &val) const noexcept {
unsigned int idx =
std::lower_bound(vec.begin(), vec.end(), val) - vec.begin();
return (vec[idx] == val) ? counter[idx + 1] - counter[idx] : 0;
}
inline unsigned int count(const const_itr_type &itr) const noexcept {
unsigned int idx = itr - vec.cbegin();
return counter[idx + 1] - counter[idx];
}
// lower_bound, upper_bound
inline const_itr_type lower_bound(const element_type &val) const noexcept {
return std::lower_bound(vec.cbegin(), vec.cend(), val);
}
inline const_itr_type upper_bound(const element_type &val) const noexcept {
return std::upper_bound(vec.cbegin(), vec.cend(), val);
}
// イテレーター関係
const_itr_type cbegin(void) const noexcept { return vec.cbegin(); }
const_itr_type cend(void) const noexcept { return vec.cend(); }
};
int main(void) {
int n;
long long int k;
MIO::cin >> n >> k;
std::vector<int> Pos, Neg;
Pos.reserve(n);
Neg.reserve(n);
unsigned long long zero = 0;
for (int i = 0; i < n; ++i) {
int a;
MIO::cin >> a;
if (a < 0)
Neg.push_back(-a);
else if (a == 0)
zero++;
else
Pos.push_back(a);
}
CountingVector<long long int> CNeg(Neg), CPos(Pos);
unsigned long long pos = Pos.size(), neg = Neg.size();
if (k <= pos * neg) {
long long int ok = 0, ng = inf;
while (ng - ok > 1) {
long long int num = (ok + ng) / 2;
long long int cnt = 0;
// Ai * (-Aj) ≤ -num -> Ai * Aj ≥ num
for (auto itr = CPos.cbegin(); itr != CPos.cend(); ++itr) {
long long int need = num / *itr;
if (num % (*itr) != 0)
need++;
cnt += CNeg.count_notSmallerThan(need) * CPos.count(itr);
if (cnt >= k)
break;
}
if (cnt >= k)
ok = num;
else
ng = num;
}
MIO::cout << -ok << '\n';
return 0;
}
k -= pos * neg;
if (k <= (pos + neg) * zero + zero * (zero - 1) / 2) {
MIO::cout << "0\n";
return 0;
}
k -= (pos + neg) * zero + zero * (zero - 1) / 2;
long long int ok = inf, ng = 0;
while (ok - ng > 1) {
long long int num = (ok + ng) / 2;
long long int cnt = 0;
// ai * aj ≤ num : ai ≤ (num / aj)
for (auto itr = CNeg.cbegin(); itr != CNeg.cend(); ++itr) {
long long int need = num / *itr;
long long int kazu = CNeg.count(itr);
const auto itr2 = CNeg.upper_bound(need);
if (itr < itr2) {
cnt += CNeg.count_smallerThan(itr) * kazu;
cnt += kazu * (kazu - 1) / 2;
} else
cnt += CNeg.count_smallerThan(itr2) * kazu;
if (cnt >= k)
break;
}
for (auto itr = CPos.cbegin(); itr != CPos.cend(); ++itr) {
long long int need = num / *itr;
long long int kazu = CPos.count(itr);
const auto itr2 = CPos.upper_bound(need);
if (itr < itr2) {
cnt += CPos.count_smallerThan(itr) * kazu;
cnt += kazu * (kazu - 1) / 2;
} else
cnt += CPos.count_smallerThan(itr2) * kazu;
if (cnt >= k)
break;
}
if (cnt >= k)
ok = num;
else
ng = num;
}
MIO::cout << ok << '\n';
return 0;
} | replace | 329 | 330 | 329 | 330 | 0 | |
p02774 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
ll n, k, a[N];
vector<ll> v1, v2, v0;
bool check(ll val) {
ll cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == 0) {
if (val >= 0)
cnt += n - 1;
} else if (a[i] > 0) {
if (val >= 0) {
ll l = -1e9 - 10;
ll r = val / a[i];
int pos1 = lower_bound(a + 1, a + n + 1, l) - a;
int pos2 = upper_bound(a + 1, a + n + 1, r) - a;
pos2--;
cnt += pos2 - pos1 + 1;
if (l <= a[i] && a[i] <= r)
cnt--;
} else {
ll l = -1e9 - 10;
ll r = val / a[i];
if (val % a[i] != 0)
r--;
int pos1 = lower_bound(a + 1, a + n + 1, l) - a;
int pos2 = upper_bound(a + 1, a + n + 1, r) - a;
pos2--;
cnt += pos2 - pos1 + 1;
if (l <= a[i] && a[i] <= r)
cnt--;
}
} else if (a[i] < 0) {
if (val >= 0) {
ll l = val / a[i];
ll r = 1e9 + 10;
int pos1 = lower_bound(a + 1, a + n + 1, l) - a;
int pos2 = upper_bound(a + 1, a + n + 1, r) - a;
pos2--;
cnt += pos2 - pos1 + 1;
if (l <= a[i] && a[i] <= r)
cnt--;
} else {
ll l = val / a[i];
ll r = 1e9 + 10;
if (val % a[i] != 0)
l++;
int pos1 = lower_bound(a + 1, a + n + 1, l) - a;
int pos2 = upper_bound(a + 1, a + n + 1, r) - a;
pos2--;
cnt += pos2 - pos1 + 1;
if (l <= a[i] && a[i] <= r)
cnt--;
}
}
}
cnt /= 2;
return cnt >= k;
}
int main() {
// cout<<(-9)/(-4)<<endl;
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (a[i] == 0)
v0.push_back(a[i]);
else if (a[i] > 0)
v1.push_back(a[i]);
else
v2.push_back(a[i]);
}
sort(a + 1, a + n + 1);
ll l = -1e18 - 10, r = 1e18 + 10;
while (l < r) {
ll mid = (l + r) >> 1;
bool flag = check(mid);
if (flag)
r = mid;
else
l = mid + 1;
}
printf("%lld\n", r);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
ll n, k, a[N];
vector<ll> v1, v2, v0;
bool check(ll val) {
ll cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == 0) {
if (val >= 0)
cnt += n - 1;
} else if (a[i] > 0) {
if (val >= 0) {
ll l = -1e9 - 10;
ll r = val / a[i];
int pos1 = lower_bound(a + 1, a + n + 1, l) - a;
int pos2 = upper_bound(a + 1, a + n + 1, r) - a;
pos2--;
cnt += pos2 - pos1 + 1;
if (l <= a[i] && a[i] <= r)
cnt--;
} else {
ll l = -1e9 - 10;
ll r = val / a[i];
if (val % a[i] != 0)
r--;
int pos1 = lower_bound(a + 1, a + n + 1, l) - a;
int pos2 = upper_bound(a + 1, a + n + 1, r) - a;
pos2--;
cnt += pos2 - pos1 + 1;
if (l <= a[i] && a[i] <= r)
cnt--;
}
} else if (a[i] < 0) {
if (val >= 0) {
ll l = val / a[i];
ll r = 1e9 + 10;
int pos1 = lower_bound(a + 1, a + n + 1, l) - a;
int pos2 = upper_bound(a + 1, a + n + 1, r) - a;
pos2--;
cnt += pos2 - pos1 + 1;
if (l <= a[i] && a[i] <= r)
cnt--;
} else {
ll l = val / a[i];
ll r = 1e9 + 10;
if (val % a[i] != 0)
l++;
int pos1 = lower_bound(a + 1, a + n + 1, l) - a;
int pos2 = upper_bound(a + 1, a + n + 1, r) - a;
pos2--;
cnt += pos2 - pos1 + 1;
if (l <= a[i] && a[i] <= r)
cnt--;
}
}
}
cnt /= 2;
return cnt >= k;
}
int main() {
// cout<<(-9)/(-4)<<endl;
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (a[i] == 0)
v0.push_back(a[i]);
else if (a[i] > 0)
v1.push_back(a[i]);
else
v2.push_back(a[i]);
}
sort(a + 1, a + n + 1);
ll l = -1e18 - 10, r = 1e18 + 10;
while (l < r) {
ll mid = (l + r) >> 1;
bool flag = check(mid);
if (flag)
r = mid;
else
l = mid + 1;
}
printf("%lld\n", r);
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02774 | Python | Runtime Error | from bisect import bisect_left, bisect_right
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
n_m = bisect_left(a, 0) # a[i] < 0 の数
n_0 = bisect_right(a, 0) - n_m # a[i] = 0 の数
n_p = n - n_m - n_0 # a[i] > 0 の数
nn_m = n_m * n_p # 積が負になるペア数
nn_0 = n_0 * (n - n_0) + n_0 * (n_0 - 1) // 2 # 積が0になるペア数
nn_p = n * (n - 1) // 2 - nn_m - nn_0 # 積が正になるペア数
if k <= nn_m:
# k番目の値は負
def check_minus(x):
# k番目の値がx(<0)以下
# a[i] * a[j] <= x
# a[i] * a[j] <= x : a[j] >= abs(x) / abs(a[i])
# a[i+1] * a[j] <= x : a[j] >= abs(x) / abs(a[i+1])
# a[i] <= a[i+1] < 0
# abs(a[i]) >= abs(a[i+1])
# a: [-------00000+++++++]
# i jjjjj
# i jjjj
# i jj
# a[i] * a[j] <= -7
# n_m = 4
# n_0 = 3
# a = [-5, -3, -2, -1, 0, 0, 0, 1, 2, 3, 4, 5]
# i j (j j j)
# i j (j j)
# i j
# i j
# a[i] * a[j] = -5
# -2 * 4 = -6
cnt = 0
j = n_m + n_0
for i in range(n_m):
while a[i] * a[j] > x and j < n:
j += 1
# a[i] * a[j] <= x
# [j, n)
cnt += n - j
return cnt >= k
# a[i] * a[j] <= x
lb = -(10**18) # False
ub = -1 # True
while ub - lb > 1:
mid = (ub + lb) // 2
if check_minus(mid):
ub = mid
else:
lb = mid
ans = ub
elif k <= nn_m + nn_0:
# k番目の値は0
ans = 0
else:
# k番目の値は正
a_p = a[n_m + n_0 :]
a_m = [-a[i] for i in reversed(range(n_m))]
def check_plus(x):
# k番目の値がx(>=0)以下
def func(b):
# b [++++++++++++++]
# ijjjjjjjjjjj
# ijjjjjjjj
# ijjjj
# ij
# b[i] * b[j] <= x
# b[i] * b[j] <= x : b[j] <= x / b[i]
# b[i+1] * b[j] <= x : b[j] <= x / b[i+1]
c = 0
j = len(b) - 1
for i in range(len(b)):
if i >= j:
break
# i < j
while i < j and b[i] * b[j] > x:
j -= 1
# b[i] * b[j] <= x
# (i, j]
c += j - i
return c
cnt = nn_m + nn_0
cnt += func(a_p)
cnt += func(a_m)
return cnt >= k
# a[i] * a[j] <= x
lb = 0 # False
ub = 10**18 + 1 # True
while ub - lb > 1:
mid = (ub + lb) // 2
if check_plus(mid):
ub = mid
else:
lb = mid
ans = ub
print(ans)
| from bisect import bisect_left, bisect_right
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
n_m = bisect_left(a, 0) # a[i] < 0 の数
n_0 = bisect_right(a, 0) - n_m # a[i] = 0 の数
n_p = n - n_m - n_0 # a[i] > 0 の数
nn_m = n_m * n_p # 積が負になるペア数
nn_0 = n_0 * (n - n_0) + n_0 * (n_0 - 1) // 2 # 積が0になるペア数
nn_p = n * (n - 1) // 2 - nn_m - nn_0 # 積が正になるペア数
if k <= nn_m:
# k番目の値は負
def check_minus(x):
# k番目の値がx(<0)以下
# a[i] * a[j] <= x
# a[i] * a[j] <= x : a[j] >= abs(x) / abs(a[i])
# a[i+1] * a[j] <= x : a[j] >= abs(x) / abs(a[i+1])
# a[i] <= a[i+1] < 0
# abs(a[i]) >= abs(a[i+1])
# a: [-------00000+++++++]
# i jjjjj
# i jjjj
# i jj
# a[i] * a[j] <= -7
# n_m = 4
# n_0 = 3
# a = [-5, -3, -2, -1, 0, 0, 0, 1, 2, 3, 4, 5]
# i j (j j j)
# i j (j j)
# i j
# i j
# a[i] * a[j] = -5
# -2 * 4 = -6
cnt = 0
j = n_m + n_0
for i in range(n_m):
while j < n and a[i] * a[j] > x:
j += 1
# a[i] * a[j] <= x
# [j, n)
cnt += n - j
return cnt >= k
# a[i] * a[j] <= x
lb = -(10**18) # False
ub = -1 # True
while ub - lb > 1:
mid = (ub + lb) // 2
if check_minus(mid):
ub = mid
else:
lb = mid
ans = ub
elif k <= nn_m + nn_0:
# k番目の値は0
ans = 0
else:
# k番目の値は正
a_p = a[n_m + n_0 :]
a_m = [-a[i] for i in reversed(range(n_m))]
def check_plus(x):
# k番目の値がx(>=0)以下
def func(b):
# b [++++++++++++++]
# ijjjjjjjjjjj
# ijjjjjjjj
# ijjjj
# ij
# b[i] * b[j] <= x
# b[i] * b[j] <= x : b[j] <= x / b[i]
# b[i+1] * b[j] <= x : b[j] <= x / b[i+1]
c = 0
j = len(b) - 1
for i in range(len(b)):
if i >= j:
break
# i < j
while i < j and b[i] * b[j] > x:
j -= 1
# b[i] * b[j] <= x
# (i, j]
c += j - i
return c
cnt = nn_m + nn_0
cnt += func(a_p)
cnt += func(a_m)
return cnt >= k
# a[i] * a[j] <= x
lb = 0 # False
ub = 10**18 + 1 # True
while ub - lb > 1:
mid = (ub + lb) // 2
if check_plus(mid):
ub = mid
else:
lb = mid
ans = ub
print(ans)
| replace | 45 | 46 | 45 | 46 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02774/Python/s789969852.py", line 58, in <module>
if check_minus(mid):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02774/Python/s789969852.py", line 45, in check_minus
while a[i] * a[j] > x and j < n:
IndexError: list index out of range
|
p02774 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL << 60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main(void) {
ll N, K;
cin >> N >> K;
vector<ll> A(N), B(N);
ll mx = 0;
REP(i, N) {
cin >> A[i];
B[i] = A[i];
chmax(mx, abs(A[i]));
}
SORT(A);
SORT(B);
REVERSE(B);
ll ans = 0;
ll xl = -mx * mx, xr = -xl, X = (xl + xr) / 2;
while (xr - xl > 1) {
ll tmp = 0;
REP(i, N - 1) {
ll l = -1, r = N, n = (l + r) / 2;
vector<ll> v;
if (A[i] < 0)
v = B;
else
v = A;
while (r - l > 1) {
if (A[i] * v[n] <= X)
l = n;
else
r = n;
n = (l + r) / 2;
}
if (A[i] >= 0)
tmp += max((ll)0, r - i - 1);
else
tmp += min(N - i - 1, r);
}
if (tmp < K)
xl = X;
else
xr = X;
X = (xl + xr) / 2;
}
ans = xr;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL << 60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main(void) {
ll N, K;
cin >> N >> K;
vector<ll> A(N), B(N);
ll mx = 0;
REP(i, N) {
cin >> A[i];
B[i] = A[i];
chmax(mx, abs(A[i]));
}
SORT(A);
SORT(B);
REVERSE(B);
ll ans = 0;
ll xl = -mx * mx, xr = -xl, X = (xl + xr) / 2;
while (xr - xl > 1) {
ll tmp = 0;
REP(i, N - 1) {
ll l = -1, r = N, n = (l + r) / 2;
if (A[i] < 0) {
while (r - l > 1) {
if (A[i] * B[n] <= X)
l = n;
else
r = n;
n = (l + r) / 2;
}
} else {
while (r - l > 1) {
if (A[i] * A[n] <= X)
l = n;
else
r = n;
n = (l + r) / 2;
}
}
if (A[i] >= 0)
tmp += max((ll)0, r - i - 1);
else
tmp += min(N - i - 1, r);
}
if (tmp < K)
xl = X;
else
xr = X;
X = (xl + xr) / 2;
}
ans = xr;
cout << ans << endl;
return 0;
} | replace | 78 | 89 | 78 | 95 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.