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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03102 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, m, c, ans = 0, z;
cin >> n >> m >> c;
vector<long long int> b(100000000);
vector<long long int> a(100000000);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[j];
z += a[j] * b[j];
}
z += c;
if (z > 0) {
ans++;
}
z = 0;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, m, c, ans = 0, z;
cin >> n >> m >> c;
vector<long long int> b(1000000);
vector<long long int> a(1000000);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[j];
z += a[j] * b[j];
}
z += c;
if (z > 0) {
ans++;
}
z = 0;
}
cout << ans << endl;
return 0;
} | replace | 9 | 11 | 9 | 11 | MLE | |
p03102 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = 0; i < (f); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 100;
const int INF = (1 << 12);
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(n);
rep(i, m) cin >> B[i];
int ans = 0;
rep(i, n) {
int sum = c;
rep(j, m) {
int a;
cin >> a;
sum += a * B[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | // #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = 0; i < (f); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 100;
const int INF = (1 << 12);
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(m);
rep(i, m) cin >> B[i];
int ans = 0;
rep(i, n) {
int sum = c;
rep(j, m) {
int a;
cin >> a;
sum += a * B[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int ans = 0;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
sum += C;
if (sum > 0)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int ans = 0;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
sum += C;
if (sum > 0)
ans++;
}
cout << ans << endl;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define IMIN INT_MIN;
#define IMAX INT_MAX;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
rep(i, M) cin >> B[i];
int A[M][N];
int cnt = 0;
int rowsum;
rep(i, N) {
rowsum = 0;
rep(j, M) {
cin >> A[i][j];
rowsum += A[i][j] * B[j];
}
if (rowsum + C > 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define IMIN INT_MIN;
#define IMAX INT_MAX;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
rep(i, M) cin >> B[i];
int A[N][M];
int cnt = 0;
int rowsum;
rep(i, N) {
rowsum = 0;
rep(j, M) {
cin >> A[i][j];
rowsum += A[i][j] * B[j];
}
if (rowsum + C > 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
| replace | 28 | 29 | 28 | 29 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> bm(m);
for (int i = 0; i < m; i++)
cin >> bm[i];
vector<vector<int>> am(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> am[i][j];
}
}
int answer = 0;
for (int i = 0; i < n; i++) {
long long sum = c;
for (int j = 0; j < m; j++) {
sum += bm[j] * am[i][j];
}
if (sum > 0)
answer++;
}
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> bm(m);
for (int i = 0; i < m; i++)
cin >> bm[i];
vector<vector<int>> am(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> am[i][j];
}
}
int answer = 0;
for (int i = 0; i < n; i++) {
long long sum = c;
for (int j = 0; j < m; j++) {
sum += bm[j] * am[i][j];
}
if (sum > 0)
answer++;
}
cout << answer << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using namespace std;
typedef long long int LL;
typedef unsigned long long int ULL;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) { cin >> b[i]; }
int a[m][n];
rep(i, n) {
rep(j, m) { cin >> a[i][j]; }
}
int res = 0;
rep(i, n) {
LL tmp = 0;
rep(j, m) { tmp += a[i][j] * b[j]; }
if (tmp + c > 0) {
res += 1;
}
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using namespace std;
typedef long long int LL;
typedef unsigned long long int ULL;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, m) { cin >> b[i]; }
vector<vector<int>> a(n, vector<int>(m, 0));
;
rep(i, n) {
rep(j, m) { cin >> a[i][j]; }
}
int res = 0;
rep(i, n) {
LL tmp = 0;
rep(j, m) { tmp += a[i][j] * b[j]; }
if (tmp + c > 0) {
res += 1;
}
}
cout << res << endl;
return 0;
}
| replace | 25 | 26 | 25 | 27 | 0 | |
p03102 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
int n, m, c;
int count = 0;
cin >> n >> m >> c;
vector<int> b(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> a[i][j];
}
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
sum += a[i][j] * b[j];
}
sum += c;
if (sum > 0)
count++;
}
cout << count << endl;
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
int n, m, c;
int count = 0;
cin >> n >> m >> c;
int b[30];
int a[30][30];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> a[i][j];
}
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
sum += a[i][j] * b[j];
}
sum += c;
if (sum > 0)
count++;
}
cout << count << endl;
}
| replace | 11 | 13 | 11 | 13 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
cin >> A[i][j];
}
}
int count = 0;
for (int i = 0; i < N; i++) {
int ans = 0;
for (int j = 0; j < M; j++) {
ans += A[i][j] * B[j];
}
if (ans + C > 0)
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 0;
for (int i = 0; i < N; i++) {
int ans = 0;
for (int j = 0; j < M; j++) {
ans += A[i][j] * B[j];
}
if (ans + C > 0)
count++;
}
cout << count << endl;
} | replace | 10 | 12 | 10 | 12 | -11 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
using vi = vector<int>;
int main() {
int N, M, C;
cin >> N >> M >> C;
vi B = vi(10);
FOR(i, 0, M) cin >> B[i];
int ans = 0;
FOR(k, 0, N) {
int sum = C;
FOR(i, 0, M) {
int A_i;
cin >> A_i;
sum += A_i * B[i];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
using vi = vector<int>;
int main() {
int N, M, C;
cin >> N >> M >> C;
vi B = vi(M);
FOR(i, 0, M) cin >> B[i];
int ans = 0;
FOR(k, 0, N) {
int sum = C;
FOR(i, 0, M) {
int A_i;
cin >> A_i;
sum += A_i * B[i];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A;
vector<int> B(M);
// vector<vector<int>> A = vector<vector<int>>(N, vector<int>(M));
int cnt = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
cin >> A;
sum += A * B.at(i);
}
if (sum > 0) {
cnt++;
}
}
cout << cnt;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A;
vector<int> B(M);
// vector<vector<int>> A = vector<vector<int>>(N, vector<int>(M));
int cnt = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
cin >> A;
sum += A * B.at(j);
}
if (sum > 0) {
cnt++;
}
}
cout << cnt;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p03102 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
/*calculation*/
int o = 0;
for (int i = 0; i < n; i++) {
int wa = 0;
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
wa += c;
if (wa > 0) {
o++;
}
}
/*output*/
cout << o << endl;
delete[] b;
for (int i = 0; i < m; i++) {
delete[] a[i];
}
delete[] a;
}
| #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
/*calculation*/
int o = 0;
for (int i = 0; i < n; i++) {
int wa = 0;
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
wa += c;
if (wa > 0) {
o++;
}
}
/*output*/
cout << o << endl;
delete[] b;
for (int i = 0; i < n; i++) {
delete[] a[i];
}
delete[] a;
}
| replace | 35 | 36 | 35 | 36 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
int B[M];
int A[N][M];
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
sum += (A[i][j] * B[j]);
}
if (sum > 0)
ans++;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
int B[110];
int A[110][110];
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int sum = C;
for (int j = 0; j < M; j++) {
sum += (A[i][j] * B[j]);
}
if (sum > 0)
ans++;
}
cout << ans << endl;
}
| replace | 11 | 13 | 11 | 13 | -11 | |
p03102 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, c, num[21][21], nn, sum;
while (scanf("%d%d%d", &n, &m, &c)) {
nn = 0;
for (int j = 0; j < m; j++)
scanf("%d", &num[0][j]);
for (int i = 1; i <= n; i++) {
sum = c;
for (int j = 0; j < m; j++) {
scanf("%d", &num[i][j]);
sum += num[i][j] * num[0][j];
}
if (sum > 0)
nn++;
}
cout << nn << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, c, num[21][21], nn, sum;
while (cin >> n >> m >> c) {
nn = 0;
for (int j = 0; j < m; j++)
scanf("%d", &num[0][j]);
for (int i = 1; i <= n; i++) {
sum = c;
for (int j = 0; j < m; j++) {
scanf("%d", &num[i][j]);
sum += num[i][j] * num[0][j];
}
if (sum > 0)
nn++;
}
cout << nn << endl;
}
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x : (c))
#define EXIST(s, e) ((s).find(e) != (s).end())
#define ALL(c) (c).begin(), (c).end()
#define REVERSE(c) reverse(ALL(c))
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define STABLE_SORT(c) stable_sort(ALL(c))
#define STABLE_RSORT(c) stable_sort((c).rbegin(), (c).rend())
#define UNIQUE(c) \
SORT(c); \
(c).erase(unique(ALL(c)), (c).end());
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double INF = 1e7;
const double EPS = 1e-10;
const double PI = acos(-1.0);
#define dump(x) cerr << #x << " = " << (x) << endl;
int main() {
LL N, M, C;
cin >> N >> M >> C;
VI B(M);
REP(i, M) { cin >> B[i]; }
VVI A(N);
REP(i, M) { A[i].resize(M); }
REP(i, N) {
REP(j, M) { cin >> A[i][j]; }
}
LL count = 0;
REP(i, N) {
LL sum = C;
REP(j, M) { sum += A[i][j] * B[j]; }
if (sum > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x : (c))
#define EXIST(s, e) ((s).find(e) != (s).end())
#define ALL(c) (c).begin(), (c).end()
#define REVERSE(c) reverse(ALL(c))
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define STABLE_SORT(c) stable_sort(ALL(c))
#define STABLE_RSORT(c) stable_sort((c).rbegin(), (c).rend())
#define UNIQUE(c) \
SORT(c); \
(c).erase(unique(ALL(c)), (c).end());
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double INF = 1e7;
const double EPS = 1e-10;
const double PI = acos(-1.0);
#define dump(x) cerr << #x << " = " << (x) << endl;
int main() {
LL N, M, C;
cin >> N >> M >> C;
VI B(M);
REP(i, M) { cin >> B[i]; }
VVI A(N);
REP(i, N) { A[i].resize(M); }
REP(i, N) {
REP(j, M) { cin >> A[i][j]; }
}
LL count = 0;
REP(i, N) {
LL sum = C;
REP(j, M) { sum += A[i][j] * B[j]; }
if (sum > 0) {
count++;
}
}
cout << count << endl;
return 0;
}
| replace | 45 | 46 | 45 | 46 | -6 | free(): invalid size
|
p03102 | C++ | Runtime Error | #include <iostream>
#include <vector>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
std::vector<long long> b(n, 0);
int a = 0;
for (int mm = 0; mm < m; mm++) {
std::cin >> b[mm];
}
for (int nn = 0; nn < n; nn++) {
long long s = 0;
for (int mm = 0; mm < m; mm++) {
int a;
std::cin >> a;
s += a * b[mm];
}
if (s + c > 0) {
a++;
}
}
std::cout << a << std::endl;
return 0;
} | #include <iostream>
#include <vector>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
std::vector<long long> b(m, 0);
int a = 0;
for (int mm = 0; mm < m; mm++) {
std::cin >> b[mm];
}
for (int nn = 0; nn < n; nn++) {
long long s = 0;
for (int mm = 0; mm < m; mm++) {
int a;
std::cin >> a;
s += a * b[mm];
}
if (s + c > 0) {
a++;
}
}
std::cout << a << std::endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
// cout << fixed << setprecision(10);
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<ll> B(N);
for (int i = 0; i < M; i++)
cin >> B[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
ll sum = C;
for (int j = 0; j < M; j++) {
ll tmp;
cin >> tmp;
sum += tmp * B[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
// cout << fixed << setprecision(10);
int main() {
ll N, M, C;
cin >> N >> M >> C;
vector<ll> B(M);
for (int i = 0; i < M; i++)
cin >> B[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
ll sum = C;
for (int j = 0; j < M; j++) {
ll tmp;
cin >> tmp;
sum += tmp * B[j];
}
if (sum > 0)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int sum_val = 0;
rep(j, 0, m) {
int a;
cin >> a;
sum_val += a * b[j];
}
if (sum_val + c > 0)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
rep(i, 0, m) cin >> b[i];
int ans = 0;
rep(i, 0, n) {
int sum_val = 0;
rep(j, 0, m) {
int a;
cin >> a;
sum_val += a * b[j];
}
if (sum_val + c > 0)
ans++;
}
cout << ans << endl;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(M, vector<int>(N));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int sum = 0, ans = 0;
for (int i = 0; i < N; i++, sum = 0) {
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int sum = 0, ans = 0;
for (int i = 0; i < N; i++, sum = 0) {
for (int j = 0; j < M; j++) {
sum += A[i][j] * B[j];
}
if (sum + C > 0)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p03102 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
/*https://github.com/kurokoji/.cpp-Template/wiki#struct-fast*/
// 理解できていないものはコメントアウト
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* debug */
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n';
/* short */
// #define pb push_back
// #define eb emplace_back
// #define mp make_pair
// #define Fi first
// #define Se second
#define ALL(v) begin(v), end(v) // sort(ALL(v));みたいに使う
// #define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()
/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
// #define EACH(i, n) for (auto&& i : n)
/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
// using pii = pair<int, int>;
using D = double;
// using P = complex<D>;
using vs = vector<string>;
// template <typename T> using PQ = priority_queue<T>;
// template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
// const int dx[] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[] = { 1, 0, -1, 0, 1, -1,
// -1, 1 };
/* func */
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
inline int in() {
int x;
cin >> x;
return x;
}
// inline vs split(const string& t, char c) { vs v; stringstream s(t); string b;
// while (getline(s, b, c)) v.eb(b); return v; } template <typename T> inline
// bool chmin(T& a, const T& b) { if (a > b) a = b; return a > b; } template
// <typename T> inline bool chmax(T& a, const T& b) { if (a < b) a = b; return a
// < b; } template <typename T, typename S> inline void print(const pair<T, S>&
// p) { cout << p.first << " " << p.second << endl; }
template <typename T> inline void print(const T &x) { cout << x << '\n'; }
// template <typename T, typename S> inline void print(const vector<pair<T, S>>&
// v) { for (auto&& p : v) print(p); } template <typename T> inline void
// print(const vector<T>& v, string s = " ") { REP(i, v.size()) cout << v[i] <<
// (i != (ll)v.size() - 1 ? s : "\n"); }
// #define int long long
signed main() {
int N, M, C;
cin >> N >> M >> C;
vi B;
vvi A;
for (int i = 0; i < M; ++i)
B[i] = in();
for (int j = 0; j < N; ++j)
for (int k = 0; k < M; ++k)
A[j][k] = in();
int ans = 0;
for (int j = 0; j < N; ++j) {
ll sum = 0;
for (int k = 0; k < M; ++k)
sum += A[j][k] * B[k];
if (sum + C > 0)
ans++;
}
cout << ans << endl;
#ifdef _DEBUG
system("pause");
#endif
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
/*https://github.com/kurokoji/.cpp-Template/wiki#struct-fast*/
// 理解できていないものはコメントアウト
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* debug */
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n';
/* short */
// #define pb push_back
// #define eb emplace_back
// #define mp make_pair
// #define Fi first
// #define Se second
#define ALL(v) begin(v), end(v) // sort(ALL(v));みたいに使う
// #define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()
/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
// #define EACH(i, n) for (auto&& i : n)
/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
// using pii = pair<int, int>;
using D = double;
// using P = complex<D>;
using vs = vector<string>;
// template <typename T> using PQ = priority_queue<T>;
// template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
// const int dx[] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[] = { 1, 0, -1, 0, 1, -1,
// -1, 1 };
/* func */
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
inline int in() {
int x;
cin >> x;
return x;
}
// inline vs split(const string& t, char c) { vs v; stringstream s(t); string b;
// while (getline(s, b, c)) v.eb(b); return v; } template <typename T> inline
// bool chmin(T& a, const T& b) { if (a > b) a = b; return a > b; } template
// <typename T> inline bool chmax(T& a, const T& b) { if (a < b) a = b; return a
// < b; } template <typename T, typename S> inline void print(const pair<T, S>&
// p) { cout << p.first << " " << p.second << endl; }
template <typename T> inline void print(const T &x) { cout << x << '\n'; }
// template <typename T, typename S> inline void print(const vector<pair<T, S>>&
// v) { for (auto&& p : v) print(p); } template <typename T> inline void
// print(const vector<T>& v, string s = " ") { REP(i, v.size()) cout << v[i] <<
// (i != (ll)v.size() - 1 ? s : "\n"); }
// #define int long long
signed main() {
int N, M, C;
cin >> N >> M >> C;
vi B;
vvi A;
B = vector<int>(M, 0);
A = vector<vector<int>>(N, vector<int>(M, 0));
for (int i = 0; i < M; ++i)
B[i] = in();
for (int j = 0; j < N; ++j)
for (int k = 0; k < M; ++k)
A[j][k] = in();
int ans = 0;
for (int j = 0; j < N; ++j) {
ll sum = 0;
for (int k = 0; k < M; ++k)
sum += A[j][k] * B[k];
if (sum + C > 0)
ans++;
}
cout << ans << endl;
#ifdef _DEBUG
system("pause");
#endif
return 0;
}
| insert | 88 | 88 | 88 | 91 | -11 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
int a[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = 0; j < m; j++) {
count += a[i][j] * b[j];
// cout << count << "\n";
}
if (count + c > 0)
ans++;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
int a[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = 0; j < m; j++) {
count += a[i][j] * b[j];
// cout << count << "\n";
}
if (count + c > 0)
ans++;
}
cout << ans;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define repp(i, n) for (int(i) = 1; (i) <= (n); ++(i))
#define popcnt __builtin_popcount
#define all(v) v.begin(), v.end()
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using itn = int;
using vint = vector<int>;
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;
}
template <class T> T gcd(T a, T b) { return b ? GCD(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a * b / GCD(a, b); }
int main() {
int n, m, c;
cin >> n >> m >> c;
vint b(m);
rep(i, m) cin >> b[i];
vector<vint> a(n, vint(n));
rep(i, n) rep(j, m) cin >> a[i][j];
int ans = 0, sum;
rep(i, n) {
sum = c;
rep(j, m) { sum += a[i][j] * b[j]; }
if (sum > 0)
++ans;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define repp(i, n) for (int(i) = 1; (i) <= (n); ++(i))
#define popcnt __builtin_popcount
#define all(v) v.begin(), v.end()
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using itn = int;
using vint = vector<int>;
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;
}
template <class T> T gcd(T a, T b) { return b ? GCD(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a * b / GCD(a, b); }
int main() {
int n, m, c;
cin >> n >> m >> c;
vint b(m);
rep(i, m) cin >> b[i];
vector<vint> a(n, vint(m));
rep(i, n) rep(j, m) cin >> a[i][j];
int ans = 0, sum;
rep(i, n) {
sum = c;
rep(j, m) { sum += a[i][j] * b[j]; }
if (sum > 0)
++ans;
}
cout << ans << endl;
return 0;
}
| replace | 35 | 36 | 35 | 36 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push_back(x)
#define ALL(x) x.begin(), x.end()
#define SZ(x) (x).size()
#define CLR(x) memset(x, 0, sizeof x)
#define pdebug() printf("%d\n", __LINE__)
#define Itype(a) typeof(a.begin())
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define FORO(i, n) REP(i, 0, (int)n - 1)
#define FORI(i, n) REP(i, 1, (int)n)
#define FORIT(i, t) for (Itype(t) i = t.begin(); i != t.end(); i++)
#define eps 1e-6
#define sqr(x) ((x) * (x))
#define dist(_a, _b) sqrt(sqr(_a.A - _b.A) + sqr(_a.B - _b.B))
#define norm(_a) sqrt(sqr(_a.A) + sqr(_a.B))
template <typename T> void getMin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void getMax(T &a, T b) {
if (a < b)
a = b;
}
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int cnt = 0;
FORO(i, M) cin >> B[i];
FORO(i, N) {
vector<int> A(N);
int score = C;
FORO(j, M) {
cin >> A[j];
score += A[j] * B[j];
}
if (score > 0)
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push_back(x)
#define ALL(x) x.begin(), x.end()
#define SZ(x) (x).size()
#define CLR(x) memset(x, 0, sizeof x)
#define pdebug() printf("%d\n", __LINE__)
#define Itype(a) typeof(a.begin())
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define FORO(i, n) REP(i, 0, (int)n - 1)
#define FORI(i, n) REP(i, 1, (int)n)
#define FORIT(i, t) for (Itype(t) i = t.begin(); i != t.end(); i++)
#define eps 1e-6
#define sqr(x) ((x) * (x))
#define dist(_a, _b) sqrt(sqr(_a.A - _b.A) + sqr(_a.B - _b.B))
#define norm(_a) sqrt(sqr(_a.A) + sqr(_a.B))
template <typename T> void getMin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void getMax(T &a, T b) {
if (a < b)
a = b;
}
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
int cnt = 0;
FORO(i, M) cin >> B[i];
FORO(i, N) {
vector<int> A(M);
int score = C;
FORO(j, M) {
cin >> A[j];
score += A[j] * B[j];
}
if (score > 0)
cnt++;
}
cout << cnt << endl;
return 0;
} | replace | 45 | 46 | 45 | 46 | 0 | |
p03102 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C, sum, res;
cin >> N >> M >> C;
vector<int> A, B;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
res = 0;
for (int j = 0; j < N; j++) {
sum = C;
for (int i = 0; i < M; i++) {
cin >> A.at(i);
sum += A.at(i) * B.at(i);
}
if (sum > 0) {
res++;
}
}
cout << res << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C, sum, res;
cin >> N >> M >> C;
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
res = 0;
for (int j = 0; j < N; j++) {
sum = C;
for (int i = 0; i < M; i++) {
cin >> A.at(i);
sum += A.at(i) * B.at(i);
}
if (sum > 0) {
res++;
}
}
cout << res << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | -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)
|
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
vector<int> A(N);
long long sum = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];
sum += A[j] * B[j];
}
if (sum + C > 0) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
vector<int> A(M);
long long sum = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];
sum += A[j] * B[j];
}
if (sum + C > 0) {
count++;
}
}
cout << count << endl;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int Count = 0;
for (int i = 0; i < N; i++) {
int Sum = C;
for (int j = 0; j < M; j++) {
Sum += A.at(i).at(j) * B.at(j);
}
if (Sum > 0) {
Count++;
}
}
cout << Count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int Count = 0;
for (int i = 0; i < N; i++) {
int Sum = C;
for (int j = 0; j < M; j++) {
Sum += A.at(i).at(j) * B.at(j);
}
if (Sum > 0) {
Count++;
}
}
cout << Count << endl;
} | replace | 6 | 8 | 6 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// B - Can you solve this?
int main(void) {
int n, m, c;
std::cin >> n >> m >> c;
std::vector<int> b(n);
for (int i = 0; i < m; i++) {
std::cin >> b[i];
}
int ans = 0;
int a, sum;
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
std::cin >> a;
sum += a * b[j];
}
sum += c;
if (sum > 0) {
ans++;
}
}
std::cout << ans << std::endl;
}
| #include <bits/stdc++.h>
using namespace std;
// B - Can you solve this?
int main(void) {
int n, m, c;
std::cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
std::cin >> b[i];
}
int ans = 0;
int a, sum;
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
std::cin >> a;
sum += a * b[j];
}
sum += c;
if (sum > 0) {
ans++;
}
}
std::cout << ans << std::endl;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03102 | Python | Runtime Error | import numpy as np
if __name__ == "__main__":
N, M, C = map(int, input().split())
B = np.array(list(map(int, input().split())))
A = np.array(list(map(lambda _: list(map(int, input().split())), range(N))))
scores = np.matmul(A, B)
print(np.sum(scores > -C))
| import numpy as np
if __name__ == "__main__":
N, M, C = map(int, input().split())
B = np.array(list(map(int, input().split())))
A = np.array(list(map(lambda _: list(map(int, input().split())), range(N))))
scores = A.dot(B)
print(np.sum(scores > -C))
| replace | 7 | 8 | 7 | 8 | TLE | |
p03102 | Python | Runtime Error | import numpy as np
n, m, c = [int(x) for x in input().split(" ")]
b = np.asarray([int(x) for x in input().split(" ")])
a = np.ndarray((n, 3), dtype=np.int32)
for i in range(n):
a[i] = [int(x) for x in input().split(" ")]
s = np.sum(a * b, axis=1)
print(np.sum(s + c > 0))
| import numpy as np
n, m, c = [int(x) for x in input().split(" ")]
b = np.asarray([int(x) for x in input().split(" ")])
a = np.ndarray((n, m), dtype=np.int32)
for i in range(n):
a[i] = [int(x) for x in input().split(" ")]
s = np.sum(a * b, axis=1)
print(np.sum(s + c > 0))
| replace | 5 | 6 | 5 | 6 | TLE | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#if LOCAL
freopen("b.in", "r", stdin);
#endif
int N, M, C;
cin >> N >> M >> C;
int res = 0;
vector<int> B(N);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int a, sum = C;
for (int j = 0; j < M; j++) {
cin >> a;
sum += a * B[j];
}
if (sum > 0)
res++;
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
#if LOCAL
freopen("b.in", "r", stdin);
#endif
int N, M, C;
cin >> N >> M >> C;
int res = 0;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int a, sum = C;
for (int j = 0; j < M; j++) {
cin >> a;
sum += a * B[j];
}
if (sum > 0)
res++;
}
cout << res << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
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;
}
const long long INF = 1LL << 60;
const int inf = 1001001001;
const int mod = 1000000007;
using pint = pair<ll, ll>;
// union by size + path having
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける)
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool same(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
ll modpow(ll x, ll n) {
x = x % mod;
if (n == 0)
return 1; // 再帰の終了条件
else if (n % 2 == 1) {
return (x * modpow(x, n - 1)) % mod; // nが奇数ならnを1ずらす
} else
return modpow((x * x) % mod, n / 2) % mod; // nが偶数ならnが半分になる
}
ll com(ll n, ll k) {
ll x = 1;
for (int i = n - k + 1; i <= n; i++) {
x = x * i % mod;
}
ll y = 1;
for (int i = 1; i <= k; i++) {
y = y * i % mod;
}
y = modpow(y, mod - 2);
return x * y % mod;
}
int main() {
ll n, m, c, ans = 0;
cin >> n >> m >> c;
vector<ll> b(m);
vector<vector<ll>> a(n, vector<ll>(m));
rep(i, n) { cin >> b.at(i); }
rep(i, n) {
rep(j, m) { cin >> a.at(i).at(j); }
}
rep(i, n) {
ll x = c;
rep(j, m) { x += ((a.at(i).at(j)) * (b.at(j))); }
if (x > 0)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
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;
}
const long long INF = 1LL << 60;
const int inf = 1001001001;
const int mod = 1000000007;
using pint = pair<ll, ll>;
// union by size + path having
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける)
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool same(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
ll modpow(ll x, ll n) {
x = x % mod;
if (n == 0)
return 1; // 再帰の終了条件
else if (n % 2 == 1) {
return (x * modpow(x, n - 1)) % mod; // nが奇数ならnを1ずらす
} else
return modpow((x * x) % mod, n / 2) % mod; // nが偶数ならnが半分になる
}
ll com(ll n, ll k) {
ll x = 1;
for (int i = n - k + 1; i <= n; i++) {
x = x * i % mod;
}
ll y = 1;
for (int i = 1; i <= k; i++) {
y = y * i % mod;
}
y = modpow(y, mod - 2);
return x * y % mod;
}
int main() {
ll n, m, c, ans = 0;
cin >> n >> m >> c;
vector<ll> b(m);
vector<vector<ll>> a(n, vector<ll>(m));
rep(i, m) { cin >> b.at(i); }
rep(i, n) {
rep(j, m) { cin >> a.at(i).at(j); }
}
rep(i, n) {
ll x = c;
rep(j, m) { x += ((a.at(i).at(j)) * (b.at(j))); }
if (x > 0)
ans++;
}
cout << ans << endl;
} | replace | 105 | 106 | 105 | 106 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const int X = 10000;
int N, M, C, ans = 0;
int B[X];
int A[X][X];
cin >> N >> M >> C;
for (int i = 1; i <= M; i++)
cin >> B[i];
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
cin >> A[i][j];
for (int i = 1; i <= N; i++) {
int t = 0;
for (int j = 1; j <= M; j++)
t += A[i][j] * B[j];
t += C;
if (t > 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const int X = 10000;
int N, M, C, ans = 0;
int B[X];
int A[100][100];
cin >> N >> M >> C;
for (int i = 1; i <= M; i++)
cin >> B[i];
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
cin >> A[i][j];
for (int i = 1; i <= N; i++) {
int t = 0;
for (int j = 1; j <= M; j++)
t += A[i][j] * B[j];
t += C;
if (t > 0)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | -11 | |
p03102 | C++ | Runtime Error |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(m);
for (int i = 0; i < m; ++i) {
cin >> B[i];
}
vector<vector<int>> A(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> A[n][m];
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
cnt += A[i][j] * B[j];
}
if ((cnt + c) > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(m);
for (int i = 0; i < m; ++i) {
cin >> B[i];
}
vector<vector<int>> A(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> A[i][j];
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
cnt += A[i][j] * B[j];
}
if ((cnt + c) > 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | -11 | |
p03102 | Python | Runtime Error | # -*- coding: utf-8 -*-
import numpy as np
N, M, C = map(int, input().split())
B = np.ndarray([M, 1])
B = list(map(int, input().split()))
A = np.ndarray([N, M])
for i in range(N):
A[i, :] = list(map(int, input().split()))
ans = sum((A @ B + C) > 0)
print(ans)
| # -*- coding: utf-8 -*-
import numpy as np
N, M, C = map(int, input().split())
B = np.ndarray([M, 1])
B = list(map(int, input().split()))
A = np.ndarray([N, M])
for i in range(N):
A[i, :] = list(map(int, input().split()))
ans = sum((np.dot(A, B) + C) > 0)
print(ans)
| replace | 11 | 12 | 11 | 12 | TLE | |
p03102 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
/*calculation*/
int o = 0;
for (int i = 0; i < n; i++) {
int wa = 0;
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
wa += c;
if (wa > 0) {
o++;
}
}
/*output*/
cout << o << endl;
delete[] b;
for (int i = 0; i < m; i++) {
delete[] a[i];
}
delete[] a;
}
| #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
/*calculation*/
int o = 0;
for (int i = 0; i < n; i++) {
int wa = 0;
for (int j = 0; j < m; j++) {
wa += a[i][j] * b[j];
}
wa += c;
if (wa > 0) {
o++;
}
}
/*output*/
cout << o << endl;
return 0;
}
| replace | 34 | 39 | 34 | 35 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
int a;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
cin >> a;
sum += a * b[j];
}
if (sum + c > 0) {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
int a;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
cin >> a;
sum += a * b[j];
}
if (sum + c > 0) {
ans++;
}
}
cout << ans << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03102 | C++ | Runtime Error | // main.cpp
// CppTest
#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
// input from txt （提出時にこの箇所は削除すること）
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
/////////////////////
// Write code below /
/////////////////////
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B.at(i);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int correct_answer_num = 0;
for (int i = 0; i < N; i++) {
int answer = 0;
for (int j = 0; j < M; j++) {
answer += A.at(i).at(j) * B.at(j);
}
answer += C;
if (answer > 0) {
correct_answer_num++;
}
}
cout << correct_answer_num << endl;
return 0;
}
| // main.cpp
// CppTest
#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
// cinを高速にするためのおまじない
cin.tie(0);
ios::sync_with_stdio(false);
/////////////////////
// Write code below /
/////////////////////
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++)
cin >> B.at(i);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int correct_answer_num = 0;
for (int i = 0; i < N; i++) {
int answer = 0;
for (int j = 0; j < M; j++) {
answer += A.at(i).at(j) * B.at(j);
}
answer += C;
if (answer > 0) {
correct_answer_num++;
}
}
cout << correct_answer_num << endl;
return 0;
}
| replace | 11 | 14 | 11 | 14 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<vector<int>> A(N, vector<int>(M));
vector<int> B(N);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int count = 0;
for (int i = 0; i < N; i++) {
int ans = 0;
for (int j = 0; j < M; j++) {
ans = ans + A.at(i).at(j) * B.at(j);
}
ans = ans + C;
if (ans > 0) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<vector<int>> A(N, vector<int>(M));
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}
int count = 0;
for (int i = 0; i < N; i++) {
int ans = 0;
for (int j = 0; j < M; j++) {
ans = ans + A.at(i).at(j) * B.at(j);
}
ans = ans + C;
if (ans > 0) {
count++;
}
}
cout << count << endl;
}
| 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 2) >= this->size() (which is 2)
|
p03102 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, m, c, num = 0;
cin >> n >> m >> c;
int array[20][20];
for (int i = 0; i <= n; i++) {
for (int j = 0; j < m; j++) {
cin >> array[i][j];
}
}
for (int i = 1; i <= n; i++) {
int sum = c;
for (int j = 0; j < m; j++) {
sum += array[0][j] * array[i][j];
}
if (sum > 0)
num += 1;
}
cout << num << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, m, c, num = 0;
cin >> n >> m >> c;
int array[21][21];
for (int i = 0; i <= n; i++) {
for (int j = 0; j < m; j++) {
cin >> array[i][j];
}
}
for (int i = 1; i <= n; i++) {
int sum = c;
for (int j = 0; j < m; j++) {
sum += array[0][j] * array[i][j];
}
if (sum > 0)
num += 1;
}
cout << num << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e3 + 17;
ll cnt, lnt, mn = N, mx, a[N], n, m, k, x, y, ans, sum;
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
int main() {
cin >> n >> m;
for (ll i = 0; i < n; i++) {
cin >> pr[i].first >> pr[i].second;
}
sort(pr, pr + n);
for (ll i = 0; i < n; i++) {
if (m > pr[i].second and m > 0 and !used[i]) {
ans += pr[i].first * pr[i].second;
m -= pr[i].second;
used[i] = true;
}
if (m <= pr[i].second and m > 0 and !used[i]) {
ans += pr[i].first * m;
m = 0;
used[i] = true;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e5 + 17;
ll cnt, lnt, mn = N, mx, a[N], n, m, k, x, y, ans, sum;
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
int main() {
cin >> n >> m;
for (ll i = 0; i < n; i++) {
cin >> pr[i].first >> pr[i].second;
}
sort(pr, pr + n);
for (ll i = 0; i < n; i++) {
if (m > pr[i].second and m > 0 and !used[i]) {
ans += pr[i].first * pr[i].second;
m -= pr[i].second;
used[i] = true;
}
if (m <= pr[i].second and m > 0 and !used[i]) {
ans += pr[i].first * m;
m = 0;
used[i] = true;
}
}
cout << ans;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 28;
vector<pair<int, int>> p;
long long ans;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
p.push_back({a, b});
}
sort(p.begin(), p.end());
int c = 0;
int i = 0;
while (c + p[i].second <= m) {
c += p[i].second;
ans += (long long)p[i].first * p[i].second;
i++;
}
ans += (long long)p[i].first * (m - c);
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 28;
vector<pair<int, int>> p;
long long ans;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
p.push_back({a, b});
}
sort(p.begin(), p.end());
int c = 0;
int i = 0;
while (c + p[i].second < m) {
c += p[i].second;
ans += (long long)p[i].first * p[i].second;
i++;
}
ans += (long long)p[i].first * (m - c);
cout << ans;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p03103 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, m, a, b;
vector<pair<int, int>> vec;
long long ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
vec.pb({a, b});
}
sort(vec.begin(), vec.end());
vec.pb({0, 0});
int cur = 0, cnt = 0;
while (1) {
if (cnt + vec[cur].se <= m) {
cnt += vec[cur].se;
ans += vec[cur].fi * 1LL * vec[cur].se;
} else {
ans += vec[cur].fi * 1LL * (m - cnt);
break;
}
cur++;
}
cout << ans << "\n";
// system("pause");
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, m, a, b;
vector<pair<int, int>> vec;
long long ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
vec.pb({a, b});
}
sort(vec.begin(), vec.end());
vec.pb({0, 1});
int cur = 0, cnt = 0;
while (1) {
if (cnt + vec[cur].se <= m) {
cnt += vec[cur].se;
ans += vec[cur].fi * 1LL * vec[cur].se;
} else {
ans += vec[cur].fi * 1LL * (m - cnt);
break;
}
cur++;
}
cout << ans << "\n";
// system("pause");
return 0;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ep emplace_back
#define st first
#define sc second
using namespace std;
const ll mod = 998244353;
const int e = 300;
const int base = 311;
// dung igt thay cho gt luc tinh giai thua
// 3
// cach tao hoan vi tu n so : n*(n+1)/2;
struct kien {
ll x, y;
};
kien a[e];
bool lf(const kien &p, const kien &q) { return p.x < q.x; }
int main() {
ll n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i].x >> a[i].y;
}
sort(a + 1, a + n + 1, lf);
ll s = 0;
for (int i = 1; i <= n; i++) {
s += a[i].x * min(m, a[i].y);
m -= min(m, a[i].y);
if (m == 0)
break;
}
cout << s;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ep emplace_back
#define st first
#define sc second
using namespace std;
const ll mod = 998244353;
const int e = 1e6 + 69;
const int base = 311;
// dung igt thay cho gt luc tinh giai thua
// 3
// cach tao hoan vi tu n so : n*(n+1)/2;
struct kien {
ll x, y;
};
kien a[e];
bool lf(const kien &p, const kien &q) { return p.x < q.x; }
int main() {
ll n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i].x >> a[i].y;
}
sort(a + 1, a + n + 1, lf);
ll s = 0;
for (int i = 1; i <= n; i++) {
s += a[i].x * min(m, a[i].y);
m -= min(m, a[i].y);
if (m == 0)
break;
}
cout << s;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
long long n, m, ans = 0;
struct Node {
int p, d;
bool operator<(Node b) { return p < b.p; }
} a[3000];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> a[i].p >> a[i].d;
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i) {
while (m && a[i].d)
--m, --a[i].d, ans += a[i].p;
}
cout << ans;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
long long n, m, ans = 0;
struct Node {
int p, d;
bool operator<(Node b) { return p < b.p; }
} a[300000];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> a[i].p >> a[i].d;
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i) {
while (m && a[i].d)
--m, --a[i].d, ans += a[i].p;
}
cout << ans;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
rep(i, n) cin >> a[i] >> b[i];
vector<pair<int, int>> pa(n);
rep(i, n) pa[i] = make_pair(a[i], b[i]);
sort(pa.begin(), pa.end());
ll ans = 0;
rep(i, n) {
int buy = min(m, pa[i].second);
ans += (ll)buy * pa[i].first;
m -= buy;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
vector<pair<int, int>> pa(n);
rep(i, n) pa[i] = make_pair(a[i], b[i]);
sort(pa.begin(), pa.end());
ll ans = 0;
rep(i, n) {
int buy = min(m, pa[i].second);
ans += (ll)buy * pa[i].first;
m -= buy;
}
cout << ans << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define tr(it, c) for (iter(c) it = (c).begin(); it != (c).end(); it++)
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) {
cout << a << ' ';
pr(b);
}
template <Z A, Z B, Z C> void pr(A a, B b, C c) {
cout << a << ' ';
pr(b, c);
}
template <Z A, Z B, Z C, Z D> void pr(A a, B b, C c, D d) {
cout << a << ' ';
pr(b, c, d);
}
template <Z A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
ln;
}
ll check(ll n, ll m, ll x, ll y) { return x >= 0 && x < n && y >= 0 && y < m; }
const ll MAX = 1e9 + 7, MAXL = 1LL << 61, dx[4] = {-1, 0, 1, 0},
dy[4] = {0, 1, 0, -1};
typedef pair<ll, ll> P;
void Main() {
ll n, m;
cin >> n >> m;
P a[n];
rep(i, n) cin >> a[i].F >> a[i].S;
sort(a, a + n);
ll ans = 0;
rep(i, n) {
rep(j, a[i].S) {
if (m) {
m--;
ans += a[i].F;
}
}
}
pr(ans);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define tr(it, c) for (iter(c) it = (c).begin(); it != (c).end(); it++)
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) {
cout << a << ' ';
pr(b);
}
template <Z A, Z B, Z C> void pr(A a, B b, C c) {
cout << a << ' ';
pr(b, c);
}
template <Z A, Z B, Z C, Z D> void pr(A a, B b, C c, D d) {
cout << a << ' ';
pr(b, c, d);
}
template <Z A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
ln;
}
ll check(ll n, ll m, ll x, ll y) { return x >= 0 && x < n && y >= 0 && y < m; }
const ll MAX = 1e9 + 7, MAXL = 1LL << 61, dx[4] = {-1, 0, 1, 0},
dy[4] = {0, 1, 0, -1};
typedef pair<ll, ll> P;
void Main() {
ll n, m;
cin >> n >> m;
P a[n];
rep(i, n) cin >> a[i].F >> a[i].S;
sort(a, a + n);
ll ans = 0;
rep(i, n) {
ll x = min(m, a[i].S);
m -= x;
ans += a[i].F * x;
}
pr(ans);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
Main();
return 0;
}
| replace | 55 | 61 | 55 | 58 | TLE | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
struct AB {
long long a;
long long b;
};
bool asc(const AB &left, const AB &right) {
if (left.a != right.a)
return left.a < right.a;
}
int main() {
int N, M, tmp1, tmp2, get;
long long cost;
AB tmp_AB;
vector<AB> v;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> tmp1 >> tmp2;
tmp_AB.a = tmp1;
tmp_AB.b = tmp2;
v.push_back(tmp_AB);
}
cost = 0;
get = 0;
int min = 0, tmp_num;
sort(v.begin(), v.end(), asc);
while (get < M) {
tmp_num = v[min].b;
if ((M - get) <= tmp_num) { // 終了できるとき
cost += v[min].a * (M - get);
break;
} else {
cost += v[min].a * v[min].b;
get += v[min].b;
}
min++;
}
cout << cost;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
struct AB {
long long a;
long long b;
};
bool asc(const AB &left, const AB &right) { return left.a < right.a; }
int main() {
int N, M, tmp1, tmp2, get;
long long cost;
AB tmp_AB;
vector<AB> v;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> tmp1 >> tmp2;
tmp_AB.a = tmp1;
tmp_AB.b = tmp2;
v.push_back(tmp_AB);
}
cost = 0;
get = 0;
int min = 0, tmp_num;
sort(v.begin(), v.end(), asc);
while (get < M) {
tmp_num = v[min].b;
if ((M - get) <= tmp_num) { // 終了できるとき
cost += v[min].a * (M - get);
break;
} else {
cost += v[min].a * v[min].b;
get += v[min].b;
}
min++;
}
cout << cost;
}
| replace | 9 | 13 | 9 | 10 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
ll N, M;
Scll2(N, M);
vector<pair<ll, ll>> d(N);
Rep(i, N) { Scll2(d[i].second, d[i].first); }
sort(d.begin(), d.end());
ll ans = 0;
for (int i = 0; M; i++) {
if (M < d[i].second) {
d[i].second = M;
}
M -= d[i].second;
ans += d[i].first * d[i].second;
}
printf("%llu\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
ll N, M;
Scll2(N, M);
vector<pair<ll, ll>> d(N);
Rep(i, N) { Scll2(d[i].first, d[i].second); }
sort(d.begin(), d.end());
ll ans = 0;
for (int i = 0; M; i++) {
if (M < d[i].second) {
d[i].second = M;
}
M -= d[i].second;
ans += d[i].first * d[i].second;
}
printf("%llu\n", ans);
return 0;
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int64_t, int64_t>> vec(N);
for (int i = 0; i < N; i++) {
int64_t O, P;
cin >> O >> P;
vec.at(i) = make_pair(O, P);
}
sort(vec.begin(), vec.end());
int64_t total = 0;
int64_t ans = 0;
int i = 0;
bool shokai = false;
while (true) {
if (vec.at(i).second >= M) {
shokai = true;
break;
} else {
total += vec.at(i).second;
ans += vec.at(i).first * vec.at(i).second;
if (total + vec.at(i + 1).second > M) {
break;
} else {
i++;
}
}
}
if (shokai) {
ans += (M - total) * vec.at(i).first;
} else {
ans += (M - total) * vec.at(i + 1).first;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int64_t, int64_t>> vec(N);
for (int i = 0; i < N; i++) {
int64_t O, P;
cin >> O >> P;
vec.at(i) = make_pair(O, P);
}
sort(vec.begin(), vec.end());
int64_t total = 0;
int64_t ans = 0;
int i = 0;
bool shokai = false;
while (true) {
if (vec.at(i).second >= M) {
shokai = true;
break;
} else {
total += vec.at(i).second;
ans += vec.at(i).first * vec.at(i).second;
if (total + vec.at(i + 1).second >= M) {
break;
} else {
i++;
}
}
}
if (shokai) {
ans += (M - total) * vec.at(i).first;
} else {
ans += (M - total) * vec.at(i + 1).first;
}
cout << ans << endl;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i] = make_pair(A[i], B[i]);
}
sort(AB.begin(), AB.end());
long long result = 0;
for (int i = 0; i < N; i++) {
int buy = min(M, AB[i].second);
result += (long long)buy * AB[i].first;
M -= buy;
}
cout << result << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i] = make_pair(A[i], B[i]);
}
sort(AB.begin(), AB.end());
long long result = 0;
for (int i = 0; i < N; i++) {
int buy = min(M, AB[i].second);
result += (long long)buy * AB[i].first;
M -= buy;
}
cout << result << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m;
struct drink {
int cou;
long long mon;
} a[10001];
bool cmp(struct drink a, struct drink b) { return a.mon < b.mon; }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%lld%d", &a[i].mon, &a[i].cou);
sort(a + 1, a + n + 1, cmp);
long long ans = 0;
for (int i = 1; m > 0; i++) {
if (m >= a[i].cou) {
m -= a[i].cou;
ans += a[i].cou * a[i].mon;
} else {
ans += m * a[i].mon;
m = 0;
}
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, m;
struct drink {
int cou;
long long mon;
} a[100001];
bool cmp(struct drink a, struct drink b) { return a.mon < b.mon; }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%lld%d", &a[i].mon, &a[i].cou);
sort(a + 1, a + n + 1, cmp);
long long ans = 0;
for (int i = 1; m > 0; i++) {
if (m >= a[i].cou) {
m -= a[i].cou;
ans += a[i].cou * a[i].mon;
} else {
ans += m * a[i].mon;
m = 0;
}
}
printf("%lld\n", ans);
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const ll mininf = -922337203685477;
const ll nax = 1e5 + 5;
ll n, m, ans = 0, banyak = 0;
struct struk {
ll a, b;
};
struk minum[105];
bool cmp(struk s1, struk s2) { return s1.a < s2.a; }
int main() {
IOS cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> minum[i].a >> minum[i].b;
}
sort(minum, minum + n, cmp);
for (int i = 0; i < n; i++) {
while (minum[i].b > 0 && banyak < m) {
ans += minum[i].a;
banyak++;
minum[i].b--;
}
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const ll mininf = -922337203685477;
const ll nax = 1e5 + 5;
ll n, m, ans = 0, banyak = 0;
struct struk {
ll a, b;
};
struk minum[nax];
bool cmp(struk s1, struk s2) { return s1.a < s2.a; }
int main() {
IOS cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> minum[i].a >> minum[i].b;
}
sort(minum, minum + n, cmp);
for (int i = 0; i < n; i++) {
while (minum[i].b > 0 && banyak < m) {
ans += minum[i].a;
banyak++;
minum[i].b--;
}
}
cout << ans << '\n';
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int N = 20;
pii a[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%d%d", &a[i].first, &a[i].second);
sort(a, a + n);
ll ans = 0;
for (int i = 0; i < n; ++i) {
if (m <= a[i].second) {
ans += m * 1LL * a[i].first;
m = 0;
break;
} else {
ans += a[i].second * 1LL * a[i].first;
m -= a[i].second;
}
}
printf("%lld", ans);
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int N = 1e5;
pii a[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%d%d", &a[i].first, &a[i].second);
sort(a, a + n);
ll ans = 0;
for (int i = 0; i < n; ++i) {
if (m <= a[i].second) {
ans += m * 1LL * a[i].first;
m = 0;
break;
} else {
ans += a[i].second * 1LL * a[i].first;
m -= a[i].second;
}
}
printf("%lld", ans);
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int n, m;
pair<int, int> super[10000];
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++)
scanf("%d %d", &super[i].first, &super[i].second);
sort(super, super + n);
long long sum = 0;
for (int i = 0; i < n; i++) {
if (m == 0)
break;
if (m >= super[i].second) {
m -= super[i].second;
sum += (long long)super[i].first * super[i].second;
} else {
sum += (long long)super[i].first * m;
m = 0;
}
}
printf("%lld\n", sum);
return 0;
} | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int n, m;
pair<int, int> super[100000];
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++)
scanf("%d %d", &super[i].first, &super[i].second);
sort(super, super + n);
long long sum = 0;
for (int i = 0; i < n; i++) {
if (m == 0)
break;
if (m >= super[i].second) {
m -= super[i].second;
sum += (long long)super[i].first * super[i].second;
} else {
sum += (long long)super[i].first * m;
m = 0;
}
}
printf("%lld\n", sum);
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
using namespace std;
bool comparator(P &A, P &B) { return A.first <= B.first; }
int main() {
int n, m;
cin >> n >> m;
vector<P> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i].first >> arr[i].second;
}
sort(arr.begin(), arr.end(), comparator);
ll cost = 0;
int i = 0;
while (i < n && m > 0) {
if (m <= arr[i].second) {
cost += (m * arr[i].first);
m = 0;
} else {
cost += (arr[i].first * arr[i].second);
m -= arr[i].second;
}
i++;
}
cout << cost << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
using namespace std;
bool comparator(P &A, P &B) { return A.first < B.first; }
int main() {
int n, m;
cin >> n >> m;
vector<P> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i].first >> arr[i].second;
}
sort(arr.begin(), arr.end(), comparator);
ll cost = 0;
int i = 0;
while (i < n && m > 0) {
if (m <= arr[i].second) {
cost += (m * arr[i].first);
m = 0;
} else {
cost += (arr[i].first * arr[i].second);
m -= arr[i].second;
}
i++;
}
cout << cost << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(N), B(N);
map<ll, ll> C;
for (ll i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
C[A.at(i)] += B.at(i);
}
sort(A.begin(), A.end());
ll ans = 0;
ll cnt = 0;
for (ll i = 0; i < 1000000000; i++) {
ans += i * C[i];
cnt += C[i];
if (cnt >= M) {
cout << ans - (cnt - M) * i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(N), B(N);
map<ll, ll> C;
for (ll i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
C[A.at(i)] += B.at(i);
}
sort(A.begin(), A.end());
ll ans = 0;
ll cnt = 0;
ll judge;
for (ll i : A) {
if (judge != i) {
ans += i * C[i];
cnt += C[i];
}
judge = i;
if (cnt >= M) {
cout << ans - (cnt - M) * i << endl;
break;
}
}
} | replace | 15 | 18 | 15 | 22 | TLE | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a, b, d = 0;
cin >> a >> b;
vector<pair<int, int>> c(a);
for (int i = 0; i < a; i++)
cin >> c.at(i).first >> c.at(i).second;
sort(c.begin(), c.end());
for (int i = 0; b > 0; i++) {
if (b >= c.at(i).second) {
b -= c.at(i).second;
d += c.at(i).second * c.at(i).first;
} else {
d += b * c.at(i).first;
}
}
cout << d << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a, b, d = 0;
cin >> a >> b;
vector<pair<int, int>> c(a);
for (int i = 0; i < a; i++)
cin >> c.at(i).first >> c.at(i).second;
sort(c.begin(), c.end());
for (int i = 0; b > 0; i++) {
if (b >= c.at(i).second) {
b -= c.at(i).second;
d += c.at(i).second * c.at(i).first;
} else {
d += b * c.at(i).first;
break;
}
}
cout << d << endl;
}
| insert | 23 | 23 | 23 | 24 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y) {
swap(x, y);
}
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> Type lcm(Type x, Type y) { return x * y / gcd(x, y); }
template <class Type> bool is_prime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binary_search_judge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binary_search(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binary_search_judge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v[i] = make_pair(a, b);
}
sort(v.begin(), v.end());
ll num = 0;
ll cost = 0;
for (auto p : v) {
if (num + p.second < m) {
num += p.second;
cost += p.first * p.second;
} else {
cost += p.first * (m - num);
cout << cost << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y) {
swap(x, y);
}
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> Type lcm(Type x, Type y) { return x * y / gcd(x, y); }
template <class Type> bool is_prime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binary_search_judge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binary_search(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binary_search_judge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> v(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v[i] = make_pair(a, b);
}
sort(v.begin(), v.end());
ll num = 0;
ll cost = 0;
for (auto p : v) {
if (num + p.second < m) {
num += p.second;
cost += p.first * p.second;
} else {
cost += p.first * (m - num);
cout << cost << endl;
return 0;
}
}
} | replace | 99 | 100 | 99 | 100 | -11 | |
p03103 | Python | Time Limit Exceeded | n, m = map(int, input().split())
money = 0
li = []
for i in range(n):
li.append(list(map(int, input().split())))
li.sort()
while 0 < m:
shop = li.pop(0)
if m < shop[1]:
money += m * shop[0]
break
money += shop[0] * shop[1]
m -= shop[1]
print(money)
| n, m = map(int, input().split())
money = 0
li = []
for i in range(n):
li.append(list(map(int, input().split())))
li.sort()
for j in range(n):
shop = li.pop(0)
if m < shop[1]:
money += m * shop[0]
break
money += shop[0] * shop[1]
m -= shop[1]
print(money)
| replace | 8 | 9 | 8 | 9 | TLE | |
p03103 | Python | Runtime Error | n, m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)].sort()
pm = s = 0
m_minus_1 = m - 1
for item in a:
pm += item[1]
if pm > m_minus_1:
print(s + item[0] * (m - pm + item[1]))
break
else:
s += item[0] * item[1]
| n, m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
a.sort()
pm = s = 0
m_minus_1 = m - 1
for item in a:
pm += item[1]
if pm > m_minus_1:
print(s + item[0] * (m - pm + item[1]))
break
else:
s += item[0] * item[1]
| replace | 1 | 2 | 1 | 3 | TypeError: 'NoneType' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03103/Python/s281800849.py", line 5, in <module>
for item in a:
TypeError: 'NoneType' object is not iterable
|
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e4 + 10;
typedef struct Node {
ll a, b;
bool operator<(const Node &t) const { return a < t.a; }
} Node;
Node p[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &p[i].a, &p[i].b);
}
sort(p + 1, p + 1 + n);
ll ans = 0;
ll cur = 0;
for (int i = 1; i <= n; i++) {
if (cur + p[i].b <= m) {
ans = ans + p[i].a * p[i].b;
cur = cur + p[i].b;
} else {
ll t = (m - cur) * p[i].a;
ans = ans + t;
break;
}
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
typedef struct Node {
ll a, b;
bool operator<(const Node &t) const { return a < t.a; }
} Node;
Node p[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &p[i].a, &p[i].b);
}
sort(p + 1, p + 1 + n);
ll ans = 0;
ll cur = 0;
for (int i = 1; i <= n; i++) {
if (cur + p[i].b <= m) {
ans = ans + p[i].a * p[i].b;
cur = cur + p[i].b;
} else {
ll t = (m - cur) * p[i].a;
ans = ans + t;
break;
}
}
printf("%lld\n", ans);
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define DIM 107
#define DIMM 2007
#define INF 10000000000007.0
#define X 2000000007
#define epc 0.0000001
#define PI 3.14159265358979323846
#define MAX 25
#define MODULO 10009
const long double gr = (1 + sqrt(5)) / 2;
typedef int I;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<I, I> pII;
typedef pair<ll, ll> pllll;
typedef pair<ld, ld> pldld;
typedef pair<ll, pllll> pllpllll;
typedef vector<I> vI;
typedef vector<ll> vll;
typedef vector<pllll> vpllll;
typedef char cr;
typedef string str;
ll n, m;
ll res;
pllll a[DIM];
int main() {
// freopen("events.in", "r", stdin);
// freopen("events.out", "w", stdout);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// cout<<"ops"<<endl;
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// ll x1,y1,xs,ys,x2,y2,x3,x4,y3,y4;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i].first >> a[i].second;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
if (a[i].second <= m) {
res += (a[i].first * a[i].second);
m -= a[i].second;
} else {
res += (a[i].first * m);
m = 0;
}
if (m == 0)
break;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define DIM 100007
#define DIMM 2007
#define INF 10000000000007.0
#define X 2000000007
#define epc 0.0000001
#define PI 3.14159265358979323846
#define MAX 25
#define MODULO 10009
const long double gr = (1 + sqrt(5)) / 2;
typedef int I;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<I, I> pII;
typedef pair<ll, ll> pllll;
typedef pair<ld, ld> pldld;
typedef pair<ll, pllll> pllpllll;
typedef vector<I> vI;
typedef vector<ll> vll;
typedef vector<pllll> vpllll;
typedef char cr;
typedef string str;
ll n, m;
ll res;
pllll a[DIM];
int main() {
// freopen("events.in", "r", stdin);
// freopen("events.out", "w", stdout);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// cout<<"ops"<<endl;
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// ll x1,y1,xs,ys,x2,y2,x3,x4,y3,y4;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i].first >> a[i].second;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
if (a[i].second <= m) {
res += (a[i].first * a[i].second);
m -= a[i].second;
} else {
res += (a[i].first * m);
m = 0;
}
if (m == 0)
break;
}
cout << res << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
A[i].first = tmp1;
A[i].second = tmp2;
}
// for (int i = 0; i < N; i++)
//{
// cout << i << "th" << A[i].first << endl;
// }
sort(A.begin(), A.end());
// for (int i = 0; i < N; i++)
// {
// cout << i << "th" << A[i].first << endl;
// }
// reverse(A.begin(), A.end());
// for (int i = 0; i < N; i++)
// {
// cout << i << "th" << A[i].first << endl;
// }
int i = -1;
long long cnt = 0;
while (M >= 0) {
i++;
int M_tmp = M;
M_tmp -= A[i].second;
if (M_tmp <= 0) {
cnt += (long long)M * A[i].first;
} else {
cnt += (long long)A[i].second * A[i].first;
}
M -= A[i].second;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
A[i].first = tmp1;
A[i].second = tmp2;
}
// for (int i = 0; i < N; i++)
//{
// cout << i << "th" << A[i].first << endl;
// }
sort(A.begin(), A.end());
// for (int i = 0; i < N; i++)
// {
// cout << i << "th" << A[i].first << endl;
// }
// reverse(A.begin(), A.end());
// for (int i = 0; i < N; i++)
// {
// cout << i << "th" << A[i].first << endl;
// }
int i = -1;
long long cnt = 0;
while (M > 0) {
i++;
int M_tmp = M;
M_tmp -= A[i].second;
if (M_tmp <= 0) {
cnt += (long long)M * A[i].first;
} else {
cnt += (long long)A[i].second * A[i].first;
}
M -= A[i].second;
}
cout << cnt << endl;
return 0;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef unsigned long long int ll;
typedef std::pair<ll, ll> pii;
using namespace std;
bool s(pii a, pii b) { return a.first <= b.first; }
int main() {
int N, M;
vector<pii> v;
cin >> N >> M;
ll ans = 0;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.begin(), v.end(), s);
ll c = 0;
for (auto i : v) {
ans += (ll)(i.first * i.second);
c += i.second;
if (c >= M) {
ans -= (ll)(i.first * (c - M));
cout << ans;
return 0;
}
}
}
| #include <bits/stdc++.h>
typedef unsigned long long int ll;
typedef std::pair<ll, ll> pii;
using namespace std;
bool s(pii a, pii b) { return a.first <= b.first; }
int main() {
int N, M;
vector<pii> v;
cin >> N >> M;
ll ans = 0;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
stable_sort(v.begin(), v.end(), s);
ll c = 0;
for (auto i : v) {
ans += (ll)(i.first * i.second);
c += i.second;
if (c >= M) {
ans -= (ll)(i.first * (c - M));
cout << ans;
return 0;
}
}
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> vec;
rep(i, n) {
ll a, b;
cin >> a >> b;
vec[i].first = a;
vec[i].second = b;
}
sort(ALL(vec));
ll money = 0;
ll count = 0;
for (int i = 0; i < n; i++) {
bool fin = false;
if (count + vec[i].second >= m) {
for (int j = 0; j < vec[i].second; j++) {
money += vec[i].first;
count++;
if (count == m) {
fin = true;
break;
}
}
}
if (fin)
break;
money += vec[i].first * vec[i].second;
count += vec[i].second;
}
cout << money << endl;
}
| #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> vec;
rep(i, n) {
ll a, b;
cin >> a >> b;
vec.push_back(make_pair(a, b));
}
sort(ALL(vec));
ll money = 0;
ll count = 0;
for (int i = 0; i < n; i++) {
bool fin = false;
if (count + vec[i].second >= m) {
for (int j = 0; j < vec[i].second; j++) {
money += vec[i].first;
count++;
if (count == m) {
fin = true;
break;
}
}
}
if (fin)
break;
money += vec[i].first * vec[i].second;
count += vec[i].second;
}
cout << money << endl;
}
| replace | 13 | 15 | 13 | 14 | -11 | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
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;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<pair<int, int>> v(n);
rep(i, n) {
pair<int, int> ab;
cin >> ab.first >> ab.second;
v[i] = ab;
}
sort(all(v));
ll sum = 0;
rep(i, n) {
auto ab = v[i];
for (int j = 1; j <= ab.second; ++j) {
--m;
sum += ab.first;
if (m == 0) {
cout << sum;
}
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
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;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<pair<int, int>> v(n);
rep(i, n) {
pair<int, int> ab;
cin >> ab.first >> ab.second;
v[i] = ab;
}
sort(all(v));
ll sum = 0;
rep(i, n) {
auto ab = v[i];
for (int j = 1; j <= ab.second; ++j) {
--m;
sum += ab.first;
if (m == 0) {
cout << sum;
return 0;
}
}
}
} | insert | 50 | 50 | 50 | 51 | TLE | |
p03103 | C++ | Runtime Error | /*ASHWINI SHARMA*/
#include <bits/stdc++.h>
using namespace std;
#define fr(i, a, b) for (long long int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define debug(x) cout << #x << ": " << x << endl
#define ull unsigned long long
#define ll long long int
#define ld double
#define ui unsigned int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.1415926535897932385
#define INF 1000111222
#define EPS 1e-7
#define MAXN 1000001
#define MOD 1000000007
/*ASHWINI SHARMA*/
void pairsort(ll a[], ll b[], ll n) {
pair<ll, ll> pairt[n];
// Storing the respective array
// elements in pairs.
for (ll i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
// Sorting the pair array.
sort(pairt, pairt + n);
// Modifying original arrays
for (ll i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
}
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin.sync_with_stdio(false);
ll n, m;
cin >> n >> m;
ll a[n];
ll b[n];
rep(i, n) cin >> a[i] >> b[i];
pairsort(a, b, n);
ll sum = 0;
rep(i, n) {
sum += min(m, b[i]) * a[i];
m -= min(m, b[i]);
}
cout << sum;
return 0;
} | /*ASHWINI SHARMA*/
#include <bits/stdc++.h>
using namespace std;
#define fr(i, a, b) for (long long int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define debug(x) cout << #x << ": " << x << endl
#define ull unsigned long long
#define ll long long int
#define ld double
#define ui unsigned int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.1415926535897932385
#define INF 1000111222
#define EPS 1e-7
#define MAXN 1000001
#define MOD 1000000007
/*ASHWINI SHARMA*/
void pairsort(ll a[], ll b[], ll n) {
pair<ll, ll> pairt[n];
// Storing the respective array
// elements in pairs.
for (ll i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
// Sorting the pair array.
sort(pairt, pairt + n);
// Modifying original arrays
for (ll i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
}
}
int main() {
cin.sync_with_stdio(false);
ll n, m;
cin >> n >> m;
ll a[n];
ll b[n];
rep(i, n) cin >> a[i] >> b[i];
pairsort(a, b, n);
ll sum = 0;
rep(i, n) {
sum += min(m, b[i]) * a[i];
m -= min(m, b[i]);
}
cout << sum;
return 0;
} | replace | 48 | 52 | 48 | 49 | -11 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = a; i < (n); ++i)
#define ll long long
template <class T, class U> struct P {
T a;
U b;
};
bool Comp(P<ll, ll> &a, P<ll, ll> &b) { return a.a <= b.a; }
int main() {
ll n, m;
cin >> n >> m;
vector<P<ll, ll>> ab(n);
rep(i, 0, n) cin >> ab[i].a >> ab[i].b;
sort(ab.begin(), ab.end(), Comp);
ll a, b, ans = 0;
rep(i, 0, n) {
a = ab[i].a;
b = ab[i].b;
if (m <= b) {
ans += m * a;
break;
}
if (m > b) {
m -= b;
ans += a * b;
}
}
printf("%lld\n", ans);
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = a; i < (n); ++i)
#define ll long long
template <class T, class U> struct P {
T a;
U b;
};
bool Comp(P<ll, ll> &a, P<ll, ll> &b) { return a.a < b.a; }
int main() {
ll n, m;
cin >> n >> m;
vector<P<ll, ll>> ab(n);
rep(i, 0, n) cin >> ab[i].a >> ab[i].b;
sort(ab.begin(), ab.end(), Comp);
ll a, b, ans = 0;
rep(i, 0, n) {
a = ab[i].a;
b = ab[i].b;
if (m <= b) {
ans += m * a;
break;
}
if (m > b) {
m -= b;
ans += a * b;
}
}
printf("%lld\n", ans);
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03103 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 2 << 29
#define MOD 1000000007
#define Yes(f) puts((f) ? "Yes" : "No")
#define YES(f) puts((f) ? "YES" : "NO")
int gcd(int a, int b) {
if (b != 0)
return gcd(b, a % b);
return a;
}
ll Lgcd(ll a, ll b) {
if (b != 0)
return gcd(b, a % b);
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
ll Llcm(ll a, ll b) { return a / gcd(a, b) * b; }
using Graph = vector<vector<int>>;
// cout << fixed << setprecision(6);
// cout << setfill('0') << right << setw(2);
int main() {
ll n, m, a, b, ans = 0;
cin >> n >> m;
vector<pair<ll, ll>> v;
rep(i, n) {
cin >> a >> b;
v[i] = pair<ll, ll>(a, b);
}
sort(v.begin(), v.end());
rep(i, n) {
ans += v[i].first * min(m, v[i].second);
m -= v[i].second;
if (m <= 0)
break;
}
cout << ans << endl;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 2 << 29
#define MOD 1000000007
#define Yes(f) puts((f) ? "Yes" : "No")
#define YES(f) puts((f) ? "YES" : "NO")
int gcd(int a, int b) {
if (b != 0)
return gcd(b, a % b);
return a;
}
ll Lgcd(ll a, ll b) {
if (b != 0)
return gcd(b, a % b);
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
ll Llcm(ll a, ll b) { return a / gcd(a, b) * b; }
using Graph = vector<vector<int>>;
// cout << fixed << setprecision(6);
// cout << setfill('0') << right << setw(2);
int main() {
ll n, m, a, b, ans = 0;
cin >> n >> m;
vector<pair<ll, ll>> v;
rep(i, n) {
cin >> a >> b;
v.push_back(pair<ll, ll>(a, b));
}
sort(v.begin(), v.end());
rep(i, n) {
ans += v[i].first * min(m, v[i].second);
m -= v[i].second;
if (m <= 0)
break;
}
cout << ans << endl;
} | replace | 42 | 43 | 42 | 43 | -11 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
long long N, M;
cin >> N >> M;
vector<pair<long long, long long>> E(N);
for (int i = 0; i < N; i++) {
cin >> E.at(i).first >> E.at(i).second;
}
sort(E.begin(), E.end());
// for(int i=0;i<N;i++) cout<<E.at(i).first<<','<<E.at(i).second<<endl;
long long ans = 0;
long long num;
long long i = 0;
while (num < M) {
num += E.at(i).second;
ans += E.at(i).first * E.at(i).second;
i++;
}
// cout<<num<<','<<ans<<','<<i<<endl;
ans = ans - (num - M) * E.at(i - 1).first;
cout << ans << endl;
} | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
long long N, M;
cin >> N >> M;
vector<pair<long long, long long>> E(N);
for (int i = 0; i < N; i++) {
cin >> E.at(i).first >> E.at(i).second;
}
sort(E.begin(), E.end());
// for(int i=0;i<N;i++) cout<<E.at(i).first<<','<<E.at(i).second<<endl;
long long ans = 0;
long long num;
long long i = 0;
while (num < M) {
num += E.at(i).second;
ans += E.at(i).first * E.at(i).second;
i++;
}
// cout<<num<<','<<ans<<','<<i<<endl;
ans = ans - (num - M) * E.at(i - 1).first;
cout << ans << endl;
} | replace | 7 | 9 | 7 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744073709551615) >= this->size() (which is 0)
|
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<pair<long long int, long long int>> X(N);
for (long long int i = 0; i < N; i++) {
long long int A, B;
cin >> A >> B;
X.at(i) = make_pair(A, B);
}
sort(X.begin(), X.end());
long long int ans = 0;
long long int i = 0;
while (M >= X.at(i).second) {
ans += X.at(i).first * X.at(i).second;
M -= X.at(i).second;
i++;
}
ans += X.at(i).first * M;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<pair<long long int, long long int>> X(N);
for (long long int i = 0; i < N; i++) {
long long int A, B;
cin >> A >> B;
X.at(i) = make_pair(A, B);
}
sort(X.begin(), X.end());
long long int ans = 0;
long long int i = 0;
while (M > X.at(i).second) {
ans += X.at(i).first * X.at(i).second;
M -= X.at(i).second;
i++;
}
ans += X.at(i).first * M;
cout << ans << endl;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
const int maxN = 10010;
const int MAXM = 310;
const int MAXK = 17;
const int MOD = 1000000007;
const ll INF = 10000000000000000LL;
const ll inf = 5000000000000LL;
int a[maxN];
int b[maxN];
int c;
int n, m;
struct node {
int x, y;
bool operator<(const node &p) const { return x < p.x; }
};
node s[maxN];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &s[i].x, &s[i].y);
}
sort(s + 1, s + 1 + n);
ll ans = 0;
for (int i = 1; i <= n; i++) {
if (s[i].y >= m) {
ans += (ll)s[i].x * m;
break;
} else {
ans += (ll)s[i].x * s[i].y;
m -= s[i].y;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
const int maxN = 100010;
const int MAXM = 310;
const int MAXK = 17;
const int MOD = 1000000007;
const ll INF = 10000000000000000LL;
const ll inf = 5000000000000LL;
int a[maxN];
int b[maxN];
int c;
int n, m;
struct node {
int x, y;
bool operator<(const node &p) const { return x < p.x; }
};
node s[maxN];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &s[i].x, &s[i].y);
}
sort(s + 1, s + 1 + n);
ll ans = 0;
for (int i = 1; i <= n; i++) {
if (s[i].y >= m) {
ans += (ll)s[i].x * m;
break;
} else {
ans += (ll)s[i].x * s[i].y;
m -= s[i].y;
}
}
cout << ans << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define lp(i, a, b) for (int i = a; i < (b); i++)
#define lpd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
bool cmp(pl a, pl b) { return (a.first <= b.first); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
ll m, a, b;
cin >> n >> m;
vector<pair<ll, ll>> v(n);
lp(i, 0, n) {
cin >> a >> b;
v[i] = mp(a, b);
}
sort(all(v), cmp);
ll sum = 0, price = 0;
int i = 0;
while (sum + v[i].second <= m) {
sum += v[i].second;
price += (v[i].first * v[i].second);
i++;
}
price += (v[i].first * (m - sum));
cout << price << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define lp(i, a, b) for (int i = a; i < (b); i++)
#define lpd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
bool cmp(pl a, pl b) { return (a.first < b.first); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
ll m, a, b;
cin >> n >> m;
vector<pair<ll, ll>> v(n);
lp(i, 0, n) {
cin >> a >> b;
v[i] = mp(a, b);
}
sort(all(v), cmp);
ll sum = 0, price = 0;
int i = 0;
while (sum + v[i].second <= m) {
sum += v[i].second;
price += (v[i].first * v[i].second);
i++;
}
price += (v[i].first * (m - sum));
cout << price << endl;
return 0;
} | replace | 62 | 63 | 62 | 63 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long sum;
int n, m, cnt;
pair<int, int> p[10005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p + 1, p + n + 1);
for (int i = 1; i <= n; i++) {
int cnti = 0;
while (cnt != m) {
if (cnti == p[i].second) {
break;
} else {
sum += p[i].first;
}
cnt++;
cnti++;
}
}
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long sum;
int n, m, cnt;
pair<int, int> p[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p + 1, p + n + 1);
for (int i = 1; i <= n; i++) {
int cnti = 0;
while (cnt != m) {
if (cnti == p[i].second) {
break;
} else {
sum += p[i].first;
}
cnt++;
cnti++;
}
}
cout << sum;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++)
cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < n; i++) {
int amount = min(q, v[i].second);
ans += v[i].first * amount;
q -= amount;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v(n);
for (int i = 0; i < n; i++)
cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < n; i++) {
int amount = min(q, v[i].second);
ans += v[i].first * amount;
q -= amount;
}
cout << ans << endl;
} | replace | 9 | 10 | 9 | 10 | -11 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, a, b;
cin >> N >> M;
vector<pair<int, int>> pairs(N);
for (int i = 0; i < N; ++i) {
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
int honsuu = 0;
int index = 0;
int tmp = pairs[0].second;
long long ans = 0;
while (true) {
if (tmp == 0) {
++index;
tmp = pairs[index].second;
}
for (int i = 0; i < pairs[index].second; ++i) {
if (honsuu == M) {
cout << ans << endl;
return 0;
}
++honsuu;
--tmp;
ans += pairs[index].first;
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, a, b;
cin >> N >> M;
vector<pair<int, int>> pairs(N);
for (int i = 0; i < N; ++i) {
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
int honsuu = 0;
int index = 0;
int tmp = pairs[0].second;
long long ans = 0;
while (true) {
if (honsuu == M) {
cout << ans << endl;
return 0;
}
if (tmp == 0) {
++index;
tmp = pairs[index].second;
}
for (int i = 0; i < pairs[index].second; ++i) {
if (honsuu == M) {
cout << ans << endl;
return 0;
}
++honsuu;
--tmp;
ans += pairs[index].first;
}
}
return 0;
} | insert | 20 | 20 | 20 | 24 | 0 | |
p03103 | C++ | Time Limit Exceeded | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define double long double
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define rep1(i, n) REP(i, 1, n + 1)
using namespace std;
bool my_compare(pair<ll, ll> a, pair<ll, ll> 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() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, m, n, maxi = 0, f = 0, mini = INF, sum = 0;
string str;
cin >> n >> m;
vector<pair<ll, ll>> p(n);
rep(i, n) {
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p.begin(), p.end(), my_compare);
ll d = 0;
ll mem;
rep(i, n) {
sum += p[i].first * p[i].second;
d += p[i].second;
mem = i;
if (d >= m)
break;
}
sum -= (d - m) * p[mem].first;
cout << sum << endl;
return 0;
}
| // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define double long double
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define rep1(i, n) REP(i, 1, n + 1)
using namespace std;
bool my_compare(pair<ll, ll> a, pair<ll, ll> 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() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, m, n, maxi = 0, f = 0, mini = INF, sum = 0;
string str;
cin >> n >> m;
vector<pair<ll, ll>> p(n);
rep(i, n) {
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p.begin(), p.end());
ll d = 0;
ll mem;
rep(i, n) {
sum += p[i].first * p[i].second;
d += p[i].second;
mem = i;
if (d >= m)
break;
}
sum -= (d - m) * p[mem].first;
cout << sum << endl;
return 0;
}
| replace | 43 | 44 | 43 | 44 | TLE | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> A(N);
vector<long long> B(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<pair<long long, long long>> p(N);
for (long long i = 0; i < N; i++) {
p.at(i) = make_pair(A.at(i), B.at(i));
}
sort(p.begin(), p.end());
long long sum = 0;
long long cost = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < p[i].second; j++) {
sum++;
cost += p[i].first;
if (sum == M) {
cout << cost << endl;
break;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> A(N);
vector<long long> B(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<pair<long long, long long>> p(N);
for (long long i = 0; i < N; i++) {
p.at(i) = make_pair(A.at(i), B.at(i));
}
sort(p.begin(), p.end());
long long sum = 0;
long long cost = 0;
for (int i = 0; i < N; i++) {
sum += p[i].second;
cost += p[i].first * p[i].second;
if (sum >= M) {
cost -= p[i].first * (sum - M);
cout << cost << endl;
break;
}
}
} | replace | 21 | 28 | 21 | 27 | TLE | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A, B;
cin >> N >> M;
vector<pair<int, int>> list(N);
for (int i = 0; i < N; i++) {
cin >> A >> B;
list[i] = make_pair(A, B);
}
sort(list.begin(), list.end());
long cost = 0;
int drink = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < list[i].second; j++) {
if (drink < M) {
drink++;
cost += list[i].first;
}
}
}
cout << cost << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A, B;
cin >> N >> M;
vector<pair<int, int>> list(N);
for (int i = 0; i < N; i++) {
cin >> A >> B;
list[i] = make_pair(A, B);
}
sort(list.begin(), list.end());
long cost = 0;
int drink = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < list[i].second; j++) {
if (drink < M) {
drink++;
cost += list[i].first;
}
if (drink >= M) {
break;
}
}
if (drink >= M) {
break;
}
}
cout << cost << endl;
} | insert | 23 | 23 | 23 | 29 | TLE | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX 10005
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
pair<ll, int> T[N_MAX];
for (int i = 0; i < N; i++) {
ll A;
int B;
cin >> A >> B;
T[i].first = A;
T[i].second = B;
}
sort(T, T + N);
ll money = 0;
for (int i = 0; i < N; i++) {
if (M >= T[i].second) {
M -= T[i].second;
money += T[i].first * T[i].second;
} else {
money += T[i].first * M;
break;
}
}
cout << money << endl;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX 100005
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
pair<ll, int> T[N_MAX];
for (int i = 0; i < N; i++) {
ll A;
int B;
cin >> A >> B;
T[i].first = A;
T[i].second = B;
}
sort(T, T + N);
ll money = 0;
for (int i = 0; i < N; i++) {
if (M >= T[i].second) {
M -= T[i].second;
money += T[i].first * T[i].second;
} else {
money += T[i].first * M;
break;
}
}
cout << money << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int main() {
int n, m, x;
cin >> n >> m;
vector<ii> a(n);
for (int i = 0; i < n; i++)
cin >> a[i].first >> a[i].second;
sort(a.begin(), a.end());
int i = 0;
long long y = 0;
while (x < m) {
if (a[i].second > 0)
y += a[i].first, a[i].second--, x++;
else
i++;
}
cout << y << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int main() {
int n, m, x = 0;
cin >> n >> m;
vector<ii> a(n);
for (int i = 0; i < n; i++)
cin >> a[i].first >> a[i].second;
sort(a.begin(), a.end());
int i = 0;
long long y = 0;
while (x < m) {
if (a[i].second > 0)
y += a[i].first, a[i].second--, x++;
else
i++;
}
cout << y << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define poi 1000
using namespace std;
struct girl {
int x, y;
bool operator<(girl b) const { return x < b.x; }
} a[poi];
inline int re() {
char c = getchar();
int x = 0, k = 1;
while (c < '0' || c > '9') {
if (c == '-')
k = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x * k;
}
void wr(int x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
wr(x / 10);
putchar(x % 10 + '0');
}
signed main() {
int n = re(), m = re(), ans = 0;
for (int i = 1; i <= n; i++)
a[i].x = re(), a[i].y = re();
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (m - a[i].y < 0) {
ans += a[i].x * m;
break;
}
ans += a[i].x * a[i].y;
m -= a[i].y;
}
wr(ans);
return 0;
}
/*
*/ | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define poi 1000000
#define int long long
using namespace std;
struct girl {
int x, y;
bool operator<(girl b) const { return x < b.x; }
} a[poi];
inline int re() {
char c = getchar();
int x = 0, k = 1;
while (c < '0' || c > '9') {
if (c == '-')
k = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x * k;
}
void wr(int x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
wr(x / 10);
putchar(x % 10 + '0');
}
signed main() {
int n = re(), m = re(), ans = 0;
for (int i = 1; i <= n; i++)
a[i].x = re(), a[i].y = re();
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (m - a[i].y < 0) {
ans += a[i].x * m;
break;
}
ans += a[i].x * a[i].y;
m -= a[i].y;
}
wr(ans);
return 0;
}
/*
*/ | replace | 5 | 6 | 5 | 7 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(n);
vector<pair<int, int>> ab;
rep(i, n) {
cin >> a.at(i) >> b.at(i);
ab.at(i) = make_pair(a.at(i), b.at(i));
}
sort(ab.begin(), ab.end());
int64_t ans = 0;
rep(i, n) {
int p = min(m, ab.at(i).second);
ans += p * ab.at(i).first;
m -= p;
}
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int64_t> a(n), b(n);
vector<pair<int64_t, int>> ab(n);
rep(i, n) {
cin >> a.at(i) >> b.at(i);
ab.at(i) = make_pair(a.at(i), b.at(i));
}
sort(ab.begin(), ab.end());
int64_t ans = 0;
rep(i, n) {
int p = min(m, ab.at(i).second);
ans += p * ab.at(i).first;
m -= p;
}
cout << ans;
} | replace | 7 | 9 | 7 | 9 | -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)
|
p03103 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a, i, j, v) \
for (ll k = i; k <= j; k++) { \
a[k] = v; \
}
int main() {
int n, m;
cin >> n >> m;
vector<tuple<ll, int>> v;
REP(i, n) {
ll a;
int b;
cin >> a >> b;
v.push_back(make_tuple(a, b));
}
sort(v.begin(), v.end(),
[](tuple<ll, int> const &lhs, tuple<ll, int> const &rhs) {
if (get<0>(lhs) != get<0>(rhs))
return get<0>(lhs) < get<0>(rhs);
if (get<1>(lhs) != get<1>(rhs))
return get<1>(lhs) > get<1>(rhs);
return true;
});
ll cost = 0;
REP(i, n) {
cost += get<0>(v[i]) * min(get<1>(v[i]), m);
m -= min(get<1>(v[i]), m);
if (m == 0) {
break;
}
}
cout << cost << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a, i, j, v) \
for (ll k = i; k <= j; k++) { \
a[k] = v; \
}
int main() {
int n, m;
cin >> n >> m;
vector<tuple<ll, int>> v;
REP(i, n) {
ll a;
int b;
cin >> a >> b;
v.push_back(make_tuple(a, b));
}
sort(ALL(v));
// sort(
// v.begin(),
// v.end(),
// [](tuple<ll, int> const &lhs, tuple<ll, int> const &rhs) {
// if (get<0>(lhs) != get<0>(rhs)) return get<0>(lhs) < get<0>(rhs);
// if (get<1>(lhs) != get<1>(rhs)) return get<1>(lhs) > get<1>(rhs);
// return true;
// }
// );
ll cost = 0;
REP(i, n) {
cost += get<0>(v[i]) * min(get<1>(v[i]), m);
m -= min(get<1>(v[i]), m);
if (m == 0) {
break;
}
}
cout << cost << endl;
return 0;
} | replace | 54 | 62 | 54 | 64 | 0 | |
p03105 | C++ | Time Limit Exceeded | /**************************
* Writer : Leo101
* Problem :
* Tags :
**************************/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define File(s) \
freopen(#s ".in", "r", stdin); \
freopen(#s ".out", "w", stdout)
#define gi get_int()
int get_int() {
int x = 0, y = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
y = -1, ch = getchar();
while (ch <= '9' && ch >= '0') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * y;
}
int main() {
File(a);
int a = gi, b = gi, k = gi;
printf("%d", std ::min(b / a, k));
return 0;
}
| /**************************
* Writer : Leo101
* Problem :
* Tags :
**************************/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define File(s) \
freopen(#s ".in", "r", stdin); \
freopen(#s ".out", "w", stdout)
#define gi get_int()
int get_int() {
int x = 0, y = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
y = -1, ch = getchar();
while (ch <= '9' && ch >= '0') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * y;
}
int main() {
int a = gi, b = gi, k = gi;
printf("%d", std ::min(b / a, k));
return 0;
}
| delete | 28 | 30 | 28 | 28 | TLE | |
p03105 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int a, b, k;
cin >> a >> b >> k;
if (a == 1 && b == 1) {
cout << 1;
return 0;
}
set<int> s;
forsn(i, 1, min(a, b)) {
if (a % i == 0 && b % i == 0)
s.insert(i);
}
auto it = s.end();
forn(i, k) { it--; }
cout << *it << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
}
| replace | 15 | 29 | 15 | 18 | 0 | |
p03105 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = A * C;
if (A > B) {
cout << "0" << endl;
exit(1);
}
for (int i = 3; i <= 100; i++) {
if (ans < B) {
ans = ans + A * C;
} else {
cout << i << endl;
exit(1);
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * C < B) {
cout << C << endl;
} else {
cout << int(B / A) << endl;
}
}
| replace | 6 | 18 | 6 | 10 | 1 | |
p03105 | C++ | Runtime Error | // https://cs.stackexchange.com/questions/84426/find-a-node-with-maximum-distance-from-given-node-in-a-tree
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including
// tree_order_statistics_node_update using namespace __gnu_pbds; #include
// <ext/rope> //header with rope using namespace __gnu_cxx; #define ordered_set
// tree<pii, null_type,less<pii>, rb_tree_tag,tree_order_statistics_node_update>
// find_by_order tells index pr kon hai..
// order_by_key tells ki us element se kitne strictly smaller element hai...
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Senky_Bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
ll fact[1000007];
ll mdpower(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res % mod * a % mod) % mod;
b /= 2;
a = (a % mod * a % mod) % mod;
}
return res;
}
void factorial() {
fact[0] = 1;
for (int i = 1; i < 1000007; i++)
fact[i] = (fact[i - 1] % mod * i % mod) % mod;
}
ll inverse(ll a, ll b) { return mdpower(a, b - 2); }
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a);
a = (a * a);
b /= 2;
}
return res;
}
int main() {
Senky_Bansal IIIT_ALLAHABAD
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
} | // https://cs.stackexchange.com/questions/84426/find-a-node-with-maximum-distance-from-given-node-in-a-tree
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including
// tree_order_statistics_node_update using namespace __gnu_pbds; #include
// <ext/rope> //header with rope using namespace __gnu_cxx; #define ordered_set
// tree<pii, null_type,less<pii>, rb_tree_tag,tree_order_statistics_node_update>
// find_by_order tells index pr kon hai..
// order_by_key tells ki us element se kitne strictly smaller element hai...
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Senky_Bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
ll fact[1000007];
ll mdpower(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res % mod * a % mod) % mod;
b /= 2;
a = (a % mod * a % mod) % mod;
}
return res;
}
void factorial() {
fact[0] = 1;
for (int i = 1; i < 1000007; i++)
fact[i] = (fact[i - 1] % mod * i % mod) % mod;
}
ll inverse(ll a, ll b) { return mdpower(a, b - 2); }
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a);
a = (a * a);
b /= 2;
}
return res;
}
int main() {
Senky_Bansal IIIT_ALLAHABAD
ll a,
b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
} | replace | 53 | 58 | 53 | 55 | 0 | |
p03105 | Python | Runtime Error | import sys
sys.setrecursionlimit(10**5)
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
ans = n * (n - 1) // 2
result = [ans]
leader = [-1] * n
size = [1] * n
def leader_check(i):
if leader[i] == -1:
return i
ln = leader_check(leader[i])
leader[i] = ln
return ln
for a, b in ab[:0:-1]:
a, b = a - 1, b - 1
la = leader_check(a)
lb = leader_check(b)
if la != lb:
leader[la] = lb
ans -= size[la] * size[lb]
size[lb] += size[la]
result.append(ans)
for i in result[::-1]:
print(i)
| a, b, c = list(map(int, input().split()))
if b > a * c:
print(c)
else:
print(int(b / a))
| replace | 0 | 32 | 0 | 5 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03105/Python/s049058276.py", line 3, in <module>
n, m = list(map(int, input().split()))
ValueError: too many values to unpack (expected 2)
|
p03105 | C++ | Runtime Error | #include <iostream>
int main() {
long A;
long B;
long C;
std::cin >> A >> B >> C;
if (A * C < B) {
std::cout << C;
} else {
std::cout << B / A;
}
main();
return 0;
} | #include <iostream>
int main() {
long A;
long B;
long C;
std::cin >> A >> B >> C;
if (A * C < B) {
std::cout << C;
} else {
std::cout << B / A;
}
return 0;
} | delete | 12 | 13 | 12 | 12 | -11 | |
p03105 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a, b, c;
if (a / b >= c) {
cout << c << endl;
} else if (a / b < c) {
cout << a / b << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> b >> a >> c;
if (a / b >= c) {
cout << c << endl;
} else if (a / b < c) {
cout << a / b << endl;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p03105 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n, m) for (int i = (n); i < (m); i++)
#define REP_EQ(i, n, m) for (int i = (n); i <= (m); i++)
#define CNT(i, n) for (int i = (n); i > 0; i--)
#define REP_two(i, n, m) for (int i = (n); i < (m); i += 2)
#define ll long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int MAX = 1e9;
int MOD = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int cnt, ans = 0;
cnt = b % a;
ans = c / cnt;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n, m) for (int i = (n); i < (m); i++)
#define REP_EQ(i, n, m) for (int i = (n); i <= (m); i++)
#define CNT(i, n) for (int i = (n); i > 0; i--)
#define REP_two(i, n, m) for (int i = (n); i < (m); i += 2)
#define ll long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int MAX = 1e9;
int MOD = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
if (a * c <= b) {
ans = c;
} else {
ans = b / a;
}
cout << ans << endl;
}
| replace | 15 | 18 | 15 | 21 | 0 | |
p03105 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define For(i, n) for (int i = 0; i < n; i++)
#define Fre(i, a, b) for (int i = a; i < b; i++)
#define sf(n) scanf("%d", &n)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pfn(n) printf("%d\n", n)
#define pfs(n) printf("%d ", n)
#define ff first
#define ss second
#define mem(a, b) memset(a, b, sizeof(a))
#define READ freopen("in.txt", "r", stdin)
#define WRITE freopen("out.txt", "w", stdout)
#define sz size()
#define number_of_digit(n) __builtin_ffs(n);
#define ll long long
#define T int
#define ld long double
inline void print(T n) {
if (n == 0) {
putchar('0');
putchar('\n');
} else if (n == -1) {
putchar('-');
putchar('1');
putchar('\n');
} else {
char buf[11];
buf[10] = '\n';
int i = 9;
while (n) {
buf[i--] = n % 10 + '0';
n /= 10;
}
while (buf[i] != '\n')
putchar(buf[++i]);
}
}
int read() {
int cc = getc(stdin);
for (; cc < '0' || cc > '9';)
cc = getc(stdin);
int ret = 0;
for (; cc >= '0' && cc <= '9';) {
ret = ret * 10 + cc - '0';
cc = getc(stdin);
}
return ret;
}
ll power(ll num, ll g) {
if (g == 0)
return 1;
if (g % 2 == 1)
return (num * power((num * num), g / 2));
return power((num * num), g / 2);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define For(i, n) for (int i = 0; i < n; i++)
#define Fre(i, a, b) for (int i = a; i < b; i++)
#define sf(n) scanf("%d", &n)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pfn(n) printf("%d\n", n)
#define pfs(n) printf("%d ", n)
#define ff first
#define ss second
#define mem(a, b) memset(a, b, sizeof(a))
#define READ freopen("in.txt", "r", stdin)
#define WRITE freopen("out.txt", "w", stdout)
#define sz size()
#define number_of_digit(n) __builtin_ffs(n);
#define ll long long
#define T int
#define ld long double
inline void print(T n) {
if (n == 0) {
putchar('0');
putchar('\n');
} else if (n == -1) {
putchar('-');
putchar('1');
putchar('\n');
} else {
char buf[11];
buf[10] = '\n';
int i = 9;
while (n) {
buf[i--] = n % 10 + '0';
n /= 10;
}
while (buf[i] != '\n')
putchar(buf[++i]);
}
}
int read() {
int cc = getc(stdin);
for (; cc < '0' || cc > '9';)
cc = getc(stdin);
int ret = 0;
for (; cc >= '0' && cc <= '9';) {
ret = ret * 10 + cc - '0';
cc = getc(stdin);
}
return ret;
}
ll power(ll num, ll g) {
if (g == 0)
return 1;
if (g % 2 == 1)
return (num * power((num * num), g / 2));
return power((num * num), g / 2);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
return 0;
} | replace | 62 | 66 | 62 | 63 | 0 | |
p03105 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
int solve() {
int a, b, n;
cin >> a >> b >> n;
cout << min(b / a, n);
return 0;
}
int main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
while (t--) {
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
int solve() {
int a, b, n;
cin >> a >> b >> n;
cout << min(b / a, n);
return 0;
}
int main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
while (t--) {
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| delete | 70 | 75 | 70 | 70 | 0 | |
p03105 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int a, b, c, co = 0;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
while (a > b || c != 0) {
b = b - a;
co++;
c--;
}
printf("%d\n", co);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c, co = 0;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
while (a <= b && c > 0) {
b = b - a;
co++;
c--;
}
printf("%d\n", co);
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p03105 | C++ | Runtime Error | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
auto ans = b / a;
return ans < c ? ans : c;
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
auto ans = b / a;
std::cout << (ans < c ? ans : c) << std::endl;
;
return 0;
}
| replace | 6 | 7 | 6 | 9 | 4 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
if (A > B)
swap(A, B);
int cnt = 0;
for (int i = 0; i < A; i++) {
if (A % i == 0 && B % i == 0)
cnt++;
if (cnt == K) {
cout << i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
if (A > B)
swap(A, B);
int cnt = 0;
for (int i = A; i > 0; i--) {
if (A % i == 0 && B % i == 0)
cnt++;
if (cnt == K) {
cout << i << endl;
break;
}
}
} | replace | 9 | 10 | 9 | 10 | -8 | |
p03106 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k, c;
cin >> a >> b >> k;
for (int i = 100; 0 < i; i++) {
if ((a / i) * i == a && (b / i) * i == b) {
k--;
if (k == 0) {
cout << i << endl;
i = 0;
}
}
}
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k, c;
cin >> a >> b >> k;
for (int i = 100; 0 < i; i--) {
if ((a / i) * i == a && (b / i) * i == b) {
k--;
if (k == 0) {
cout << i << endl;
i = 0;
}
}
}
} | replace | 15 | 16 | 15 | 16 | TLE | |
p03106 | C++ | Runtime Error | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <forward_list>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// Others
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;
}
const int dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int dy[8] = {1, 1, 1, 0, 0, -1, -1, -1};
// LOVE NyantakoGG https://www.youtube.com/channel/UC6XdFs8T6Ei54O0FYl3PVVA
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = min(A, B); i >= 0; i--) {
if (A % i == 0 && B % i == 0) {
K--;
if (K) {
} else {
cout << i << endl;
}
}
}
}
| // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <forward_list>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// Others
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;
}
const int dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int dy[8] = {1, 1, 1, 0, 0, -1, -1, -1};
// LOVE NyantakoGG https://www.youtube.com/channel/UC6XdFs8T6Ei54O0FYl3PVVA
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = min(A, B); i >= 0; i--) {
if (A % i == 0 && B % i == 0) {
K--;
if (K) {
} else {
cout << i << endl;
return 0;
}
}
}
}
| insert | 110 | 110 | 110 | 111 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
int cnt = 1;
cin >> A >> B >> K;
int comdiv[K];
for (int i = 1; i < 100; i++) {
if ((A % i == 0) || (B % i == 0)) {
comdiv[cnt] = i;
cnt++;
}
}
cout << comdiv[K];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
int cnt = 1;
cin >> A >> B >> K;
int comdiv[100];
for (int i = 100; 0 < i; i--) {
if ((A % i == 0) && (B % i == 0)) {
comdiv[cnt] = i;
cnt++;
}
}
cout << comdiv[K];
} | replace | 6 | 9 | 6 | 9 | 0 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> gcd;
int mx = max(a, b);
for (int i = 1; i < mx; i++) {
if (a % i == 0 && b % i == 0) {
gcd.push_back(i);
}
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> gcd;
int mx = max(a, b);
for (int i = 1; i <= mx; i++) {
if (a % i == 0 && b % i == 0) {
gcd.push_back(i);
}
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] << endl;
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.