# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758864 | lukameladze | 허수아비 (JOI14_scarecrows) | C++17 | 1104 ms | 34752 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;
#define f first
#define s second
// #define int long long
#define pii pair <int, int>
#define pb push_back
const int N = 3e5 + 5;
int t,n;
long long ans;
pii a[N];
map <int, int> mp;
void g(vector <int> v) {
sort(v.begin(),v.end());
int cnt = 0;
for (int i = 0 ; i < v.size(); i++) {
if (i == 0 || v[i] != v[i - 1]) cnt++, mp[v[i]] = cnt;
}
}
void comp() {
vector <int> v;
for (int i = 1; i <= n; i++) {
v.pb(a[i].f);
}
g(v);
for (int i = 1; i <= n; i++) {
a[i].f = mp[a[i].f];
}
v.clear();
for (int i = 1; i <= n; i++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |