# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519881 | Vianti | Alias (COCI21_alias) | C++17 | 40 ms | 620 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll INF = 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
map<string, int> id;
set<string> st;
int cnt = 0;
vector<vector<pair<int, ll>>> g(n);
for (int i = 0; i < m; i++) {
string s1, s2;
cin >> s1 >> s2;
if (st.find(s1) == st.end()) {
st.insert(s1);
id[s1] = cnt++;
}
if (st.find(s2) == st.end()) {
st.insert(s2);
id[s2] = cnt++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |