Submission #1690129
Source Code Expand
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
/*
//#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
*/
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
/*
//#if __cplusplus >= 201103L
#include <array>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
*/
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define uni(x) x.erase(unique(all(x)),x.end())
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) > (b) ? (b) : (a))
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
#define INF INT_MAX/3
#define MAX_N 1000
#define M_INF 1000000000
int n,m,v,i;
void solve(){
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
std::vector<ll> v(n);
std::vector<ll> w(n);
set<ll> st;
rep(i,n) cin>>v[i];
rep(i,n) st.insert(v[i]);
ll flg = 0 ;
for(auto itr = st.begin(); itr != st.end(); ++itr) {
rep(j,n){
if(v[j] == *itr){
w[j] = flg;
}
}
flg++;
}
rep(i,n){
cout<<w[i]<<endl;
}
}
int main(){
solve();
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 座圧 |
User |
koki1018 |
Language |
C++14 (GCC 5.4.1) |
Score |
30 |
Code Size |
2936 Byte |
Status |
TLE |
Exec Time |
2104 ms |
Memory |
6400 KB |
Judge Result
Set Name |
Testset1 |
Testset2 |
All |
Score / Max Score |
30 / 30 |
0 / 30 |
0 / 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 |
4 ms |
384 KB |
003.txt |
AC |
4 ms |
384 KB |
004.txt |
AC |
4 ms |
256 KB |
005.txt |
AC |
3 ms |
256 KB |
006.txt |
AC |
3 ms |
256 KB |
007.txt |
AC |
4 ms |
384 KB |
008.txt |
AC |
3 ms |
256 KB |
009.txt |
AC |
4 ms |
256 KB |
010.txt |
TLE |
2104 ms |
3712 KB |
011.txt |
AC |
202 ms |
2176 KB |
012.txt |
TLE |
2103 ms |
3200 KB |
013.txt |
AC |
866 ms |
2816 KB |
014.txt |
TLE |
2104 ms |
4608 KB |
015.txt |
TLE |
2023 ms |
3584 KB |
016.txt |
AC |
919 ms |
2816 KB |
017.txt |
TLE |
2104 ms |
4480 KB |
018.txt |
TLE |
2104 ms |
4352 KB |
019.txt |
TLE |
2104 ms |
3968 KB |
020.txt |
TLE |
2104 ms |
6400 KB |
021.txt |
TLE |
2104 ms |
4736 KB |
022.txt |
AC |
1050 ms |
2944 KB |
023.txt |
TLE |
2104 ms |
5760 KB |
024.txt |
TLE |
2104 ms |
6016 KB |
025.txt |
AC |
536 ms |
2560 KB |
026.txt |
AC |
1598 ms |
3328 KB |
027.txt |
TLE |
2104 ms |
5120 KB |
028.txt |
AC |
1483 ms |
3200 KB |
029.txt |
TLE |
2104 ms |
6400 KB |