# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
743241 | Azther0z | Bitaro’s Party (JOI18_bitaro) | C++11 | 1271 ms | 215080 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;
const int B=150;
vector<vector<int>> adjl(100001);
vector<vector<pair<int,int>>> far(100001);
vector<int> visited(100001,0),val(100001,0);
bitset<100001> busy;
bool cmp(int x,int y)
{
return val[x]>val[y];
}
int main()
{
int n,m,q;
scanf("%d%d%d",&n,&m,&q);
while(m--)
{
int a,b;
scanf("%d%d",&a,&b);
adjl[b].push_back(a);
}
for(int i=1;i<=n;i++)
{
vector<int> all;
for(auto j:adjl[i])
{
for(auto f:far[j])
{
if(visited[f.second]!=i)
{
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... |