Submission #2240077


Source Code Expand

#include <iostream>
#include <list>
#include <queue>

using namespace std;
using ll = long long;

int main(){
    int N;
    cin >> N;
    int mod2 = N%2;
    list<ll> lst;
    for(int i=1;i<=N;i++){
        int tmp;
        cin >> tmp;
        if(i%2==mod2){
            lst.push_front(tmp);
        }else{
            lst.push_back(tmp);
        }
    }

    for(auto itr=lst.begin();itr!=lst.end();++itr){
        cout << *itr << " ";
    }
    cout << endl;
    return 0;

}

Submission Info

Submission Time
Task C - pushpush
User okesaku
Language C++14 (GCC 5.4.1)
Score 300
Code Size 506 Byte
Status AC
Exec Time 121 ms
Memory 8448 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 12
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt, sample4.txt
All even_0.txt, even_1.txt, even_2.txt, even_3.txt, odd_0.txt, odd_1.txt, odd_2.txt, odd_3.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt
Case Name Status Exec Time Memory
even_0.txt AC 109 ms 8448 KB
even_1.txt AC 110 ms 8448 KB
even_2.txt AC 121 ms 8448 KB
even_3.txt AC 110 ms 8448 KB
odd_0.txt AC 109 ms 8448 KB
odd_1.txt AC 109 ms 8448 KB
odd_2.txt AC 109 ms 8448 KB
odd_3.txt AC 109 ms 8448 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB
sample4.txt AC 1 ms 256 KB