oj.uz

답안 #852999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852999 2023-09-23T10:08:52 Z hariaakas646 Martian DNA (IOI16_dna) C++17
0 / 100
 7 ms 600 KB 
#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 = 0;
    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) {
            if(make_test(out)) {
                nc = 0;
                ls = i;
            }
            else {
                int lo = 0;
                int hi = 64;
                while(lo != hi) {
                    string curr="";
                    int mid = (lo + hi+1)/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;
            }
        }
    }
    frange(i, n-out.size()) {
        out = '1' + out;
        if(!make_test(out)) {
            out[0] = '0';
        }
    }
    return out;
}

// int main() {
//     usaco();
//     int t;
//     std::cin >> s >> t;
//     std::string ans = analyse(s.size(), t);
//     std::cout << tests << std::endl << ans << std::endl;
//     return 0;
// }

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:13:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 | #define forr(i, j, k) for (int i = j; i < k; i++)
      |                                         ^
dna.cpp:14:22: note: in expansion of macro 'forr'
   14 | #define frange(i, j) forr(i, 0, j)
      |                      ^~~~
dna.cpp:115:5: note: in expansion of macro 'frange'
  115 |     frange(i, n-out.size()) {
      |     ^~~~~~
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()) {

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 0 ms 344 KB Wrong DNA
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 344 KB Wrong DNA
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 344 KB Wrong DNA
12 Incorrect 0 ms 344 KB Wrong DNA
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 0 ms 344 KB Wrong DNA
17 Correct 1 ms 344 KB Output is correct
18 Incorrect 0 ms 344 KB Wrong DNA
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Incorrect 0 ms 344 KB Wrong DNA
22 Incorrect 0 ms 344 KB Wrong DNA
23 Incorrect 0 ms 344 KB Wrong DNA
24 Correct 1 ms 344 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 344 KB Wrong DNA
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Incorrect 0 ms 344 KB Wrong DNA
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Incorrect 0 ms 344 KB Wrong DNA
11 Incorrect 0 ms 344 KB Wrong DNA
12 Incorrect 0 ms 344 KB Wrong DNA
13 Incorrect 0 ms 344 KB Wrong DNA
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Incorrect 1 ms 344 KB Wrong DNA
17 Incorrect 1 ms 344 KB Wrong DNA
18 Incorrect 0 ms 344 KB Wrong DNA
19 Incorrect 1 ms 344 KB Wrong DNA
20 Incorrect 0 ms 344 KB Wrong DNA
21 Incorrect 0 ms 344 KB Wrong DNA
22 Incorrect 0 ms 344 KB Wrong DNA
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Incorrect 1 ms 344 KB Wrong DNA
27 Correct 1 ms 348 KB Output is correct
28 Incorrect 1 ms 544 KB Wrong DNA
29 Incorrect 0 ms 344 KB Wrong DNA
30 Incorrect 0 ms 344 KB Wrong DNA
31 Incorrect 0 ms 344 KB Wrong DNA
32 Incorrect 1 ms 344 KB Wrong DNA
33 Incorrect 0 ms 344 KB Wrong DNA
34 Correct 0 ms 344 KB Output is correct

Subtask #3
0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 344 KB Wrong DNA
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Incorrect 1 ms 344 KB Wrong DNA
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Incorrect 0 ms 344 KB Wrong DNA
11 Incorrect 0 ms 344 KB Wrong DNA
12 Incorrect 0 ms 344 KB Wrong DNA
13 Incorrect 1 ms 348 KB Wrong DNA
14 Incorrect 0 ms 344 KB Wrong DNA
15 Incorrect 0 ms 348 KB Wrong DNA
16 Incorrect 0 ms 348 KB Wrong DNA
17 Incorrect 0 ms 344 KB Wrong DNA
18 Incorrect 1 ms 344 KB Wrong DNA
19 Incorrect 0 ms 344 KB Wrong DNA
20 Incorrect 0 ms 344 KB Wrong DNA
21 Incorrect 0 ms 348 KB Wrong DNA
22 Incorrect 6 ms 500 KB Wrong DNA
23 Incorrect 6 ms 344 KB Wrong DNA
24 Incorrect 6 ms 344 KB Wrong DNA
25 Incorrect 6 ms 344 KB Wrong DNA
26 Incorrect 6 ms 344 KB Wrong DNA
27 Incorrect 5 ms 344 KB Wrong DNA
28 Correct 5 ms 344 KB Output is correct
29 Correct 7 ms 512 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Incorrect 5 ms 344 KB Wrong DNA
32 Correct 7 ms 344 KB Output is correct
33 Incorrect 4 ms 348 KB Wrong DNA
34 Incorrect 6 ms 344 KB Wrong DNA
35 Incorrect 5 ms 344 KB Wrong DNA
36 Incorrect 5 ms 344 KB Wrong DNA
37 Incorrect 6 ms 344 KB Wrong DNA
38 Incorrect 5 ms 344 KB Wrong DNA
39 Correct 5 ms 344 KB Output is correct