# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168639 | tkm_algorithms | Jakarta Skyscrapers (APIO15_skyscraper) | C++20 | 265 ms | 327680 KiB |
/**
* In the name of Allah
* We are nothing and you're everything
* author: najmuddin
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
#define int ll
const char nl = '\n';
const int N = 1e5+5;
const int inf = 1e18+10;
void solve() {
int n, m; cin >> n >> m;
vector<int> b(m), p(m);
vector<tuple<int, int>> g[n];
set<pair<int, int>> st;
for (int i = 0; i < m; ++i) {
cin >> b[i] >> p[i];
st.insert({b[i], p[i]});
}
for (auto i: st) {
auto [x, y] = i;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |