oj.uz

답안 #148380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
148380 2019-09-01T04:13:42 Z 등수만큼 신재웅 생일빵 때림 (10대)(#3628, kjp4155, GodTe, JWoong148) 함수컵 박물관 (FXCUP4_museum) C++17
100 / 100
 115 ms 17644 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,s,n) cout<<#a<<"=["; printarray(a,s,n); 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 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }

void cio(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
}

#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
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 endl '\n'

typedef tuple<int,int,int> t3;
typedef tuple<int,int,int,int> t4;
void die(){printf("-1\n"); exit(0);}
int xx[4] = {1,-1,0,0}, yy[4] = {0,0,1,-1};
const ll mod = 1e9+7;

#include "museum.h"

ll A[3][1000];
ll AA[3][150][150];
ll AAA[150][150][150];
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
	int N = B.size();
	ll ans = 0;

	for(auto e : B) A[0][e]++;
	for(auto e : T) A[1][e]++;
	for(auto e : G) A[2][e]++;

	for (int t = 0; t < 3; t++) {
		for(int i = 0; i < 1000; i++) {
			ans += A[t][i] * (A[t][i]-1) /2;
		}
	}
	for (int i = 0; i < N; i++) {
		AA[0][B[i]][T[i]]++;
		AA[1][T[i]][G[i]]++;
		AA[2][G[i]][B[i]]++;
		AAA[B[i]][T[i]][G[i]]++;
	}

	for (int t = 0; t < 3; t++) {
		for(int i = 0; i < 150; i++) {
			for(int j = 0; j < 150; j++) {
				ans -= AA[t][i][j] * (AA[t][i][j]-1) / 2;
			}
		}
	}

	rep(i,150)rep(j,150)rep(k,150){
		ans += AAA[i][j][k] * (AAA[i][j][k]-1)/2;
	}
	return ans;
}

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 16 ms 512 KB Output is correct
3 Correct 16 ms 640 KB Output is correct
4 Correct 15 ms 896 KB Output is correct
5 Correct 16 ms 2176 KB Output is correct
6 Correct 16 ms 3072 KB Output is correct
7 Correct 17 ms 4224 KB Output is correct
8 Correct 15 ms 640 KB Output is correct
9 Correct 18 ms 6784 KB Output is correct
10 Correct 17 ms 6784 KB Output is correct

Subtask #2
73.0 / 73.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 16 ms 512 KB Output is correct
3 Correct 16 ms 640 KB Output is correct
4 Correct 15 ms 896 KB Output is correct
5 Correct 16 ms 2176 KB Output is correct
6 Correct 16 ms 3072 KB Output is correct
7 Correct 17 ms 4224 KB Output is correct
8 Correct 15 ms 640 KB Output is correct
9 Correct 18 ms 6784 KB Output is correct
10 Correct 17 ms 6784 KB Output is correct
11 Correct 20 ms 11008 KB Output is correct
12 Correct 27 ms 1280 KB Output is correct
13 Correct 44 ms 12020 KB Output is correct
14 Correct 57 ms 14960 KB Output is correct
15 Correct 102 ms 15852 KB Output is correct
16 Correct 90 ms 5352 KB Output is correct
17 Correct 93 ms 5476 KB Output is correct
18 Correct 97 ms 8556 KB Output is correct
19 Correct 103 ms 17644 KB Output is correct
20 Correct 115 ms 17640 KB Output is correct