oj.uz

답안 #879083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879083 2023-11-26T09:41:31 Z Alora Superpozicija (COCI22_superpozicija) C++17
0 / 110
 0 ms 348 KB 
#include <bits/stdc++.h>
#define Alora "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define all(v) v.begin(), v.end()
#define pb push_back
#define maxn 200005
const int M = 1e9 + 7;
using namespace std;
int t, n, xd[maxn], ans[maxn];
string s;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	if(fopen(Alora".inp", "r")){
    freopen(Alora".inp", "r", stdin);
    freopen(Alora".out", "w", stdout);}
    while(cin >> t){
        cin >> n;
        cin >> s; s = ' ' + s;
        if(n % 2 == 1) {cout << -1 << '\n'; continue;}
        fi(i, 1, 2*n) xd[i] = 0, ans[i] = 0;
        fi(i, 1, n){
            int a, b; cin >> a >> b;
            if(s[a] == '('){
                if(a < b) ans[i] = 0, xd[a] = 1;
                else ans[i] = 1, xd[b] = 1;
            }
            else{
                if(a > b) ans[i] = 0, xd[a] = 1;
                else ans[i] = 1, xd[b] = 1;
            }
        }
        int A = 0;
        fi(i, 1, 2*n) if(xd[i]){
            if(s[i] == '(') A++;
            else A--;
            if(A < 0) break;
        }
        if(A != 0){cout << -1 << '\n'; continue;}
        fi(i, 1, n) cout << ans[i] << " ";
        cout << '\n';
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:22:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     freopen(Alora".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen(Alora".out", "w", stdout);}
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 70.0

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