oj.uz

Submission #72688

# Submission time Handle Problem Language Result Execution time Memory
72688 2018-08-26T15:15:05 Z gs14004 Chocolate Cookie Machine (FXCUP3_chocolate) C++17
100 / 100
 1224 ms 42992 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 300005;
 
int n, m, k, chk[MAXN];
vector<int> gph[MAXN];
int stat[MAXN], mp[MAXN];
 
int main(){
	scanf("%d %d %d",&n,&m,&k);
	for(int i=0; i<m; i++){
		int x;
		scanf("%d",&x);
		chk[x] = 1;
	}
	for(int i=0; i<k; i++){
		int s, e;
		scanf("%d %d",&s,&e);
		gph[s].push_back(e);
		gph[e].push_back(s);
	}
	scanf("%d",&m);
	char sregy[4][10];
	bool fuck = false; // indicates, that ro something can be unsafe
	for(int i=0; i<m; i++){
		int x;
		scanf("%s %s %d %s %s", sregy[0], sregy[1], &x, sregy[2], sregy[3]);
		if(*sregy[3] == 'B') stat[x] = -1;
		if(*sregy[3] == 'O') stat[x] = 1;
		if(*sregy[3] == 'O') fuck = true;
	}
	vector<int> ret, adj, notadj;
	if(!fuck){
		for(int i=1; i<=n; i++){
			if(chk[i]) ret.push_back(i);
		}
	}
	for(int i=1; i<=n; i++){
		if(stat[i] == -1 && !chk[i]) adj.push_back(i);
		if(stat[i] == 1 && !chk[i]) notadj.push_back(i);
	}
	for(auto &i : adj){
		for(auto &j : gph[i]) mp[j]++;
	}
	int sz = adj.size(); adj.clear();
	for(int i=1; i<=n; i++){
		if(mp[i] == sz && !chk[i]) adj.push_back(i);
	}
	memset(mp, 0, sizeof(mp));
	for(auto &i : notadj){
		for(auto &j : gph[i]) mp[j] = 1;
	}
	for(auto &i : adj){
		bool fuck = false;
		if(mp[i]) fuck = true;
		if(!fuck) ret.push_back(i);
	}
	sort(ret.begin(), ret.end());
	cout << ret.size() << endl;
	for(auto &i : ret) printf("%d ", i);
}

Compilation message

chocolate.cpp: In function 'int main()':
chocolate.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&n,&m,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
chocolate.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~
chocolate.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&s,&e);
   ~~~~~^~~~~~~~~~~~~~~
chocolate.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&m);
  ~~~~~^~~~~~~~~
chocolate.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s %s %d %s %s", sregy[0], sregy[1], &x, sregy[2], sregy[3]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8568 KB Output is correct
2 Correct 10 ms 8568 KB Output is correct
3 Correct 16 ms 8884 KB Output is correct
4 Correct 96 ms 13136 KB Output is correct
5 Correct 11 ms 13136 KB Output is correct
6 Correct 9 ms 13136 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 575 ms 31264 KB Output is correct
2 Correct 145 ms 31264 KB Output is correct
3 Correct 391 ms 31264 KB Output is correct
4 Correct 880 ms 35996 KB Output is correct
5 Correct 439 ms 35996 KB Output is correct
6 Correct 91 ms 35996 KB Output is correct
7 Correct 980 ms 39792 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8568 KB Output is correct
2 Correct 10 ms 8568 KB Output is correct
3 Correct 16 ms 8884 KB Output is correct
4 Correct 96 ms 13136 KB Output is correct
5 Correct 11 ms 13136 KB Output is correct
6 Correct 9 ms 13136 KB Output is correct
7 Correct 575 ms 31264 KB Output is correct
8 Correct 145 ms 31264 KB Output is correct
9 Correct 391 ms 31264 KB Output is correct
10 Correct 880 ms 35996 KB Output is correct
11 Correct 439 ms 35996 KB Output is correct
12 Correct 91 ms 35996 KB Output is correct
13 Correct 980 ms 39792 KB Output is correct
14 Correct 21 ms 39792 KB Output is correct
15 Correct 23 ms 39792 KB Output is correct
16 Correct 873 ms 39792 KB Output is correct
17 Correct 347 ms 39792 KB Output is correct
18 Correct 992 ms 42040 KB Output is correct
19 Correct 1178 ms 42040 KB Output is correct
20 Correct 1155 ms 42992 KB Output is correct
21 Correct 1141 ms 42992 KB Output is correct
22 Correct 1030 ms 42992 KB Output is correct
23 Correct 1224 ms 42992 KB Output is correct