oj.uz

Submission #1078740

# Submission time Handle Problem Language Result Execution time Memory
1078740 2024-08-28T05:31:12 Z Faisal_Saqib Comparing Plants (IOI20_plants) C++17
0 / 100
 3 ms 4956 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
const int N=200100;
int cp[N],od[N],deg[N];
vector<int> ma[N];
void init(int k, std::vector<int> r) {
	int n=r.size();
	for(int i=0;i<n;i++)
	{
		int j=(i+1)%n;
		if(r[i]==0)
		{
			// j -> i
			deg[i]++;
			ma[j].push_back(i);
		}
		else
		{
			// i -> j
			deg[j]++;
			ma[i].push_back(j);
		}
	}
	int cnt=0;
	for(int i=0;i<n;i++)
	{
		if(deg[i]==0 and cp[i]==0)
		{
			cnt++;
			queue<int> cur;
			cur.push(i);
			int jp=0;
			while(cur.size()>0)
			{
				int f=cur.front();
				cur.pop();
				cp[f]=cnt;
				od[f]=jp;
				jp++;
				for(auto s:ma[f])
				{
					deg[s]--;
					if(deg[s]==0)
						cur.push(s);
				}
			}
		}
	}
	return;
}

int compare_plants(int x, int y) {
	if(cp[x]==cp[y])
		return ((od[x]<od[y])?-1:1);
	else
		return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Incorrect 2 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Incorrect 2 ms 4956 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Incorrect 2 ms 4956 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Incorrect 2 ms 4956 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Incorrect 2 ms 4956 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Incorrect 2 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -