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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
using namespace std;
int D;
int c[27], s[400][27];
int L[27];
int last[27];
long long ANS = 0;
long long ans = 0;
int T[27];
long long test() {
... | #include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
using namespace std;
int D;
int c[27], s[400][27];
int L[27];
int last[27];
long long ANS = 0;
long long ans = 0;
int T[400];
long long test() {
... | replace | 11 | 12 | 11 | 12 | -11 | |
p02618 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <iostream> // cout, endl, cin
#include <math.h> // sqrt
#include <string> // string, to_string, stoi
#include <vector> // vector
using namespace std;
typedef long long ll;
int main() {
ll D;
cin >> D;
vector<ll> c(... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <iostream> // cout, endl, cin
#include <math.h> // sqrt
#include <string> // string, to_string, stoi
#include <vector> // vector
using namespace std;
typedef long long ll;
int main() {
ll D;
cin >> D;
vector<ll> c(... | replace | 40 | 41 | 40 | 46 | 0 | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
int main() {
srand((unsigned)time(NULL));
int d;
int res = 0;
cin >> d;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
int main() {
srand((unsigned)time(NULL));
int d;
int res = 0;
cin >> d;
... | replace | 30 | 31 | 30 | 31 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#pragma warn... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#pragma warn... | replace | 168 | 169 | 168 | 169 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/*==============変数宣言==============*/
int N;
const int M = 26;
int n;
int m = M;
int c[30];
int s[400][30];
void input() {
scanf("%d", &N);
n = N;
for (int i = 0; i < M; i++)
scanf("%d", &c[i]);
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
... | #include <bits/stdc++.h>
using namespace std;
/*==============変数宣言==============*/
int N;
const int M = 26;
int n;
int m = M;
int c[30];
int s[400][30];
void input() {
scanf("%d", &N);
n = N;
for (int i = 0; i < M; i++)
scanf("%d", &c[i]);
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
... | replace | 29 | 30 | 29 | 33 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1... | replace | 36 | 37 | 36 | 37 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | replace | 220 | 221 | 220 | 221 | 0 | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | replace | 252 | 253 | 252 | 253 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define SUM(x) ((x) * (x + 1) / 2)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int D;
cin >> D;
vector<int> c(26);
for (int i = 0; i < 26; i++)
cin >> c[i];
vector<vector<int>> s(D, vector<int>(26));
for (int i = 0; i < D; i++)
for (int... | #include <bits/stdc++.h>
#define SUM(x) ((x) * (x + 1) / 2)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int D;
cin >> D;
vector<int> c(26);
for (int i = 0; i < 26; i++)
cin >> c[i];
vector<vector<int>> s(D, vector<int>(26));
for (int i = 0; i < D; i++)
for (int... | replace | 49 | 50 | 49 | 50 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int D;
cin >> D;
vector<int> c(26);
for (int i = 0; i < 26; i++) {
cin >> c[i];
}
vector<vector<int>> s(D, vector<int>(26... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int D;
cin >> D;
vector<int> c(26);
for (int i = 0; i < 26; i++) {
cin >> c[i];
}
vector<vector<int>> s(D, vector<int>(26... | replace | 33 | 34 | 33 | 34 | TLE | |
p02618 | C++ | Runtime Error | #include <iostream>
#include <iterator>
#include <string>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
using namespace std;
using ll = long long;
int main() {
int D;
cin >> D;
vector<int> C(26);
vector<int> conts(26, 0);
rep(i, 0, 26) {
int c;
cin >> c;
C[i] = c;
}
... | #include <iostream>
#include <iterator>
#include <string>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
using namespace std;
using ll = long long;
int main() {
int D;
cin >> D;
vector<int> C(26);
vector<int> conts(26, 0);
rep(i, 0, 26) {
int c;
cin >> c;
C[i] = c;
}
... | replace | 50 | 51 | 50 | 51 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#ifdef _MSC_VER
#include <intrin... | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#ifdef _MSC_VER
#include <intrin... | replace | 97 | 98 | 97 | 98 | TLE | |
p02618 | C++ | Runtime Error | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#ifdef _MSC_VER
#include <intrin... | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#ifdef _MSC_VER
#include <intrin... | replace | 120 | 132 | 120 | 122 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
vector<pair<int, int>> c(26);
vector<vector<int>> s(D, vector<int>(26));
vector<int> t(D);
cin >> D;
for (int i = 0; i < 26; i++) {
cin >> c.at(i).first;
c.at(i).second = 0;
}
for (int i = 0; i < D; i++) {
for (int j = 0; j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
vector<pair<int, int>> c(26);
vector<vector<int>> s(D, vector<int>(26));
vector<int> t(D);
cin >> D;
for (int i = 0; i < 26; i++) {
cin >> c.at(i).first;
c.at(i).second = 0;
}
for (int i = 0; i < D; i++) {
for (int j = 0; j... | replace | 28 | 29 | 28 | 29 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
vector<pair<int, int>> c(26);
vector<vector<int>> s(D, vector<int>(26));
vector<int> t(D);
for (int i = 0; i < 26; i++) {
cin >> c.at(i).first;
c.at(i).second = 0;
}
for (int i = 0; i < D; i++) {
for (int j = 0; j... | #include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 1; i <= 365; i++) {
cout << rand() % 26 + 1 << endl;
}
} | replace | 4 | 55 | 4 | 6 | TLE | |
p02618 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#define F first
#define S second
using namespace std;
int Q = 1e7, h1, h2, cut = 5;
int n, s, D, l, r, up, mx, cnt, mxx, xx, a[30], b[400][30], la[400], u[400],
ans[400], o[400];
pair<int, int> c[400][... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#define F first
#define S second
using namespace std;
int Q = 1e7, h1, h2, cut = 5;
int n, s, D, l, r, up, mx, cnt, mxx, xx, a[30], b[400][30], la[400], u[400],
ans[400], o[400];
pair<int, int> c[400][... | delete | 23 | 24 | 23 | 23 | -8 | |
p02618 | C++ | Runtime Error | // Copyright 2020 yaito3014
#include <bits/stdc++.h>
int main() {
using namespace std;
cin.tie(nullptr);
ios::sync_with_stdio(false);
using namespace chrono_literals;
chrono::high_resolution_clock clock;
auto be = clock.now();
int D;
cin >> D;
array<int, 26> c;
for (auto &e : c)
cin >> e;
vec... | // Copyright 2020 yaito3014
#include <bits/stdc++.h>
int main() {
using namespace std;
cin.tie(nullptr);
ios::sync_with_stdio(false);
using namespace chrono_literals;
chrono::high_resolution_clock clock;
auto be = clock.now();
int D;
cin >> D;
array<int, 26> c;
for (auto &e : c)
cin >> e;
vec... | delete | 55 | 56 | 55 | 55 | 0 | 28927 |
p02618 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
... | replace | 300 | 301 | 300 | 301 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
// typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
// typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP... | replace | 114 | 115 | 114 | 115 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
#define ll long long
#define double lon... | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
#define ll long long
#define double lon... | replace | 56 | 57 | 56 | 57 | TLE | |
p02618 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | replace | 157 | 159 | 157 | 159 | -8 | |
p02618 | C++ | Time Limit Exceeded | /**
* @brief atcoder
* @author yao
*/
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <utility>
#include <vector>
#define ft first
#define sd second
#ifdef DBG
#define dbg_pri(x...) fprintf(stderr, x)
#e... | /**
* @brief atcoder
* @author yao
*/
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <utility>
#include <vector>
#define ft first
#define sd second
#ifdef DBG
#define dbg_pri(x...) fprintf(stderr, x)
#e... | replace | 30 | 31 | 30 | 31 | TLE | |
p02618 | C++ | Time Limit Exceeded | /**
* @brief atcoder
* @author yao
*/
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <utility>
#include <vector>
#define ft first
#define sd second
#ifdef DBG
#define dbg_pri(x...) fprintf(stderr, x)
#e... | /**
* @brief atcoder
* @author yao
*/
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <utility>
#include <vector>
#define ft first
#define sd second
#ifdef DBG
#define dbg_pri(x...) fprintf(stderr, x)
#e... | replace | 30 | 32 | 30 | 32 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace... | replace | 132 | 133 | 132 | 133 | TLE | |
p02618 | C++ | Time Limit Exceeded | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | replace | 81 | 82 | 81 | 82 | TLE | |
p02618 | C++ | Time Limit Exceeded | #ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
class XorShift {
public:
explicit XorShift(uint64_t x) : state_{x} {}
uint64_t operator()() noexcept { return next(state_); }
private:
... | #ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
class XorShift {
public:
explicit XorShift(uint64_t x) : state_{x} {}
uint64_t operator()() noexcept { return next(state_); }
private:
... | replace | 141 | 142 | 141 | 142 | TLE | |
p02618 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
constexpr int CONTEST = 26;
constexpr int D = 365;
int C[CONTEST];
int S[D + 1][CONTEST];
/////////////////////////////////////////////////////////////////////////
// TIME MANAGEMENT
//////////////////////////////////////////////////////////////... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
constexpr int CONTEST = 26;
constexpr int D = 365;
int C[CONTEST];
int S[D + 1][CONTEST];
/////////////////////////////////////////////////////////////////////////
// TIME MANAGEMENT
//////////////////////////////////////////////////////////////... | replace | 13 | 15 | 13 | 15 | TLE | |
p02618 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
constexpr int CONTEST = 26;
constexpr int D = 365;
int C[CONTEST];
int S[D + 1][CONTEST];
/////////////////////////////////////////////////////////////////////////
// TIME MANAGEMENT
//////////////////////////////////////////////////////////////... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
constexpr int CONTEST = 26;
constexpr int D = 365;
int C[CONTEST];
int S[D + 1][CONTEST];
/////////////////////////////////////////////////////////////////////////
// TIME MANAGEMENT
//////////////////////////////////////////////////////////////... | replace | 14 | 16 | 14 | 16 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(... | replace | 104 | 105 | 104 | 105 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | replace | 108 | 109 | 108 | 109 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int D = 365;
int csum;
int c[26];
int s[D][26];
int last[26];
set<int> se[26];
int ans[D];
int cur_score;
int score() {
memset(last, -1, sizeof(last));
int sum = 0... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int D = 365;
int csum;
int c[26];
int s[D][26];
int last[26];
set<int> se[26];
int ans[D];
int cur_score;
int score() {
memset(last, -1, sizeof(last));
int sum = 0... | replace | 74 | 75 | 74 | 75 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1e9;
int main() {
srand(0);
// input
constexpr int n = 26;
int d;
cin >> d;
vector<int> c(n);
for (auto &e : c)
cin >> e;
vector<vector<int>> s(d, vector<int>(n));
for (auto &se : s) {
for (auto &e : se)
cin >> e;
}
... | #include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1e9;
int main() {
srand(0);
// input
constexpr int n = 26;
int d;
cin >> d;
vector<int> c(n);
for (auto &e : c)
cin >> e;
vector<vector<int>> s(d, vector<int>(n));
for (auto &se : s) {
for (auto &e : se)
cin >> e;
}
... | replace | 68 | 69 | 68 | 69 | TLE | |
p02618 | C++ | Time Limit Exceeded | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::num... | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::num... | replace | 93 | 94 | 93 | 94 | TLE | |
p02618 | C++ | Time Limit Exceeded | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::num... | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::num... | replace | 105 | 106 | 105 | 107 | TLE | |
p02618 | C++ | Time Limit Exceeded | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int D = 365;
const int beam = 240;
int c[26];
int s[D][26];
int ans[D];
struct State {
ll val = 0;
int out[D] = {0};
int cnt[26] = {0};
};
bool oper... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int D = 365;
const int beam = 230;
int c[26];
int s[D][26];
int ans[D];
struct State {
ll val = 0;
int out[D] = {0};
int cnt[26] = {0};
};
bool oper... | replace | 7 | 8 | 7 | 8 | TLE | |
p02618 | C++ | Time Limit Exceeded | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
constexpr int D = 365;
constexpr int beam = 270;
int c[26];
int s[D][26];
int ans[D];
struct State {
int val = 0;
int out[D] = {0};
int cnt[26] = {0};
};
constexpr bool ope... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
constexpr int D = 365;
constexpr int beam = 260;
int c[26];
int s[D][26];
int ans[D];
struct State {
int val = 0;
int out[D] = {0};
int cnt[26] = {0};
};
constexpr bool ope... | replace | 6 | 7 | 6 | 7 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int d, score, i, j, k, pscore, cscore, id;
int c[26], s[365][26], last[26], t[365];
int day1, day2, v1, v2, csize, f, check[4];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> d;
for (i = 0; i < 26; i++) {
cin >> c[i];
}
for (i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int d, score, i, j, k, pscore, cscore, id;
int c[26], s[365][26], last[26], t[365];
int day1, day2, v1, v2, csize, f, check[4];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> d;
for (i = 0; i < 26; i++) {
cin >> c[i];
}
for (i = 0; i < ... | replace | 55 | 56 | 55 | 56 | 0 | |
p02618 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define repr(e, x) f... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define repr(e, x) f... | replace | 36 | 37 | 36 | 37 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define PI acos(-1)
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
template <typename T> using v2 = vector<vector<T>>;
template <typename T> using v3 = vector<vector<vector<T>>>;
template <class T> istre... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define PI acos(-1)
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
template <typename T> using v2 = vector<vector<T>>;
template <typename T> using v3 = vector<vector<vector<T>>>;
template <class T> istre... | replace | 117 | 118 | 117 | 118 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define drep(i, cc, n) for (int i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define drrep(i, cc, n) for (int i = (cc); i >= (n); --i)
#define rrep(i, n) drrep(i, 0, n - 1)
#define sz(s) (int)(s.size())
#define vecprint(v) ... | #include <bits/stdc++.h>
#define drep(i, cc, n) for (int i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define drrep(i, cc, n) for (int i = (cc); i >= (n); --i)
#define rrep(i, n) drrep(i, 0, n - 1)
#define sz(s) (int)(s.size())
#define vecprint(v) ... | replace | 67 | 68 | 67 | 68 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
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;
}
using namespace s... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
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;
}
using namespace s... | replace | 38 | 39 | 38 | 39 | TLE | |
p02618 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <complex>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <new>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <complex>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <new>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>... | replace | 294 | 295 | 294 | 295 | TLE | |
p02618 | C++ | Time Limit Exceeded | // 山登り法しか思いつかない
#include <bits/stdc++.h>
using namespace std;
int D;
int res[365]; // 解答
long long c[26];
long long s[365][26];
long long evaluate() {
static int LatestProb[26];
long long score = 0;
memset(LatestProb, -1, sizeof(LatestProb));
for (int d = 0; d < D; ++d) {
score += s[d][res[d]];
Latest... | // 山登り法しか思いつかない
#include <bits/stdc++.h>
using namespace std;
int D;
int res[365]; // 解答
long long c[26];
long long s[365][26];
long long evaluate() {
static int LatestProb[26];
long long score = 0;
memset(LatestProb, -1, sizeof(LatestProb));
for (int d = 0; d < D; ++d) {
score += s[d][res[d]];
Latest... | replace | 46 | 47 | 46 | 47 | TLE | |
p02618 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
ll D;
cin >> D;
ll N = 26;
vector<ll> c(N);
for (ll ii = 0; ii < N; ++ii) {
cin >> c[ii];
}
vector<vector<ll>> s(D, vector<ll>(N));
for (ll ii = 0; ii < D;... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
ll D;
cin >> D;
ll N = 26;
vector<ll> c(N);
for (ll ii = 0; ii < N; ++ii) {
cin >> c[ii];
}
vector<vector<ll>> s(D, vector<ll>(N));
for (ll ii = 0; ii < D;... | replace | 48 | 49 | 48 | 49 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int F = 26;
const int def = 1e6;
int n;
vector<int> c(F);
vector<vector<int>> a;
void init() {
cin >> n;
a.resize(n, vector<int>(F));
for (int i = 0; i < F; i++)
cin >> c[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < F; j... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int F = 26;
const int def = 1e6;
int n;
vector<int> c(F);
vector<vector<int>> a;
void init() {
cin >> n;
a.resize(n, vector<int>(F));
for (int i = 0; i < F; i++)
cin >> c[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < F; j... | replace | 54 | 55 | 54 | 55 | -8 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr char newl = '\n';
constexpr double ticks_per_sec = 2800000000;
constexpr double ticks_per_sec_inv = 1.0 / ticks_per_sec;
inline double rdtsc() { // in seconds
uint32_t lo, hi;
asm volatile("rdtsc" : "=a"(lo), "=d"(hi));
return (((ui... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr char newl = '\n';
constexpr double ticks_per_sec = 2800000000;
constexpr double ticks_per_sec_inv = 1.0 / ticks_per_sec;
inline double rdtsc() { // in seconds
uint32_t lo, hi;
asm volatile("rdtsc" : "=a"(lo), "=d"(hi));
return (((ui... | replace | 139 | 140 | 139 | 140 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
mt19937 rng(time(NULL));
const int D = 365, N = 26;
int d;
ll c[N + 1];
ll s[D + 1][N + 1];
ll last[N];
int contest[D];
ll calc(int idx, int x) {
ll ans = 0;
ll l = idx - 1, r = idx + 1;
ll len, len2;
while (l > 0 && contest[l] != contest[idx... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
mt19937 rng(time(NULL));
const int D = 365, N = 26;
int d;
ll c[N + 1];
ll s[D + 1][N + 1];
ll last[N];
int contest[D];
ll calc(int idx, int x) {
ll ans = 0;
ll l = idx - 1, r = idx + 1;
ll len, len2;
while (l > 0 && contest[l] != contest[idx... | replace | 69 | 70 | 69 | 70 | -11 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
class xor_shift_128 {
public:
typedef uint32_t result_type;
explicit xor_shift_128(uint32_t seed = 42) { set_seed(seed); }
void set_seed(uint32_t seed) {
a = seed = 1812433253u * (seed ^ (seed >> 30));
b = seed = 1812433253u * (seed ^ (seed >> 30)) + 1;
... | #include <bits/stdc++.h>
using namespace std;
class xor_shift_128 {
public:
typedef uint32_t result_type;
explicit xor_shift_128(uint32_t seed = 42) { set_seed(seed); }
void set_seed(uint32_t seed) {
a = seed = 1812433253u * (seed ^ (seed >> 30));
b = seed = 1812433253u * (seed ^ (seed >> 30)) + 1;
... | replace | 98 | 145 | 98 | 140 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#in... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#in... | replace | 351 | 352 | 351 | 352 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (int i = 0; i < int(n); i++)
#define N 11500
int a[N][27];... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (int i = 0; i < int(n); i++)
#define N 10500
int a[N][27];... | replace | 14 | 15 | 14 | 15 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (int i = 0; i < int(n); i++)
#define N 2750
int a[N][27];
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (int i = 0; i < int(n); i++)
#define N 2600
int a[N][27];
... | replace | 14 | 15 | 14 | 15 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <utility>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
template <... | #include <bits/stdc++.h>
#include <utility>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
template <... | replace | 196 | 197 | 196 | 197 | TLE | |
p02618 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3", "unroll-loops", "omit-frame-pointer", \
"inline") // Optimization flags
#pragma GCC option("arch=native", "tune=native", "no-zero-upper") // Enable AVX
#pragma GCC target("avx") // Enable AVX
#include <bits/stdc++.h>
u... | #pragma GCC optimize("O3", "unroll-loops", "omit-frame-pointer", \
"inline") // Optimization flags
#pragma GCC option("arch=native", "tune=native", "no-zero-upper") // Enable AVX
#pragma GCC target("avx") // Enable AVX
#include <bits/stdc++.h>
u... | replace | 15 | 16 | 15 | 16 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector... | replace | 405 | 406 | 405 | 406 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
template <class T>
using reverse_priority_queue = priority_queue<T, vector<T>, gre... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
template <class T>
using reverse_priority_queue = priority_queue<T, vector<T>, gre... | replace | 382 | 383 | 382 | 383 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) ((... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) ((... | replace | 118 | 119 | 118 | 119 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define M 998244353
#define INF 1e16
typedef long long... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define M 998244353
#define INF 1e16
typedef long long... | replace | 78 | 79 | 78 | 79 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
int N, D;
vector<int> C;
vector<vector<int>> S;
vector<int> ans;
void Read(bool local = false) {
N = 26;
if (local) {
D = 365;
} else {
cin >> D;
}
C.resize(N);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
int N, D;
vector<int> C;
vector<vector<int>> S;
vector<int> ans;
void Read(bool local = false) {
N = 26;
if (local) {
D = 365;
} else {
cin >> D;
}
C.resize(N);
for (int i ... | replace | 118 | 119 | 118 | 119 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template <class T> using VE = vector<T>;
template <class T> using P = pair<T, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template <class T> using VE = vector<T>;
template <class T> using P = pair<T, ... | replace | 40 | 41 | 40 | 41 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#defin... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#defin... | replace | 141 | 148 | 141 | 142 | TLE | |
p02618 | C++ | Time Limit Exceeded | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <ioma... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <ioma... | replace | 137 | 138 | 137 | 138 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <cstdlib>
#include <ctime>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll d, c[26], s[365][26], t[365], ans = 0, m, x, y, v;
set<ll> se[26];
srand(time(NULL));
cin >> d;
for (int i = 0; i < 26; i++) {
cin >> c[i];
se[i].insert(... | #include <cstdlib>
#include <ctime>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll d, c[26], s[365][26], t[365], ans = 0, m, x, y, v;
set<ll> se[26];
srand(time(NULL));
cin >> d;
for (int i = 0; i < 26; i++) {
cin >> c[i];
se[i].insert(... | replace | 34 | 36 | 34 | 36 | TLE | |
p02618 | C++ | Time Limit Exceeded | const int isDebugMode = 1;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1,... | const int isDebugMode = 1;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1,... | replace | 161 | 162 | 161 | 162 | TLE | |
p02618 | C++ | Time Limit Exceeded | #if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#inclu... | #if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#inclu... | replace | 170 | 171 | 170 | 171 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int d, ans[365], c[26], s[365][26], last[26], tlast[26];
const int INF = 1e9;
#define REP(i, n) for (int i = 0; i < n; i++)
void FIN(int a) {
if (a) {
ofstream fout("output.txt");
REP(i, d) fout << ans[i] << "\n";
fout.close();
return;
}
REP(i, d) c... | #include <bits/stdc++.h>
using namespace std;
int d, ans[365], c[26], s[365][26], last[26], tlast[26];
const int INF = 1e9;
#define REP(i, n) for (int i = 0; i < n; i++)
void FIN(int a) {
if (a) {
ofstream fout("output.txt");
REP(i, d) fout << ans[i] << "\n";
fout.close();
return;
}
REP(i, d) c... | replace | 61 | 62 | 61 | 62 | TLE | |
p02618 | C++ | Runtime Error | /*/ Author: kal013 /*/
/*/ Author: kal013 /*/
// #pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_o... | /*/ Author: kal013 /*/
/*/ Author: kal013 /*/
// #pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_o... | replace | 195 | 196 | 195 | 196 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | replace | 227 | 228 | 227 | 228 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
int cd = 350000;
int d, c[26], s[366][26];
int t[366];
ll r;
void init() {
cin >> d;
REP(i, 26) cin >> c[i];
REP(i, d) REP(j, 26) cin >> s[i][j];
}
void greedy... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
int cd = 20000;
int d, c[26], s[366][26];
int t[366];
ll r;
void init() {
cin >> d;
REP(i, 26) cin >> c[i];
REP(i, d) REP(j, 26) cin >> s[i][j];
}
void greedy(... | replace | 6 | 7 | 6 | 7 | TLE | |
p02618 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime> //時間を測ります
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random> //乱択します
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime> //時間を測ります
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random> //乱択します
#inc... | delete | 103 | 111 | 103 | 103 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime> //時間を測ります
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random> //乱択します
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime> //時間を測ります
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random> //乱択します
#inc... | replace | 25 | 26 | 25 | 26 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <time.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n, m) for (int i = (n); i <= (m); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int d;
int c[26];
int s[365][26];
map<int, int> exist[26];
int sum[2... | #include <bits/stdc++.h>
#include <time.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n, m) for (int i = (n); i <= (m); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int d;
int c[26];
int s[365][26];
map<int, int> exist[26];
int sum[2... | replace | 114 | 115 | 114 | 115 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#... | replace | 54 | 55 | 54 | 55 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#... | replace | 54 | 55 | 54 | 55 | TLE | |
p02618 | Python | Time Limit Exceeded | import numpy as np
def solve_greedy(dd, c_arr, s_arr):
missing_d = np.zeros(26, dtype=np.int64)
score = 0
res_list = []
for d in range(dd):
missing_d += 1
score_add = s_arr[d, :]
score_miss = c_arr * missing_d
t = np.argmax(score_add + score_miss)
score += sc... | import numpy as np
def solve_greedy(dd, c_arr, s_arr):
missing_d = np.zeros(26, dtype=np.int64)
score = 0
res_list = []
for d in range(dd):
missing_d += 1
score_add = s_arr[d, :]
score_miss = c_arr * missing_d
t = np.argmax(score_add + score_miss)
score += sc... | replace | 38 | 39 | 38 | 39 | TLE | |
p02618 | Python | Time Limit Exceeded | import os
import sys
import numpy as np
def solve(inp):
def bitree_sum(bit, t, i):
s = 0
while i > 0:
s += bit[t, i]
i ^= i & -i
return s
def bitree_add(bit, n, t, i, x):
while i <= n:
bit[t, i] += x
i += i & -i
def bitree_... | import os
import sys
import numpy as np
def solve(inp):
def bitree_sum(bit, t, i):
s = 0
while i > 0:
s += bit[t, i]
i ^= i & -i
return s
def bitree_add(bit, n, t, i, x):
while i <= n:
bit[t, i] += x
i += i & -i
def bitree_... | replace | 82 | 83 | 82 | 83 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
int D, c[27], s[366][27];
int sco(vector<int> &t, int k, int x) {
int S = 0, L[27] = {};
REP(i, D) {
if (i == k) {
S += s[i][x];
L[x] = i;
} else {
S += s[i][t[i]];
L[t[i]] = i;
}
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
int D, c[27], s[366][27];
int sco(vector<int> &t, int k, int x) {
int S = 0, L[27] = {};
REP(i, D) {
if (i == k) {
S += s[i][x];
L[x] = i;
} else {
S += s[i][t[i]];
L[t[i]] = i;
}
... | replace | 56 | 57 | 56 | 57 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
int D, c[27], s[366][27];
int sco(vector<int> &t, int k, int x) {
int S = 0, L[27] = {};
REP(i, D) {
if (i == k) {
S += s[i][x];
L[x] = i;
} else {
S += s[i][t[i]];
L[t[i]] = i;
}
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
int D, c[27], s[366][27];
int sco(vector<int> &t, int k, int x) {
int S = 0, L[27] = {};
REP(i, D) {
if (i == k) {
S += s[i][x];
L[x] = i;
} else {
S += s[i][t[i]];
L[t[i]] = i;
}
... | replace | 56 | 57 | 56 | 57 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | replace | 56 | 57 | 56 | 57 | TLE | |
p02618 | C++ | Time Limit Exceeded | #define DEBUG
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#include <cstdio>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
#define Vec vector
#define V2 vector<vector<ll>>
cla... | #define DEBUG
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#include <cstdio>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
#define Vec vector
#define V2 vector<vector<ll>>
cla... | replace | 330 | 331 | 330 | 331 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define repi(n) for (int i = 0; i < (n); i++)
#define repj(n) for (int j = 0; j < (n); j++)
#define repk(n) for (int k = 0; k < (n); k++)
#define repl(n) for (int l = 0; l < (n); l++)
#define rep(i, n) for (int i = 0; (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define repi(n) for (int i = 0; i < (n); i++)
#define repj(n) for (int j = 0; j < (n); j++)
#define repk(n) for (int k = 0; k < (n); k++)
#define repl(n) for (int l = 0; l < (n); l++)
#define rep(i, n) for (int i = 0; (... | replace | 140 | 142 | 140 | 142 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int D = 365, T = 26;
vector<int> c(T);
vector<vector<int>> s(D, vector<int>(T));
vector<vector<int>> pena(T, vector<int>(D + 2));
class Timer {
private:
chrono::high_resolution_clock::time_point start;
public:
Timer() { reset(); }
void reset() { start = chro... | #include <bits/stdc++.h>
using namespace std;
const int D = 365, T = 26;
vector<int> c(T);
vector<vector<int>> s(D, vector<int>(T));
vector<vector<int>> pena(T, vector<int>(D + 2));
class Timer {
private:
chrono::high_resolution_clock::time_point start;
public:
Timer() { reset(); }
void reset() { start = chro... | replace | 90 | 92 | 90 | 92 | -11 | -91330615
|
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define outve(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define outve(v) \
for (auto i : v) ... | replace | 76 | 77 | 76 | 77 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<vi> vvi;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<vi> vvi;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#de... | replace | 227 | 228 | 227 | 228 | -11 | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll d;
cin >> d;
vector<ll> c(26);
for (ll i = 0; i < 26; ++i) {
cin >> c[i];
}
vector<vector<ll>> s(d, vector<ll>(26));
for (ll i = 0; i < d; ++i) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll d;
cin >> d;
vector<ll> c(26);
for (ll i = 0; i < 26; ++i) {
cin >> c[i];
}
vector<vector<ll>> s(d, vector<ll>(26));
for (ll i = 0; i < d; ++i) {... | replace | 76 | 77 | 76 | 77 | 0 | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
// int n=0;//
cin >> d;
int c[26];
int s[d][26];
for (int i = 0; i < 26; i++) {
cin >> c[i];
// n+=c[i];//
}
for (int i = 0; i < d; i++) {
for (int ii = 0; ii < 26; ii++) {
cin >> s[i][ii];
}
}
long long int la[2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
// int n=0;//
cin >> d;
int c[26];
int s[d][26];
for (int i = 0; i < 26; i++) {
cin >> c[i];
// n+=c[i];//
}
for (int i = 0; i < d; i++) {
for (int ii = 0; ii < 26; ii++) {
cin >> s[i][ii];
}
}
long long int la[d... | replace | 17 | 18 | 17 | 18 | 0 | |
p02618 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/time.h>
#include <vector>
#define R... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/time.h>
#include <vector>
#define R... | replace | 156 | 177 | 156 | 157 | 0 | |
p02618 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int D;
scanf("%d", &D);
int c[26], s[D][26], last[26], ans[D];
for (int i = 0; i < 26; ++i)
scanf("%d", &c[i]);
for (int i = 0; i < D; ++i) {
for (int j = 0; j < 26; ++j)
scanf("%d", &s[i][j]);
}
fill_n(last, 26, -1);
... | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int D;
scanf("%d", &D);
int c[26], s[D][26], last[26], ans[D];
for (int i = 0; i < 26; ++i)
scanf("%d", &c[i]);
for (int i = 0; i < D; ++i) {
for (int j = 0; j < 26; ++j)
scanf("%d", &s[i][j]);
}
fill_n(last, 26, -1);
... | replace | 18 | 19 | 18 | 19 | 0 | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | replace | 102 | 103 | 102 | 103 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define ll long long
#define umap unordered_map
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
#define oorret true // std::out_of_r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define ll long long
#define umap unordered_map
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
#define oorret true // std::out_of_r... | replace | 182 | 183 | 182 | 183 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define ll long long
#define umap unordered_map
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
#define oorret true // std::out_of_r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define ll long long
#define umap unordered_map
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
#define oorret true // std::out_of_r... | replace | 99 | 100 | 99 | 100 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define ll long long
#define umap unordered_map
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
#define oorret true // std::out_of_r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define ll long long
#define umap unordered_map
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
#define oorret true // std::out_of_r... | replace | 99 | 102 | 99 | 102 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using ll = long long;
vector<int> c;
vector<vector<int>> s;
int D;
vector<int> v;
vector<set<int>> U;
vector<set<int>> minusU;
int now;
ll calc() {
ll ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using ll = long long;
vector<int> c;
vector<vector<int>> s;
int D;
vector<int> v;
vector<set<int>> U;
vector<set<int>> minusU;
int now;
ll calc() {
ll ... | replace | 91 | 92 | 91 | 92 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using ll = long long;
vector<int> c;
vector<vector<int>> s;
int D;
vector<int> v;
vector<set<int>> U;
ll calc() {
ll ans = 0;
vector<int> last(26, 0)... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using ll = long long;
vector<int> c;
vector<vector<int>> s;
int D;
vector<int> v;
vector<set<int>> U;
ll calc() {
ll ans = 0;
vector<int> last(26, 0)... | replace | 57 | 58 | 57 | 58 | TLE | |
p02618 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
const int INF = 2e9;
// const ll INF = 9e18;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int D;
cin >> D;
vector<int> c(26);
for (int i = 0; i < 26; i++)
cin >> c[i];
vector<vector<int>> s(D, ve... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
const int INF = 2e9;
// const ll INF = 9e18;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int D;
cin >> D;
vector<int> c(26);
for (int i = 0; i < 26; i++)
cin >> c[i];
vector<vector<int>> s(D, ve... | replace | 52 | 54 | 52 | 54 | -8 | |
p02618 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | replace | 61 | 62 | 61 | 66 | TLE | |
p02618 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | replace | 109 | 110 | 109 | 110 | TLE | |
p02619 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define per(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#define ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define per(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#define ... | replace | 30 | 31 | 30 | 31 | 0 | |
p02619 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | #include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | replace | 54 | 55 | 54 | 55 | -11 | |
p02619 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
// #define _GLIBCXX_DEBUG
signed main() {
int D;
cin >> D;
vector<int> c(26);
re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
// #define _GLIBCXX_DEBUG
signed main() {
int D;
cin >> D;
vector<int> c(26);
re... | replace | 16 | 17 | 16 | 17 | 0 | |
p02619 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll D;
cin >> D;
vector<ll> c(26), t(26), last(26, -1);
vector<vector<ll>> s(365, vector<ll>(26));
rep(i, 0, 26) cin >> c[i];
rep(i, 0, D) { rep(j, 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll D;
cin >> D;
vector<ll> c(26), t(D), last(26, -1);
vector<vector<ll>> s(365, vector<ll>(26));
rep(i, 0, 26) cin >> c[i];
rep(i, 0, D) { rep(j, 0,... | replace | 8 | 9 | 8 | 9 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.