oj.uz

답안 #64190

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
64190 2018-08-03T13:10:54 Z Just_Solve_The_Problem parentrises (BOI18_parentrises) C++11
11 / 100
 3 ms 604 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];
int suf[N];
vector < int > stk;
int a[N];

void solve1() {
  string s;
  cin >> s;
  b[0] = ((s[0] == '(') ? 1 : -1);
  a[0] = 1;
  suf[0] = inf;
  for (int i = 1; i < sz(s); i++) {
    b[i] = b[i - 1] + ((s[i] == '(') ? 1 : -1);
    suf[i] = inf;
    a[i] = 1;
  }
  suf[sz(s)] = inf;
  for (int i = sz(s) - 1; i >= 0; i--) {
    suf[i] = min(b[i], suf[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) {
        puts("impossible");
        return ;
      }
    }
  }
  stk.clear();
  for (int i = 0; i < sz(s); i++) {
    if (s[i] == '(')
      stk.pb(i);
  }
  int b1 = b[sz(s) - 1] + cur;
  while (b1 > 0 && sz(stk) > 1) {
    b1--;
    a[stk.back()] = 0;
    stk.pop_back();
    a[stk.back()] = 2;
    stk.pop_back();
  }
  if (b1 > 0) {
    puts("impossible");
  }
  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("");
}

void solve2() {
  int n;
  scanf("%d", &n);

}

main() {
  int p;
  scanf("%d", &p);
  int test;
  scanf("%d", &test);
  if (p == 1) {
    while (test--)
      solve1();
  } else {
    while (test--)
      solve2();
  }
}

Compilation message

parentrises.cpp:81:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
parentrises.cpp: In function 'void solve2()':
parentrises.cpp:77: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:83:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &p);
   ~~~~~^~~~~~~~~~
parentrises.cpp:85:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &test);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Incorrect 2 ms 456 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 544 KB Output is correct
2 Correct 2 ms 544 KB Output is correct
3 Correct 3 ms 544 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Incorrect 3 ms 604 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 544 KB Output is correct
2 Correct 2 ms 544 KB Output is correct
3 Correct 3 ms 544 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Incorrect 3 ms 604 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Unexpected end of file - int32 expected

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Unexpected end of file - int32 expected

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Unexpected end of file - int32 expected