oj.uz

Submission #251687

# Submission time Handle Problem Language Result Execution time Memory
251687 2020-07-22T07:32:21 Z kartel Ili (COI17_ili) C++14
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
#define F first
#define S second
#define pb push_back
#define N +20500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int c[N], n, m, i, j, cc[N];
string s;
pair <int, int> pr[N];
bool mrk[N], was_one[N];

bitset<N> bt[N], clr;

bool iszr(int v)
{
    if (v < n)
        return (c[v] == 0);

    bool is = 0;

    is |= iszr(pr[v].F);
    is |= iszr(pr[v].S);

    return is;
}

void mrk_all(int v)
{
    if (v < n)
        {
            cc[v] = 0;
            return;
        }

    mrk_all(pr[v].F);
    mrk_all(pr[v].S);
}

int main()
{
    cout.precision(2);
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> m;
    cin >> s;

    for (i = 0; i < n + m; i++)
        c[i] = 1;

    for (i = n; i < n + m; i++)
        if (s[i - n] != '?')
          c[i] = s[i - n] - '0';
     else c[i] = -1;

     for (i = 0; i < m; i++)
     {
         string f1, f2;
         cin >> f1 >> f2;

         int number = atoi(f1.substr(1).c_str());

         if (f1[0] == 'c')
            number += n;

         number--;
         pr[i + n].F = number;

         number = atoi(f2.substr(1).c_str());

         if (f2[0] == 'c')
            number += n;

         number--;
         pr[i + n].S = number;
     }

     for (i = n; i < n + m; i++)
     {
         if (c[i] != -1) continue;

         if (iszr(i)) c[i] = 0;
         else
         {
             for (j = 0; j < n + m; j++) cc[j] = c[j];

             mrk_all(i);

             bool isone = 0;

             for (int i = n; i < n + m; i++)
             {
                 was_one[i] = 0;

                 int le = pr[i].F;
                 int ri = pr[i].S;

                 if (le < n) was_one[i] |= cc[le]; else was_one[i] |= was_one[le];
                 if (ri < n) was_one[i] |= cc[ri]; else was_one[i] |= was_one[ri];

                 if (c[i] == 1 && !was_one[i])
                 {
                     isone = 1;
                     break;
                 }
             }
             if (isone)
                c[i] = 1;
         }
     }

     for (i = n; i < n + m; i++)
        if (c[i] == -1)
          cout << "?";
     else cout << c[i];
}
//
//00000
//00110
//00111
//00011
//00000

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -