제출 #71979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
71979		이시대의진정한갓겜스타투 (#118)	마법 다우징 (FXCUP3_magic)	C++17	0 / 100	3 ms	376 KiB

dowsing

#include "dowsing.h"
#include<bits/stdc++.h>
using namespace std;
#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 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; }

void FindTreasure(int N) {
	vector<int> RS,CS;
	repp(i,N) RS.push_back(i);
	repp(i,N) CS.push_back(i);
	srand(412421);
	int CNT = 150;
	while( (sz(RS) + sz(CS))*3 > CNT ){
		int r1 = rand() % sz(RS);
		int r2 = rand() % sz(CS);

		int x = RS[r1], y = CS[r2];
		int res = Detect(x,y);
		CNT--;
	
		if( res == 1 ) continue;
		
		RS.erase(RS.begin()+r1);
		CS.erase(CS.begin()+r2);
	}

	if( sz(RS) == 1 && sz(CS) == 1 ){
		Report(RS[0], CS[0]);
		return;
	}

	int R,C;
	map<int,int> rm, cm;
	for(int i=0;i<sz(RS);i++){
		int res = Detect(RS[i], CS[0]);	
		rm[RS[i]] += res;
	}
	for(int i=0;i<sz(RS);i++){
		int res = Detect(RS[i], CS[1]);	
		rm[RS[i]] += res;
	}
	for(int i=0;i<sz(RS);i++){
		int res = Detect(RS[i], CS[2]);	
		rm[RS[i]] += res;
	}
	for(int i=0;i<sz(CS);i++){
		int res = Detect(RS[0], CS[i]);
		cm[CS[i]] += res;
	}

	for(int i=0;i<sz(CS);i++){
		int res = Detect(RS[1], CS[i]);
		cm[CS[i]] += res;
	}
	for(int i=0;i<sz(CS);i++){
		int res = Detect(RS[2], CS[i]);
		cm[CS[i]] += res;
	}

	int mx = -1;
	for(auto e : rm){
		if( mx < e.Se ){
			mx = e.Se; R = e.Fi;
		}
	}
	mx = -1;
	for(auto e : cm){
		if( mx < e.Se ){
			mx = e.Se; C = e.Fi;
		}
	}
	Report(R,C);
}

컴파일 시 표준 에러 (stderr) 메시지

dowsing.cpp: In function 'void FindTreasure(int)':
dowsing.cpp:114:8: warning: 'C' may be used uninitialized in this function [-Wmaybe-uninitialized]
  Report(R,C);
  ~~~~~~^~~~~
dowsing.cpp:114:8: warning: 'R' may be used uninitialized in this function [-Wmaybe-uninitialized]

• Subtask 1: 0 / 100