Submission #2550101
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:> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ void solve(){ ll N; cin >> N; vector<ll> a(N); for(auto& in:a) cin >> in; auto t = a; sort(t.begin(),t.end()); t.erase(unique(t.begin(),t.end()),t.end()); for(int i = 0; i < N;i++){ a[i] = lower_bound(t.begin(),t.end(),a[i]) - t.begin(); cout << a[i] << endl; } } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); // cout << solve() << endl; solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 座圧 |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1651 Byte |
Status | AC |
Exec Time | 184 ms |
Memory | 2432 KB |
Judge Result
Set Name | Testset1 | Testset2 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 30 / 30 | 30 / 30 | 40 / 40 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Testset1 | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt |
Testset2 | 000.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 1 ms | 256 KB |
001.txt | AC | 3 ms | 256 KB |
002.txt | AC | 3 ms | 256 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 3 ms | 256 KB |
005.txt | AC | 3 ms | 256 KB |
006.txt | AC | 3 ms | 256 KB |
007.txt | AC | 3 ms | 256 KB |
008.txt | AC | 3 ms | 256 KB |
009.txt | AC | 3 ms | 256 KB |
010.txt | AC | 176 ms | 2432 KB |
011.txt | AC | 168 ms | 2176 KB |
012.txt | AC | 173 ms | 2432 KB |
013.txt | AC | 177 ms | 2304 KB |
014.txt | AC | 177 ms | 2432 KB |
015.txt | AC | 174 ms | 2432 KB |
016.txt | AC | 177 ms | 2304 KB |
017.txt | AC | 177 ms | 2432 KB |
018.txt | AC | 175 ms | 2432 KB |
019.txt | AC | 175 ms | 2432 KB |
020.txt | AC | 179 ms | 2432 KB |
021.txt | AC | 179 ms | 2432 KB |
022.txt | AC | 174 ms | 2304 KB |
023.txt | AC | 182 ms | 2432 KB |
024.txt | AC | 184 ms | 2432 KB |
025.txt | AC | 177 ms | 2304 KB |
026.txt | AC | 175 ms | 2304 KB |
027.txt | AC | 179 ms | 2432 KB |
028.txt | AC | 176 ms | 2304 KB |
029.txt | AC | 182 ms | 2432 KB |