Submission #789355

#TimeUsernameProblemLanguageResultExecution timeMemory
789355NothingXDAliens (IOI16_aliens)C++17
0 / 100
1 ms212 KiB
#include "aliens.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef complex<ld> point; void debug_out() {cerr << endl;} template<typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << ' '; debug_out(T...); } #define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__) #define F first #define S second #define all(x) x.begin(), x.end() #define MP(x, y) make_pair(x, y) const int maxn = 100 + 10; multiset<int> st; vector<int> val[maxn]; long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) { for (int i = 0; i < n; i++){ if (r[i] > c[i]) swap(r[i], c[i]); val[r[i]].push_back(r[i]); val[c[i]].push_back(r[i]); } ll ans = 0; for (int i = 0; i < m; i++){ for (auto x: val[i]){ if (x == i) st.insert(i); } if (st.empty()) continue; int tmp = *(st.begin()); ans += 2 * (i - tmp) + 1; for (auto x: val[i]){ if (x != i) st.erase(st.find(x)); } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...