oj.uz

Submission #251696

# Submission time Handle Problem Language Result Execution time Memory
251696 2020-07-22T07:41:11 Z kartel Ili (COI17_ili) C++14
100 / 100
 461 ms 888 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];

    bool is = 0;

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

    return is;
}

void fll(int v)
{
    c[v] = 0;

    if (v < n) return;

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

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] == 0)
          fll(i);

     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
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 19 ms 512 KB Output is correct
16 Correct 125 ms 632 KB Output is correct
17 Correct 68 ms 640 KB Output is correct
18 Correct 339 ms 640 KB Output is correct
19 Correct 100 ms 636 KB Output is correct
20 Correct 387 ms 760 KB Output is correct
21 Correct 461 ms 768 KB Output is correct
22 Correct 204 ms 760 KB Output is correct
23 Correct 216 ms 764 KB Output is correct
24 Correct 209 ms 764 KB Output is correct
25 Correct 160 ms 888 KB Output is correct
26 Correct 155 ms 760 KB Output is correct
27 Correct 162 ms 760 KB Output is correct
28 Correct 150 ms 760 KB Output is correct
29 Correct 151 ms 760 KB Output is correct
30 Correct 158 ms 760 KB Output is correct
31 Correct 207 ms 760 KB Output is correct
32 Correct 266 ms 640 KB Output is correct