| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 348953 | shrek12357 | Salesman (IOI09_salesman) | C++14 | 3095 ms | 15716 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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <iomanip>
#include <bitset>
//#include "network.h"
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0);
const int MAXN = 1e5 + 5;
int dp[MAXN];
int main() {
//ifstream cin("bcount.in"); ofstream cout("bcount.out");
int n, u, d, s;
cin >> n >> u >> d >> s;
vector<pair<int, pair<int, int>>> nums;
for (int i = 0; i < n; i++) {
int t, l, x;
cin >> t >> l >> x;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||