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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
// 100要素の配列で初期化
int n;
cin >> n;
vector<int> vec(n);
string a = "YES";
// 100個の入力を受け取る
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (vec.at(i) == vec.at(j))
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// 100要素の配列で初期化
int n;
cin >> n;
vector<int> vec(n);
string a = "YES";
// 100個の入力を受け取る
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 1; i < n; i++) {
if (vec.at(i) == vec.at(i - 1))
... | replace | 13 | 18 | 13 | 17 | TLE | |
p02779 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
bool ans = true;
for (int i = 0; i < n; i++) {
for (int j = i ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
bool ans = true;
sort(a.begin(), a.end());
for (int i = 0; i < n... | replace | 17 | 22 | 17 | 21 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define PI 3.141592653589793238462... | #include <bits/stdc++.h>
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define PI 3.141592653589793238462... | replace | 91 | 95 | 91 | 95 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef unsigned long long ull;
typedef pair<int, int> P;
int main() {
long n;
cin >> n;
vector<long> a(n);
bool IsNotUnique = false;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef unsigned long long ull;
typedef pair<int, int> P;
int main() {
long n;
cin >> n;
vector<long> a(n);
bool IsNotUnique = false;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end()); //... | replace | 16 | 25 | 16 | 22 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(a.begin(), a.end());
bool sta = false;
for (int i = 0; i < n; i++) {
if (a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(a.begin(), a.end());
bool sta = false;
for (int i = 0; i < n - 1; i++) {
i... | replace | 15 | 16 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02779 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i <= (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n;
... | replace | 4 | 5 | 4 | 5 | -6 | /usr/include/c++/12/debug/vector:442:
In function:
std::debug::vector<_Tp, _Allocator>::reference std::debug::vector<_Tp,
_Allocator>::operator[](size_type) [with _Tp = long long int; _Allocator
= std::allocator<long long int>; reference = long long int&; size_type =
long unsigned int]
Error: attemp... |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
bool result = true;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
for (int j = 0; j < i; j++) {
if (a.at(i) == a.at(j)) {
result = false;
break;
}
}
}
if (result) {
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
bool result = true;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++) {
if (a.at(i) == a.at(i + 1)) {
result = false;
break;
}
... | replace | 10 | 15 | 10 | 16 | TLE | |
p02779 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
ty... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
ty... | replace | 41 | 42 | 41 | 42 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
// #define int long long
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
// #define int long long
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \... | replace | 43 | 49 | 43 | 50 | TLE | |
p02779 | C++ | Runtime Error | /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#inc... | /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#inc... | replace | 66 | 67 | 66 | 67 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
long long arr[n];
for (long long i = 0; i < n; i++)
scanf("%lld", &arr[i]);
for (long long i = 0; i < n; i++)
for (long long j = i + 1; j < n; j++)
if (arr[i] == arr[j]) {
cout << "NO\n";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int arr[n];
for (int i = 0; i < n; i++)
scanf("%d", &arr[i]);
sort(arr, arr + n);
for (int i = 0; i < n - 1; i++)
if (arr[i] == arr[i + 1]) {
cout << "NO\n";
return 0;
}
cout << "YES\n";
} | replace | 4 | 15 | 4 | 15 | TLE | |
p02779 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int a = 0, b = 0, x = 0;
long long int n = 0, ans = 0, count = 0;
string s, t, u;
vector<long long int> z;
vector<long long int>::iterator position;
bool q = false;
cin >> n;
for (in... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int a = 0, b = 0, x = 0;
long long int n = 0, ans = 0, count = 0;
string s, t, u;
vector<long long int> z;
vector<long long int>::iterator position;
bool q = false;
cin >> n;
for (in... | replace | 13 | 14 | 13 | 14 | -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)
|
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long n, a[200000];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
for (int j = i - 1; j >= 0; --j) {
if (a[i] == a[j]) {
cout << "NO" << '\n';
return 0;
}
}
}
cout << "YES" << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long n, a[200000];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 1; i < n; ++i) {
if (a[i] == a[i - 1]) {
cout << "NO" << '\n';
return 0;
}
}
cout << "YES" << '\n';
return 0;
} | replace | 7 | 12 | 7 | 13 | TLE | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
bool ans = false;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (A.at(i) == A.at(j)) {
ans = true;
break;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
bool ans = false;
sort(A.begin(), A.end());
for (int i = 0; i < N - 1; i++) {
if (A.at(i) == A.at(i + 1)) {
ans = true;
break;
}
}
if ... | replace | 10 | 18 | 10 | 14 | TLE | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (i == j)
continue;
if (a.at(i) == a.at(j)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < N - 1; i++) {
if (a.at(i) == a.at(i + 1)) {
cout << "NO" << endl;
exit(0);
}
}
cout << "Y... | replace | 11 | 19 | 11 | 15 | TLE | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int S[200100];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
for (int j = 0; j < i; j++) {
if (S[i] == S[j]) {
cout << "NO" << endl;
return 0;
}
}
}
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int S[200100];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
sort(S, S + N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == S[i + 1]) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return... | replace | 9 | 14 | 9 | 15 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool a[2000000];
int main() {
int N, b;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> b;
if (a[b] == false) {
a[b] = true;
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
} | #include <bits/stdc++.h>
using namespace std;
bool a[2000000000];
int main() {
int N, b;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> b;
if (a[b] == false) {
a[b] = true;
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
bool judge = true;
for (int i = 0; i < n; i++)
cin >> arr.at(i);
for (int i = 0; i < n; i++) {
for (int j = (i + 1); j < n; j++) {
if (arr.at(i) == arr.at(j)) {
judge = false;
break... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
bool judge = true;
for (int i = 0; i < n; i++)
cin >> arr.at(i);
sort(arr.begin(), arr.end());
for (int i = 1; i < n; i++) {
if (arr.at(i) == arr.at(i - 1)) {
judge = false;
break;
}
... | replace | 10 | 18 | 10 | 14 | TLE | |
p02779 | 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;
cin >> n;
vector<int> arr(n);
rep(i, n) { cin >> arr.at(i); }
vector<bool> jud(200001);
rep(i, n) {
if (jud.at(arr.at(i))) {
cout << "NO" << endl;
return 0;
} else {
j... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
rep(i, n) { cin >> arr.at(i); }
vector<bool> jud(1e9);
rep(i, n) {
if (jud.at(arr.at(i))) {
cout << "NO" << endl;
return 0;
} else {
jud.... | replace | 9 | 10 | 9 | 10 | 0 | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
bool vis[200006];
bool flag = 1;
signed main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int b;
cin >> b;
if (vis[b])
flag = 0;
vis[b] = 1;
// if(a==b)flag = 0;
// a = b;
}
if (flag)
cout << "YES"... | #include <bits/stdc++.h>
using namespace std;
#define int long long
map<int, bool> vis;
bool flag = 1;
signed main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int b;
cin >> b;
if (vis[b])
flag = 0;
vis[b] = 1;
// if(a==b)flag = 0;
// a = b;
}
if (flag)
cout << "YE... | replace | 4 | 5 | 4 | 5 | 0 | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll ar[200007], a, b, test, sum, t, x = 0, p, q, y, i, j, k = 0, l, cnt;
ll br[200007];
string s, s1, s2;
int main() {
ll test;
cin >> a;
for (i = 1; i <= a; i++) {
cin >> ar[i];
br[ar[i]]++;
}
for (i = 1; i <= a; i++)
if (br[a... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll ar[200007], a, b, test, sum, t, x = 0, p, q, y, i, j, k = 0, l, cnt;
map<ll, ll> br;
string s, s1, s2;
int main() {
ll test;
cin >> a;
for (i = 1; i <= a; i++) {
cin >> ar[i];
br[ar[i]]++;
}
for (i = 1; i <= a; i++)
if (br[... | replace | 4 | 5 | 4 | 5 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void printVector(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << endl;
}
}
int main() {
int N;
cin >> N;
vector<int> vec;
for (int i = 0; i < N; i++) {
i... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void printVector(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << endl;
}
}
int main() {
int N;
cin >> N;
vector<int> vec;
for (int i = 0; i < N; i++) {
i... | replace | 22 | 28 | 22 | 27 | TLE | |
p02779 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
int main() {
long long N;
cin >> N;
vector<long long> A;
for (long long i; i < N; i++) {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i; i < N; i++) ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int n = 0;
cin >> n;
vector<long long int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
for (int k = 0; k < i; k++) {
if (a[k] == a[i]) {
cout << "NO\n";
return 0;
}
}
}
cout << "YES\n"... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int n = 0;
cin >> n;
vector<long long int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1]) {
cout << "NO\n";
return 0;
... | replace | 10 | 15 | 10 | 18 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<bool> B(200050, true);
bool ans = true;
rep(i, N) {
cin >> A.at(i);
if (B.at(A.at(i))) {
B.at(A.at(i)) = false;
} else... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<bool> B(1000000050, true);
bool ans = true;
rep(i, N) {
cin >> A.at(i);
if (B.at(A.at(i))) {
B.at(A.at(i)) = false;
} ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j && vec.at(i) == vec.at(j)) {
cout << "NO" << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < n - 1; i++) {
if (vec.at(i) == vec.at(i + 1)) {
cout << "NO" << endl;
return 0;
}
}... | replace | 10 | 16 | 10 | 15 | TLE | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, C = 1;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (A.at(i) == A.at(j))
C = 0;
}
}
if (C == 1)
cout << "YES" << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, C = 1;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
sort(A.begin(), A.end());
for (int i = 0; i < N - 1; i++) {
if (A.at(i) == A.at(i + 1))
C = 0;
}
if (C == 1)
cout << "YES" << endl;
else... | replace | 9 | 14 | 9 | 14 | TLE | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int ex = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
if (A.at(i) == A.at(j)) {
ex++;
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
A.erase(unique(A.begin(), A.end()), A.end());
if (A.size() < N) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
... | replace | 10 | 20 | 10 | 13 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int LMS(int n, int k) {
if (n == 1)
return 1;
else
/* The position returned by josephus(n - 1, k) is adjusted because the
recursive call josephus(n - 1, k) considers the original position
k%n + 1 as position 1 ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int LMS(int n, int k) {
if (n == 1)
return 1;
else
/* The position returned by josephus(n - 1, k) is adjusted because the
recursive call josephus(n - 1, k) considers the original position
k%n + 1 as position 1 ... | delete | 14 | 21 | 14 | 14 | 0 | |
p02779 | C++ | Memory Limit Exceeded | // clang-format off
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
#defin... | // clang-format off
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
#defin... | replace | 26 | 27 | 26 | 27 | MLE | |
p02779 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, i, j;
int a[100005], flag = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 1; i < n; i++) {
if (a[i] == a[i - 1]) {
flag = 1;
break;
}
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, i, j;
long long a[200005], flag = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 1; i < n; i++) {
if (a[i] == a[i - 1]) {
flag = 1;
break;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02779 | Python | Time Limit Exceeded | def main():
n = int(input())
A = list(map(int, input().split()))
for i in range(n):
a = A.pop()
if a in A:
print("NO")
return
print("YES")
if __name__ == "__main__":
main()
| def main():
n = int(input())
A = list(map(int, input().split()))
A_set = set(A)
if len(A) == len(A_set):
print("YES")
else:
print("NO")
if __name__ == "__main__":
main()
| replace | 4 | 10 | 4 | 9 | TLE | |
p02779 | Python | Time Limit Exceeded | n = int(input())
a = input().split()
flag = False
for i in range(n):
for j in range(i + 1, n):
if a[i] == a[j]:
flag = True
break
if flag:
break
if flag:
print("NO")
else:
print("YES")
| n = int(input())
a = [int(i) for i in input().split()]
if len(a) != len(set(a)):
print("NO")
else:
print("YES")
| replace | 1 | 12 | 1 | 3 | TLE | |
p02779 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
for i in a:
if a.count(i) >= 2:
print("NO")
exit()
print("YES")
| n = int(input())
a = list(map(int, input().split()))
b = set(a)
a.sort()
if len(a) != len(b):
print("NO")
else:
print("YES")
| replace | 2 | 7 | 2 | 8 | TLE | |
p02779 | Python | Time Limit Exceeded | n = int(input())
num_list = list(map(int, input().split()))
out = "YES"
for j in range(len(num_list)):
for k in num_list[j + 1 :]:
out = "NO" if num_list[j] == k else out
print(out)
| n = int(input())
num_list = list(map(int, input().split()))
out = "YES" if len(num_list) == len(set(num_list)) else "NO"
print(out)
| replace | 2 | 6 | 2 | 3 | TLE | |
p02779 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
answer = "YES"
for i in range(N):
c = A.count(A[i])
if c >= 2:
answer = "NO"
break
print(answer)
| N = int(input())
A = list(map(int, input().split()))
answer = "YES"
AA = sorted(A)
for i in range(N - 1):
if AA[i] == AA[i + 1]:
answer = "NO"
break
print(answer)
| replace | 4 | 7 | 4 | 7 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool a = true;
vector<int> wtf(N);
for (int i = 0; i < N; i++) {
cin >> wtf.at(i);
}
sort(wtf.begin(), wtf.end());
for (int i = 0; i < N; i++) {
if (wtf.at(i) == wtf.at(i + 1)) {
a = false;
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool a = true;
vector<int> wtf(N);
for (int i = 0; i < N; i++) {
cin >> wtf.at(i);
}
sort(wtf.begin(), wtf.end());
for (int i = 0; i < N - 1; i++) {
if (wtf.at(i) == wtf.at(i + 1)) {
a = false;
break;
}
... | replace | 11 | 12 | 11 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02779 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1e9 + 7;
int main(void) {
int N;
vec... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1e9 + 7;
int main(void) {
int N;
vec... | replace | 23 | 30 | 23 | 31 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> d(1000000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end())... | replace | 12 | 16 | 12 | 15 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
rep(i, n) {
for (int j = i + 1; j < n; j++) {
if (a.at(i) == a.at(j)) {
cout << "NO" << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(a.begin(), a.end());
rep(i, n - 1) {
if (a.at(i) == a.at(i + 1)) {
cout << "NO" << endl;
return 0;
}
}
... | replace | 9 | 15 | 9 | 14 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
using namespace std;
// Library
// モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
... | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
using namespace std;
// Library
// モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
... | replace | 242 | 243 | 242 | 243 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int A[200000] = {0};
int N;
int main(void) {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
std::sort(A, A + N);
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
if (A[i] == A[j]) {
cout << "NO";
... | #include <algorithm>
#include <iostream>
using namespace std;
int A[200000] = {0};
int N;
int main(void) {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
std::sort(A, A + N);
for (int i = 0; i < N - 1; i++) {
if (A[i] == A[i + 1]) {
cout << "NO";
return 0;
}
}
cout << "... | replace | 15 | 20 | 15 | 18 | TLE | |
p02779 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int N;
cin >> N;
vector<int> cnt(N);
for (int i = 1; i <= N; ++i)
cin >> cnt[i];
cnt[... | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int N;
cin >> N;
vector<int> cnt(N + 1);
for (int i = 1; i <= N; ++i)
cin >> cnt[i];
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[100004];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + 1 + n);
for (int i = 2; i <= n; i++)
if (a[i] == a[i - 1]) {
cout << "NO";
return 0;
}
cout << "YES";
} | #include <bits/stdc++.h>
using namespace std;
int n, a[200004];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + 1 + n);
for (int i = 2; i <= n; i++)
if (a[i] == a[i - 1]) {
cout << "NO";
return 0;
}
cout << "YES";
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<string> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
if (A[i] == A[j]) {
cout << "NO" << endl;
return 0;
}
}
}
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<string> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < N - 1; ++i) {
if (A[i] == A[i + 1]) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" <... | replace | 10 | 16 | 10 | 15 | TLE | |
p02779 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int findIndex(vector<long> vec, long ... | #include <algorithm>
#include <cctype>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int findIndex(vector<long> vec, long ... | replace | 35 | 42 | 35 | 41 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string s, t;
int n;
int judge = 1;
string u;
vector<int> a(200000);
int main(int argc, char const *argv[]) {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a.at(i);
}
sort(a.begin(), a.end(), greater<int>());
// for(int i = 0; i<n;i++) cout << a.at(i) << en... | #include <bits/stdc++.h>
using namespace std;
string s, t;
int n;
int judge = 1;
string u;
vector<int> a(200010);
int main(int argc, char const *argv[]) {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a.at(i);
}
sort(a.begin(), a.end(), greater<int>());
// for(int i = 0; i<n;i++) cout << a.at(i) << en... | replace | 7 | 8 | 7 | 8 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a[i] == a[i + 1]) {
... | replace | 19 | 24 | 19 | 22 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
void solve() { return; }
int32_t main() {
ios_base::sync_w... | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
void solve() { return; }
int32_t main() {
ios_base::sync_w... | delete | 20 | 24 | 20 | 20 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define urng(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define urep(i, b) urng(i, 0, b)
#define pb push_back
#define eb emplace_back
#define F first
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define urng(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define urep(i, b) urng(i, 0, b)
#define pb push_back
#define eb emplace_back
#define F first
#d... | replace | 24 | 30 | 24 | 29 | TLE | |
p02779 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, c = 0;
cin >> n;
vector<long long int> a(100000);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), std::greater<>());
for (int i = 0; i < n - 1; i++) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, c = 0;
cin >> n;
vector<long long int> a(1000000);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), std::greater<>());
for (int i = 0; i < n - 1; i++) {
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int n, arr[10 ^ 9];
int main() {
int flag;
flag = 1;
long long int i;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%lld", &arr[i]);
}
sort(arr, arr + n);
for (i = 0; i < n; i++) {
if (arr[i] == arr[i + 1]) {
flag = 0;
pri... | #include <bits/stdc++.h>
using namespace std;
long long int n, arr[100000000];
int main() {
int flag;
flag = 1;
long long int i;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%lld", &arr[i]);
}
sort(arr, arr + n);
for (i = 0; i < n; i++) {
if (arr[i] == arr[i + 1]) {
flag = 0;
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
if (count(a.begin() + i, a.end(), a.at(i)) != 1) {
cout << "NO" << endl;
return 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++) {
if (a.at(i) == a.at(i + 1)) {
cout << "NO" << endl;
return 0;... | replace | 11 | 13 | 11 | 14 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e5 + 7;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
bool bl = true;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
++a[x];
if (a[x] > 1)
bl = false;
}
bl ?... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e5 + 7;
unordered_map<int, int> a;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
bool bl = true;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
++a[x];
if (a[x] > 1)
bl = ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORd(i, a, b) for (int i = a; i >= b; i--)
#define fi first
#define se second
#define II pair<ll, ll>
const int maxn = 2e5 + 10;
const ll maxN = 1e18 + 10;
ll ST[maxn], a[maxn];
int main()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORd(i, a, b) for (int i = a; i >= b; i--)
#define fi first
#define se second
#define II pair<ll, ll>
const int maxn = 2e5 + 10;
const ll maxN = 1e18 + 10;
ll ST[maxn], a[maxn];
int main()... | replace | 23 | 24 | 23 | 24 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
struct dog {
string a;
int b;
};
int main() {
// dog shiba; dog pa;
// cin >> shiba.a >> pa.a;
// cin >> shiba.b >> pa.b;
// string key;
// cin >> key;
// if (shiba.a ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
struct dog {
string a;
int b;
};
int main() {
// dog shiba; dog pa;
// cin >> shiba.a >> pa.a;
// cin >> shiba.b >> pa.b;
// string key;
// cin >> key;
// if (shiba.a ... | replace | 37 | 43 | 37 | 41 | TLE | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> pii;
const int maxn = 2e5 + 10;
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const ll mod = 1000000007;
int vis[maxn], n;
bool flg = 1;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (vi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> pii;
const int maxn = 2e5 + 10;
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const ll mod = 1000000007;
int n;
map<int, int> vis;
bool flg = 1;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
... | replace | 8 | 9 | 8 | 10 | 0 | |
p02779 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long z[2323];
int n, m;
int main() {
bool flag = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m;
z[i] = m;
}
sort(z, z + n);
for (int i = 0; i < n - 1; i++) {
if (z[i] == z[i + 1])
flag = 1;
}
i... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long z[0x3f3f3f];
int n, m;
int main() {
bool flag = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m;
z[i] = m;
}
sort(z, z + n);
for (int i = 0; i < n - 1; i++) {
if (z[i] == z[i + 1])
flag = 1;
}... | replace | 6 | 7 | 6 | 7 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int l, ii = 0;
while (cin >> l) {
A[ii] = l;
ii++;
}
sort(A.begin(), A.end());
string answer = "YES";
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int l, ii = 0;
while (cin >> l) {
A[ii] = l;
ii++;
}
sort(A.begin(), A.end());
string answer = "YES";
for (int i = 0; i < N - 1; i++) {
if (A[i] == A[i + 1])... | replace | 20 | 26 | 20 | 24 | TLE | |
p02779 | C++ | Runtime Error | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> A;
set<double> A_set;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
A_set.insert(A.at(i));
}
if (A.size() == A_set.size()) {
cout << "YES" << endl;
} else {
cout <<... | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> A(N);
set<double> A_set;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
A_set.insert(A.at(i));
}
if (A.size() == A_set.size()) {
cout << "YES" << endl;
} else {
cout... | replace | 10 | 11 | 10 | 11 | -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)
|
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v{istream_iterator<int>(cin), istream_iterator<int>()};
std::sort(v.begin(), v.end() - 1);
rep(i, int(v.size())) {
if (int(v.at(i)) == v.at(i + 1)) {
... | #include <bits/stdc++.h>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v{istream_iterator<int>(cin), istream_iterator<int>()};
std::sort(v.begin(), v.end());
rep(i, int(v.size()) - 1) {
if (int(v.at(i)) == v.at(i + 1)) {
... | replace | 10 | 12 | 10 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<bool> arr(1e7);
bool dis = 1;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (arr[t]) {
dis = 0;
}
arr[t] = 1;
}
if (dis)
cout << "YES";
else
cout << "NO";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> arr;
bool dis = 1;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (arr[t]) {
dis = 0;
}
arr[t] = 1;
}
if (dis)
cout << "YES";
else
cout << "NO";
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02779 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, s = 0, a[100000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < n; i++) {
if (a[i] != a[i + 1]) {
s++;
}
}
if (s == n) {
cout << "YES" << endl;
;
} else {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, s = 0, a[200110];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < n; i++) {
if (a[i] != a[i + 1]) {
s++;
}
}
if (s == n) {
cout << "YES" << endl;
;
} else {
cout ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02779 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) { cin >> a[i]; }
rep(i, N) {
rep(j, N) {
if (a[i] == a[j] && i != j) {
cout << "NO" << endl;
return 0;
} else {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) { cin >> a[i]; }
sort(a.begin(), a.end());
rep(i, N - 1) {
if (a[i] == a[i + 1]) {
cout << "NO" << endl;
return 0;
} else {
... | replace | 9 | 17 | 9 | 16 | TLE | |
p02779 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll n;
vector<bool> as = {};
cin >> n;
as.resize(100000001, false);
for (auto i = 0; i < n; i++) {
ll a;
cin >> a;
if (as[a]) {
cout << "NO" << endl;
return 0;
} else {
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll n;
vector<bool> as = {};
cin >> n;
as.resize(1000000001, false);
for (auto i = 0; i < n; i++) {
ll a;
cin >> a;
if (as[a]) {
cout << "NO" << endl;
return 0;
} else {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repeat(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> p(N, 0);
vector<double> expect(N, 0.0), list(N, 0.0);
double result = 0.0;
repeat(i, N) {
cin >> p[i];
expect[i] = (double)(1... | #include <bits/stdc++.h>
#define repeat(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> p(N, 0);
vector<double> expect(210000, 0.0), list(210000, 0.0);
double result = 0.0;
repeat(i, N) {
cin >> p[i];
expect[i] = ... | replace | 9 | 10 | 9 | 10 | -6 | malloc(): corrupted top size
|
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<double> p(N);
for (int i = 0; i < N; ++i)
cin >> p[i];
vector<double> sum(N + 1);
sum[0] = 0;
for (int i = 0; i < N; ++i) {
double e = (p[i] * (p[i] + 1)) / 2;
e /= p[i];
sum[i + 1] = sum[i] + e;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<double> p(N);
for (int i = 0; i < N; ++i)
cin >> p[i];
vector<double> sum(N + 1);
sum[0] = 0;
for (int i = 0; i < N; ++i) {
double e = (p[i] * (p[i] + 1)) / 2;
e /= p[i];
sum[i + 1] = sum[i] + e;
... | replace | 19 | 20 | 19 | 20 | 0 | |
p02780 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
/*階乗*/
ll factorial(ll n) {
if (n == 0) {
return 1;
} els... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
/*階乗*/
ll factorial(ll n) {
if (n == 0) {
return 1;
} els... | replace | 107 | 108 | 107 | 108 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
using namespace std;
using ll = long long;
typedef pair<in... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
using namespace std;
using ll = long long;
typedef pair<in... | replace | 25 | 36 | 25 | 34 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define el endl
#define INF 1e8
typedef long long ll;
typedef long double ld;
int main() {
int n, k;
cin >> n >> k;
vector<long double> p(n), s(n), a(n);
s[0] = 0;
rep(i, n) {
long double ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define el endl
#define INF 1e8
typedef long long ll;
typedef long double ld;
int main() {
int n, k;
cin >> n >> k;
vector<long double> p(n), s(n + 1), a(n);
s[0] = 0;
rep(i, n) {
long dou... | replace | 14 | 15 | 14 | 15 | -6 | munmap_chunk(): invalid pointer
|
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[200005], n, k;
double ans, num;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= k; i++)
num += a[i];
ans = num;
for (int i = 2; i < n; i++) {
num -= a[i - 1];
num += a[i + k - 1];
ans = max(ans, ... | #include <bits/stdc++.h>
using namespace std;
int a[2000005], n, k;
double ans, num;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= k; i++)
num += a[i];
ans = num;
for (int i = 2; i < n; i++) {
num -= a[i - 1];
num += a[i + k - 1];
ans = max(ans,... | replace | 2 | 3 | 2 | 3 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, s, n) for (int i = (s); i < ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, s, n) for (int i = (s); i < ... | replace | 52 | 56 | 52 | 62 | TLE | |
p02780 | C++ | Time Limit Exceeded | /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#i... | /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#i... | replace | 194 | 201 | 194 | 200 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K, mx_pk = 0;
cin >> N >> K;
vector<int> p(N);
rep(i, N) cin >> p.at(i);
rep(i, N - K + 1) {
int tmp = 0;
for (int j = i; j < i + K; j++) {
tmp += p.at(j)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K, mx_pk = 0;
cin >> N >> K;
vector<int> p(N + 1, 0), p_sum(N + 1, 0);
rep(i, N) cin >> p.at(i + 1);
rep(i, N) p_sum.at(i + 1) = p_sum.at(i) + p.at(i + 1);
for (int ... | replace | 8 | 17 | 8 | 14 | TLE | |
p02780 | C++ | Time Limit Exceeded | // include
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue... | // include
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue... | replace | 280 | 284 | 280 | 288 | TLE | |
p02780 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#includ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#includ... | replace | 40 | 41 | 40 | 44 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | replace | 44 | 45 | 44 | 45 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<double> kit(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
kit.at(i) = (a.at(i) + 1.0) / 2;
}
double ans = 0;
for (int i = 0; i <= n - k; i++) {
double bf = 0;
for (int j = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<double> kit(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
kit.at(i) = (a.at(i) + 1.0) / 2;
}
double ans = 0, bf = 0;
for (int i = 0; i < k; i++)
bf += kit.at(i);
ans = bf;
fo... | replace | 12 | 18 | 12 | 18 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll int64_t
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using namespace std;
bool compare_by_b(pair<string, ll> a, pair<stri... | #include <bits/stdc++.h>
#define ll int64_t
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using namespace std;
bool compare_by_b(pair<string, ll> a, pair<stri... | replace | 46 | 47 | 46 | 47 | -6 | malloc(): corrupted top size
|
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll << 60;
long double P[200010];
long double sum[200010];
int main(int argc, char **argv) {
ll N, K;
cin >> N >> K;
for (ll i = 0; i < N; ++i) {
long double p;
cin >> p;
P[i] = (p *... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll << 60;
long double P[200010];
long double sum[200010];
int main(int argc, char **argv) {
ll N, K;
cin >> N >> K;
for (ll i = 0; i < N; ++i) {
long double p;
cin >> p;
P[i] = (p *... | replace | 23 | 24 | 23 | 24 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
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 ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
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 ... | replace | 27 | 31 | 27 | 39 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll ZERO = 0;
const int Inf = 1000000000;
const ll INF = 1e18;
const ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll, ll> P;
int main() {
int N, K;
cin >> N >> K;
vector<double> vec(N);
for (int i = 0; i < N; i++) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll ZERO = 0;
const int Inf = 1000000000;
const ll INF = 1e18;
const ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll, ll> P;
int main() {
int N, K;
cin >> N >> K;
vector<double> vec(N);
for (int i = 0; i < N; i++) ... | replace | 21 | 26 | 21 | 29 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#includ... | replace | 130 | 133 | 130 | 136 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LL long long
using namespace std;
double a[200020];
int sum[1010];
int main() {
for (int i = 1; i <= 1000; i++) {
sum[i] = sum[i - 1] + i;
}
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
scanf("%lf", &a[i]);
a[i] = sum[(int)a[i]] / a[i];
}
double ans ... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
double a[200020];
int sum[1010];
int main() {
for (int i = 1; i <= 1000; i++) {
sum[i] = sum[i - 1] + i;
}
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
scanf("%lf", &a[i]);
a[i] = sum[(int)a[i]] / a[i];
}
double ans ... | replace | 17 | 22 | 17 | 25 | TLE | |
p02780 | C++ | Time Limit Exceeded | // default
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
typedef pair<int, int> P_i;
typedef pair<double, double> P_d;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define alrep(i, j, n) \
for (int i = 0; i < (... | // default
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
typedef pair<int, int> P_i;
typedef pair<double, double> P_d;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define alrep(i, j, n) \
for (int i = 0; i < (... | replace | 38 | 44 | 38 | 48 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, K, i, j;
cin >> N >> K;
vector<double> q(N);
int p;
for (i = 0; i < N; i++) {
cin >> p;
for (j = 1; j <= p; j++) {
q[i] += j;
}
q[i] /= p;
}
double ans = 0;
for (... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, K, i, j;
cin >> N >> K;
vector<double> q(N);
int p;
for (i = 0; i < N; i++) {
cin >> p;
for (j = 1; j <= p; j++) {
q[i] += j;
}
q[i] /= p;
}
double ans = 0;
doubl... | replace | 17 | 22 | 17 | 24 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
const long long MAXN = 1e5 + 10, inf = 1e18 + 21, LG = 20;
int n, k;
double p[MAXN], res;
double ans;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
const long long MAXN = 2e5 + 10, inf = 1e18 + 21, LG = 20;
int n, k;
double p[MAXN], res;
double ans;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i = 0; i <... | replace | 7 | 8 | 7 | 8 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double a = 0;
double p[n];
for (int i = 0; i < n; i++) {
cin >> a;
p[i] = (1 + a) / 2;
}
double max = 0;
for (int i = 0; i < n - k + 1; i++) {
double max_b = 0;
for (int j = 0; j < k; j++) ... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double a = 0;
double p[n];
for (int i = 0; i < n; i++) {
cin >> a;
p[i] = (1 + a) / 2;
}
double s[n];
s[0] = p[0];
for (int j = 1; j < n; j++) {
s[j] = p[j] + s[j - 1];
}
double max = s[k... | replace | 13 | 21 | 13 | 22 | TLE | |
p02780 | C++ | Runtime Error | // Garg's Code
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define ll long long
#define vec vector<ll>
#define pb push_back
#define po pop_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
#define rf(i, x, n) for (ll i =... | // Garg's Code
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define ll long long
#define vec vector<ll>
#define pb push_back
#define po pop_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
#define rf(i, x, n) for (ll i =... | delete | 26 | 30 | 26 | 26 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e9 + 5;
const int MAXN = 500005;
int n, k;
double a[100005];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e9 + 5;
const int MAXN = 500005;
int n, k;
double a[200005];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
int ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define up(x, v) upper_bound(all(x), v)
#define low(x, v) lower_bound(all(x), v)
#define bin(x, v) binary_search(all(x), v)
#define FOR(k, a, b) for (int k = (a); k < (b); ++k)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define up(x, v) upper_bound(all(x), v)
#define low(x, v) lower_bound(all(x), v)
#define bin(x, v) binary_search(all(x), v)
#define FOR(k, a, b) for (int k = (a); k < (b); ++k)
#defi... | replace | 33 | 34 | 33 | 34 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// be... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// be... | replace | 71 | 72 | 71 | 72 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <uno... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <uno... | replace | 69 | 70 | 69 | 70 | TLE | |
p02780 | C++ | Runtime Error | #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
vector<long long> sum(N);
sum[0] = p[0];
for (int i = 0; i < N; i++) {
sum[i + 1] = sum[i] + p[i];
}
long... | #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
vector<long long> sum(N + 1);
sum[0] = p[0];
for (int i = 0; i < N; i++) {
sum[i + 1] = sum[i] + p[i];
}
... | replace | 12 | 13 | 12 | 13 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
const ll MAXN = 1e5 + 51;
ll cnt, x;
double res, sum;
double prob[MAXN];
inline ll read() {
register ll num = 0, neg = 1;
register char ch = getchar();
while (!isdigit(ch) && ch != '-') {
ch = getchar();
}
if (ch == '-') {
neg = -1;
ch ... | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
const ll MAXN = 5e5 + 51;
ll cnt, x;
double res, sum;
double prob[MAXN];
inline ll read() {
register ll num = 0, neg = 1;
register char ch = getchar();
while (!isdigit(ch) && ch != '-') {
ch = getchar();
}
if (ch == '-') {
neg = -1;
ch ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(), (v).end()
using namespace std;
const double ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(), (v).end()
using namespace std;
const double ... | replace | 30 | 34 | 30 | 36 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using ... | replace | 47 | 51 | 47 | 54 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
double n, k, t;
double ma = 0, ans = 0;
vector<double> p;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> t;
p.push_back... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
double n, k, t;
double ma = 0, ans = 0;
vector<double> p;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> t;
p.push_back... | replace | 19 | 25 | 19 | 26 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
using G = vector<map<int, int>>;
int main() {
int N, K;
cin >> N >> K;
vector<double> arr(N);
rep(i, 0, N) cin >... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
using G = vector<map<int, int>>;
int main() {
int N, K;
cin >> N >> K;
vector<double> arr(N);
rep(i, 0, N) cin >... | replace | 23 | 24 | 23 | 24 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int sum(int n) {
int ans = 0;
if (n == 1)
return 1;
if (n % 2 == 0) {
ans = (1 + n) * n / 2;
} else {
ans = (0 + n) * (n + 1) / 2;
}
return ans;
}
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
vector<double> v(n);
vector<doub... | #include <bits/stdc++.h>
using namespace std;
int sum(int n) {
int ans = 0;
if (n == 1)
return 1;
if (n % 2 == 0) {
ans = (1 + n) * n / 2;
} else {
ans = (0 + n) * (n + 1) / 2;
}
return ans;
}
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
vector<double> v(n + 1);
vector<... | replace | 21 | 23 | 21 | 23 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.