| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 285741 |
2020-08-29T14:16:55 Z |
kevlee |
Martian DNA (IOI16_dna) |
C++17 |
|
53 ms |
504 KB |
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a));
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
int init(int n, char c) {
int lo = 1, hi = n, ans = 0;
while (lo <= hi) {
int mid = (lo + hi) / 2;
string s = string(mid, c);
if (make_test(s)) {
ans = mid;
lo = mid + 1;
} else {
hi = mid - 1;
}
}
return ans;
}
int right(int n, char c, string str) {
int lo = 1, hi = n, ans = 0;
while (lo <= hi) {
int mid = (lo + hi) / 2;
string s = str + string(mid, c);
if (make_test(s)) {
ans = mid;
lo = mid + 1;
} else {
hi = mid - 1;
}
}
return ans;
}
int left(int n, char c, string str) {
int lo = 1, hi = n, ans = 0;
while (lo <= hi) {
int mid = (lo + hi) / 2;
string s = string(mid, c) + str;
if (make_test(s)) {
ans = mid;
lo = mid + 1;
} else {
hi = mid - 1;
}
}
return ans;
}
string analyse(int n, int t) {
int maxzero = init(n, '0');
int maxone = n - maxzero;
//cout << maxzero << ' ' << maxone << endl;
if (maxzero == 0) {
return string(n, '1');
}
if (maxone == 0) {
return string(n, '0');
}
string s = string(maxzero, '0');
int rem = n - maxzero;
char next = '1';
while (rem > 0) {
int cnt = (next == '0' ? right(min(rem, maxzero), next, s) : right(min(rem, maxone), next, s));
if (cnt == 0) break;
s += string(cnt, next);
if (next == '0') next = '1';
else next = '0';
rem -= cnt;
}
next = '1';
while (rem > 0) {
int cnt = (next == '0' ? left(min(rem, maxzero), next, s) : left(min(rem, maxone), next, s));
if (cnt == 0) break;
s = string(cnt, next) + s;
if (next == '0') next = '1';
else next = '0';
rem -= cnt;
}
return s;
}
Compilation message
grader.cpp: In function 'bool make_test(std::string)':
grader.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
14 | for (int i = 0; i < p.size(); i++) {
| ~~^~~~~~~~~~
grader.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
23 | for (int i = 1; i <= ss.size(); i++) {
| ~~^~~~~~~~~~~~
grader.cpp:28:13: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
28 | if (pr[i] == p.size()) {
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
256 KB |
Output is correct |
| 2 |
Correct |
0 ms |
256 KB |
Output is correct |
| 3 |
Correct |
0 ms |
256 KB |
Output is correct |
| 4 |
Correct |
1 ms |
256 KB |
Output is correct |
| 5 |
Correct |
1 ms |
256 KB |
Output is correct |
| 6 |
Correct |
1 ms |
256 KB |
Output is correct |
| 7 |
Correct |
0 ms |
256 KB |
Output is correct |
| 8 |
Correct |
0 ms |
256 KB |
Output is correct |
| 9 |
Correct |
0 ms |
256 KB |
Output is correct |
| 10 |
Correct |
1 ms |
256 KB |
Output is correct |
| 11 |
Correct |
1 ms |
256 KB |
Output is correct |
| 12 |
Correct |
0 ms |
256 KB |
Output is correct |
| 13 |
Correct |
0 ms |
256 KB |
Output is correct |
| 14 |
Correct |
0 ms |
256 KB |
Output is correct |
| 15 |
Correct |
1 ms |
256 KB |
Output is correct |
| 16 |
Correct |
0 ms |
256 KB |
Output is correct |
| 17 |
Correct |
0 ms |
256 KB |
Output is correct |
| 18 |
Correct |
0 ms |
256 KB |
Output is correct |
| 19 |
Correct |
1 ms |
256 KB |
Output is correct |
| 20 |
Correct |
1 ms |
256 KB |
Output is correct |
| 21 |
Correct |
1 ms |
256 KB |
Output is correct |
| 22 |
Correct |
1 ms |
384 KB |
Output is correct |
| 23 |
Correct |
1 ms |
256 KB |
Output is correct |
| 24 |
Correct |
0 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
256 KB |
Output is correct |
| 2 |
Correct |
0 ms |
256 KB |
Output is correct |
| 3 |
Correct |
0 ms |
256 KB |
Output is correct |
| 4 |
Correct |
0 ms |
256 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
256 KB |
Output is correct |
| 8 |
Correct |
1 ms |
256 KB |
Output is correct |
| 9 |
Correct |
0 ms |
256 KB |
Output is correct |
| 10 |
Correct |
0 ms |
256 KB |
Output is correct |
| 11 |
Correct |
0 ms |
256 KB |
Output is correct |
| 12 |
Correct |
0 ms |
256 KB |
Output is correct |
| 13 |
Correct |
0 ms |
256 KB |
Output is correct |
| 14 |
Correct |
0 ms |
256 KB |
Output is correct |
| 15 |
Correct |
1 ms |
256 KB |
Output is correct |
| 16 |
Correct |
1 ms |
256 KB |
Output is correct |
| 17 |
Correct |
1 ms |
256 KB |
Output is correct |
| 18 |
Correct |
1 ms |
256 KB |
Output is correct |
| 19 |
Correct |
1 ms |
256 KB |
Output is correct |
| 20 |
Incorrect |
1 ms |
256 KB |
Too many tests |
| 21 |
Correct |
1 ms |
256 KB |
Output is correct |
| 22 |
Incorrect |
1 ms |
256 KB |
Too many tests |
| 23 |
Incorrect |
1 ms |
256 KB |
Too many tests |
| 24 |
Correct |
0 ms |
256 KB |
Output is correct |
| 25 |
Correct |
0 ms |
256 KB |
Output is correct |
| 26 |
Correct |
0 ms |
256 KB |
Output is correct |
| 27 |
Correct |
0 ms |
256 KB |
Output is correct |
| 28 |
Incorrect |
1 ms |
256 KB |
Too many tests |
| 29 |
Incorrect |
1 ms |
256 KB |
Too many tests |
| 30 |
Incorrect |
1 ms |
256 KB |
Too many tests |
| 31 |
Incorrect |
1 ms |
256 KB |
Too many tests |
| 32 |
Incorrect |
1 ms |
256 KB |
Too many tests |
| 33 |
Correct |
1 ms |
256 KB |
Output is correct |
| 34 |
Correct |
1 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
256 KB |
Output is correct |
| 2 |
Correct |
0 ms |
256 KB |
Output is correct |
| 3 |
Correct |
0 ms |
256 KB |
Output is correct |
| 4 |
Correct |
1 ms |
256 KB |
Output is correct |
| 5 |
Correct |
0 ms |
256 KB |
Output is correct |
| 6 |
Correct |
1 ms |
256 KB |
Output is correct |
| 7 |
Correct |
0 ms |
256 KB |
Output is correct |
| 8 |
Correct |
1 ms |
256 KB |
Output is correct |
| 9 |
Correct |
0 ms |
256 KB |
Output is correct |
| 10 |
Correct |
1 ms |
256 KB |
Output is correct |
| 11 |
Correct |
0 ms |
256 KB |
Output is correct |
| 12 |
Correct |
1 ms |
256 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
256 KB |
Output is correct |
| 15 |
Correct |
0 ms |
256 KB |
Output is correct |
| 16 |
Correct |
0 ms |
256 KB |
Output is correct |
| 17 |
Correct |
1 ms |
256 KB |
Output is correct |
| 18 |
Correct |
1 ms |
256 KB |
Output is correct |
| 19 |
Correct |
1 ms |
256 KB |
Output is correct |
| 20 |
Correct |
1 ms |
256 KB |
Output is correct |
| 21 |
Correct |
1 ms |
256 KB |
Output is correct |
| 22 |
Incorrect |
33 ms |
384 KB |
Too many tests |
| 23 |
Incorrect |
33 ms |
376 KB |
Too many tests |
| 24 |
Incorrect |
32 ms |
384 KB |
Too many tests |
| 25 |
Incorrect |
40 ms |
384 KB |
Too many tests |
| 26 |
Incorrect |
40 ms |
384 KB |
Too many tests |
| 27 |
Incorrect |
37 ms |
384 KB |
Too many tests |
| 28 |
Incorrect |
37 ms |
376 KB |
Too many tests |
| 29 |
Correct |
1 ms |
384 KB |
Output is correct |
| 30 |
Correct |
1 ms |
256 KB |
Output is correct |
| 31 |
Correct |
1 ms |
384 KB |
Output is correct |
| 32 |
Correct |
1 ms |
384 KB |
Output is correct |
| 33 |
Incorrect |
51 ms |
256 KB |
Too many tests |
| 34 |
Incorrect |
53 ms |
376 KB |
Too many tests |
| 35 |
Incorrect |
49 ms |
504 KB |
Too many tests |
| 36 |
Incorrect |
50 ms |
376 KB |
Too many tests |
| 37 |
Incorrect |
45 ms |
376 KB |
Too many tests |
| 38 |
Correct |
1 ms |
256 KB |
Output is correct |
| 39 |
Correct |
1 ms |
384 KB |
Output is correct |
