# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920066 | Muhammad_Aneeq | Cloud Computing (CEOI18_clo) | C++17 | 1 ms | 348 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.
/*
بسم الله الرحمن الرحيم
Author:
(:Muhammad Aneeq:)
*/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n,m;
vector<vector<int>>buy,sell;
int ans=0;
inline void solve()
{
cin>>n;
bool w=1,p=1;
for (int i=0;i<n;i++)
{
int c,f,p1;
cin>>c>>f>>p1;
buy.push_back({c,f,p1});
w=(w&&(f==1));
p=(p&&(p1==1));
}
cin>>m;
for (int i=0;i<m;i++)
{
int c,f,p1;
cin>>c>>f>>p1;
# | 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... |