oj.uz

Submission #12061

# Submission time Handle Problem Language Result Execution time Memory
12061 2014-12-20T12:32:10 Z gs14004 라멘 (JOI14_ramen) C++
0 / 100
 0 ms 1180 KB 
#include "ramen.h"
#include <vector>
using namespace std;

vector<int> mild, jin;

int bback(vector<int> v){
    return v[v.size() - 2];
}

void Ramen(int N) {
    for (int i=0; i<N/2; i++) {
        if(Compare(2*i,2*i+1) == 1){
            jin.push_back(2*i);
            mild.push_back(2*i+1);
        }
        else{
            mild.push_back(2*i);
            jin.push_back(2*i+1);
        }
    }
    if(N&1){
        mild.push_back(N-1);
        jin.push_back(N-1);
    }
    while (mild.size() > 1) {
        if(Compare(mild.back(),mild[mild.size()-2]) == 1){
            mild.pop_back();
        }
        else{
            int t = mild.back();
            mild.pop_back();
            mild.pop_back();
            mild.push_back(t);
        }
    }
    while (jin.size() > 1){
        if(Compare(jin.back(),jin[jin.size()-2]) == -1){
            jin.pop_back();
        }
        else{
            int t = mild.back();
            jin.pop_back();
            jin.pop_back();
            jin.push_back(t);
        }
    }
    Answer(mild.front(),jin.front());
}

Compilation message

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1180 KB Output is correct
2 Correct 0 ms 1180 KB Output is correct
3 Incorrect 0 ms 1180 KB Wrong Answer [5]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1180 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1180 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -