Submission #8533878
Source Code Expand
#define _GLIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> P; #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define rep(i, n) for (ll i = 0; i < n; i++) #define rrep(i, n) for (ll i = n - 1; i >= 0; i--) #define Rep(i, r, n) for (ll i = r; i < n; i++) #define RRep(i, r, n) for (ll i = n - 1; i <= r; i--) #define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl; #define fs first #define sc second #define int long long #define pb push_back const int dx[] = {0, -1, 0, 1}; const int dy[] = {1, 0, -1, 0}; const int MOD = (1000000007); //const int MOD = (998244353); //const int INF = (1 << 30)-1; const int INF = (1LL << 60)-1; const double EPS = (1 >> 30); template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;} template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;} using Graph = vector<vector<pair<int, int>>>; signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); //--------------------------------------------- int n,m; cin>>n>>m; vector<int> a(m); rep(i, m) cin >> a[i]; vector<P> b(n); rep(i,n){ b[i].sc=i; } rep(i,m){ int memo=a[i]-1; b[memo].fs=i; } sort(rall(b)); rep(i,n){ //cout<<b[i].fs<<" "<<b[i].sc+1<<endl; if(b[i].fs==0) break; cout<<b[i].sc+1<<endl; } sort(all(b)); rep(i,n){ if(b[i].fs!=0) break; cout<<b[i].sc+1<<endl; } }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | yotsutose |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1651 Byte |
Status | WA |
Exec Time | 957 ms |
Memory | 2432 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 70 | ||||||||||
Status |
|
|
|
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 | WA | 1 ms | 256 KB |
subtask1_02.txt | AC | 2 ms | 256 KB |
subtask1_03.txt | WA | 2 ms | 256 KB |
subtask1_04.txt | WA | 2 ms | 256 KB |
subtask1_05.txt | WA | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | WA | 2 ms | 256 KB |
subtask1_08.txt | WA | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 2 ms | 256 KB |
subtask2_00.txt | AC | 753 ms | 1792 KB |
subtask2_01.txt | AC | 157 ms | 640 KB |
subtask2_02.txt | AC | 643 ms | 1920 KB |
subtask2_03.txt | AC | 22 ms | 640 KB |
subtask2_04.txt | AC | 307 ms | 1024 KB |
subtask2_05.txt | AC | 891 ms | 2176 KB |
subtask2_06.txt | WA | 844 ms | 2048 KB |
subtask2_07.txt | AC | 101 ms | 1152 KB |
subtask2_08.txt | AC | 286 ms | 1152 KB |
subtask2_09.txt | AC | 193 ms | 768 KB |
subtask2_10.txt | WA | 906 ms | 2432 KB |
subtask2_11.txt | AC | 913 ms | 2432 KB |
subtask2_12.txt | AC | 930 ms | 2432 KB |
subtask2_13.txt | WA | 957 ms | 2432 KB |
subtask2_14.txt | WA | 923 ms | 2432 KB |
subtask2_15.txt | AC | 832 ms | 2432 KB |