oj.uz

Submission #150405

# Submission time Handle Problem Language Result Execution time Memory
150405 2019-09-01T08:20:34 Z (대충 적당한 팀명)(#3621, rose0310, cos18, baikdohyup) FunctionCup Museum (FXCUP4_museum) C++17
27 / 100
 120 ms 8300 KB 
#include "museum.h"
#include<algorithm>
#include<utility>
#include<map>
#include<iostream>
using namespace std;
typedef struct Person {
	int num,b,t,g;
};
Person P[200000];
bool cmpB(Person A, Person B) {
	return A.b < B.b;
}
bool cmpT(Person A, Person B) {
	return A.t < B.t;
}
bool cmpG(Person A, Person B) {
	return A.g < B.g;
}
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
	int N = B.size(),ans=0;
	
	for (int i = 0; i < N; i++) {
		P[i].num = i;
		P[i].b = B[i];
		P[i].t = T[i];
		P[i].g = G[i];
	}
	sort(P, P + N, cmpB);
	for (int i = 0; i < N;) {
		int j;
		for (j = i + 1; j < N && P[i].b==P[j].b;j++) {
			ans += (j-i);
		}
		i = j;
	}

	sort(P, P + N, cmpT);
	
	for (int i = 0; i < N;) {
		int j;
		int visitB[121] = {};
		visitB[P[i].b]++;
		for (j = i + 1; j < N && P[i].t == P[j].t; j++) {
			
			ans += (j - i) - visitB[P[j].b];
			
			visitB[P[j].b]++;
		}
		i = j;
	}
	sort(P, P + N, cmpG);
	for (int i = 0; i < N;) {
		int j;
		int visitB[121] = {}, visitT[121] = {};
		map<pair<int, int>,int> m;
		visitB[P[i].b]++;
		visitT[P[i].t]++;
		m[make_pair(P[i].b, P[i].t)]++;
		for (j = i + 1; j < N && P[i].g == P[j].g; j++) {
			ans += (j - i) -visitT[P[j].t]-visitB[P[j].b]+m[make_pair(P[j].b, P[j].t)];
			visitB[P[j].b]++;
			visitT[P[j].t]++;
			m[make_pair(P[j].b, P[j].t)]++;
		}
		i = j;
	}
	return ans;
}

Compilation message

museum.cpp:7:1: warning: 'typedef' was ignored in this declaration
 typedef struct Person {
 ^~~~~~~

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 128 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 8 ms 512 KB Output is correct
9 Correct 8 ms 512 KB Output is correct
10 Correct 8 ms 384 KB Output is correct

Subtask #2
0 / 73.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 128 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 8 ms 512 KB Output is correct
9 Correct 8 ms 512 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 10 ms 640 KB Output is correct
12 Correct 23 ms 1664 KB Output is correct
13 Correct 56 ms 2676 KB Output is correct
14 Correct 82 ms 3780 KB Output is correct
15 Correct 120 ms 5316 KB Output is correct
16 Incorrect 106 ms 8300 KB Output isn't correct
17 Halted 0 ms 0 KB -