oj.uz

Submission #937006

# Submission time Handle Problem Language Result Execution time Memory
937006 2024-03-03T08:21:53 Z 089487 Superpozicija (COCI22_superpozicija) C++14
30 / 110
 73 ms 15000 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("sse4,abm,avx,popcnt")
#include<bits/stdc++.h>
#define int long long
#define quick ios::sync_with_stdio(0);cin.tie(0);
#define rep(x,a,b) for(int x=a;x<=b;x++)
#define repd(x,a,b) for(int x=a;x>=b;x--)
#define F first
#define S second
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x.size())
#define lowbit(x) (x&-x)
using namespace std;
typedef pair<int,int> pii;
void debug(){
    cout<<"\n";
}
template<class T,class ...U>
void debug(T a,U ...b){
    cout<<a<<" ",debug(b...);
}
const int N=2e5+7;
const int INF=1e18L;
pii p[N];
void solve(){
    int n;
    cin>>n;
    string s;
    cin>>s;
    set<pii> st;
    vector<pii> v;
    map<pii,int> ch;
    int cnt=0;
    rep(i,0,n-1){
        cin>>p[i].F>>p[i].S;
        --p[i].F,--p[i].S;
        if(s[p[i].F]!=s[p[i].S]) v.eb(p[i]);
        else{
            if(s[p[i].F]=='(') st.insert(mp(p[i].F,1)),cnt++,ch[p[i]]=0;
            else {
                st.insert(mp(p[i].S,-1));
                ch[p[i]]=1;
                cnt--;
            }
        }
    }
    int total=-cnt+sz(v);
    if(total%2){
        cout<<"-1\n";
        return ;
    }
    int a=total/2;
    int b=a+cnt;
    if(a<0||b<0) {
        cout<<"-1\n";
        return ;
    }
    sort(all(v));
    for(pii p2:v){

        if(s[p2.F]=='('){
            if(a>0){
                st.insert(mp(p2.F,1));
                ch[p2]=0;
                a--;
            }
            else{
                ch[p2]=1;
                b--;
                st.insert(mp(p2.S,-1));
            }
        }
        else if(s[p2.F]==')'){
            if(a>0){
                st.insert(mp(p2.S,1));
                ch[p2]=1;
                a--;
            }
            else{
                st.insert(mp(p2.F,-1));
                ch[p2]=0;
                b--;
            }
        }
    }
    assert(a==0&&b==0);
    int sum=0;
    for(pii p2:st){
        sum+=p2.S;
        if(sum<0){
            cout<<"-1\n";
            return ;
        }
    }
    assert(sum==0);
    rep(i,0,n-1){
        cout<<ch[p[i]]<<" \n"[i==n-1];
    }
}
signed main(){
    quick
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 344 KB Output is correct
2 Correct 47 ms 1884 KB Output is correct
3 Correct 47 ms 5212 KB Output is correct
4 Correct 54 ms 6440 KB Output is correct
5 Correct 56 ms 7768 KB Output is correct
6 Correct 35 ms 8868 KB Output is correct
7 Correct 51 ms 10064 KB Output is correct
8 Correct 73 ms 11484 KB Output is correct
9 Correct 60 ms 12728 KB Output is correct
10 Correct 72 ms 13940 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 29 ms 516 KB Output is correct
3 Correct 35 ms 2356 KB Output is correct
4 Correct 35 ms 5540 KB Output is correct
5 Correct 43 ms 6816 KB Output is correct
6 Correct 46 ms 8328 KB Output is correct
7 Correct 22 ms 9428 KB Output is correct
8 Correct 35 ms 10708 KB Output is correct
9 Correct 33 ms 11960 KB Output is correct
10 Correct 49 ms 13396 KB Output is correct
11 Correct 56 ms 15000 KB Output is correct

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -