oj.uz

답안 #204869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204869 2020-02-27T11:48:23 Z Haunted_Cpp Treasure (info1cup19_treasure) C++17
100 / 100
 9 ms 1284 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cassert>
using namespace std;
 
#define FOR(i, a, b) for (int i = a; i < (int) b; i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define f first
#define s second
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

void setIO(string nome) {
  ios_base::sync_with_stdio(0); cin.tie(0);
  freopen ((nome + ".in").c_str(), "r", stdin);
  freopen ((nome + ".out").c_str(), "w", stdout);
}

int main () {
  ios_base::sync_with_stdio(0); 
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  string w;
  cin >> w;
  stack< pair<char, int> > cnt;
  F0R (i, n) {
    if (cnt.empty()) {
      cnt.push({w[i], 1});
    } else {
      char last = cnt.top().f;
      char cur = w[i];
      int score_last = cnt.top().s;
      if (last == cur) {
        cnt.push({w[i], score_last + 1});
        if (score_last + 1 == k) {
          int to_remove = k;
          while (to_remove--) {
            cnt.pop(); 
          }
        }
      } else {
        cnt.push({w[i], 1});
      }  
    }
  }
  string ans;
  while (!cnt.empty()) {
    ans += cnt.top().f;
    cnt.pop();
  }
  reverse (all(ans));
  cout << ans << '\n';
  return 0;
}

Compilation message

treasure.cpp: In function 'void setIO(std::__cxx11::string)':
treasure.cpp:38:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ((nome + ".in").c_str(), "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
treasure.cpp:39:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ((nome + ".out").c_str(), "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 504 KB Output is correct
18 Correct 6 ms 504 KB Output is correct
19 Correct 6 ms 504 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 6 ms 636 KB Output is correct
22 Correct 7 ms 632 KB Output is correct
23 Correct 7 ms 760 KB Output is correct
24 Correct 8 ms 900 KB Output is correct
25 Correct 8 ms 1016 KB Output is correct
26 Correct 9 ms 1284 KB Output is correct
27 Correct 9 ms 1256 KB Output is correct
28 Correct 9 ms 1028 KB Output is correct
29 Correct 9 ms 1156 KB Output is correct
30 Correct 8 ms 952 KB Output is correct
31 Correct 8 ms 900 KB Output is correct
32 Correct 8 ms 900 KB Output is correct
33 Correct 8 ms 900 KB Output is correct
34 Correct 8 ms 900 KB Output is correct
35 Correct 8 ms 900 KB Output is correct