oj.uz

답안 #937091

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937091 2024-03-03T13:11:10 Z gaga999 Superpozicija (COCI22_superpozicija) C++17
110 / 110
 26 ms 5212 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC ttoget("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 2e5 + 5;
char s[N];
int to[N], fr[N], ans[N], dp[N];

struct cmp
{
    bool operator()(int a, int b)
    {
        return to[a] > to[b];
    }
};

signed main()
{
    int t, n, x, y;
    scanf("%d", &t);
    while (t-- && scanf("%d%s", &n, s + 1))
    {
        int c0 = 0, ct = n >> 1;
        fill(dp, dp + n + n + 1, 0), fill(to, to + n + n + 1, 0);
        for (int i = 1; i <= n; i++)
        {
            scanf("%d%d", &x, &y);
            if (s[x] == '(')
            {
                if (s[y] == '(')
                {
                    ct--;
                    if (x < y)
                        dp[x] = 1, ans[i] = 0;
                    else
                        dp[y] = 1, ans[i] = 1;
                }
                else
                {
                    dp[y] = -1, ans[i] = 1;
                    if (x < y)
                        to[x] = y, fr[x] = i;
                    else
                        to[y] = x, fr[y] = -i;
                }
            }
            else
            {
                if (s[y] == '(')
                {
                    dp[x] = -1, ans[i] = 0;
                    if (x < y)
                        to[x] = y, fr[x] = -i;
                    else
                        to[y] = x, fr[y] = i;
                }
                else
                {
                    c0++;
                    if (x < y)
                        dp[y] = -1, ans[i] = 1;
                    else
                        dp[x] = -1, ans[i] = 0;
                }
            }
        }
        if (n & 1 || c0 > n >> 1 || ct < 0)
        {
            puts("-1");
            continue;
        }
        priority_queue<int, vector<int>, cmp> pq;
        bool ov = 0;
        for (int i = 1; i <= n << 1; i++)
        {
            if (to[i])
                pq.push(i);
            dp[i] += dp[i - 1];
            while (ct && !pq.empty() && to[pq.top()] <= i)
            {
                x = pq.top(), ct--;
                pq.pop(), dp[i] += 2;
                ans[abs(fr[x])] = fr[x] < 0;
            }
            while (dp[i] < 0 && ct && !pq.empty())
            {
                x = pq.top(), ct--;
                pq.pop(), dp[i]++, dp[to[x]]++;
                ans[abs(fr[x])] = fr[x] < 0;
            }
            if (dp[i] < 0)
            {
                ov = 1;
                break;
            }
        }
        if (ov)
        {
            puts("-1");
            continue;
        }
        assert(!dp[n << 1] && !ct);
        for (int i = 1; i <= n; i++)
            printf("%d%c", ans[i], " \n"[i == n]);
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:127:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  127 |     scanf("%d", &t);
      |     ~~~~~^~~~~~~~~~
Main.cpp:134:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  134 |             scanf("%d%d", &x, &y);
      |             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 2588 KB Output is correct
2 Correct 14 ms 3164 KB Output is correct
3 Correct 22 ms 3164 KB Output is correct
4 Correct 22 ms 3164 KB Output is correct
5 Correct 22 ms 3220 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2396 KB Output is correct
2 Correct 12 ms 2672 KB Output is correct
3 Correct 12 ms 2848 KB Output is correct
4 Correct 13 ms 2908 KB Output is correct
5 Correct 12 ms 3072 KB Output is correct
6 Correct 7 ms 3160 KB Output is correct
7 Correct 12 ms 3260 KB Output is correct
8 Correct 10 ms 3164 KB Output is correct
9 Correct 13 ms 3420 KB Output is correct
10 Correct 13 ms 3416 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 18 ms 2392 KB Output is correct
3 Correct 15 ms 2652 KB Output is correct
4 Correct 14 ms 2956 KB Output is correct
5 Correct 17 ms 2908 KB Output is correct
6 Correct 21 ms 3420 KB Output is correct
7 Correct 8 ms 3160 KB Output is correct
8 Correct 18 ms 3260 KB Output is correct
9 Correct 11 ms 3416 KB Output is correct
10 Correct 19 ms 3676 KB Output is correct
11 Correct 20 ms 3932 KB Output is correct

Subtask #4
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 2588 KB Output is correct
2 Correct 14 ms 3164 KB Output is correct
3 Correct 22 ms 3164 KB Output is correct
4 Correct 22 ms 3164 KB Output is correct
5 Correct 22 ms 3220 KB Output is correct
6 Correct 13 ms 2396 KB Output is correct
7 Correct 12 ms 2672 KB Output is correct
8 Correct 12 ms 2848 KB Output is correct
9 Correct 13 ms 2908 KB Output is correct
10 Correct 12 ms 3072 KB Output is correct
11 Correct 7 ms 3160 KB Output is correct
12 Correct 12 ms 3260 KB Output is correct
13 Correct 10 ms 3164 KB Output is correct
14 Correct 13 ms 3420 KB Output is correct
15 Correct 13 ms 3416 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 18 ms 2392 KB Output is correct
18 Correct 15 ms 2652 KB Output is correct
19 Correct 14 ms 2956 KB Output is correct
20 Correct 17 ms 2908 KB Output is correct
21 Correct 21 ms 3420 KB Output is correct
22 Correct 8 ms 3160 KB Output is correct
23 Correct 18 ms 3260 KB Output is correct
24 Correct 11 ms 3416 KB Output is correct
25 Correct 19 ms 3676 KB Output is correct
26 Correct 20 ms 3932 KB Output is correct
27 Correct 23 ms 3420 KB Output is correct
28 Correct 24 ms 3924 KB Output is correct
29 Correct 21 ms 4008 KB Output is correct
30 Correct 24 ms 4188 KB Output is correct
31 Correct 22 ms 4336 KB Output is correct
32 Correct 14 ms 3932 KB Output is correct
33 Correct 17 ms 4188 KB Output is correct
34 Correct 20 ms 4620 KB Output is correct
35 Correct 23 ms 4948 KB Output is correct
36 Correct 26 ms 5212 KB Output is correct