oj.uz

답안 #64351

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
64351 2018-08-04T06:27:31 Z Just_Solve_The_Problem parentrises (BOI18_parentrises) C++11
50 / 100
 208 ms 13476 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()

const int N = (int)1e6 + 7;
const int inf = (int)1e9 + 7;

int b[N];
vector < int > stk;
int a[N];
int mod = (int)1e9 + 7;

bool solve1(string &s) {
  a[0] = 1;
  b[0] = ((s[0] == '(') ? 1 : -1);
  for (int i = 1; i < sz(s); i++) {
    b[i] = b[i - 1] + ((s[i] == '(') ? 1 : -1);
    a[i] = 1;
  }
  int cur = 0;
  stk.clear();
  for (int i = 0; i < sz(s); i++) {
    if (s[i] == ')') stk.pb(i);
    if (b[i] + cur < 0) {
//        cout << i << ' ' << b[i] + cur << ' ' << sz(stk) << endl;
      while (b[i] + cur < 0 && sz(stk) > 1) {
        a[stk.back()] = 0;
        stk.pop_back();
        a[stk.back()] = 2;
        stk.pop_back();
        cur++;
      }
      if (b[i] + cur < 0) {
        return 0;
      }
    }
  }
  cur = 0;
  stk.clear();
  for (int i = 0; i < sz(s); i++) {
    s[i] = ((s[i] == '(') ? ')' : '(');
  }
  reverse(all(s));
  b[0] = ((s[0] == '(') ? 1 : -1);
  for (int i = 1; i < sz(s); i++) {
    b[i] = b[i - 1] + ((s[i] == '(') ? 1 : -1);
  }
  for (int i = 0; i < sz(s); i++) {
    if (a[sz(s) - i - 1] == 2) continue;
    if (s[i] == ')') stk.pb(i);
    if (b[i] + cur < 0) {
//        cout << i << ' ' << b[i] + cur << ' ' << sz(stk) << endl;
      while (b[i] + cur < 0 && sz(stk) > 1) {
        a[sz(s) - stk.back() - 1] = 0;
        stk.pop_back();
        a[sz(s) - stk.back() - 1] = 2;
        stk.pop_back();
        cur++;
      }
      if (b[i] + cur < 0) {
        return 0;
      }
    }
  }
  stk.clear();
  reverse(all(s));
  for (int i = 0; i < sz(s); i++) {
    s[i] = ((s[i] == '(') ? ')' : '(');
  }
  int b1 = 0;
  int b2 = 0;
  bool fl = 0;
  for (int i = 0; i < sz(s); i++) {
    if (a[i] <= 1) {
      b1 += ((s[i] == '(') ? 1 : -1);
    }
    if (a[i] >= 1) {
      b2 += ((s[i] == '(') ? 1 : -1);
    }
    fl |= (b1 < 0 || b2 < 0);
  }
  fl |= (b1 != 0 || b2 != 0);
  if (fl) {
    return 0;
  }
  return 1;
}

int add(int a, int b) {
  return (a + b) % mod;
}

int n;
int ans = 0;

void go(string &s) {
  if (sz(s) == n) {
    if (solve1(s)) {
      cout << s << endl;
      ans++;
    }
    return ;
  }
  s.pb('(');
  go(s);
  s.pop_back();
  s.pb(')');
  go(s);
  s.pop_back();
}



void solve2() {
  scanf("%d", &n);
  string asd;
  ans = 0;
  go(asd);
  cout << " -> " <<  ans << endl;
}

main() {
  int p;
  scanf("%d", &p);
  int test;
  scanf("%d", &test);
  if (p == 1) {
    while (test--) {
      string s;
      cin >> s;
      if (solve1(s) == 0) {
        puts("impossible");
      } else {
        for (int i = 0; i < sz(s); i++) {
          if (a[i] == 0) printf("R");
          else if (a[i] == 1) printf("G");
          else printf("B");
        }
        puts("");
      }
    }
  } else {
    while (test--)
      solve2();
  }
}

Compilation message

parentrises.cpp:126:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
parentrises.cpp: In function 'void solve2()':
parentrises.cpp:119:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ~~~~~^~~~~~~~~~
parentrises.cpp: In function 'int main()':
parentrises.cpp:128:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &p);
   ~~~~~^~~~~~~~~~
parentrises.cpp:130:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &test);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 560 KB Output is correct
2 Correct 2 ms 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 3 ms 572 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 560 KB Output is correct
2 Correct 2 ms 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 3 ms 572 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 2 ms 572 KB Output is correct
8 Correct 2 ms 572 KB Output is correct
9 Correct 4 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 560 KB Output is correct
2 Correct 2 ms 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 3 ms 572 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 2 ms 572 KB Output is correct
8 Correct 2 ms 572 KB Output is correct
9 Correct 4 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 4 ms 692 KB Output is correct
12 Correct 6 ms 764 KB Output is correct
13 Correct 3 ms 764 KB Output is correct
14 Correct 4 ms 764 KB Output is correct
15 Correct 5 ms 812 KB Output is correct
16 Correct 22 ms 812 KB Output is correct
17 Correct 21 ms 1996 KB Output is correct
18 Correct 13 ms 1996 KB Output is correct
19 Correct 13 ms 1996 KB Output is correct
20 Correct 15 ms 1996 KB Output is correct
21 Correct 208 ms 1996 KB Output is correct
22 Correct 128 ms 13476 KB Output is correct
23 Correct 88 ms 13476 KB Output is correct
24 Correct 116 ms 13476 KB Output is correct
25 Correct 137 ms 13476 KB Output is correct

Subtask #5
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 13476 KB Expected integer, but "->" found

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 13476 KB Expected integer, but "->" found

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 13476 KB Expected integer, but "->" found