# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970692 | vjudge1 | New Home (APIO18_new_home) | C++17 | 142 ms | 45244 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>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int,int>
#define ss second
#define ff first
signed main()
{
//cout<<"hgahwg";
int t1,t2,t3,t4;
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
/*
initial set:
-> at least on eo feach type
int currant -> where youre at now (vector)
bitset of taken; take till typestaken=types; push into vector of vectors
each new one taken:check if currtaken for that one is whats at the bottom
boittom:check bottom for tha tione where ur at now for each ttype
-> replace else no
-> at each stage after all maximums ->take currmxa - currmin
*/
int n,k,q;
cin>>n>>k>>q;
//scout<<"banana";
queue<pii>nottake; //location, type
queue<pii>taken;
Compilation message (stderr)
# | 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... |