Delete Files

input/code.cpp: In function 'int main()':
input/code.cpp:36:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); i++) {
                                ^
input/code.cpp:53:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); i++) {
                                ^
input/code.cpp:64:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < v.size() - 1; i++) {
                                    ^
input/code.cpp:15:7: warning: unused variable 'p' [-Wunused-variable]
   int p = INF;
       ^

#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define LINF 999999999999999999LL
#define N (1<<17)
#define M 1000000007

using namespace std;

int main () {
  int n;
  cin>>n;
  vector<pair<char, int>> v;
  v.push_back({'n', INF});
  int p = INF;
  for (int i = 0; i < n; i++) {
    char c;
    int l;
    cin>>c>>l;
    if (v[v.size() - 1].first == c) {
      if (c == 'n') v[v.size() - 1].second = max(v[v.size() - 1].second, l);
      else v[v.size() - 1].second = min(v[v.size() - 1].second, l);
    } else {
      v.push_back({c, l});
    }
  }
  int ans2 = 0;
  int ans = 0;
  vector<pair<char, int>> cpy = v;
  {
    if ((*v.begin()).first == 'n') v.erase(v.begin());
    if ((*(--v.end())).first == 'n') v.erase(--v.end());
    v.push_back({'n', INF});
    int ma = 0;
    int mi = INF;
    for (int i = 0; i < v.size(); i++) {
      if (i % 2) ma = max(ma, v[i].second);
      else mi = min(mi, v[i].second);
      
      if (ma >= mi) {
	ans2++;
	if (i % 2) ma = 0, mi = INF;
	else ma = 0, mi = v[i].second;
      }
    }
  }
  v = cpy;
  if ((*(--v.end())).first == 'n') v.erase(--v.end());
  v.push_back({'n', INF});
  int l = v.size() / 2;
  while (l > 0) {
    vector<pair<char, int>> x;
    for (int i = 0; i < v.size(); i++) {
      if (i % 2 == 1 && v[i].second <= v[i - 1].second && v[i].second <= v[i + 1].second) {
	l--;
	ans++;
	x[x.size() - 1].second = max(x[x.size() - 1].second, v[i + 1].second);
	i++;
      } else x.push_back(v[i]);
    }
    v = x;
    vector<pair<char, int>> y;
    y.push_back(v[0]);
    for (int i = 1; i < v.size() - 1; i++) {
      if (i % 2 == 0 && v[i].second < v[i - 1].second && v[i].second < v[i + 1].second) {
	l--;
	y[y.size() - 1].second = min(y[y.size() - 1].second, v[i + 1].second);
	i++;
      } else y.push_back(v[i]);
    }
    y.push_back(v[v.size() - 1]);
    v = y;
  }
  cout<<min(ans, ans2)<<endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: ACCEPTED

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: ACCEPTED

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED