답안 #72521

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72521 2018-08-26T08:46:56 Z 이시대의진정한갓겜스타투(#2216, kjp4155) 초코쿠키 기계 (FXCUP3_chocolate) C++17
100 / 100
1702 ms 55388 KB
#include<bits/stdc++.h>
using namespace std;

#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a)           cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b)         cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c)       cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d)     cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e)   cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,n) cout<<#a<<"=["; printarray(a,n); cout<<"]\n"
#define DAR(a,n,s) cout<<#a<<"["<<s<<"-"<<n-1<<"]=["; printarray(a,n,s); cout<<"]\n"

#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){       bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) {     bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){    bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 sz, T2 beg = 0){ for (T2 i = beg; i<sz; i++) cout << a[i] << " "; cout << endl; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;

#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)

#define INF 987654321

#define endl '\n'

int N,M,K;
bool die[300500];
int explode[300500], ok[300500];
bool vis[300500];
vector<int> E[300500];

void printans(set<int> s){
	printf("%d\n",sz(s));
	for(auto e : s) printf("%d ",e);
}

int main(){

	// check when locadium is exploding

	scanf("%d%d%d",&N,&M,&K);
	repp(i,M){
		int x; scanf("%d",&x); die[x] = 1;
	}
	repp(i,K){
		int a,b; scanf("%d%d",&a,&b);
		E[a].pb(b); E[b].pb(a);
	}

	int Q; scanf("%d",&Q);
	int bcnt = 0 , ocnt = 0;
	vector<pair<int,int>> v;
	repp(q,Q){
		char buf[100]; scanf("%s",buf); scanf("%s",buf);
		int x; scanf("%d",&x);
		scanf("%s",buf);
		scanf("%s",buf);
		string s = buf;
		if( s == "BOOM" ){
			explode[x] = 1;
			bcnt++;
			v.push_back({1,x});
		}
		if( s == "OK" ){
			ok[x] = 1;
			ocnt++;
			v.push_back({2,x});
		}
	}

	set<int> s1,s2;
	for(auto e : v){
		int x = e.Se;
		// 위험물질이랑 섞어서 터지면 아무 정보도 없다
		if( e.Fi == 1 && die[x] == 1  ) continue;
		// 안전물질이랑 섞어서 터지면 반드시 연결
		if( e.Fi == 1 && die[x] == 0 ) s1.insert(x);
		// 위험물질이랑 섞어서 안 터지는 경우는 없다
		// 안전물질이랑 섞어서 안 터지면 연결되면 안됨
		if( e.Fi == 2 && die[x] == 0 ) s2.insert(x);
	}
	if( (bcnt > 0 && ocnt > 0) || (bcnt == 0 && ocnt > 0 ) ){
		set<int> ans;
		for(int i=1;i<=N;i++){
			if( die[i] ) continue;
			bool flag = true;
			int cnt = 0;
			for(auto e : E[i]){
				if( s1.count(e) ) cnt++;
				if( s2.count(e) ){
					flag = false;
					break;
				}
			}
			if( flag && cnt == s1.size() ) ans.insert(i);
		}
		printans(ans);
	}
	else if( (bcnt > 0 && ocnt == 0 ) ){
		// 다 터짐
		set<int> ans;
		repp(i,N){
			if( die[i] ){
				ans.insert(i);
				continue;
			}
			int cnt = 0;
			for(auto e : E[i]){
				if( s1.count(e) ) cnt++;
			}
			if( cnt == sz(s1) ) ans.insert(i);
		}
		printans(ans);
	}
	else if( bcnt == 0 && ocnt == 0 ){
		set<int> ans;
		for(int i=1;i<=N;i++) ans.insert(i);
		printans(ans);
	}
	return 0;

}

Compilation message

chocolate.cpp: In function 'int main()':
chocolate.cpp:127:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if( flag && cnt == s1.size() ) ans.insert(i);
                ~~~~^~~~~~~~~~~~
chocolate.cpp:73: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:75:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x; scanf("%d",&x); die[x] = 1;
          ~~~~~^~~~~~~~~
chocolate.cpp:78:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a,b; scanf("%d%d",&a,&b);
            ~~~~~^~~~~~~~~~~~~~
chocolate.cpp:82:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int Q; scanf("%d",&Q);
         ~~~~~^~~~~~~~~
chocolate.cpp:86:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   char buf[100]; scanf("%s",buf); scanf("%s",buf);
                  ~~~~~^~~~~~~~~~
chocolate.cpp:86:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   char buf[100]; scanf("%s",buf); scanf("%s",buf);
                                   ~~~~~^~~~~~~~~~
chocolate.cpp:87:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x; scanf("%d",&x);
          ~~~~~^~~~~~~~~
chocolate.cpp:88:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",buf);
   ~~~~~^~~~~~~~~~
chocolate.cpp:89:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",buf);
   ~~~~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7292 KB Output is correct
2 Correct 9 ms 7396 KB Output is correct
3 Correct 12 ms 7876 KB Output is correct
4 Correct 88 ms 12052 KB Output is correct
5 Correct 9 ms 12052 KB Output is correct
6 Correct 9 ms 12052 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 719 ms 19524 KB Output is correct
2 Correct 196 ms 20260 KB Output is correct
3 Correct 449 ms 27924 KB Output is correct
4 Correct 981 ms 27924 KB Output is correct
5 Correct 541 ms 48244 KB Output is correct
6 Correct 191 ms 48244 KB Output is correct
7 Correct 1068 ms 48244 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7292 KB Output is correct
2 Correct 9 ms 7396 KB Output is correct
3 Correct 12 ms 7876 KB Output is correct
4 Correct 88 ms 12052 KB Output is correct
5 Correct 9 ms 12052 KB Output is correct
6 Correct 9 ms 12052 KB Output is correct
7 Correct 719 ms 19524 KB Output is correct
8 Correct 196 ms 20260 KB Output is correct
9 Correct 449 ms 27924 KB Output is correct
10 Correct 981 ms 27924 KB Output is correct
11 Correct 541 ms 48244 KB Output is correct
12 Correct 191 ms 48244 KB Output is correct
13 Correct 1068 ms 48244 KB Output is correct
14 Correct 33 ms 48244 KB Output is correct
15 Correct 70 ms 48244 KB Output is correct
16 Correct 827 ms 48244 KB Output is correct
17 Correct 387 ms 48244 KB Output is correct
18 Correct 1240 ms 55388 KB Output is correct
19 Correct 1563 ms 55388 KB Output is correct
20 Correct 1702 ms 55388 KB Output is correct
21 Correct 1697 ms 55388 KB Output is correct
22 Correct 1288 ms 55388 KB Output is correct
23 Correct 1631 ms 55388 KB Output is correct