提出 #2979723
ソースコード 拡げる
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
using namespace std;
typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 100005;
class MPI : public vector<int> {
private:
static constexpr int root = 5;
static constexpr int MOD_ = 924844033;
bool sign;
inline static void trim_sign(MPI& num){
if(num.isZero()) num.sign = false;
}
inline static void trim_digit(MPI& num){
while(num.back() == 0 && (int)num.size() >= 2) num.pop_back();
}
inline bool abs_less(const MPI& a, const MPI& b) const {
if(a.size() != b.size()) return a.size() < b.size();
for(int index = (int)a.size() - 1; index >= 0; index--){
if(a[index] != b[index]) return a[index] < b[index];
}
return false;
}
inline static void num_sbst(MPI& a, const MPI& b){
int n = (int)b.size();
a.resize(n);
for(int i = 0; i < n; i++) a[i] = b[i];
}
inline void add(const MPI& a, const MPI& b, MPI& res) const {
num_sbst(res, a);
int mx = (int)max(a.size(), b.size());
res.resize(mx, 0);
int carry = 0;
for(int i = 0; i < mx; i++){
int val = res[i] + ((i < (int)b.size()) ? b[i] : 0) + carry;
carry = val/10;
res[i] = val%10;
}
if(carry) res.push_back(1);
}
inline void sub(const MPI& a, const MPI& b, MPI& res) const {
num_sbst(res, a);
int carry = 0;
for(int i = 0; i < (int)res.size(); i++){
int val = res[i] - carry - ((i < (int)b.size()) ? b[i] : 0);
if(val < 0){
carry = 1, val += 10;
}else{
carry = 0;
}
res[i] = val;
}
trim_digit(res), trim_sign(res);
}
inline static int add_(const int x, const int y) { return (x + y < MOD_) ? x + y : x + y - MOD_; }
inline static int mul_(const int x, const int y) { return (ll)x * y % MOD_; }
inline static int power(int x, int n){
int res = 1;
while(n > 0){
if(n & 1) res = mul_(res, x);
x = mul_(x, x);
n >>= 1;
}
return res;
}
inline static int inverse(const int x) { return power(x, MOD_ - 2); }
inline static void ntt(vector<int>& a, const bool rev = false){
int i,j,k,s,t,v,w,wn;
const int size = (int)a.size();
const int height = (int)log2(2 * size - 1);
for(i = 0; i < size; i++){
j = 0;
for(k = 0; k < height; k++) j |= (i >> k & 1) << (height - 1 - k);
if(i < j) std::swap(a[i], a[j]);
}
for(i = 1; i < size; i *= 2) {
w = power(root, (MOD_ - 1) / (i * 2));
if(rev) w = inverse(w);
for(j = 0; j < size; j += i * 2){
wn = 1;
for(k = 0; k < i; k++){
s = a[j + k], t = mul_(a[j + k + i], wn);
a[j + k] = add_(s, t);
a[j + k + i] = add_(s, MOD_ - t);
wn = mul_(wn, w);
}
}
}
if(rev){
v = inverse(size);
for (i = 0; i < size; i++) a[i] = mul_(a[i], v);
}
}
static void mul(const MPI& a, const MPI& b, MPI& res){
const int size = (int)a.size() + (int)b.size() - 1;
int t = 1;
while (t < size) t <<= 1;
vector<int> A(t, 0), B(t, 0);
for(int i = 0; i < (int)a.size(); i++) A[i] = a[i];
for(int i = 0; i < (int)b.size(); i++) B[i] = b[i];
ntt(A), ntt(B);
for(int i = 0; i < t; i++) A[i] = mul_(A[i], B[i]);
ntt(A, true);
res.resize(size);
int carry = 0;
for(int i = 0; i < size; i++){
int val = A[i] + carry;
carry = val / 10;
res[i] = val % 10;
}
if(carry) res.push_back(carry);
trim_digit(res), trim_sign(res);
}
inline bool isZero() const {
return (int)size() == 1 && (*this)[0] == 0;
}
inline static bool div_geq(const MPI& mod, const MPI& num){
if((int)mod.size() != (int)num.size()) return (int)mod.size() > (int)num.size();
int n = (int)mod.size();
for(int i = 0; i < n; i++){
if(mod[i] != num[n-1-i]){
return mod[i] > num[n-1-i];
}
}
return true;
}
inline void div_(const MPI& a, const MPI& b, MPI& quo, MPI& mod) const {
vector<MPI> mult(9);
mult[0] = b;
for(int i = 0; i < 8; i++) mult[i+1] = mult[i] + b;
for(int i = (int)a.size() - 1; i >= 0; i--){
if(mod.isZero()){
mod.back() = a[i];
}else{
mod.push_back(a[i]);
}
if(div_geq(mod, b)){
int l = 0, r = 9;
reverse(mod.begin(), mod.end());
while(r-l>1){
int mid = (l+r)/2;
if(mult[mid] > mod){
r = mid;
}else{
l = mid;
}
}
mod -= mult[l];
reverse(mod.begin(), mod.end());
quo.push_back(l+1);
}else{
quo.push_back(0);
}
}
reverse(quo.begin(), quo.end());
trim_digit(quo);
reverse(mod.begin(), mod.end());
}
public:
MPI() : sign(false){ this->push_back(0); }
MPI(ll val) : sign(false){
if(val == 0){
this->push_back(0);
}else{
if(val < 0) sign = true, val = -val;
while(val){
this->push_back(val%10);
val /= 10;
}
}
}
MPI(const string& s) : sign(false){
if(s.empty()) return;
if(s[0] == '-') sign = true;
for(int i = (int)s.size() - 1; i >= sign; i--) this->push_back(s[i]-'0');
}
ll to_ll(){
ll res = 0, dig = 1;
for(int i = 0; i < (int)size(); i++){
res += dig * (*this)[i], dig *= 10;
}
if(sign) res = -res;
return res;
}
string to_string(){
int n = (int)size() + sign;
string s(n, ' ');
if(sign) s[0] = '-';
for(int i = sign; i < n; i++) s[i] = (char)('0'+(*this)[n-1-i]);
return s;
}
friend istream& operator>>(istream& is, MPI& num) {
string s;
is >> s;
num = MPI(s);
return is;
}
friend ostream& operator<<(ostream& os, const MPI& num) {
if(num.sign) os << '-';
for(int i = (int)num.size()-1; i >= 0; i--) os << (char)('0'+num[i]);
return os;
}
MPI& operator=(ll val) {
*this = MPI(val);
return *this;
}
bool operator<(const MPI& another) const {
if(sign ^ another.sign) return sign;
if(size() != another.size()) return (size() < another.size()) ^ sign;
for(int index = (int)size() - 1; index >= 0; index--){
if((*this)[index] != another[index]) return ((*this)[index] < another[index]) ^ sign;
}
return false;
}
bool operator<(const ll num) const {
return *this < MPI(num);
}
friend bool operator<(const ll num, const MPI& another){
return MPI(num) < another;
}
bool operator>(const MPI& another) const {
return another < *this;
}
bool operator>(const ll num) const {
return *this > MPI(num);
}
friend bool operator>(const ll num, const MPI& another){
return MPI(num) > another;
}
bool operator<=(const MPI& another) const {
return !(*this > another);
}
bool operator<=(const ll num) const {
return *this <= MPI(num);
}
friend bool operator<=(const ll num, const MPI& another){
return MPI(num) <= another;
}
bool operator>=(const MPI& another) const {
return !(*this < another);
}
bool operator>=(const ll num) const {
return *this >= MPI(num);
}
friend bool operator>=(const ll num, const MPI& another){
return MPI(num) >= another;
}
bool operator==(const MPI& another) const {
if(sign ^ another.sign) return false;
if(size() != another.size()) return false;
for(int index = (int)size() - 1; index >= 0; index--){
if((*this)[index] != another[index]) return false;
}
return true;
}
bool operator==(const ll num) const {
return *this == MPI(num);
}
friend bool operator==(const ll num, const MPI& another){
return MPI(num) == another;
}
bool operator!=(const MPI& another) const {
return !(*this == another);
}
bool operator!=(const ll num) const {
return *this != MPI(num);
}
friend bool operator!=(const ll num, const MPI& another){
return MPI(num) != another;
}
explicit operator bool() const noexcept { return !isZero(); }
bool operator!() const noexcept { return !static_cast<bool>(*this); }
MPI operator+() const {
return *this;
}
MPI operator-() const {
MPI res = *this;
res.sign = !sign;
return res;
}
inline friend MPI abs(const MPI& num){
MPI res = num;
res.sign = false;
return res;
}
MPI operator+(const MPI& num) const {
MPI res; res.sign = sign;
if(sign != num.sign){
if(abs_less(*this, num)){
res.sign = num.sign;
sub(num, *this, res);
return res;
}else{
sub(*this, num, res);
return res;
}
}
add(*this, num, res);
return res;
}
MPI operator+(ll num) const {
return *this + MPI(num);
}
friend MPI operator+(ll a, const MPI& b){
return b + a;
}
MPI& operator+=(const MPI& num){
*this = *this + num;
return *this;
}
MPI& operator+=(ll num){
*this = *this + num;
return *this;
}
MPI& operator++(){
return *this += 1;
}
MPI operator++(int){
MPI res = *this;
*this += 1;
return res;
}
MPI operator-(const MPI& num) const {
if(sign != num.sign){
MPI res; res.sign = sign;
add(*this, num, res);
return res;
}
MPI res; res.sign = (abs_less(*this, num) ^ sign);
if(res.sign){
sub(num, *this, res);
}else{
sub(*this, num, res);
}
return res;
}
MPI operator-(ll num) const {
return *this - MPI(num);
}
friend MPI operator-(ll a, const MPI& b){
return b - a;
}
MPI& operator-=(const MPI& num){
*this = *this - num;
return *this;
}
MPI& operator-=(ll num){
*this = *this - num;
return *this;
}
MPI& operator--(){
return *this -= 1;
}
MPI operator--(int){
MPI res = *this;
*this -= 1;
return res;
}
MPI operator*(MPI num) const {
MPI res; res.sign = (sign^num.sign);
mul(*this, num, res);
return res;
}
MPI operator*(ll num) const {
return *this * MPI(num);
}
friend MPI operator*(ll a, const MPI& b){
return b * a;
}
MPI& operator*=(const MPI& num){
*this = *this * num;
return *this;
}
MPI& operator*=(ll num){
*this = *this * num;
return *this;
}
MPI operator/(const MPI& num) const {
MPI num_ = abs(num);
MPI a, b;
div_(*this, num_, a, b);
a.sign = (sign^num.sign);
trim_sign(a);
return a;
}
MPI operator/(ll num) const {
return *this / MPI(num);
}
friend MPI operator/(ll a, const MPI& b){
return b / a;
}
MPI& operator/=(const MPI& num){
*this = *this / num;
return *this;
}
MPI& operator/=(ll num){
*this = *this / num;
return *this;
}
MPI operator%(const MPI& num) const {
MPI num_ = abs(num);
MPI a, b;
div_(*this, num_, a, b);
b.sign = sign;
trim_sign(b);
return b;
}
MPI operator%(ll num) const {
return *this % MPI(num);
}
friend MPI operator%(ll a, const MPI& b){
return b % a;
}
MPI& operator%=(const MPI& num){
*this = *this % num;
return *this;
}
MPI& operator%=(ll num){
*this = *this % num;
return *this;
}
inline MPI div2() const {
MPI res; res.sign = sign;
int n = (int)this->size(), carry = 0;
for(int i = n-1; i >= 0; i--){
int val = (*this)[i]+carry*10;
carry = val%2;
if(i != n-1 || val >= 2) res.push_back(val/2);
}
reverse(res.begin(), res.end());
trim_digit(res);
return res;
}
inline friend MPI sqrt(const MPI& x){
if(x <= MPI(0)) return MPI(0);
MPI s = 1, t = x;
while(s < t){
s = s + s, t = t.div2();
}
do{ t = s, s = (x / s + s).div2();
}while(s < t);
return t;
}
inline friend MPI log10(const MPI& x){
assert(x > MPI(0));
return MPI((int)x.size());
}
inline friend MPI pow(MPI a, MPI b){
assert(b >= 0);
MPI res(1);
while(b){
if(b[0] % 2){
res *= a;
}
a *= a;
b = b.div2();
}
return res;
}
};
MPI s;
int n,K;
bool possible(const MPI& num){
MPI val("");
int cnt = 0;
rep(i, n){
val.pb(s[n-1-i]);
if(len(val) == len(num)){
reverse(all(val));
if(val <= num){
val = MPI("");
if(i < n-1) cnt++;
}else{
if(len(num) == 1) return false;
val = s[n-1-i];
cnt++;
}
}
}
return cnt <= K;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> K;
cin >> s;
n = len(s);
int mx = (n-1) / (K+1) + 1;
MPI l(""), r("");
rep(i,mx-1){
l.pb(0), r.pb(0);
}
l.pb(1), r.pb(0), r.pb(1);
l -= 1, r -= 1;
while(r - l > 1){
MPI mid = (l+r).div2();
if(possible(mid)){
r = mid;
}else{
l = mid;
}
}
cout << r << "\n";
return 0;
}
提出情報
提出日時 |
|
問題 |
B - 数字列をカンマで分ける問題 |
ユーザ |
kopricky |
言語 |
C++14 (GCC 5.4.1) |
得点 |
600 |
コード長 |
16438 Byte |
結果 |
TLE |
実行時間 |
3155 ms |
メモリ |
3284 KB |
ジャッジ結果
セット名 |
Sample |
Dataset1 |
Dataset2 |
Dataset3 |
Dataset4 |
Dataset5 |
得点 / 配点 |
0 / 0 |
100 / 100 |
100 / 100 |
200 / 200 |
200 / 200 |
0 / 400 |
結果 |
|
|
|
|
|
|
セット名 |
テストケース |
Sample |
subtask_02_ex1.txt, subtask_03_ex2.txt, subtask_03_ex3.txt |
Dataset1 |
subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt |
Dataset2 |
subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_02_04.txt, subtask_02_05.txt, subtask_02_06.txt, subtask_02_07.txt, subtask_02_08.txt, subtask_02_09.txt, subtask_02_10.txt, subtask_02_11.txt, subtask_02_12.txt, subtask_02_13.txt, subtask_02_14.txt, subtask_02_ex1.txt |
Dataset3 |
subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_02_04.txt, subtask_02_05.txt, subtask_02_06.txt, subtask_02_07.txt, subtask_02_08.txt, subtask_02_09.txt, subtask_02_10.txt, subtask_02_11.txt, subtask_02_12.txt, subtask_02_13.txt, subtask_02_14.txt, subtask_02_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_06.txt, subtask_03_07.txt, subtask_03_08.txt, subtask_03_09.txt, subtask_03_10.txt, subtask_03_11.txt, subtask_03_12.txt, subtask_03_13.txt, subtask_03_14.txt, subtask_03_15.txt, subtask_03_ex2.txt, subtask_03_ex3.txt |
Dataset4 |
subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_02_04.txt, subtask_02_05.txt, subtask_02_06.txt, subtask_02_07.txt, subtask_02_08.txt, subtask_02_09.txt, subtask_02_10.txt, subtask_02_11.txt, subtask_02_12.txt, subtask_02_13.txt, subtask_02_14.txt, subtask_02_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_06.txt, subtask_03_07.txt, subtask_03_08.txt, subtask_03_09.txt, subtask_03_10.txt, subtask_03_11.txt, subtask_03_12.txt, subtask_03_13.txt, subtask_03_14.txt, subtask_03_15.txt, subtask_03_ex2.txt, subtask_03_ex3.txt, subtask_04_01.txt, subtask_04_02.txt, subtask_04_03.txt, subtask_04_04.txt, subtask_04_05.txt, subtask_04_06.txt, subtask_04_07.txt, subtask_04_08.txt, subtask_04_09.txt, subtask_04_10.txt, subtask_04_11.txt, subtask_04_12.txt, subtask_04_13.txt, subtask_04_14.txt, subtask_04_15.txt |
Dataset5 |
subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_02_04.txt, subtask_02_05.txt, subtask_02_06.txt, subtask_02_07.txt, subtask_02_08.txt, subtask_02_09.txt, subtask_02_10.txt, subtask_02_11.txt, subtask_02_12.txt, subtask_02_13.txt, subtask_02_14.txt, subtask_02_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_06.txt, subtask_03_07.txt, subtask_03_08.txt, subtask_03_09.txt, subtask_03_10.txt, subtask_03_11.txt, subtask_03_12.txt, subtask_03_13.txt, subtask_03_14.txt, subtask_03_15.txt, subtask_03_ex2.txt, subtask_03_ex3.txt, subtask_04_01.txt, subtask_04_02.txt, subtask_04_03.txt, subtask_04_04.txt, subtask_04_05.txt, subtask_04_06.txt, subtask_04_07.txt, subtask_04_08.txt, subtask_04_09.txt, subtask_04_10.txt, subtask_04_11.txt, subtask_04_12.txt, subtask_04_13.txt, subtask_04_14.txt, subtask_04_15.txt, subtask_05_01.txt, subtask_05_02.txt, subtask_05_03.txt, subtask_05_04.txt, subtask_05_05.txt, subtask_05_06.txt, subtask_05_07.txt, subtask_05_08.txt, subtask_05_09.txt, subtask_05_10.txt, subtask_05_11.txt, subtask_05_12.txt, subtask_05_13.txt, subtask_05_14.txt, subtask_05_15.txt |
ケース名 |
結果 |
実行時間 |
メモリ |
subtask_01_01.txt |
AC |
1 ms |
256 KB |
subtask_01_02.txt |
AC |
1 ms |
256 KB |
subtask_01_03.txt |
AC |
1 ms |
256 KB |
subtask_01_04.txt |
AC |
1 ms |
256 KB |
subtask_01_05.txt |
AC |
1 ms |
256 KB |
subtask_01_06.txt |
AC |
1 ms |
256 KB |
subtask_01_07.txt |
AC |
1 ms |
256 KB |
subtask_01_08.txt |
AC |
1 ms |
256 KB |
subtask_01_09.txt |
AC |
1 ms |
256 KB |
subtask_01_10.txt |
AC |
1 ms |
256 KB |
subtask_01_11.txt |
AC |
1 ms |
256 KB |
subtask_01_12.txt |
AC |
1 ms |
256 KB |
subtask_01_13.txt |
AC |
1 ms |
256 KB |
subtask_01_14.txt |
AC |
1 ms |
256 KB |
subtask_01_15.txt |
AC |
1 ms |
256 KB |
subtask_01_16.txt |
AC |
1 ms |
256 KB |
subtask_01_17.txt |
AC |
1 ms |
256 KB |
subtask_02_01.txt |
AC |
1 ms |
256 KB |
subtask_02_02.txt |
AC |
1 ms |
256 KB |
subtask_02_03.txt |
AC |
1 ms |
256 KB |
subtask_02_04.txt |
AC |
1 ms |
256 KB |
subtask_02_05.txt |
AC |
1 ms |
256 KB |
subtask_02_06.txt |
AC |
1 ms |
256 KB |
subtask_02_07.txt |
AC |
1 ms |
256 KB |
subtask_02_08.txt |
AC |
1 ms |
256 KB |
subtask_02_09.txt |
AC |
1 ms |
256 KB |
subtask_02_10.txt |
AC |
1 ms |
256 KB |
subtask_02_11.txt |
AC |
1 ms |
256 KB |
subtask_02_12.txt |
AC |
1 ms |
256 KB |
subtask_02_13.txt |
AC |
1 ms |
256 KB |
subtask_02_14.txt |
AC |
1 ms |
256 KB |
subtask_02_ex1.txt |
AC |
1 ms |
256 KB |
subtask_03_01.txt |
AC |
1 ms |
256 KB |
subtask_03_02.txt |
AC |
1 ms |
256 KB |
subtask_03_03.txt |
AC |
1 ms |
256 KB |
subtask_03_04.txt |
AC |
1 ms |
256 KB |
subtask_03_05.txt |
AC |
1 ms |
256 KB |
subtask_03_06.txt |
AC |
1 ms |
256 KB |
subtask_03_07.txt |
AC |
1 ms |
256 KB |
subtask_03_08.txt |
AC |
1 ms |
256 KB |
subtask_03_09.txt |
AC |
2 ms |
256 KB |
subtask_03_10.txt |
AC |
1 ms |
256 KB |
subtask_03_11.txt |
AC |
1 ms |
256 KB |
subtask_03_12.txt |
AC |
1 ms |
256 KB |
subtask_03_13.txt |
AC |
1 ms |
256 KB |
subtask_03_14.txt |
AC |
1 ms |
256 KB |
subtask_03_15.txt |
AC |
1 ms |
256 KB |
subtask_03_ex2.txt |
AC |
1 ms |
256 KB |
subtask_03_ex3.txt |
AC |
1 ms |
256 KB |
subtask_04_01.txt |
AC |
2 ms |
256 KB |
subtask_04_02.txt |
AC |
3 ms |
256 KB |
subtask_04_03.txt |
AC |
1 ms |
256 KB |
subtask_04_04.txt |
AC |
2 ms |
256 KB |
subtask_04_05.txt |
AC |
2 ms |
256 KB |
subtask_04_06.txt |
AC |
2 ms |
256 KB |
subtask_04_07.txt |
AC |
2 ms |
256 KB |
subtask_04_08.txt |
AC |
72 ms |
256 KB |
subtask_04_09.txt |
AC |
221 ms |
384 KB |
subtask_04_10.txt |
AC |
2 ms |
256 KB |
subtask_04_11.txt |
AC |
2 ms |
256 KB |
subtask_04_12.txt |
AC |
2 ms |
256 KB |
subtask_04_13.txt |
AC |
2 ms |
256 KB |
subtask_04_14.txt |
AC |
1 ms |
256 KB |
subtask_04_15.txt |
AC |
2 ms |
256 KB |
subtask_05_01.txt |
AC |
47 ms |
972 KB |
subtask_05_02.txt |
AC |
42 ms |
972 KB |
subtask_05_03.txt |
AC |
2 ms |
972 KB |
subtask_05_04.txt |
AC |
37 ms |
972 KB |
subtask_05_05.txt |
AC |
48 ms |
972 KB |
subtask_05_06.txt |
AC |
51 ms |
972 KB |
subtask_05_07.txt |
AC |
68 ms |
972 KB |
subtask_05_08.txt |
TLE |
3155 ms |
1956 KB |
subtask_05_09.txt |
TLE |
3155 ms |
3284 KB |
subtask_05_10.txt |
AC |
49 ms |
972 KB |
subtask_05_11.txt |
AC |
48 ms |
972 KB |
subtask_05_12.txt |
AC |
55 ms |
972 KB |
subtask_05_13.txt |
AC |
70 ms |
1020 KB |
subtask_05_14.txt |
AC |
81 ms |
1020 KB |
subtask_05_15.txt |
AC |
28 ms |
672 KB |