| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1353180 | retarde | Road Construction (JOI21_road_construction) | C++20 | 10118 ms | 531756 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
int n, k;
mii m; int tot = 0;
void add(int x) {
m[x]++; tot++;
cout << "adding " << x << '\n';
if (tot > k) {
cout << "removing\n";
m[m.rbegin()->fi]--;
}
}
inline void solve() {
cin >> n >> k;
vi a(n); for (int i = 0; i < n; i++) {
int x, y; cin >> x >> y;
a[i] = x; assert(y == 0);
}
sort(all(a));
if (n <= 500) {
multiset<int> s;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
s.insert(abs(a[i] - a[j]));
}
}
for (int i = 0; i < k; i++) {
cout << *s.begin() << '\n';
s.erase(s.begin());
}
return;
}
// atmost 500 closest guys
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= min(i+500, n - 1); j++) {
add(a[j] - a[i]);
}
// for (int j = i - 1; j >= max(i-500, (int)0); j--) {
// add(a[i] - a[j]);
// }
}
// cout << (int)m.size() << " " << k << '\n';
for (auto &x : m) {
if (k <= x.se) {
for (int i = 0; i < k; i++) cout << x.fi << '\n';
return;
}
for (int i = 0; i < x.se; i++) cout << x.fi << '\n';
k -= x.se;
}
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}컴파일 시 표준 에러 (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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
