結果
| 問題 |
No.2153 何コーダーが何人?
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2022-12-09 21:36:27 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 2,780 bytes |
| コンパイル時間 | 2,247 ms |
| コンパイル使用メモリ | 202,748 KB |
| 最終ジャッジ日時 | 2025-02-09 07:33:14 |
|
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 19 |
ソースコード
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
template<typename T> using pqmin = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using pqmax = priority_queue<T>;
typedef pair<int, int> pii;
using pll = pair<ll, ll>;
using ld = long double;
template <typename T> using vc = vector<T>;
template <typename T> using vvc = vector<vc<T>>;
template <typename T> using vvvc = vector<vvc<T>>;
using vi = vc<int>;
using vl = vc<ll>;
using vpi = vc<pii>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rev(x) reverse(all(x))
#define forn(i, n) for (int i = 0; i < n; i++)
#define fora(i, a, b) for (int i = a; i <= b; i++)
#define rofn(i, n) for (int i = n-1; i >= 0; i--)
#define rofa(i, a, b) for (int i = a; i >= b; i--)
#define rep(n) forn(i, n)
//trencherous things bellow
#define get(n) int n; cin >> n; forn(i, n) cin >> arr[i];
//debug
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#ifndef ONLINE_JUDGE
#define debarr(arr, n) cerr << "arr: ["; forn(i, n) cerr << arr[i] << (i == n-1 ? "" : ", "); cerr << "]" << endl;
#else
#define debarr(x...)
#endif
const int mod = 1e9 + 7; //998244353
const int maxn = 2e5 + 5;
void solve() {
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
vector<int> colors(8);
map<string, int> mapa;
forn(i, n) {
string s; cin >> s;
int c; cin >> c;
mapa[s] = c;
}
for (auto a : mapa) {
colors[a.second]++;
}
for (int a : colors) cout << a << endl;
}