# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920104 | Muhammad_Aneeq | Lottery (CEOI18_lot) | C++17 | 3039 ms | 600 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 <algorithm>
#include <vector>
#include <set>
using namespace std;
inline void solve()
{
int n,l;
cin>>n>>l;
int a[n];
for (auto &i:a)
cin>>i;
int q;
cin>>q;
int qu[q];
for (auto& i:qu)
cin>>i;
if (q==1&&qu==0)
{
set<int>s;
int ans[n-l+1]={};
for (int i=0;i<=n-l;i++)
s.insert(i);
while (s.size())
# | 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... |