# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150452 | (대충 적당한 팀명) (#200) | 함수컵 박물관 (FXCUP4_museum) | C++17 | 118 ms | 8424 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "museum.h"
#include<algorithm>
#include<utility>
#include<map>
#include<iostream>
using namespace std;
typedef struct Person {
int num,b,t,g;
};
Person P[212121];
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;) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |