oj.uz

Submission #730741

# Submission time Handle Problem Language Result Execution time Memory
730741 2023-04-26T10:53:42 Z Augustyn Superpozicija (COCI22_superpozicija) C++17
110 / 110
 29 ms 3152 KB 
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pf printf
#define pii pair<int,int>
pii ab[200001];
char naw[200001];
int jb[200001],gr[200001];
int t,n;
void rozw()
{
    scanf("%d",&n);    
    priority_queue<pii ,vector<pii >,greater<pii >>dod;
    getchar();
    for(int i=0;i<n*2;++i)
        naw[i]=getchar();
    for(int i=0;i<n;++i)
    {
        scanf("%d%d",&ab[i].f,&ab[i].s);
        --ab[i].f;
        --ab[i].s;
        gr[ab[i].f]=ab[i].s;
        gr[ab[i].s]=ab[i].f;
    }
    int ile=0;
    for(int i=0;i<2*n;++i)
    {
        if(naw[gr[i]]==naw[i])
        {
            if(naw[i]=='('&&i<gr[i])
            {
                jb[i]=t;
                jb[gr[i]]=-t;
                ++ile;
            }
            else if(naw[i]==')'&&i>gr[i])
            {
                jb[i]=t;
                jb[gr[i]]=-t;
                --ile;
            }
        }
        else
        {
            if(jb[i]!=-t&&jb[i]!=t)
            {
                if(naw[i]=='(')
                {
                    jb[i]=-t;
                    jb[gr[i]]=t;
                    dod.push({gr[i],i});
                }
                else
                {
                    jb[i]=t;
                    jb[gr[i]]=-t;
                    --ile;
                    dod.push({gr[i],i});
                }
            }
            else if(jb[i]==t)
            {
                ile++;
                if(naw[i]==')')
                   ile-=2;
            }
        }
        if(ile<0)
        {
            if(dod.empty())
            {
                pf("-1\n");
                return;
            }
            jb[dod.top().s]*=-1;
            jb[dod.top().f]*=-1;
            ++ile;
            if(max(dod.top().f,dod.top().s)<=i)
                ++ile;
            dod.pop();
        }
    }
    if(ile!=0)
    {
        pf("-1\n");
        return;
    }
    for(int i=0;i<n;++i)
    {
        if(jb[ab[i].f]==t)
            pf("0 ");
        else
            pf("1 ");
    }
    pf("\n");
}
int main()
{
    int xd[1000000];
    scanf("%d",&t);
    while(t)
    {
        rozw();
        --t;
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:100:9: warning: unused variable 'xd' [-Wunused-variable]
  100 |     int xd[1000000];
      |         ^~
Main.cpp: In function 'void rozw()':
Main.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         scanf("%d%d",&ab[i].f,&ab[i].s);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:101:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |     scanf("%d",&t);
      |     ~~~~~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 472 KB Output is correct
2 Correct 21 ms 356 KB Output is correct
3 Correct 24 ms 564 KB Output is correct
4 Correct 22 ms 416 KB Output is correct
5 Correct 23 ms 464 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 340 KB Output is correct
2 Correct 17 ms 460 KB Output is correct
3 Correct 16 ms 724 KB Output is correct
4 Correct 20 ms 1076 KB Output is correct
5 Correct 21 ms 1344 KB Output is correct
6 Correct 11 ms 1524 KB Output is correct
7 Correct 13 ms 1748 KB Output is correct
8 Correct 20 ms 2084 KB Output is correct
9 Correct 17 ms 2312 KB Output is correct
10 Correct 19 ms 2508 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 17 ms 340 KB Output is correct
3 Correct 17 ms 596 KB Output is correct
4 Correct 17 ms 980 KB Output is correct
5 Correct 28 ms 1236 KB Output is correct
6 Correct 29 ms 1660 KB Output is correct
7 Correct 9 ms 1108 KB Output is correct
8 Correct 16 ms 2272 KB Output is correct
9 Correct 15 ms 2428 KB Output is correct
10 Correct 20 ms 2768 KB Output is correct
11 Correct 23 ms 3148 KB Output is correct

Subtask #4
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 472 KB Output is correct
2 Correct 21 ms 356 KB Output is correct
3 Correct 24 ms 564 KB Output is correct
4 Correct 22 ms 416 KB Output is correct
5 Correct 23 ms 464 KB Output is correct
6 Correct 17 ms 340 KB Output is correct
7 Correct 17 ms 460 KB Output is correct
8 Correct 16 ms 724 KB Output is correct
9 Correct 20 ms 1076 KB Output is correct
10 Correct 21 ms 1344 KB Output is correct
11 Correct 11 ms 1524 KB Output is correct
12 Correct 13 ms 1748 KB Output is correct
13 Correct 20 ms 2084 KB Output is correct
14 Correct 17 ms 2312 KB Output is correct
15 Correct 19 ms 2508 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 17 ms 340 KB Output is correct
18 Correct 17 ms 596 KB Output is correct
19 Correct 17 ms 980 KB Output is correct
20 Correct 28 ms 1236 KB Output is correct
21 Correct 29 ms 1660 KB Output is correct
22 Correct 9 ms 1108 KB Output is correct
23 Correct 16 ms 2272 KB Output is correct
24 Correct 15 ms 2428 KB Output is correct
25 Correct 20 ms 2768 KB Output is correct
26 Correct 23 ms 3148 KB Output is correct
27 Correct 23 ms 512 KB Output is correct
28 Correct 24 ms 720 KB Output is correct
29 Correct 23 ms 1036 KB Output is correct
30 Correct 25 ms 1440 KB Output is correct
31 Correct 24 ms 1680 KB Output is correct
32 Correct 16 ms 1896 KB Output is correct
33 Correct 18 ms 2176 KB Output is correct
34 Correct 21 ms 2512 KB Output is correct
35 Correct 24 ms 2772 KB Output is correct
36 Correct 28 ms 3152 KB Output is correct