# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988634 | komasan | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 0 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 "boxes.h"
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define db double
#define ll long long
#define ull unsigned long long
#define ios
template<class A,class B> inline void maximize(A& x, B y) {x = max(x, y);};
template<class A,class B> inline void minimize(A& x, B y) {x = min(x, y);};
const long long INF = 1e18;
const long long mod = 1e9 + 7;
const int N = 2e5 + 100;
pair<int, int> dist[N];
vector<pair<int, int>> edge[N];
// int n = 5;
// vector<int> u = {0, 0, 3, 2};
// vector<int> v = {1, 2, 2, 4};
// vector<int> l = {2, 3, 1, 4};
// vector<int> p = {1, 3, 4};
int solve(int n, int m, int k, int a[]) {
//int32_t main() {
return 0;
}