Submission #1219547

#TimeUsernameProblemLanguageResultExecution timeMemory
1219547lizi14Star triangles (IZhO11_triangle)C++20
0 / 100
2096 ms328 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; vector<pair<int,int>>v(n); for(int i=0; i<n; i++){ int j,k; cin>>j>>k; pair<int,int>p={j,k}; v[i]=p; } long long ans=0; sort(v.begin(),v.end()); for(int i=0; i<v.size(); i++){ int h=0; for(int j=i+1; j<v.size(); j++){ if(h==1 && v[j].first!=v[i].first || v[j].first>v[i].first)break; int b=0; if(v[j].first==v[i].first){ h=1; for(int t=0; t<v.size(); t++){ //if(v[t].second!=v[i].second && v[t].second!=v[j].second && b==1)break; if(t!=i && t!=j){ if(v[t].second==v[i].second ){ ans++; b=1; } if(v[t].second==v[j].second){ ans++; b=1; } } } } } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...