AtCoder Beginner Contest 259 E - LCM on Whiteboard

Annotated release .

original text ： AtCoder Beginner Contest 259 E - LCM on Whiteboard_ A blog with shallow ink breaking -CSDN Blog

#include<stdio.h>
#include<iostream>
using namespace std;
#include<string>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<cstdlib>
#include<stdlib.h>
#include<vector>
#include<queue>
using namespace std;
const int N = 2e5 + 5;
map<int, int> mp, cnt;//mp Used to store the maximum power of a number ,cnt The number used to store the maximum power 
struct node {
    int p, e;
};


vector<struct node> v[N];
int main() {
    int n;
    cin >> n;
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        int m;
        cin >> m;
        for (int j = 1; j <= m; j++) {
            node tmp;
            cin >> tmp.p >> tmp.e;
            // mp[tmp.p] = max(mp[tmp.p], tmp.e);
            if (mp[tmp.p] < tmp.e) {// Update the maximum power 
                cnt[tmp.p] = 1;// Update the number with the largest power 
                mp[tmp.p] = tmp.e;
            }
            else if (mp[tmp.p] == tmp.e) {// If there is a term that is the same as the maximum power , recorded 
                cnt[tmp.p] ++;
            }
            v[i].push_back(tmp);// Store the set of numbers 
        }
    }
    int re = 1;// be equal to 1 Because when the maximum value is the same, it is also considered as a class 
    for (int i = 1; i <= n; i++) {// Traverse 
        for (int j = 0; j < v[i].size(); j++) {// Traverse the power of each number in the set 
            if (mp[v[i][j].p] == v[i][j].e && cnt[v[i][j].p] == 1) // If the maximum power is equal to the number of times of the set   also   He is the only one who has this maximum power 
            { 
                re++;// The greatest common multiples of different categories appear 
                break; 
            }
        }
    }
    cout << min(n,re) << "\n";
    return 0;
}