Pagini recente » Cod sursa (job #845488) | Cod sursa (job #1216288) | Cod sursa (job #1634915) | Cod sursa (job #111796) | Cod sursa (job #2680024)
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <unordered_map>
#include <type_traits>
#include <random>
#include <cstring>
#include <bitset>
#include <cstring>
#include <stack>
#include <stdlib.h>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define SERVER 0
const string nameFile="test";
ifstream in (nameFile+".in");
ofstream out(nameFile+".out");
typedef pair <int, int> Pii;
#if (SERVER)
#define in cin
#define out cout
#endif
const int nmax=2e3;
const long long oo=2e18;
long long dp[nmax+2];
int n, x, y, z;
long long k;
struct idk{
int ll, rr, nrM;
};
idk a[nmax+2];
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
in>>n>>k;
for(int i=1; i<=n; i++)
in>>a[i].ll>>a[i].rr>>a[i].nrM;
for(int i=1; i<=n; i++)
dp[i]=oo;
return 0;
}