#989507 (C++17) No.2553 Holidays

• 問題: No.2553 Holidays
• ユーザー: tnakao0123
• 提出日時: 2024-06-18 23:34:34
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 1,970 bytes
• コンパイル時間: 882 ms
• コンパイル使用メモリ: 67,292 KB
• 最終ジャッジ日時: 2025-02-21 23:17:07
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 54 WA * 1

コンパイルメッセージ

main.cpp: In function ‘int main()’:
main.cpp:38:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   38 |   scanf("%d%d%s", &n, &m, s);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
/* -*- coding: utf-8 -*-
 *
 * 2553.cc:  No.2553 Holidays - yukicoder
 */
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<utility>
 
using namespace std;
/* constant */
const int MAX_N = 100000;
/* typedef */
using pii = pair<int,int>;
using vpii = vector<pii>;
using qpii = queue<pii>;
/* global variables */
char s[MAX_N + 4];
/* subroutines */
bool cmppii(const pii &a, const pii &b) {
  return a.second - a.first > b.second - b.first;
}
/* main */
int main() {
  int n, m;
  scanf("%d%d%s", &n, &m, s);
  qpii q0, q1;
  vpii es;
  for (int i = 0; i < n;) {
    while (i < n && s[i] != '-') i++;
    if (i >= n) break;
    int j= i;
    while (i < n && s[i] == '-') i++;
    bool lf = (j > 0 && s[j - 1] == 'o');
    bool rf = (i < n && s[i] == 'o');
    if (lf && rf) {
      if ((i - j) & 1) q0.push({j, i});
      else q1.push({j, i});
    }
    else if (lf || rf) q1.push({j, i});
    else es.push_back({j, i});
  }
  while (m > 0 && ! q0.empty()) {
    auto [l, r] = q0.front(); q0.pop();
    for (int i = l + 1; m > 0 && i < r; i += 2)
      s[i] = 'o', m--;
  }
  //printf(" s=%s, m=%d\n", s, m);
  
  while (m > 0 && ! q1.empty()) {
    auto [l, r] = q1.front(); q1.pop();
    if (l > 0 && s[l - 1] == 'o')
      for (int i = l + 1; m > 0 && i < r; i += 2)
    s[i] = 'o', m--;
    else
      for (int i = r - 2; m > 0 && i >= l; i -= 2)
    s[i] = 'o', m--;
  }
  //printf(" s=%s, m=%d\n", s, m);
  sort(es.begin(), es.end(), cmppii);
  for (auto [l, r]: es) {
    if (m <= 0) break;
    if (r - l >= 3)
      for (int i = l; m > 0 && i < r; i += 2)
    s[i] = 'o', m--;
  }
  //printf(" s=%s, m=%d\n", s, m);
  for (int i = 1; i + 1 < n; i++)
    if (s[i] == '-' && s[i - 1] == 'o' && s[i + 1] == 'o')
      s[i] = 'o';
  for (int i = 0; m > 0 && i < n; i++)
    if (s[i] == '-') s[i] = 'o', m--;
  
  int cnt = 0;
  for (int i = 0; i < n; i++)
    if (s[i] == 'o') cnt++;
  
  printf("%d\n", cnt);
  
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX