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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02613 | Python | Runtime Error | N, *s = map(open(0).read().split())
for v in ("AC", "WA", "TLE", "RE"):
print("{} x {}".format(v, s.count(v)))
| N = int(input())
s = [input() for i in range(N)]
for v in ("AC", "WA", "TLE", "RE"):
print("{} x {}".format(v, s.count(v)))
| replace | 0 | 1 | 0 | 2 | TypeError: map() must have at least two arguments. | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02613/Python/s429316079.py", line 1, in <module>
N, *s = map(open(0).read().split())
TypeError: map() must have at least two arguments.
|
p02613 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
string s[100];
int i, n;
int AC = 0, WA = 0, TLE = 0, RE = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n; i++) {
if (s[i] == "AC") {
AC += 1;
} else if (s[i] == "WA") {
WA += 1;
} else if (s[i] ==... | #include <iostream>
using namespace std;
int main() {
string s[100001];
int i, n;
int AC = 0, WA = 0, TLE = 0, RE = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n; i++) {
if (s[i] == "AC") {
AC += 1;
} else if (s[i] == "WA") {
WA += 1;
} else if (s[i]... | replace | 5 | 6 | 5 | 6 | 0 | |
p02613 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
int ac = 0;
int wa = 0;
int tle = 0;
int re = 0;
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
}
for (int i = 0; i < N; i++) {
if (... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
int ac = 0;
int wa = 0;
int tle = 0;
int re = 0;
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
}
for (int i = 0; i < N; i++) {
if (... | replace | 28 | 32 | 28 | 32 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ac, wa, tle, re;
ac = wa = tle = re = 0;
cin >> n;
string s[10000];
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i] == "AC") {
ac++;
} else if (s[i] == "WA") {
wa++;
} else if (s[i] == "TLE") {
tle++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ac, wa, tle, re;
ac = wa = tle = re = 0;
cin >> n;
string s[100000];
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i] == "AC") {
ac++;
} else if (s[i] == "WA") {
wa++;
} else if (s[i] == "TLE") {
tle+... | replace | 8 | 9 | 8 | 9 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX = 2147483647;
const double PI = 3.14159265358979323846;
int main() {
int n;
string a;
int s[4];
cin >> n;
for (int i = 0; i < n; i++) {
s[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> a;
if (a == "AC")
... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX = 2147483647;
const double PI = 3.14159265358979323846;
int main() {
int n;
string a;
int s[4];
cin >> n;
for (int i = 0; i < 4; i++) {
s[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> a;
if (a == "AC")
... | replace | 13 | 14 | 13 | 14 | -11 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, AC, WA, TLE, RE;
AC = WA = TLE = RE = 0;
string S[10000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
if (S[i] == "AC")
AC++;
if (S[i] == "WA")
WA++;
if (S[i] == "TLE")
TLE++;
if (S[i] == "RE")
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, AC, WA, TLE, RE;
AC = WA = TLE = RE = 0;
string S[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
if (S[i] == "AC")
AC++;
if (S[i] == "WA")
WA++;
if (S[i] == "TLE")
TLE++;
if (S[i] == "RE")
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02613 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | insert | 194 | 194 | 194 | 196 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> count(N, 0);
for (int i = 0; i < N; i++) {
string S;
cin >> S;
if (S == "AC") {
count.at(0)++;
} else if (S == "WA") {
count.at(1)++;
} else if (S == "TLE") {
count.at(2)++;
} els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> count(4, 0);
for (int i = 0; i < N; i++) {
string S;
cin >> S;
if (S == "AC") {
count.at(0)++;
} else if (S == "WA") {
count.at(1)++;
} else if (S == "TLE") {
count.at(2)++;
} els... | replace | 7 | 8 | 7 | 8 | 0 | |
p02613 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
void b_judge_status_summary(void) {
int n;
string s[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
int ac_cnt = 0;
int wa_cnt = 0;
int tle_cnt = 0;
int re_cnt = 0;
for... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
void b_judge_status_summary(void) {
int n;
string s[100000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
int ac_cnt = 0;
int wa_cnt = 0;
int tle_cnt = 0;
int re_cnt = 0;
fo... | replace | 9 | 10 | 9 | 10 | 0 | |
p02613 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, w, a, t, r, i;
t = r = a = w = 0;
cin >> n;
char s[10000][4];
for (i = 0; i < n; i++) {
scanf("%s", s[i]);
if (s[i][0] == 'A') {
a++;
} else if (s[i][0] == 'W') {
w++;
} else if (s[i][0... | #include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, w, a, t, r, i;
t = r = a = w = 0;
cin >> n;
char s[n][4];
for (i = 0; i < n; i++) {
scanf("%s", s[i]);
if (s[i][0] == 'A') {
a++;
} else if (s[i][0] == 'W') {
w++;
} else if (s[i][0] ==... | replace | 8 | 9 | 8 | 9 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef tuple<ll, ll, ll> ti;
#define REP(a, b, c) for (ll a = b; a < (c); a++)
#define PER(a, b, c) for (ll a = b; a >= (c); a--)
ll ii() {
ll x;
cin >> x;
retu... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef tuple<ll, ll, ll> ti;
#define REP(a, b, c) for (ll a = b; a < (c); a++)
#define PER(a, b, c) for (ll a = b; a >= (c); a--)
ll ii() {
ll x;
cin >> x;
retu... | replace | 58 | 59 | 58 | 59 | -11 | |
p02613 | C++ | Runtime Error | #include <iostream>
#include <map>
int main() {
int n;
std::cin >> n;
std::map<std::string, int> mp;
for (int i = 0; i < n; ++i) {
std::string s;
std::cin >> s;
mp[s] += 1;
}
std::cout << "AC x " + mp["AC"] << '\n';
std::cout << "WA x " + mp["WA"] << '\n';
std::cout << "TLE x " + mp["TLE"... | #include <iostream>
#include <map>
int main() {
int n;
std::cin >> n;
std::map<std::string, int> mp;
for (int i = 0; i < n; ++i) {
std::string s;
std::cin >> s;
mp[s] += 1;
}
std::cout << "AC x " << mp["AC"] << '\n';
std::cout << "WA x " << mp["WA"] << '\n';
std::cout << "TLE x " << mp["T... | replace | 14 | 18 | 14 | 18 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<string> vec(a);
vector<int> ans(4);
for (int i = 0; i < a; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < 4; i++) {
if (vec.at(i) == "AC") {
ans.at(0) += 1;
} else if (vec.at(i) == "WA") {
ans.at(1)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<string> vec(a);
vector<int> ans(4);
for (int i = 0; i < a; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < a; i++) {
if (vec.at(i) == "AC") {
ans.at(0) += 1;
} else if (vec.at(i) == "WA") {
ans.at(1)... | replace | 11 | 12 | 11 | 12 | 0 | |
p02613 | C++ | Runtime Error | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-05 22:47:33
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-05 22:47:33
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | replace | 216 | 217 | 216 | 217 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s[100];
int n, c1 = 0, c2 = 0, c3 = 0, c4 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i] == "AC")
c1++;
else if (s[i] == "WA")
c2++;
else if (s[i] == "TLE")
c3++;
else if (s[i] == "RE")
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s[100005];
int n, c1 = 0, c2 = 0, c3 = 0, c4 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i] == "AC")
c1++;
else if (s[i] == "WA")
c2++;
else if (s[i] == "TLE")
c3++;
else if (s[i] == "RE")... | replace | 3 | 4 | 3 | 4 | 0 | |
p02613 | C++ | Runtime Error | /*
QUESTION :
RULE :
INPUT :
OUTPUT :
*/
/*
int :10^9
long long :10^19
*/
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < (n); ++i)
#define repeq(i, a, n) for (int i = a; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {... | /*
QUESTION :
RULE :
INPUT :
OUTPUT :
*/
/*
int :10^9
long long :10^19
*/
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < (n); ++i)
#define repeq(i, a, n) for (int i = a; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {... | replace | 24 | 25 | 24 | 25 | 0 | |
p02613 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#include <climits>
#include <iomanip>
#include <math.h>
#include <queue>
#include <vector>
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
long long modpow(long long a, long long n, long ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#include <climits>
#include <iomanip>
#include <math.h>
#include <queue>
#include <vector>
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
long long modpow(long long a, long long n, long ... | replace | 42 | 43 | 42 | 43 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0, c = 0, d = 0, N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
if (vec.at(i) == "AC") {
a += 1;
continue;
} else if (vec.at(i) == "WA") {
b += 1;
continue;
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0, c = 0, d = 0, N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
if (vec.at(i) == "AC") {
a += 1;
continue;
} else if (vec.at(i) == "WA") {
b += 1;
continue;
} el... | replace | 22 | 26 | 22 | 26 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> result;
for (int i = 0; i < N; i++) {
cin >> result.at(i);
}
int a, b, c, d;
a = 0;
b = 0;
c = 0;
d = 0;
for (int i = 0; i < N; i++) {
if (result.at(i) == "AC") {
a++;
} else if (result.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> result(N);
for (int i = 0; i < N; i++) {
cin >> result.at(i);
}
int a, b, c, d;
a = 0;
b = 0;
c = 0;
d = 0;
for (int i = 0; i < N; i++) {
if (result.at(i) == "AC") {
a++;
} else if (result... | replace | 6 | 7 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02613 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define V(i) vector<i>
#define rep(i, n) for (__typeof(n) i = 0; i < n; i++)
#define crep(i, N, n) for (__typeof(n) i = N; i < n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define P(i, j) pair<i, j>
#define MP make_pair
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
#define V(i) vector<i>
#define rep(i, n) for (__typeof(n) i = 0; i < n; i++)
#define crep(i, N, n) for (__typeof(n) i = N; i < n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define P(i, j) pair<i, j>
#define MP make_pair
#define MOD 10000000... | replace | 17 | 19 | 17 | 19 | TLE | |
p02613 | C++ | Runtime Error | // #pragma region ALL(include define etc)
#include <algorithm> // max(a, b) min(a, b) reverse() sort()
#include <cmath> // abs(絶対値) sin cos tan(角度 / 180.0 * 3.141592)
#include <functional> // sort(a, a + N, greater<型>());
#include <iomanip>
#include <iostream> // swap(a, b)
#include <math.h>
#include <string>
#in... | // #pragma region ALL(include define etc)
#include <algorithm> // max(a, b) min(a, b) reverse() sort()
#include <cmath> // abs(絶対値) sin cos tan(角度 / 180.0 * 3.141592)
#include <functional> // sort(a, a + N, greater<型>());
#include <iomanip>
#include <iostream> // swap(a, b)
#include <math.h>
#include <string>
#in... | replace | 34 | 35 | 34 | 36 | -11 | |
p02613 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
using ii = pair<int, int>;
using ll = long long int;
int a, b, c, d;
int main() {
FASTIO;
in... | #include <bits/stdc++.h>
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
using ii = pair<int, int>;
using ll = long long int;
int a, b, c, d;
int main() {
FASTIO;
in... | replace | 14 | 15 | 14 | 15 | TLE | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
int A = 0, W = 0, T = 0, R = 0;
for (int i = 0; i < N; i++) {
cin >> S;
if (S == "AC")
A++;
else if (S == "WA")
W++;
else if (S == "TLE")
T++;
else if (S == "RE")
R++;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
int A = 0, W = 0, T = 0, R = 0;
for (int i = 0; i < N; i++) {
cin >> S;
if (S == "AC")
A++;
else if (S == "WA")
W++;
else if (S == "TLE")
T++;
else if (S == "RE")
R++;
}
cout ... | replace | 19 | 23 | 19 | 23 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
#define Vsort(a) sort(a.bigin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, ac = 0, wa = 0, tle = 0, re = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i] == "AC")... | #include <bits/stdc++.h>
#define Vsort(a) sort(a.bigin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, ac = 0, wa = 0, tle = 0, re = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i] == "AC")... | replace | 23 | 27 | 23 | 27 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define db double
using namespace std;
map<string, int> mp;
int n;
string s;
int main() {
cin >> n;
while (n--)
cin >> s, mp[s]++;
cout << "AC x " + mp["AC"] << endl;
cout << "WA x " + mp["WA"] << endl;
cout << "TLE x " + mp["TLE"] << endl;
cout << "RE x " +... | #include <bits/stdc++.h>
#define ll long long
#define db double
using namespace std;
map<string, int> mp;
int n;
string s;
int main() {
cin >> n;
while (n--)
cin >> s, mp[s]++;
cout << "AC x " << mp["AC"] << endl;
cout << "WA x " << mp["WA"] << endl;
cout << "TLE x " << mp["TLE"] << endl;
cout << "RE x ... | replace | 11 | 15 | 11 | 15 | 0 | |
p02613 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
vector<int> a(4, 0);
while (n--) {
cin >> s;
if (s == "AC")
a[0]++;
else if (s == "WA")
a[1]++;
else if (s == "TLE")
a[2]++;
else
a[3]++;
}
cout << "AC x " << a[0] << '\n';
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
vector<int> a(4, 0);
while (n--) {
cin >> s;
if (s == "AC")
a[0]++;
else if (s == "WA")
a[1]++;
else if (s == "TLE")
a[2]++;
else
a[3]++;
}
cout << "AC x " << a[0] << '\n';
c... | replace | 22 | 23 | 22 | 23 | 1 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<char> a(h * w);
for (int i = 0; i < h * w; i++)
cin >> a[i];
vector<char> reset(h * w);
for (int i = 0; i < h * w; i++)
reset[i] = a[i];
int count = 0;
int ans = 0;
fo... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<char> a(h * w);
for (int i = 0; i < h * w; i++)
cin >> a[i];
vector<char> reset(h * w);
for (int i = 0; i < h * w; i++)
reset[i] = a[i];
int count = 0;
int ans = 0;
fo... | replace | 32 | 33 | 32 | 33 | -6 | double free or corruption (out)
|
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define INF (i64)1e18
#define MOD (i64)(1e9 + 7)
#define REP(i, n) for (i64 i = 0; i < n; i++)
#define RANGE(i, a, b) for (i64 i = a; i < b; i++)
#define EACH(v, e, p) for_each(v.begin(), v.end(), [](auto &e) p)
int main() {
int h, w, k;
cin ... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define INF (i64)1e18
#define MOD (i64)(1e9 + 7)
#define REP(i, n) for (i64 i = 0; i < n; i++)
#define RANGE(i, a, b) for (i64 i = a; i < b; i++)
#define EACH(v, e, p) for_each(v.begin(), v.end(), [](auto &e) p)
int main() {
int h, w, k;
cin ... | replace | 28 | 29 | 28 | 29 | -11 | |
p02614 | C++ | Runtime Error | #include <iostream>
#include <vector>
int main() {
int H, W, K;
std::cin >> H >> W >> K;
std::vector<std::vector<char>> c(W, std::vector<char>(H, 0));
int blackCount = 0;
std::vector<int> hBlackCount(H, 0);
std::vector<int> vBlackCount(W, 0);
for (int i = 0; i != H; i++) {
for (int j = 0; j != W; j+... | #include <iostream>
#include <vector>
int main() {
int H, W, K;
std::cin >> H >> W >> K;
std::vector<std::vector<char>> c(H, std::vector<char>(W, 0));
int blackCount = 0;
std::vector<int> hBlackCount(H, 0);
std::vector<int> vBlackCount(W, 0);
for (int i = 0; i != H; i++) {
for (int j = 0; j != W; j+... | replace | 7 | 8 | 7 | 8 | 0 | |
p02614 | C++ | Runtime Error | #include <iostream>
int main() {
int h, w, k, count = 0;
std::cin >> h >> w >> k;
char c[w + 1][h + 1];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
std::cin >> c[i][j];
}
}
for (int maskH = 0; maskH < (1 << h); maskH++) { // bit全探索 '1'の行を塗る
for (int maskW = 0; maskW < (1 ... | #include <iostream>
int main() {
int h, w, k, count = 0;
std::cin >> h >> w >> k;
char c[100][100];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
std::cin >> c[i][j];
}
}
for (int maskH = 0; maskH < (1 << h); maskH++) { // bit全探索 '1'の行を塗る
for (int maskW = 0; maskW < (1 << w... | replace | 5 | 6 | 5 | 6 | 0 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
#define boost \
ios::sync_with_stdio(false); \
cin.tie(0)
#define ll long long int
#define ld long double
#define mk make_pair
#define pb push_back
#define f first
#define s seco... | #include <bits/stdc++.h>
#define boost \
ios::sync_with_stdio(false); \
cin.tie(0)
#define ll long long int
#define ld long double
#define mk make_pair
#define pb push_back
#define f first
#define s seco... | replace | 27 | 28 | 27 | 28 | 0 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
using namespace std;
using ll = unsigned long long;
using p = pair<int, int>;
int main() {
int H, W, K;
cin >> H >> W >> K;
vector<vector<int>> m(W, vector<int>(H));
const int black = 1;
rep(y, 0, H) {
string s;
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
using namespace std;
using ll = unsigned long long;
using p = pair<int, int>;
int main() {
int H, W, K;
cin >> H >> W >> K;
vector<vector<int>> m(H, vector<int>(W));
const int black = 1;
rep(y, 0, H) {
string s;
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int h, w, k;
cin >> h >> w >> k;
string grid[h];
for (int i = 0; i < h; i++)
cin >> grid[i];
int res = 0;
for (int mask = 0; mask <... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int h, w, k;
cin >> h >> w >> k;
string grid[h];
for (int i = 0; i < h; i++)
cin >> grid[i];
int res = 0;
for (int mask = 0; mask <... | replace | 17 | 18 | 17 | 18 | -11 | |
p02614 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
rep(i, h) cin >> s[i];
int ans = 0;
rep(is, 1 << h) rep(js, 1 << w) {
int cnt = 0;
r... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
rep(i, h) cin >> s[i];
int ans = 0;
rep(is, 1 << h) rep(js, 1 << w) {
int cnt = 0;
r... | replace | 22 | 23 | 22 | 23 | -11 | |
p02614 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int H, W, K;
scanf("%d%d%d", &H, &W, &K);
string m[H];
for (int i = 0; i < H; i++) {
cin >> m[i];
}
int count = 0;
for (int b = 0; b < 1 << (H + W); b++) {
int black = 0;
for (int i = 0; i < H * W; i++) {
if (b >> ... | #include <iostream>
#include <string>
using namespace std;
int main() {
int H, W, K;
scanf("%d%d%d", &H, &W, &K);
string m[H];
for (int i = 0; i < H; i++) {
cin >> m[i];
}
int count = 0;
for (int b = 0; b < 1 << (H + W); b++) {
int black = 0;
for (int i = 0; i < H * W; i++) {
if (b >> ... | replace | 16 | 18 | 16 | 18 | -11 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int Exp(long long int exp_n, long long int exp_e, long long exp_mod);
int main() {
int H, W, K, O = 0;
cin >> H >> W >> K;
int C[H][W], T[H][W];
string s;
for (int i = 0; i < H; i++) {
cin >> s;
for (int j = 0; j < W; j++) {
if (s[j] == '... | #include <bits/stdc++.h>
using namespace std;
long long int Exp(long long int exp_n, long long int exp_e, long long exp_mod);
int main() {
int H, W, K, O = 0;
cin >> H >> W >> K;
int C[H][W], T[H][W];
string s;
for (int i = 0; i < H; i++) {
cin >> s;
for (int j = 0; j < W; j++) {
if (s[j] == '... | replace | 35 | 36 | 35 | 36 | 0 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(void) {
int h, w, k;
cin >> h >> w >> k;
vector<string> c(w);
for (int i = 0; i < h; i++) {
cin >> c[i];
}
int ans = 0;
for (int bith = 0; bith < (1 << h); bith++) {
for (int bitw = 0; bitw < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(void) {
int h, w, k;
cin >> h >> w >> k;
vector<string> c(h);
for (int i = 0; i < h; i++) {
cin >> c[i];
}
int ans = 0;
for (int bith = 0; bith < (1 << h); bith++) {
for (int bitw = 0; bitw < ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> vec(w);
for (int i = 0; i < w; i++) {
cin >> vec.at(i);
// cout << vec.at(i) << endl;
}
int ans = 0;
for (int mask_h = 0; mask_h < (1 << h) - 1; mask_h++) {
for (int mask_w = 0; mask_w... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> vec(h);
for (int i = 0; i < h; i++) {
cin >> vec.at(i);
// cout << vec.at(i) << endl;
}
int ans = 0;
for (int mask_h = 0; mask_h < (1 << h) - 1; mask_h++) {
for (int mask_w = 0; mask_w... | replace | 7 | 9 | 7 | 9 | 0 | |
p02614 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define IN(a, b) (a.find(b) != a.end())
#define p(a, b) make_pair(a, b)
#define readVec(a) ... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define IN(a, b) (a.find(b) != a.end())
#define p(a, b) make_pair(a, b)
#define readVec(a) ... | delete | 57 | 58 | 57 | 57 | 0 | |
p02614 | Python | Runtime Error | import itertools
from typing import List
def main():
h, w, k = map(int, input().split())
c = []
for _ in range(h):
c.append(input().split())
print(hv(c, h, w, k))
def hv(c: List[List[str]], h: int, w: int, k: int) -> int:
ret = 0
for comb_h in itertools.product((False, True), repeat... | import itertools
from typing import List
def main():
h, w, k = map(int, input().split())
c = []
for _ in range(h):
c.append(list(input()))
print(hv(c, h, w, k))
def hv(c: List[List[str]], h: int, w: int, k: int) -> int:
ret = 0
for comb_h in itertools.product((False, True), repeat=h... | replace | 8 | 9 | 8 | 9 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02614/Python/s784555472.py", line 29, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02614/Python/s784555472.py", line 11, in main
print(hv(c, h, w, k))
File "/h... |
p02614 | Python | Runtime Error | import itertools
import numpy as np
def _run(H, W, K, C):
input = np.zeros([H, W], dtype=np.int8)
for h in range(H):
for w in range(W):
if C[h][w] == "#":
input[h, w] = 1
count = 0
for r in itertools.product(*[[0, 1] for _ in range(H + W)]):
copy_input = i... | import itertools
import numpy as np
def _run(H, W, K, C):
input = np.zeros([H, W], dtype=np.int8)
for h in range(H):
for w in range(W):
if C[h][w] == "#":
input[h, w] = 1
count = 0
for r in itertools.product(*[[0, 1] for _ in range(H + W)]):
copy_input = i... | replace | 29 | 32 | 29 | 30 | TLE | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, need;
long long ans = 0;
cin >> h >> w >> need;
vector<string> s(w);
for (int i = 0; i < w; i++) {
cin >> s[i];
}
for (int i = 0; i < (1 << h); i++) {
for (int j = 0; j < (1 << w); j++) {
int bl = 0;
for (int k = 0; k... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, need;
long long ans = 0;
cin >> h >> w >> need;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
for (int i = 0; i < (1 << h); i++) {
for (int j = 0; j < (1 << w); j++) {
int bl = 0;
for (int k = 0; k... | replace | 6 | 8 | 6 | 8 | 0 | |
p02614 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> c(h);
for (int i = 0; i < h; i++) {
cin >> c[i];
}
int count = 0;
for (int ih = 0; ih < (1 << h); ih++) {
for (int jw = 0; jw < (1 << w); jw++) {
int cnt = 0;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> c(h);
for (int i = 0; i < h; i++) {
cin >> c[i];
}
int count = 0;
for (int ih = 0; ih < (1 << h); ih++) {
for (int jw = 0; jw < (1 << w); jw++) {
int cnt = 0;
for (int i = 0; i ... | replace | 15 | 16 | 15 | 16 | TLE | |
p02614 | C++ | Runtime Error | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int H, W, K, res = 0;
vector<vector<bool>> m, tmp0, tmp1;
cin >> H >> W >> K;
m.resize(H);
rep(i, H) {
string s;
cin >> s;
rep(j, W) { m[i].push_back((s[j] == '#')); }
}
... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int H, W, K, res = 0;
vector<vector<bool>> m, tmp0, tmp1;
cin >> H >> W >> K;
m.resize(H);
rep(i, H) {
string s;
cin >> s;
rep(j, W) { m[i].push_back((s[j] == '#')); }
}
... | delete | 17 | 18 | 17 | 17 | 0 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long ans = 0, ha[10] = {0}, wi[10] = {0}, k, h, w;
string c[10];
bool judge(void) {
int i, j, cntk = 0;
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
if (c[i][j] == '#' && ha[i] == 0 && wi[j] == 0)
cntk++;
}
}
if (cntk == k)
retu... | #include <bits/stdc++.h>
using namespace std;
long long ans = 0, ha[10] = {0}, wi[10] = {0}, k, h, w;
string c[10];
bool judge(void) {
int i, j, cntk = 0;
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
if (c[i][j] == '#' && ha[i] == 0 && wi[j] == 0)
cntk++;
}
}
if (cntk == k)
retu... | insert | 36 | 36 | 36 | 37 | 0 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define F first
#define S second
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define F first
#define S second
#d... | replace | 56 | 57 | 56 | 57 | 0 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, m, ans = 0, k, t, r, c;
char ch;
cin >> n >> m >> k;
int a[n][m];
memset(a, 0, sizeof(a));
for (i = 0; i < n; i++) {
for (i = 0; i < m; i++) {
cin >> ch;
if (ch == '#')
a[i][j] = 1;
}
}
for (r = 0; r < (1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, m, ans = 0, k, t, r, c;
char ch;
cin >> n >> m >> k;
int a[n][m];
memset(a, 0, sizeof(a));
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> ch;
if (ch == '#')
a[i][j] = 1;
}
}
for (r = 0; r < (1... | replace | 9 | 10 | 9 | 10 | -11 | |
p02614 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
vector<string> vec(W);
for (int i = 0; i < H; i++) {
cin >> vec[i];
}
int ans = 0;
for (int is = 0; is < (1 << H); is++) {
for (int js = 0; js < (1 << W); js++) {
int cnt = 0;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
vector<string> vec(H);
for (int i = 0; i < H; i++) {
cin >> vec[i];
}
int ans = 0;
for (int is = 0; is < (1 << H); is++) {
for (int js = 0; js < (1 << W); js++) {
int cnt = 0;
for (int i = 0; i... | replace | 6 | 7 | 6 | 7 | 0 | |
p02615 | C++ | Time Limit Exceeded | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
// c... | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
// c... | replace | 24 | 41 | 24 | 39 | TLE | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
reverse(a... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
reverse(a... | insert | 22 | 22 | 22 | 27 | 0 | |
p02615 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pai... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pai... | replace | 41 | 44 | 41 | 42 | TLE | |
p02615 | C++ | Runtime Error | //
// じょえチャンネル
// 高評価・チャンネル登録よろしくお願いします！
// https://www.youtube.com/watch?v=gPFr7q7eLL8
//
/*------------------------------------
∧＿∧
∧＿∧ （´<_｀ ）
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
-------------------------------------*/
#include <alg... | //
// じょえチャンネル
// 高評価・チャンネル登録よろしくお願いします！
// https://www.youtube.com/watch?v=gPFr7q7eLL8
//
/*------------------------------------
∧＿∧
∧＿∧ （´<_｀ ）
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
-------------------------------------*/
#include <alg... | replace | 278 | 279 | 278 | 279 | 0 | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
int main() {
using namespace std;
long long n, a[2000] = {}, s, w;
bool flag = 0;
cin >> n;
for (long i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
s = a[n - 1];
w = n - 2;
for (long j = n - 2; j > 0; --j) {
s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
int main() {
using namespace std;
long long n, a[200000] = {}, s, w;
bool flag = 0;
cin >> n;
for (long i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
s = a[n - 1];
w = n - 2;
for (long j = n - 2; j > 0; --j) {
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v, val) memset(v, val, sizeof(v))
#define lcm(a, b) ((a * b) / (__gcd(a, b)))
typedef long long ll;
typedef unsigned long ... | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v, val) memset(v, val, sizeof(v))
#define lcm(a, b) ((a * b) / (__gcd(a, b)))
typedef long long ll;
typedef unsigned long ... | replace | 25 | 26 | 25 | 26 | 0 | |
p02615 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
ll c;
int a[100000];
int x;
scanf("%d", &x);
for (int i = 1; i <= x; i++) {
scanf("%lld", &a[i]);
}
sort(a + 1, a + 1 + x);
c = a[x];
int d = 0;
for (int i = 1; ... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
ll c;
int a[200005];
int x;
scanf("%d", &x);
for (int i = 1; i <= x; i++) {
scanf("%lld", &a[i]);
}
sort(a + 1, a + 1 + x);
c = a[x];
int d = 0;
for (int i = 1; ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC opti... | #include <bits/stdc++.h>
using namespace std;
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC opti... | replace | 97 | 98 | 97 | 98 | 0 | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define db(x) cout << (x) << '\n';
#define all(x) x.begin(), x.end()
#define UNIQUE(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define LB(v, x) lower_bound(all(v), x)
#define UB(v, x) upper_bound(all(v), x)
#define endl "\n"
#define F first
#define S second
#de... | #include <bits/stdc++.h>
using namespace std;
#define db(x) cout << (x) << '\n';
#define all(x) x.begin(), x.end()
#define UNIQUE(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define LB(v, x) lower_bound(all(v), x)
#define UB(v, x) upper_bound(all(v), x)
#define endl "\n"
#define F first
#define S second
#de... | replace | 49 | 92 | 49 | 57 | -11 | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
templ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
templ... | insert | 60 | 60 | 60 | 62 | 0 | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
using namespace std;
using ll = long long;
const int MAXN = 100001;
int a[MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
rep(i, n) cin >> a[i];
sort(a, a + n);
reverse(a, a + n);
ll ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
using namespace std;
using ll = long long;
const int MAXN = 200001;
int a[MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
rep(i, n) cin >> a[i];
sort(a, a + n);
reverse(a, a + n);
ll ans... | replace | 4 | 5 | 4 | 5 | 0 | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define me(a, b... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define me(a, b... | replace | 23 | 24 | 23 | 24 | 0 | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
constexpr uint32_t mxN = 2e5;
uint64_t A[mxN];
void solve() {
uint32_t N;
cin >> N;
for (uint32_t i = 0; i < N; i++) {
cin >> A[i];
}
std::sort(A, A + N, std::greater<uint64_t>());
// cout << "A " << endl;
// for(uint32_t i = 0 ; i < ... | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
constexpr uint32_t mxN = 2e5;
uint64_t A[mxN];
void solve() {
uint32_t N;
cin >> N;
for (uint32_t i = 0; i < N; i++) {
cin >> A[i];
}
std::sort(A, A + N, std::greater<uint64_t>());
// cout << "A " << endl;
// for(uint32_t i = 0 ; i < ... | replace | 28 | 29 | 28 | 29 | 0 | |
p02615 | C++ | Runtime Error | /**
____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N_MAX = 100002;
int n;
int f[N_MAX];
multiset<int> s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
... | /**
____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N_MAX = 200002;
int n;
int f[N_MAX];
multiset<int> s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
... | replace | 14 | 15 | 14 | 15 | 0 | |
p02615 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | replace | 42 | 50 | 42 | 48 | TLE | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
typedef long long ll;
const int N = 100005;
int n;
ll ans;
int w[N];
priority_queue<int> q;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", w + i);
sort(w, w + n);
reverse(w, w + n);
q.push(w[0]);
for ... | #include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
typedef long long ll;
const int N = 200005;
int n;
ll ans;
int w[N];
priority_queue<int> q;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", w + i);
sort(w, w + n);
reverse(w, w + n);
q.push(w[0]);
for ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
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, co... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
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, co... | insert | 32 | 32 | 32 | 34 | 0 | |
p02615 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
vi a(n);
rep(i, 0, n) cin >> a[... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
vi a(n);
rep(i, 0, n) cin >> a[... | replace | 22 | 23 | 22 | 23 | -6 | /usr/include/c++/12/debug/vector:442:
In function:
std::debug::vector<_Tp, _Allocator>::reference std::debug::vector<_Tp,
_Allocator>::operator[](size_type) [with _Tp = int; _Allocator =
std::allocator<int>; reference = int&; size_type = long unsigned int]
Error: attempt to subscript container with out-o... |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alen... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alen... | replace | 17 | 18 | 17 | 18 | 0 | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long int N, a[100000], count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N, greater<int>());
for (int j = 0; j < N; j++) {
count += a[j / 2];
}
count -= a[0... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long int N, a[200000], count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N, greater<int>());
for (int j = 0; j < N; j++) {
count += a[j / 2];
}
count -= a[0... | replace | 7 | 8 | 7 | 8 | 0 | |
p02615 | C++ | Runtime Error | // https://atcoder.jp/contests/abc173/tasks/abc173_d
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P ... | // https://atcoder.jp/contests/abc173/tasks/abc173_d
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P ... | replace | 24 | 25 | 24 | 25 | 0 | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int arr[N];
for (int i = 0; i < N; i++)
cin >> arr[i];
sort(arr, arr + N);
long long ans = arr[N - 1];
int j = arr[N - 2];
for (int i = N - 3; i >= 0;) {
ans += arr[j], --i;
if (i >= 0)
ans += ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int arr[N];
for (int i = 0; i < N; i++)
cin >> arr[i];
sort(arr, arr + N);
long long ans = arr[N - 1];
int j = N - 2;
for (int i = N - 3; i >= 0;) {
ans += arr[j], --i;
if (i >= 0)
ans += arr[j... | replace | 12 | 13 | 12 | 13 | 0 | |
p02615 | Python | Time Limit Exceeded | # -*- coding: utf-8 -*-
N = int(input())
A = list(map(int, input().split()))
a_sorted = sorted(A, key=lambda x: -x)
circle = [a_sorted[0]]
ans = 0
for a in a_sorted:
tmp = 0
tmp_idx = -1
for i in range(len(circle) - 1):
cand = min(circle[i], circle[i + 1])
if cand > tmp:
tmp =... | # -*- coding: utf-8 -*-
N = int(input())
A = list(map(int, input().split()))
a_sorted = sorted(A, key=lambda x: -x)
circle = [a_sorted[0]]
ans = 0
for idx, a in enumerate(a_sorted[1:]):
ans += circle[idx]
circle.extend([a, a])
print(ans)
| replace | 9 | 19 | 9 | 12 | TLE | |
p02615 | Python | Runtime Error | from collections import deque
n = int(input())
a = sorted(map(int, input().split()), reverse=True)
ans, cnt = 0, deque([a[0]])
for i in a[1:]:
ans += cnt.popleft()
cnt.append(a[i])
cnt.append(a[i])
print(ans)
| from collections import deque
n = int(input())
a = sorted(map(int, input().split()), reverse=True)
ans, cnt = 0, deque([a[0]])
for i in a[1:]:
ans += cnt.popleft()
cnt.append(i)
cnt.append(i)
print(ans)
| replace | 8 | 10 | 8 | 10 | 0 | |
p02615 | Python | Time Limit Exceeded | n = int(input())
a = [int(i) for i in input().split()]
a.sort()
a = a[::-1]
cur = [a[0], a[1]]
now = a[0]
for i in a[2:]:
loc = 0
maxer = min(cur[0], cur[-1])
for j in range(1, len(cur)):
temp = min(cur[j - 1], cur[j])
if temp > maxer:
loc = j
maxer = temp
now +=... | n = int(input())
a = [int(i) for i in input().split()]
a.sort()
a = a[::-1]
if n % 3 == 0:
if n % 2 == 0:
print(a[0] + sum(a[1 : n // 2]) * 2)
else:
print(a[0] + sum(a[1 : n // 2]) * 2 + a[n // 2])
elif n % 3 == 2:
if n % 2 == 0:
print(a[0] + sum(a[1 : n // 2]) * 2)
else:
... | replace | 5 | 19 | 5 | 20 | TLE | |
p02615 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <boost/lexical_cast.hpp>
using namespace std;
#define ll long long int
#define vll vector<ll>
#define vllv vector<vector<ll>>
#define vpii vector<pair<ll, ll>>
#define sz size()
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define allr(v... | #include <bits/stdc++.h>
// #include <boost/lexical_cast.hpp>
using namespace std;
#define ll long long int
#define vll vector<ll>
#define vllv vector<vector<ll>>
#define vpii vector<pair<ll, ll>>
#define sz size()
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define allr(v... | insert | 128 | 128 | 128 | 130 | TLE | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], ans, x;
int main() {
cin >> n;
for (long long i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ans += a[n - 1];
for (long long i = n - 2; i > 0; i--) {
ans = ans + a[i];
x++;
if (x + 2 == n)
break;
ans = ans + a[i];... | #include <bits/stdc++.h>
using namespace std;
long long n, a[200010], ans, x;
int main() {
cin >> n;
for (long long i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ans += a[n - 1];
for (long long i = n - 2; i > 0; i--) {
ans = ans + a[i];
x++;
if (x + 2 == n)
break;
ans = ans + a[i];... | replace | 2 | 3 | 2 | 3 | 0 | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n], i;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll ans = a[n - 1], k = n - 2, m = 0;
for (i = n - 3; i >= 0; i--) {
if (m < 2) {
ans += a[k];
m++;
} else {
ans +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n], i;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll ans = a[n - 1], k = n - 2, m = 0;
for (i = n - 3; i >= 0; i--) {
if (m < 2) {
ans += a[k];
m++;
} else {
ans +... | replace | 17 | 18 | 17 | 18 | 0 | |
p02615 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n, 2);
b[0] = 1;
rep(i, n) cin >> a[i];
sort(a.begin(), a.end(), greater<int>());
if (n == 2) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n, 2);
b[0] = 1;
rep(i, n) cin >> a[i];
sort(a.begin(), a.end(), greater<int>());
if (n == 2) {
... | replace | 22 | 28 | 22 | 28 | TLE | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define N 100010
using namespace std;
ll ans;
int n;
int a[N];
bool cmp(int a, int b) { return a > b; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1, cmp);
int hal = n / 2;
ans += a[1];
for (int i = 2; i <= hal; i+... | #include <bits/stdc++.h>
#define ll long long
#define N 200010
using namespace std;
ll ans;
int n;
int a[N];
bool cmp(int a, int b) { return a > b; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1, cmp);
int hal = n / 2;
ans += a[1];
for (int i = 2; i <= hal; i+... | replace | 2 | 3 | 2 | 3 | 0 | |
p02615 | C++ | Runtime Error | #include <cstdio>
#include <queue>
using namespace std;
int n, a[100010], max;
long long sum;
priority_queue<int> s1;
priority_queue<pair<int, pair<int, int>>> s2;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
s1.push(a[i]);
}
s2.push(make_pair(s1.top(), make_pair(s1.t... | #include <cstdio>
#include <queue>
using namespace std;
int n, a[200010], max;
long long sum;
priority_queue<int> s1;
priority_queue<pair<int, pair<int, int>>> s2;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
s1.push(a[i]);
}
s2.push(make_pair(s1.top(), make_pair(s1.t... | replace | 3 | 4 | 3 | 4 | 0 | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... | #include <algorithm>
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... | replace | 100 | 102 | 100 | 102 | 0 | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | replace | 202 | 208 | 202 | 211 | 0 | |
p02615 | C++ | Runtime Error | #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sta... | #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sta... | replace | 26 | 27 | 26 | 27 | 0 | |
p02615 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class TH> void _dbg(const char *sdbg, TH h) {
cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',')
cerr << *sdbg++;
cerr <... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class TH> void _dbg(const char *sdbg, TH h) {
cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',')
cerr << *sdbg++;
cerr <... | replace | 22 | 23 | 22 | 23 | 0 | |
p02615 | C++ | Runtime Error | /* Author: topcoderme123
Date: 5th july
*/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define all(v) (v).begin(), (v).end()
#define np next_permutation
using namespace std;
using vi = vector<int>;
#define lp(i, n) for (int i = 0; i < n;... | /* Author: topcoderme123
Date: 5th july
*/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define all(v) (v).begin(), (v).end()
#define np next_permutation
using namespace std;
using vi = vector<int>;
#define lp(i, n) for (int i = 0; i < n;... | replace | 33 | 34 | 33 | 35 | 0 | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
int main() {
int n, A[100000];
scanf("%i", &n);
for (int i = 0; i < n; i++) {
scanf("%i", A + i);
}
sort(A, A + n, greater<int>());
long long ans = A[0];
n -= 2;
for (int i = 1; n; i++) {
if (n == 1) {
ans +... | #include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
int main() {
int n, A[200000];
scanf("%i", &n);
for (int i = 0; i < n; i++) {
scanf("%i", A + i);
}
sort(A, A + n, greater<int>());
long long ans = A[0];
n -= 2;
for (int i = 1; n; i++) {
if (n == 1) {
ans +... | replace | 5 | 6 | 5 | 6 | 0 | |
p02615 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
int t, n, a[100005], ans, pnt, tmp;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
t = 1;
// cin>>t;
while (t--) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
int t, n, a[200005], ans, pnt, tmp;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
t = 1;
// cin>>t;
while (t--) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[... | replace | 4 | 5 | 4 | 5 | 0 | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <random>
#include <vector>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll mod = 1000000007;
vector<ll> dp(200010);
int main() {
int ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <random>
#include <vector>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll mod = 1000000007;
vector<ll> dp(400010);
int main() {
int ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02615 | C++ | Runtime Error | // author: hitch_hiker42;
#include "bits/stdc++.h"
using namespace std;
// solution:
#define int int64_t
#define span(a) begin(a), end(a)
void hike() {
int n;
cin >> n;
vector<int> a(n);
for (int &i : a)
cin >> i;
sort(span(a), greater<int>());
int cost = a.front(), j = 1;
for (int i = n - 2; ~i; i ... | // author: hitch_hiker42;
#include "bits/stdc++.h"
using namespace std;
// solution:
#define int int64_t
#define span(a) begin(a), end(a)
void hike() {
int n;
cin >> n;
vector<int> a(n);
for (int &i : a)
cin >> i;
sort(span(a), greater<int>());
int cost = a.front(), j = 1;
for (int i = n - 2; i > 0;... | replace | 16 | 17 | 16 | 17 | -11 | |
p02615 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#incl... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#incl... | replace | 35 | 36 | 35 | 36 | 0 | |
p02615 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
long long a[100010], ans = 0;
int main() {
int i, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long long num = n - 1;
ans += a[n - 1];
num--;
for (i = n - 2; i >= 0; i--) {
ans += min(2LL, num) * a[i];
n... | #include <algorithm>
#include <iostream>
using namespace std;
long long a[200010], ans = 0;
int main() {
int i, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long long num = n - 1;
ans += a[n - 1];
num--;
for (i = n - 2; i >= 0; i--) {
ans += min(2LL, num) * a[i];
n... | replace | 3 | 4 | 3 | 4 | 0 | |
p02615 | C++ | Runtime Error | // ABHISHEK AGRAWAL//
// Newbie......You have to be odd to be no. ONE :)//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fl float
#define lcm(a, b) (a * (b / __gcd(a, b)))
#define vs vector<string>
#define vc vector<char>
#define vll vector<ll>
#define sll set<ll>... | // ABHISHEK AGRAWAL//
// Newbie......You have to be odd to be no. ONE :)//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fl float
#define lcm(a, b) (a * (b / __gcd(a, b)))
#define vs vector<string>
#define vc vector<char>
#define vll vector<ll>
#define sll set<ll>... | replace | 152 | 154 | 152 | 154 | 0 | Time : 23.665ms
|
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10... | replace | 220 | 224 | 220 | 230 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define double long double
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,sse")
using namespace std;
bool comp(int a, int b) { return abs(a) >= abs(b); }
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
bool can(... | #include <bits/stdc++.h>
#define int long long
#define double long double
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,sse")
using namespace std;
bool comp(int a, int b) { return abs(a) > abs(b); }
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
bool can(i... | replace | 7 | 8 | 7 | 8 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | replace | 149 | 150 | 149 | 150 | 0 | |
p02616 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define fr first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
const ll MOD = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define fr first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
const ll MOD = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,... | replace | 48 | 56 | 48 | 57 | TLE | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < ((int)(n)); ++(i))
const ll MOD = 1000000007;
int main() {
ll ans = 1;
int N, K;
cin >> N >> K;
vector<ll> pos, neg;
rep(i, N) {
ll x;
cin >> x;
if (x >= 0)
pos.push_back(x);
else
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; (i) < ((int)(n)); ++(i))
const ll MOD = 1000000007;
int main() {
ll ans = 1;
int N, K;
cin >> N >> K;
vector<ll> pos, neg;
rep(i, N) {
ll x;
cin >> x;
if (x >= 0)
pos.push_back(x);
else
... | replace | 39 | 41 | 39 | 41 | 0 | |
p02616 | C++ | Runtime Error | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typena... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typena... | replace | 405 | 406 | 405 | 408 | 0 | |
p02616 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
inline bool EQ(double a, double b) {... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
inline bool EQ(double a, double b) {... | replace | 64 | 70 | 64 | 68 | 0 | |
p02616 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | replace | 413 | 414 | 413 | 414 | 0 | |
p02616 | C++ | Runtime Error | #define _USE_MATH_DEFINES
// #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#i... | #define _USE_MATH_DEFINES
// #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#i... | replace | 38 | 40 | 38 | 40 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.