oj.uz

Submission #148363

# Submission time Handle Problem Language Result Execution time Memory
148363 2019-09-01T04:08:12 Z (대충 적당한 팀명)(#3621, rose0310, cos18, baikdohyup) FunctionCup Museum (FXCUP4_museum) C++17
0 / 100
 6 ms 1152 KB 
#include "museum.h"

long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
	int N = B.size();
	int similar[200001]={};
	int ans = 0;
	for(int i=0;i<N;i++){
		for(int j=i+1;j<N;j++){
			if(B[i] == B[j] && !similar[i]){
				similar[i] = 1;
				ans++;
				continue;
			}
			if(T[i] == T[j] && !similar[i]){
				similar[i] = 1;
				ans++;
				continue;
			}
			if(G[i] == G[j] && !similar[i]){
				similar[i] = 1;
				ans++;
				continue;
			}
		}
	}
	return ans;
}

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Incorrect 6 ms 1152 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 73.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Incorrect 6 ms 1152 KB Output isn't correct
3 Halted 0 ms 0 KB -