Submission #31675697
Source Code Expand
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define put(i) cout << i << endl
#define rep(i, s, n) for (long long i = s; i < (long long)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> t(n);
vector<string> s(n);
rep(i,0,n) cin >> s[i] >> t[i];
map<string,ll> memo;
vector<pair<ll,string>> st;
ll maxp = 0;
ll idx = -1;
rep(i,0,n){
if(memo.count(s[i])==0){
st.push_back({t[i],s[i]});
memo[s[i]] = i;
if(t[i] > maxp){
maxp = t[i];
idx = i;
}
}
}
put(idx+1);
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - Poem Online Judge |
| User | aoken_7 |
| Language | C++ (GCC 9.2.1) |
| Score | 300 |
| Code Size | 665 Byte |
| Status | AC |
| Exec Time | 147 ms |
| Memory | 18964 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 02_sorted_00.txt, 02_sorted_01.txt, 03_corner_00.txt, 03_corner_01.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 8 ms | 3492 KiB |
| 00_sample_01.txt | AC | 2 ms | 3420 KiB |
| 00_sample_02.txt | AC | 3 ms | 3564 KiB |
| 01_random_00.txt | AC | 49 ms | 7120 KiB |
| 01_random_01.txt | AC | 53 ms | 7120 KiB |
| 01_random_02.txt | AC | 58 ms | 7064 KiB |
| 01_random_03.txt | AC | 61 ms | 7120 KiB |
| 01_random_04.txt | AC | 146 ms | 18824 KiB |
| 01_random_05.txt | AC | 147 ms | 18964 KiB |
| 02_sorted_00.txt | AC | 143 ms | 18964 KiB |
| 02_sorted_01.txt | AC | 143 ms | 18764 KiB |
| 03_corner_00.txt | AC | 67 ms | 7216 KiB |
| 03_corner_01.txt | AC | 75 ms | 8504 KiB |