#include <algorithm>
#include <stack>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define per(i,n) for(int i=n-1;i>=0;--i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define rng(i, a, b) for(int i=a; i<b; i++)
#define gnr(i,a,b) for(int i=b-1;i>=a;--i)
#define vb vector<bool>
#define vi vector<int>
#define vl vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vvb vector<vb>
#define vvi vector<vi>
#define vvl vector<vl>
#define vvc vector<vc>
#define si unordered_set<int>
#define sl unordered_set<ll>
#define tsi set<int>
#define tsl set<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpii vector<pii>
#define vpll vector<pll>
#define tmii map<int, int>
#define tmll map<ll, ll>
#define mii unordered_map<int, int>
#define mll unordered_map<ll, ll>
#define pqi priority_queue<int>
#define pqig priority_queue<int, vi, greater<int>>
#define pql priority_queue<ll>
#define pqlg priority_queue<ll, vl, greater<ll>>
#define pqpii priority_queue<pii>
#define pqpll priority_queue<pll>
#define pqip priority_queue<pair<int, pair<int, int>>>
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define ld long double
#define nl '\n'
#define sp ' '
#define fi first
#define se second
#define mpr make_pair
#define nout(n) cout << n << '\n'
#define sout(n) cout << n << ' '
using namespace std;
/* ありがとう、神様、あなたはとても素晴らしく 、とても優しいです！*/
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x << sp; use_(x); cerr << nl;
#else
#define debug(x)
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_order_statistics_node_update>
mordered_set;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
// customHash working with UMP
struct hsh {
size_t operator()(const pair<ll,ll> &p) const {
return p.first * 239 + p.second; //you could change 239 to 1e9+1
}
};
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
template <typename T, typename V>
T rangeBitwiseAnd(T left, V right) {
T res = 0;
int cnt = 0; for(; left >= (1ll<<cnt); cnt++){}
if(1ll<<cnt <= right) return 0;
if(left==right) return left;
res += 1ll<<(--cnt);
left -= 1ll<<(cnt); right -= 1ll<<cnt;
return res + rangeBitwiseAnd(left, right);
}
int dx[]={0,0,1,-1,1,1,-1,-1};
int dy[]={1,-1,0,0,1,-1,1,-1};
int kx[]={1, 1, -1, -1, 2, 2, -2, -2};
int ky[]={2, -2, 2, -2, 1, -1, 1, -1};
set<char> vowels{'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'};
bool chkpalin(string s) {
rep(i, sz(s)/2) {
if(s[i] != s[sz(s)-i-1]) return false;
}
return true;
}
map<char, vector<char>> phone_keypad{
{'2', {'a', 'b', 'c'}},
{'3', {'d', 'e', 'f'}},
{'4', {'g', 'h', 'i'}},
{'5', {'j', 'k', 'l'}},
{'6', {'m', 'n', 'o'}},
{'7', {'p', 'q', 'r', 's'}},
{'8', {'t', 'u', 'v'}},
{'9', {'w', 'x', 'y', 'z'}}
};
vi generate_primes(int N) {
vi x(N+10, 1), primes;
x[0] = x[1] = 0;
rng(i, 2, N + 5) {
if(!x[i]) continue;
for(int j=i+i; j<N+5; j+=i) x[j] = 0;
}
rep(i, N+10) {
if(x[i]) primes.pb(i);
}
return primes;
}
void yesnoc(bool a) {cout << (a? "YES\n": "NO\n");}
void yesnos(bool a) {cout << (a? "Yes\n": "No\n");}
/*
アンドロイド18を愛しています
░░▒▒░░░░░░
░░░░░░░░░░░░░░▒▒░░
░░▒▒░░░░░░░░░░░░▒▒▓▓░░▒▒
░░░░▒▒░░░░░░░░ ░░▒▒▓▓░░▒▒
░░░░░░▒▒░░░░░░░░ ░░▒▒▓▓░░▒▒
▒▒▒▒░░░░░░░░░░░░░░░░░░▓▓▒▒░░░░
░░▒▒░░ ░░░░▒▒░░░░░░▒▒▓▓▒▒▒▒░░
░░ ░░▒▒▒▒▒▒ ▓▓▒▒▒▒░░░░▓▓▒▒▒▒░░
░░░░░░ ░░ ░░▓▓░░ ░░▒▒░░▒▒░░▒▒░░░░
░░░░░░░░ ░░░░ ▓▓░░ ░░ ░░▒▒▒▒▒▒ ▒▒░░░░
░░░░░░░░░░ ░░ ▒▒▒▒ ▒▒▓▓░░ ▒▒░░░░
░░░░░░ ░░░░ ░░░░ ▒▒▒▒▒▒▓▓░░░░░░▓▓ ▒▒▒▒░░░░
░░░░░░░░ ▒▒ ░░░░▒▒░░░░░░░░▒▒░░░░ ▒▒▒▒░░▒▒
░░░░░░░░░░░░▒▒ ░░░░░░░░░░░░░░ ░░▒▒░░▒▒
▒▒▓▓░░░░░░░░░░░░░░░░ ░░▒▒░░░░
▒▒▒▒░░░░ ░░░░░░▒▒░░ ░░░░░░▒▒░░░░░░
░░▒▒▒▒▒▒▓▓▒▒ ░░░░ ▒▒░░░░░░░░▒▒░░░░░░
▒▒▒▒▒▒▒▒░░▓▓▒▒░░ ▒▒░░░░░░░░▒▒░░░░▒▒
░░▒▒▒▒▒▒▒▒░░░░▓▓ ░░░░░░░░░░░░▒▒░░▒▒▒▒
▒▒▒▒▒▒▒▒▒▒░░░░ ░░░░ ░░▒▒░░▒▒▒▒
░░░░▒▒▒▒▒▒░░ ▒▒░░░░ ░░ ░░▒▒░░▒▒▒▒
▒▒░░▒▒▒▒░░ ░░▒▒▒▒░░ ░░ ░░▒▒▒▒▒▒░░
▒▒▒▒▒▒ ░░░░ ░░▓▓▒▒ ░░ ▒▒▒▒▒▒▒▒░░
░░░░ ░░░░ ░░░░░░▒▒ ▒▒▒▒▒▒▒▒░░
░░░░ ▒▒▓▓░░░░░░░░░░ ▒▒ ▒▒▒▒▒▒▒▒░░
▒▒░░▒▒▒▒▓▓ ░░░░ ░░ ░░ ▒▒▒▒▒▒░░░░
░░▒▒▒▒▒▒▓▓ ░░░░ ▓▓▒▒▒▒░░▒▒
░░▒▒▒▒▒▒▒▒▒▒░░░░░░ ░░ ▒▒▒▒▒▒ ▒▒
░░▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░ ░░░░▒▒░░░░▒▒▒▒▒▒ ░░
▒▒▒▒▒▒▒▒▒▒▒▒████████████████████████▒▒▒▒▒▒░░ ░░
░░▒▒▒▒▓▓▒▒▓▓████████████████████▓▓██▓▓▓▓▒▒▒▒ ░░
▒▒▒▒▓▓▒▒▒▒▓▓▓▓██▓▓████▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▒▒ ░░
▒▒▒▒▓▓▒▒▓▓██▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▒▒ ▒▒
▒▒▓▓▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒ ▒▒
▒▒▒▒░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██ ░░
▓▓▒▒ ▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓░░
░░▓▓▒▒░░▓▓▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▓▓ ▒▒
░░▓▓░░▒▒▓▓░░ ░░░░░░░░▒▒▒▒░░░░▒▒░░░░░░░░░░▒▒ ░░
░░▓▓░░▓▓▒▒ ░░░░░░░░░░ ░░░░░░░░░░░░░░
░░▒▒ ▓▓▒▒ ░░░░░░░░░░ ░░░░░░░░░░ ░░
░░▒▒░░▓▓▒▒ ░░░░░░░░░░ ░░░░░░ ░░
░░▒▒░░▒▒░░ ░░░░░░░░░░ ░░░░ ░░
▒▒ ▒▒ ░░░░░░░░░░ ░░
▒▒░░▒▒ ░░░░░░░░ ░░
▒▒░░▒▒ ░░░░░░░░ ░░
░░░░░░ ░░░░░░░░ ░░░░
░░░░ ░░ ░░░░ ░░░░
░░ ░░ ░░ ▒▒░░ ░░
░░ ░░░░░░░░ ░░░░ ░░
░░░░░░░░ ░░░░░░░░
░░░░░░░░ ░░ ░░░░ ░░
░░░░░░░░ ░░ ░░░░
░░░░░░ ░░ ░░░░
▒▒░░ ░░░░ ░░░░ ░░
▓▓██████ ▒▒▒▒██▓▓
██████▒▒ ▓▓████▓▓
██████░░ ░░██████
██████ ██████
░░████▓▓ ▓▓████
░░████░░ ▒▒████░░
▒▒████ ████▓▓
░░░░░░░░░░░░░░░░░░ ████▓▓ ██████
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░ ░░░░▓▓▓▓▓▓ ▓▓██▓▓░░
░░░░ ░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▓▓▓▓▒▒░░░░ ▒▒▓▓▓▓░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░▓▓▒▒░░░░░░ ░░▒▒▒▒▒▒
░░░░░░░░░░░░░░░░░░░░░░░░▓▓░░░░▓▓▓▓░░░░ ▓▓▒▒░░▓▓
░░░░ ░░░░▒▒▒▒▒▒▓▓██▒▒ ░░░░░░░░░░░░░░░░░░░░░░ ▓▓▒▒▒▒▓▓
██▓▓▓▓▓▓▓▓ ░░░░▒▒▓▓▓▓▓▓██
░░░░░░░░░░ ▒▒▒▒▒▒▒▒░░
░░░░░░░░ ░░░░░░░░░░
*/
// debug デバッグ
void use_(ll W) {cerr << W;}
void use_(ld W) {cerr << W;}
void use_(char W) {cerr << W;}
void use_(string W) {cerr << W;}
void use_(int W) {cerr << W;}
void use_(double W) {cerr << W;}
template<typename T, typename V> void use_(pair<T, V> p) {cerr << "["; use_(p.fi); cerr << ','; use_(p.se); cerr << ']';}
template<typename T> void use_(vector<T> a) {cerr << '['; for(T i: a) { use_(i); cerr << sp;} cerr << ']'; cerr << nl;}
template<typename T> void use_(set<T> a) {cerr << '['; for(T i: a) { use_(i); cerr << sp;} cerr << ']'; cerr << nl;}
template<typename T> void use_(multiset<T> ms) {cerr << '['; for(T i: ms) { use_(i); cerr << sp;} cerr << ']'; cerr << nl;}
template<typename T, typename V> void use_(map<T, V> mp) {cerr << '['; for(auto x: mp) { use_(x.fi); cerr << ','; use_(x.se); cerr << sp;} cerr << ']'; cerr << nl;}
#define trace1(x) cerr << #x << ": " << (x) << nl;
#define trace2(x, y) cerr << #x << ": " << (x) << " | " << #y << ": " << (y) << nl;
#define trace3(x, y, z) cerr << #x << ": " << (x) << " | " << #y << ": " << (y) << " | " << #z << ": " << (z) << nl;
#define trace4(a, b, c, d) cerr << #a << ": " << (a) << " | " << #b << ": " << (b) << " | " << #c << ": " << (c) << " | " << #d << ": " << (d) << nl;
#define trace5(a, b, c, d, e) cerr << #a << ": " << (a) << " | " << #b << ": " << (b) << " | " << #c << ": " << (c) << " | " << #d << ": " << (d) << " | " << #e << ": " << (e) << nl;
#define trace6(a, b, c, d, e, f) cerr << #a << ": " << (a) << " | " << #b << ": " << (b) << " | " << #c << ": " << (c) << " | " << #d << ": " << (d) << " | " << #e << ": " << (e) << " | " << #f << ": " << (f) << nl;
// read 読む
template<typename T> vector<vector<T>> RG(T n, T m) {vector<vector<T>> g(n);rep(i, m) {int u, v; cin >> u >> v;g[--u].pb(--v); g[v].pb(u);}return g;}
template<typename T> vector<vector<T>> RDG(T n, T m) {vector<vector<T>> g(n);rep(i, m) {int u, v; cin >> u >> v;g[--u].pb(--v);}return g;}
template<typename T> vector<vector<pair<T, T>>> RGW(T n, T m) {vector<vector<pair<T, T>>> g(n);rep(i, m) {int u, v, w; cin >> u >> v >> w;g[--u].pb({--v, w});g[v].pb({u, w});}return g;}
template<typename T> vector<T> R(T n) {vector<T> a(n);rep(i, n) cin >> a[i];return a;}
// Print 印刷する
template<typename T> void printa(vector<T> &A) { for(auto &x: A) { cout << x << ' ';}cout << '\n';}
template<typename T> void printa2(vector<vector<T>> &A) {for(auto x: A) {for(auto y: x) {cout << y << ' ';}cout << '\n';}}
template<typename T> void printset(set<int> &S) {for(auto &x: S) cout << x << ' '; cout << '\n';}
template<typename T> void printmulset(multiset<int> &S) {for(auto &x: S) cout << x << ' '; cout << '\n';}
ll n, k, m, q;
//const ll mod = 998244353;
const ll mod = 1000000007;
ll T;
int main() {
#ifndef ONLINE_JUDGE
freopen("error.txt", "w", stderr);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
cin >> T >> n;
vl a(n), b(n), ki(n);
rep(i, n) cin >> b[i] >> a[i] >> ki[i];
vl dp(T+1);
rep(j, n) {
for(int i=T; i>=a[j]; i--) {
for(int k=1; k<=ki[j] && i - k*a[j] >= 0; k++) {
chkmax(dp[i], dp[i-k*a[j]]+k*b[j]);
}
}
}
cout << dp[T] << nl;
}
Compilation message
knapsack.cpp: In function 'int main()':
knapsack.cpp:296:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
296 | freopen("error.txt", "w", stderr);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
376 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
376 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
3 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
344 KB |
Output is correct |
| 19 |
Correct |
1 ms |
460 KB |
Output is correct |
| 20 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
376 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
3 ms |
348 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
1 ms |
348 KB |
Output is correct |
| 22 |
Correct |
1 ms |
344 KB |
Output is correct |
| 23 |
Correct |
1 ms |
460 KB |
Output is correct |
| 24 |
Correct |
1 ms |
344 KB |
Output is correct |
| 25 |
Correct |
1 ms |
348 KB |
Output is correct |
| 26 |
Correct |
127 ms |
348 KB |
Output is correct |
| 27 |
Correct |
1 ms |
348 KB |
Output is correct |
| 28 |
Correct |
0 ms |
348 KB |
Output is correct |
| 29 |
Correct |
0 ms |
348 KB |
Output is correct |
| 30 |
Correct |
1 ms |
464 KB |
Output is correct |
| 31 |
Correct |
1 ms |
348 KB |
Output is correct |
| 32 |
Correct |
1 ms |
460 KB |
Output is correct |
| 33 |
Correct |
1 ms |
348 KB |
Output is correct |
| 34 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
376 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
3 ms |
348 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
1 ms |
348 KB |
Output is correct |
| 22 |
Correct |
1 ms |
344 KB |
Output is correct |
| 23 |
Correct |
1 ms |
460 KB |
Output is correct |
| 24 |
Correct |
1 ms |
344 KB |
Output is correct |
| 25 |
Correct |
1 ms |
348 KB |
Output is correct |
| 26 |
Correct |
127 ms |
348 KB |
Output is correct |
| 27 |
Correct |
1 ms |
348 KB |
Output is correct |
| 28 |
Correct |
0 ms |
348 KB |
Output is correct |
| 29 |
Correct |
0 ms |
348 KB |
Output is correct |
| 30 |
Correct |
1 ms |
464 KB |
Output is correct |
| 31 |
Correct |
1 ms |
348 KB |
Output is correct |
| 32 |
Correct |
1 ms |
460 KB |
Output is correct |
| 33 |
Correct |
1 ms |
348 KB |
Output is correct |
| 34 |
Correct |
1 ms |
348 KB |
Output is correct |
| 35 |
Correct |
14 ms |
3676 KB |
Output is correct |
| 36 |
Execution timed out |
1059 ms |
4188 KB |
Time limit exceeded |
| 37 |
Halted |
0 ms |
0 KB |
- |
