Submission #484419

#	Time	Username	Problem	Language	Result	Execution time	Memory
484419		Carmel_Ab1	Martian DNA (IOI16_dna)	C++17	0 / 100	12 ms	392 KiB

dna

#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

//#include "grader.cpp"
#include "dna.h"
string substr(string s,int l,int r){
    string ans;
    for(int i=l; i<=r; i++)
        ans+=s[i];
    return ans;
}
string analyse(int n, int t) {
    if(!make_test("0"))
        return string(n,'1');

    string ans;


    int l=0,r=n;
    while(l<=r){
        int m=(l+r)/2;
        if(make_test(string(m,'0')))
            ans=string(m,'0'),l=m+1;
        else
            r=m-1;
    }

    int mx=ans.size(),cur=0;

    if(ans.size()==n)return ans;
    ans+='1';
    while(ans.size()<n && cur<=mx){
        char c='0';
        if(make_test(ans+c))
            ans+=c,cur=0;
        else
            ans+=('1'+'0'-c),cur++;
    }

    l=0,r=n-1;
    string x;
    while(l<=r){
        int m=(l+r)/2;
        if(make_test(substr(ans,0,m)))
            x=substr(ans,0,m),l=m+1;
        else
            r=m-1;
    }

    ans=x;
    while(ans.size()<n){
        if(make_test("0"+ans))
            ans="0"+ans;
        else
            ans="1"+ans;
    }
    return ans;

}

Compilation message (stderr)

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:60:18: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |     if(ans.size()==n)return ans;
      |        ~~~~~~~~~~^~~
dna.cpp:62:21: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |     while(ans.size()<n && cur<=mx){
      |           ~~~~~~~~~~^~
dna.cpp:81:21: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   81 |     while(ans.size()<n){
      |           ~~~~~~~~~~^~
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
• Subtask 2: 0 / 25
• Subtask 3: 0 / 64