oj.uz

답안 #557736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557736 2022-05-06T01:24:51 Z Yazan_Alattar Zagrade (COI20_zagrade) C++14
14 / 100
 794 ms 408 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 500007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

char ans[M];
int n, q;

int main(){
//    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> q;
    for(int i = 1; i <= n; ++i) if(!ans[i]){
        bool ok = 0;
        for(int j = i + 1; j <= n; j += 2) if(!ans[j]){
            cout << "? " << i << " " << j << endl;
            cout.flush();
            cin >> ok;

            if(ok){
                ans[i] = '(';
                ans[j] = ')';
                break;
            }
        }
        if(!ok) ans[i] = ')';
    }

    cout << "! ";
    for(int i = 1; i <= n; ++i) cout << ans[i];
    cout << endl;
    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 7 ms 208 KB Output is correct
3 Correct 22 ms 208 KB Output is correct
4 Correct 32 ms 208 KB Output is correct
5 Correct 55 ms 208 KB Output is correct
6 Correct 43 ms 324 KB Output is correct
7 Correct 624 ms 292 KB Output is correct
8 Correct 50 ms 208 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 208 KB Mismatch at position 2. Expected (, found )
2 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 335 ms 408 KB Output is correct
3 Runtime error 794 ms 304 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 308 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -