oj.uz

답안 #781147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781147 2023-07-12T19:28:28 Z Ozy Homework (CEOI22_homework) C++17
0 / 100
 114 ms 118648 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define pll pair<lli,lli>

struct x {
    lli tipo;
    lli h[2];
    lli apu;
    lli res;
    lli tam;
};

string st;
lli pos,cont,a;
stack<lli> pila;
vector<x> nodos;
x trash;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> st;
    pos = 0;
    cont = 1;
    nodos.push_back(trash);
    pila.push(0);

    while (pos < st.size()) {

        //debugsl(pos);
        //debug(st[pos]);

        a = nodos[ pila.top() ].apu++;
        nodos[ pila.top() ].h[a] = cont;
        nodos.push_back(trash);
        pila.push(cont);

        if(st[pos] == 'm') {

            if (st[pos+1] == 'i') nodos[cont].tipo = 1;
            else nodos[cont].tipo = 2;

            cont++;
            pos += 4;
            continue;
        }

        nodos[cont].tam = 1;
        nodos[cont].res = 1;
        pila.pop();

        while (nodos[pila.top()].apu == 2) {

            lli act = pila.top();
            pila.pop();
            lli izq = nodos[act].h[0];
            lli der = nodos[act].h[1];

            nodos[act].tam = nodos[izq].tam + nodos[der].tam;

            lli a,b,c,d;

            a = nodos[izq].res;
            b = nodos[izq].tam - nodos[izq].res + 1;
            if (nodos[izq].tipo == 2) swap(a,b);

            c = nodos[der].res;
            d = nodos[der].tam - nodos[der].res + 1;
            if (nodos[der].tipo == 2) swap(c,d);

            if (nodos[act].tipo == 1) nodos[act].res = a+c-1;
            else nodos[act].res = b+d-1;

            pos++;
        }

        cont++;
        pos += 2;
    }

    cout << nodos[1].res;

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     while (pos < st.size()) {
      |            ~~~~^~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 118648 KB Output is correct
2 Correct 105 ms 118624 KB Output is correct
3 Incorrect 114 ms 118548 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -