# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483313 | MOUF_MAHMALAT | Cloud Computing (CEOI18_clo) | C++14 | 666 ms | 2628 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>
#define all(s) s.begin(),s.end()
#define F first
#define S second
using namespace std;
typedef int ll;
struct node
{
ll c,f,v;
bool tp=0;
} a[40009];
bool cmp(const node&xo,const node&yo)
{
if(xo.f==yo.f)
return xo.tp<yo.tp;
return xo.f>yo.f;
}
ll n,m;
long long dp[2][100001],ans=-1e15;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n;
for(ll i=0; i<n; i++)
cin>>a[i].c>>a[i].f>>a[i].v;
cin>>m;
for(ll i=n; i<n+m; i++)
{
cin>>a[i].c>>a[i].f>>a[i].v;
# | 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... |