Submission #997616
Source Code Expand
#include <cstdio> #include <iostream> #include <vector> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <string> #include <cstring> #include <sstream> #include <algorithm> #include <functional> #include <queue> #include <stack> #include <cmath> #include <iomanip> #include <list> #include <tuple> #include <bitset> #include <ciso646> #include <cassert> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> P; typedef tuple<ll, ll, ll> T; typedef vector<ll> vec; inline bool check(ll x, ll y, ll xMax, ll yMax) { return x >= 0 && y >= 0 && xMax > x && yMax > y; } inline ll toint(string s) { ll v; istringstream sin(s); sin >> v; return v; } template<class T> inline string tostring(T x) { ostringstream sout; sout << x; return sout.str(); } template<class T> inline T sqr(T x) { return x*x; } template<class T> inline T mypow(T x, ll n) { T res = 1; while (n > 0) { if (n & 1)res = res * x; x = x * x; n >>= 1; }return res; } inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } #define For(i,a,b) for(ll (i) = (a);i < (b);(i)++) #define rep(i,n) For(i,0,n) #define rFor(i,a,b) for(ll (i) = (a-1);i >= (b);(i)--) #define rrep(i,n) rFor(i,n,0) #define each(i,n) for(auto &i : n) #define clr(a) memset((a), 0 ,sizeof(a)) #define mclr(a) memset((a), -1 ,sizeof(a)) #define all(a) (a).begin(),(a).end() #define sz(a) (sizeof(a)) #define tostr(a) tostring(a) #define dump(val) cerr << #val " = " << val << endl; #define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v) const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 }; const ll mod = 1e9 + 7; const ll INF = 1e17 + 9; #define int ll #define double ld /* _ooOoo_ o8888888o 88" . "88 (| -_- |) O\ = /O ____/`---'\____ .' \\| |// `. / \\||| : |||// \ / _||||| -:- |||||- \ | | \\\ - /// | | | \_| ''\---/'' | | \ .-\__ `-` ___/-. / ___`. .' /--.--\ `. . __ ."" '< `.___\_<|>_/___.' >'"". | | : `- \`.;`\ _ /`;.`/ - ` : | | \ \ `-. \_ __\ /__ _/ .-` / / ======`-.____`-.___\_____/___.-`____.-'====== `=---=' ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ */ int dp[101][101][101]; string s; int dfs(int i, int k, int pre) { if (s.size() == i)return INF; if (k == 0)return toint(s.substr(pre)); int r0 = max(dfs(i + 1, k - 1, i + 1), ll(toint(s.substr(pre, i - pre + 1)))); int r1 = dfs(i + 1, k, pre); return min(r0, r1); } signed main() { cin.tie(0); ios_base::sync_with_stdio(false); int k; cin >> k >> s; cout << dfs(0, k, 0) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Problem where Commas Separate Digits |
User | omu |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 2993 Byte |
Status | WA |
Exec Time | 3158 ms |
Memory | 51920 KB |
Judge Result
Set Name | Sample | Dataset1 | Dataset2 | Dataset3 | Dataset4 | Dataset5 | ||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | 100 / 100 | 0 / 200 | 0 / 200 | 0 / 400 | ||||||||||||||||||||||||||
Status |
|
|
|
|
|
|
Set Name | Test Cases |
---|---|
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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask_01_01.txt | AC | 3 ms | 256 KB |
subtask_01_02.txt | AC | 3 ms | 256 KB |
subtask_01_03.txt | AC | 3 ms | 256 KB |
subtask_01_04.txt | AC | 3 ms | 256 KB |
subtask_01_05.txt | AC | 3 ms | 256 KB |
subtask_01_06.txt | AC | 3 ms | 256 KB |
subtask_01_07.txt | AC | 3 ms | 256 KB |
subtask_01_08.txt | AC | 3 ms | 256 KB |
subtask_01_09.txt | AC | 3 ms | 256 KB |
subtask_01_10.txt | AC | 3 ms | 256 KB |
subtask_01_11.txt | AC | 3 ms | 256 KB |
subtask_01_12.txt | AC | 3 ms | 256 KB |
subtask_01_13.txt | AC | 3 ms | 256 KB |
subtask_01_14.txt | AC | 3 ms | 256 KB |
subtask_01_15.txt | AC | 3 ms | 256 KB |
subtask_01_16.txt | AC | 3 ms | 256 KB |
subtask_01_17.txt | AC | 3 ms | 256 KB |
subtask_02_01.txt | AC | 20 ms | 384 KB |
subtask_02_02.txt | AC | 35 ms | 256 KB |
subtask_02_03.txt | AC | 35 ms | 384 KB |
subtask_02_04.txt | AC | 20 ms | 256 KB |
subtask_02_05.txt | AC | 7 ms | 256 KB |
subtask_02_06.txt | AC | 3 ms | 256 KB |
subtask_02_07.txt | AC | 3 ms | 256 KB |
subtask_02_08.txt | AC | 3 ms | 256 KB |
subtask_02_09.txt | AC | 3 ms | 256 KB |
subtask_02_10.txt | AC | 4 ms | 256 KB |
subtask_02_11.txt | AC | 5 ms | 256 KB |
subtask_02_12.txt | AC | 5 ms | 256 KB |
subtask_02_13.txt | AC | 34 ms | 256 KB |
subtask_02_14.txt | AC | 4 ms | 256 KB |
subtask_02_ex1.txt | AC | 3 ms | 384 KB |
subtask_03_01.txt | TLE | 3154 ms | 256 KB |
subtask_03_02.txt | TLE | 3154 ms | 256 KB |
subtask_03_03.txt | TLE | 3154 ms | 256 KB |
subtask_03_04.txt | TLE | 3154 ms | 256 KB |
subtask_03_05.txt | TLE | 3154 ms | 256 KB |
subtask_03_06.txt | TLE | 3154 ms | 256 KB |
subtask_03_07.txt | TLE | 3154 ms | 256 KB |
subtask_03_08.txt | WA | 3 ms | 256 KB |
subtask_03_09.txt | WA | 3 ms | 256 KB |
subtask_03_10.txt | TLE | 3154 ms | 256 KB |
subtask_03_11.txt | TLE | 3154 ms | 256 KB |
subtask_03_12.txt | TLE | 3154 ms | 256 KB |
subtask_03_13.txt | TLE | 3154 ms | 256 KB |
subtask_03_14.txt | TLE | 3154 ms | 256 KB |
subtask_03_15.txt | AC | 28 ms | 256 KB |
subtask_03_ex2.txt | AC | 3 ms | 256 KB |
subtask_03_ex3.txt | TLE | 3154 ms | 256 KB |
subtask_04_01.txt | TLE | 3154 ms | 1280 KB |
subtask_04_02.txt | TLE | 3154 ms | 1152 KB |
subtask_04_03.txt | TLE | 3154 ms | 1280 KB |
subtask_04_04.txt | TLE | 3154 ms | 1280 KB |
subtask_04_05.txt | TLE | 3154 ms | 1280 KB |
subtask_04_06.txt | TLE | 3154 ms | 1280 KB |
subtask_04_07.txt | TLE | 3154 ms | 1152 KB |
subtask_04_08.txt | WA | 23 ms | 1152 KB |
subtask_04_09.txt | WA | 3 ms | 256 KB |
subtask_04_10.txt | TLE | 3154 ms | 1280 KB |
subtask_04_11.txt | TLE | 3154 ms | 1280 KB |
subtask_04_12.txt | TLE | 3154 ms | 1280 KB |
subtask_04_13.txt | TLE | 3154 ms | 640 KB |
subtask_04_14.txt | TLE | 3154 ms | 384 KB |
subtask_04_15.txt | TLE | 3154 ms | 768 KB |
subtask_05_01.txt | TLE | 3158 ms | 51792 KB |
subtask_05_02.txt | TLE | 3158 ms | 51024 KB |
subtask_05_03.txt | TLE | 3158 ms | 51920 KB |
subtask_05_04.txt | TLE | 3156 ms | 32848 KB |
subtask_05_05.txt | TLE | 3156 ms | 22556 KB |
subtask_05_06.txt | TLE | 3156 ms | 17424 KB |
subtask_05_07.txt | TLE | 3155 ms | 14568 KB |
subtask_05_08.txt | TLE | 3154 ms | 3352 KB |
subtask_05_09.txt | WA | 4 ms | 592 KB |
subtask_05_10.txt | TLE | 3156 ms | 17436 KB |
subtask_05_11.txt | TLE | 3156 ms | 17436 KB |
subtask_05_12.txt | TLE | 3156 ms | 17436 KB |
subtask_05_13.txt | TLE | 3155 ms | 9068 KB |
subtask_05_14.txt | TLE | 3155 ms | 8376 KB |
subtask_05_15.txt | TLE | 3155 ms | 14080 KB |