oj.uz

답안 #250795

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250795 2020-07-19T07:33:26 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 +500500
#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;
string s;
pair <int, int> pr[N];
bool mrk[N];

void dfs(int v)
{
    c[v] = 0;
    if (v < n)
        return;

    mrk[v] = 1;

    if (!mrk[pr[v].F])
        dfs(pr[v].F);

    if (!mrk[pr[v].S])
        dfs(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; 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].F = number;

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

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

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

     for (i = n + m - 1; i >= n; i--)
         {
            if (mrk[i]) continue;

            if (c[i] == '0')
                dfs(i);

            int f1 = pr[i].F, f2 = pr[i].S;

            if (c[f1] != -1 && c[f2] != -1)
                c[i] = c[f1] | c[f2];
         }

     for (int k = 0; k < 64; k++)
     {
         for (i = n + m - 1; i >= n; i--)
         {
            int f1 = pr[i].F, f2 = pr[i].S;

            if (f1 == f2 && c[f1] != -1)
                c[i + n] = c[f1];

            if (f1 == f2 && c[i + n] != -1)
                c[f1] = c[i + n];

            if (c[f1] == 1 || c[f2] == 1)
                c[i + n] = 1;

            if (c[f1] == 0 && c[f2] == 0)
                c[i + n] = 0;

            if (c[i + n] == 0)
                 c[f1] = c[f2] = 0;
            else
                if (c[i + n] == 1)
                {
                    if (c[f1] == 0)
                        c[f2] = 1;
                    else if (c[f2] == 0)
                        c[f1] = 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -