oj.uz

답안 #70000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
70000 2018-08-22T08:22:39 Z octopuses parentrises (BOI18_parentrises) C++17
50 / 100
 53 ms 9544 KB 
//Giorgi Kldiashvili

#include <bits/stdc++.h>

#define ll long long
#define fr first
#define sc second
#define M 1000000007ll

using namespace std;

const int N = 1000020;

int n, k;
int used[N];
bool f[N];
char ch[N];

void go1()
{
  vector < int > c; c.clear();
  scanf("%s", &ch);
  n = strlen(ch);
  for(int i = 0; i < n; ++ i)
    used[i] = 0, f[i] = 0;
  if(ch[0] == ')' || ch[n - 1] == '(')
  {
    printf("impossible\n");
    return;
  }
  int now = 1;
  for(int i = 1; i < n; ++ i)
  {
    if(ch[i] == ')')
      c.push_back(i);
    now += (ch[i] == ')')?-1:1;
    if(now < 0)
    {
      if(c.size() <= 1)
      {
        printf("impossible\n");
        return;
      }
      used[c.back()] = 1; c.pop_back();
      used[c.back()] = 2; c.pop_back();
      now = 0;
    }
  }
  now = 1;
  c.clear();
  if(used[n - 1] == 2) now = 0;
  for(int i = n - 2; i >= 0; -- i)
  {
    if(used[i] == 2) continue;
    if(ch[i] == '(')
      c.push_back(i);
    now += (ch[i] == '(')?-1:1;
    if(now < 0)
    {
      if(c.size() <= 1)
      {
        printf("impossible\n");
        return;
      }
      used[c.back()] = 1; c.pop_back();
      used[c.back()] = 2; c.pop_back();
      now = 0;
    }
  }
  for(int i = 0; i < n; ++ i)
  {
    if(used[i] == 0) putchar('G');
    if(used[i] == 1) putchar('R');
    if(used[i] == 2) putchar('B');
  }
  printf("\n");
}

int sub, T;

int main()
{
  scanf("%d", &sub);
  scanf("%d\n", &T);
  if(sub == 1)
  {
    while(T --)
      go1();
  }
}

Compilation message

parentrises.cpp: In function 'void go1()':
parentrises.cpp:22:18: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[1000020]' [-Wformat=]
   scanf("%s", &ch);
               ~~~^
parentrises.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", &ch);
   ~~~~~^~~~~~~~~~~
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", &sub);
   ~~~~~^~~~~~~~~~~~
parentrises.cpp:84:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d\n", &T);
   ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
6.0 / 6.0

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

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 548 KB Output is correct
2 Correct 2 ms 548 KB Output is correct
3 Correct 3 ms 548 KB Output is correct
4 Correct 3 ms 548 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 3 ms 724 KB Output is correct
15 Correct 3 ms 756 KB Output is correct
16 Correct 8 ms 756 KB Output is correct
17 Correct 8 ms 1664 KB Output is correct
18 Correct 6 ms 1664 KB Output is correct
19 Correct 6 ms 1664 KB Output is correct
20 Correct 9 ms 1680 KB Output is correct
21 Correct 33 ms 1680 KB Output is correct
22 Correct 46 ms 9472 KB Output is correct
23 Correct 28 ms 9472 KB Output is correct
24 Correct 37 ms 9472 KB Output is correct
25 Correct 53 ms 9544 KB Output is correct

Subtask #5
0 / 6.0

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

Subtask #6
0 / 16.0

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

Subtask #7
0 / 28.0

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