#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
// #define f first
// #define s second
typedef long int li;
typedef unsigned long int uli;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;
void usaco()
{
freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
// freopen("problem.out", "w", stdout);
}
// static std::string s;
// static int tests;
// bool make_test(std::string p) {
// tests++;
// for (int i = 0; i < p.size(); i++) {
// if (p[i] != '0' && p[i] != '1') {
// return false;
// }
// }
// std::string ss = p + "#" + s;
// std::vector<int> pr(ss.size() + 1);
// pr[0] = -1;
// bool answer = false;
// for (int i = 1; i <= ss.size(); i++) {
// int k = pr[i - 1];
// while (k >= 0 && ss[k] != ss[i - 1])
// k = pr[k];
// pr[i] = k + 1;
// if (pr[i] == p.size()) {
// answer = true;
// break;
// }
// }
// return answer;
// }
string analyse(int n, int t) {
string out = "";
int ls = -1;
int nc = 0;
frange(i, n) {
out += '1';
bool ans = make_test(out);
if(ans) {
ls = i;
nc = 0;
}
else {
nc++;
out[out.size()-1] = '0';
}
if(nc >= 64 || (i ==n-1 && nc)) {
if(make_test(out)) {
nc = 0;
ls = i;
}
else {
int lo = 0;
int hi = nc-1;
while(lo != hi) {
string curr="";
int mid = (lo + hi)/2;
frange(i, ls+mid+1) {
curr += out[i];
}
if(make_test(curr)) {
lo = mid;
}
else {
hi = mid-1;
}
}
string tmp = "";
frange(i, ls+lo+1) tmp += out[i];
out = tmp;
break;
}
}
}
int x = out.length();
// cout << out << " " << n-x << "\n";
frange(i, n-x) {
out = '1' + out;
if(!make_test(out)) {
out[0] = '0';
}
// cout <<i <<":" << out << "\n";
}
// cout << out << "\n";
return out;
}
// int main() {
// // usaco();
// int t;
// // std::cin >> s >> t;
// frange(i, 32) {
// t = 10;
// s = "00000";
// frange(j, 5) {
// if(i & (1<<j)) s[5-j-1] = '1';
// }
// std::string ans = analyse(s.size(), t);
// if(ans != s) cout << s << " " << ans << "\n";
// }
// // std::cout << tests << std::endl << ans << std::endl;
// return 0;
// }
Compilation message
dna.cpp: In function 'void usaco()':
dna.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
38 | freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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()) {
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Execution timed out |
1085 ms |
348 KB |
Time limit exceeded |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Execution timed out |
1071 ms |
348 KB |
Time limit exceeded |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
348 KB |
Output is correct |
| 20 |
Correct |
0 ms |
348 KB |
Output is correct |
| 21 |
Execution timed out |
1025 ms |
348 KB |
Time limit exceeded |
| 22 |
Correct |
1 ms |
348 KB |
Output is correct |
| 23 |
Execution timed out |
1091 ms |
344 KB |
Time limit exceeded |
| 24 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Execution timed out |
1095 ms |
348 KB |
Time limit exceeded |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Execution timed out |
1087 ms |
348 KB |
Time limit exceeded |
| 11 |
Execution timed out |
1039 ms |
344 KB |
Time limit exceeded |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Execution timed out |
1088 ms |
348 KB |
Time limit exceeded |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Execution timed out |
1049 ms |
348 KB |
Time limit exceeded |
| 18 |
Execution timed out |
1064 ms |
348 KB |
Time limit exceeded |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
0 ms |
348 KB |
Output is correct |
| 21 |
Correct |
1 ms |
448 KB |
Output is correct |
| 22 |
Correct |
1 ms |
348 KB |
Output is correct |
| 23 |
Correct |
0 ms |
348 KB |
Output is correct |
| 24 |
Correct |
0 ms |
348 KB |
Output is correct |
| 25 |
Correct |
0 ms |
348 KB |
Output is correct |
| 26 |
Correct |
0 ms |
344 KB |
Output is correct |
| 27 |
Correct |
0 ms |
348 KB |
Output is correct |
| 28 |
Execution timed out |
1086 ms |
348 KB |
Time limit exceeded |
| 29 |
Correct |
1 ms |
344 KB |
Output is correct |
| 30 |
Correct |
1 ms |
348 KB |
Output is correct |
| 31 |
Execution timed out |
1075 ms |
348 KB |
Time limit exceeded |
| 32 |
Correct |
1 ms |
348 KB |
Output is correct |
| 33 |
Execution timed out |
1085 ms |
348 KB |
Time limit exceeded |
| 34 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 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 |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Execution timed out |
1048 ms |
600 KB |
Time limit exceeded |
| 8 |
Correct |
1 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Execution timed out |
1032 ms |
344 KB |
Time limit exceeded |
| 11 |
Execution timed out |
1018 ms |
344 KB |
Time limit exceeded |
| 12 |
Execution timed out |
1067 ms |
348 KB |
Time limit exceeded |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Execution timed out |
1085 ms |
348 KB |
Time limit exceeded |
| 15 |
Execution timed out |
1074 ms |
348 KB |
Time limit exceeded |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
344 KB |
Output is correct |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
0 ms |
348 KB |
Output is correct |
| 21 |
Correct |
3 ms |
456 KB |
Output is correct |
| 22 |
Execution timed out |
1057 ms |
348 KB |
Time limit exceeded |
| 23 |
Incorrect |
9 ms |
348 KB |
Too many tests |
| 24 |
Incorrect |
9 ms |
348 KB |
Too many tests |
| 25 |
Incorrect |
9 ms |
344 KB |
Too many tests |
| 26 |
Execution timed out |
1052 ms |
348 KB |
Time limit exceeded |
| 27 |
Correct |
5 ms |
348 KB |
Output is correct |
| 28 |
Correct |
5 ms |
348 KB |
Output is correct |
| 29 |
Correct |
7 ms |
512 KB |
Output is correct |
| 30 |
Correct |
5 ms |
348 KB |
Output is correct |
| 31 |
Correct |
5 ms |
348 KB |
Output is correct |
| 32 |
Correct |
6 ms |
500 KB |
Output is correct |
| 33 |
Execution timed out |
1059 ms |
600 KB |
Time limit exceeded |
| 34 |
Execution timed out |
1052 ms |
348 KB |
Time limit exceeded |
| 35 |
Execution timed out |
1067 ms |
348 KB |
Time limit exceeded |
| 36 |
Execution timed out |
1014 ms |
344 KB |
Time limit exceeded |
| 37 |
Execution timed out |
1072 ms |
348 KB |
Time limit exceeded |
| 38 |
Incorrect |
7 ms |
344 KB |
Too many tests |
| 39 |
Correct |
5 ms |
348 KB |
Output is correct |
