Submission #2518312


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    ll n,m; cin >> n >> m;
    vector<ll> a(m); for(auto& in:a) cin >> in;
    vector<pll> ans(n+1);
    for(int i = 1; i <= n;i++) ans[i] = {INF,i};
    reverse(a.begin(),a.end());
    for(int i = 0; i < m;i++){
        if(ans[a[i]].first == INF) ans[a[i]].first = i;
    }
    sort(ans.begin()+1,ans.end());
    for(int i = 1; i <= n;i++) cout << ans[i].second << endl;
    return 0;
}

Submission Info

Submission Time
Task A - 掲示板
User vjudge5
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1663 Byte
Status AC
Exec Time 167 ms
Memory 3200 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 14
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask2_00.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask1_00.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask2_00.txt AC 145 ms 2432 KB
subtask2_01.txt AC 35 ms 768 KB
subtask2_02.txt AC 115 ms 2432 KB
subtask2_03.txt AC 8 ms 640 KB
subtask2_04.txt AC 58 ms 1280 KB
subtask2_05.txt AC 163 ms 2944 KB
subtask2_06.txt AC 148 ms 2816 KB
subtask2_07.txt AC 26 ms 1152 KB
subtask2_08.txt AC 57 ms 1408 KB
subtask2_09.txt AC 38 ms 896 KB
subtask2_10.txt AC 167 ms 3200 KB
subtask2_11.txt AC 164 ms 3200 KB
subtask2_12.txt AC 166 ms 3200 KB
subtask2_13.txt AC 165 ms 3200 KB
subtask2_14.txt AC 164 ms 3200 KB
subtask2_15.txt AC 162 ms 3200 KB