# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
958802 | LucaIlie | Sightseeing in Kyoto (JOI22_kyoto) | C++17 | 175 ms | 14780 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;
struct rc {
int type, ind, prv;
long double value;
bool operator < ( const rc &x ) const {
return value < x.value;
}
};
const int MAX_N = 1e5;
const int MAX_M = 1e5;
int a[MAX_N + 1], b[MAX_M + 1], prvA[MAX_N + 1], nxtA[MAX_N + 1], prvB[MAX_M + 1], nxtB[MAX_M + 1];
priority_queue<rc> pq;
int main() {
int n, m;
cin >> n >> m;
for ( int i = 1; i <= n; i++ )
cin >> a[i];
for ( int i = 1; i <= m; i++ )
cin >> b[i];
prvA[1] = 0;
for ( int i = 2; i <= n; i++ ) {
pq.push( { 0, i, i - 1, (double)a[i] - a[i - 1] } );
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |