Submission #72037

# Submission time Handle Problem Language Result Execution time Memory
72037 2018-08-26T04:52:32 Z 이시대의진정한갓겜스타투(#2216, kjp4155) Magic Dowsing (FXCUP3_magic) C++17
100 / 100
3 ms 376 KB
#include "dowsing.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> Pi;
#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> v;
	set<int> RS, CS;
	repp(i,N){
		RS.insert(i); CS.insert(i);
	}

	repp(i,N-1){
		int t = Detect(i,i);
		if( t == 1 ) v.push_back(i);
	}
	if( sz(v) == 1 ) v.push_back(N);

	if( sz(v) == 2 ){
		RS.erase(v[0]); RS.erase(v[1]);
		int x = *RS.begin();
		int t = Detect(v[0],x);
		if( t == 1 ){
			Report(v[0], v[1]); return;
		}
		else{
			Report(v[1], v[0]); return;
		}
	}
	else if( sz(v) == 0 ){
		vector<Pi> tv;
		for(int i=1;i<=N-2;i+=2){
			int t = Detect(i,i+1);
			if( t == 1 ) tv.push_back({i,i+1});
		}
		if( N%2 == 1 && sz(tv) == 0 ){
			Report(N,N);
			return;
		}
		if( N%2 == 0 && sz(tv) == 0 ) tv.push_back({N-1,N});
		int a = tv[0].Fi, b = tv[0].Se;
		RS.erase(a); RS.erase(b);
		int x = *RS.begin();
		int t = Detect(x,a);
		if( t == 1 ) Report(a,a);
		else Report(b,b);
		return;
	}
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Correct : C = 4
2 Correct 2 ms 376 KB Correct : C = 3
3 Correct 3 ms 376 KB Correct : C = 148
4 Correct 3 ms 376 KB Correct : C = 99
5 Correct 3 ms 376 KB Correct : C = 149
6 Correct 3 ms 376 KB Correct : C = 100
7 Correct 3 ms 376 KB Correct : C = 148
8 Correct 3 ms 376 KB Correct : C = 149
9 Correct 3 ms 376 KB Correct : C = 149
10 Correct 3 ms 376 KB Correct : C = 149
11 Correct 3 ms 376 KB Correct : C = 149
12 Correct 3 ms 376 KB Correct : C = 148