2 条题解
-
0
```#include<bits/stdc++.h> using namespace std; #define int long long const int N = 2e5 + 9; map<int,int>mp1; map<pair<int,int>,int>mp2; vector<pair<int,int>> a[N]; signed main(){ int n;cin>>n; for(int i=1;i<=n;i++){ int m;cin>>m; for(int j=1;j<=m;j++){ int x,y; cin>>x>>y; a[i].push_back({x,y}); mp1[x] = max(mp1[x],y); mp2[{x,y}]++; } } int res = 0,f1 = 1; for(int i = 1;i <=n;i++){ int f = 0; for(int j = 0;j < a[i].size();j++){ if(mp2[a[i][j]]==1 && mp1[a[i][j].first] == a[i][j].second){ f = 1; } } if(f == 1) res++; else{ res += f1; f1 = 0; } } cout<<res; return 0; }
信息
- ID
- 334
- 时间
- 1500ms
- 内存
- 256MiB
- 难度
- 9
- 标签
- (无)
- 递交数
- 514
- 已通过
- 35
- 上传者