Submission #25768664

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool cust(pair<ll,ll>&x,pair<ll,ll>&y){
    if(x.first!=y.first)return x.first<y.first;
    else return x.second<y.second;
}
ll power(long long x, ll y, ll p)
{
    ll res = 1;     
    x = x % p; 
    if (x == 0) return 0; 
    while (y > 0)
    {
        if (y & 1)
            res = (res*x) % p;
        y = y>>1; 
        x = (x*x) % p;
    }
    return res;
}
void dfs(int x,vector<set<int>>&adj,vector<pair<int,int>>&c,int par){
    for(auto j:adj[x]){
        if(j!=par){
            c[j].first=x;
            dfs(j,adj,c,x);
        }
    }
}
int find(vector<pair<int,int>>&par,int i){
    if(par[i].first!=i)return par[i].first=find(par,par[i].first);
    return par[i].first;
}
int merge(vector<pair<int,int>>&par,int i,int j){
    if(par[i].second>par[j].second){
        par[j].first=i;
    }
    else if(par[i].second<par[j].second){
        par[i].first=j;
    }
    else{
        par[j].first=i;
        par[i].second++;
    }
}
// ll f[200005];
// ll modInverse(ll x, ll m){
// 	return power(x, m-2, m);
// }
// ll ncr(ll n,ll r, ll p)
// {
//     if (n < r)
//         return 0;
    
//     if (r == 0)
//         return 1;

 
//     return (f[n] * modInverse(f[r], p) % p * modInverse(f[n - r], p) % p)% p;
// }
void convert(vector<string>&s){
    for(int i=0;i<s.size();i++){
	        int f=0;
	        for(int j=0;j<s[i].size();j++){
	            if(s[i][j]=='#'){
	                f=1;
	                break;
	            }
	        }
	        if(f==1)break;
	        else {
	            s.erase(s.begin()+i);
	            i--;
	        }
	    }
	    for(int i=s.size()-1;i>=0;i--){
	        int f=0;
	        for(int j=0;j<s[i].size();j++){
	            if(s[i][j]=='#'){
	                f=1;
	                break;
	            }
	        }
	        if(f==1)break;
	        else {
	            s.erase(s.begin()+i);
	        }
	    }
	    for(int i=0;i<s[0].size();i++){
	        int f=0;
	        for(int j=0;j<s.size();j++){
	            if(s[j][i]=='#'){
	                f=1;
	                break;
	            }
	        }
	        if(f)break;
	        else{
	           for(int j=0;j<s.size();j++){
    	            s[j].erase(s[j].begin()+i);
    	        }
    	        i--;
	        }
	    }
	    for(int i=s[0].size()-1;i>=0;i--){
	        int f=0;
	        for(int j=0;j<s.size();j++){
	            if(s[j][i]=='#'){
	                f=1;
	                break;
	            }
	        }
	        if(f)break;
	        else{
	           for(int j=0;j<s.size();j++){
    	            s[j].erase(s[j].begin()+i);
    	        }
	        }
	    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	int t=1;
	//cin>>t;
	//cout<<add(9,2021)<<endl;
	
	while(t--){
	   int n;
	   cin>>n;
	   vector<pair<int,int>>arr(n);
	   set<pair<int,int>>s;
	   for(int i=0;i<n;i++){
	       cin>>arr[i].first>>arr[i].second;
	       s.insert({arr[i].first,arr[i].second});
	   }
	   int ans=0;
	   for(int i=0;i<n;i++){
	       for(int j=i+1;j<n;j++){
	           if(arr[i].first==arr[j].first||arr[i].second==arr[j].second)continue;
	           if(s.find({arr[i].first,arr[j].second})!=s.end()&&s.find({arr[j].first,arr[i].second})!=s.end())ans++;
	       }
	   }
	   cout<<ans/2<<endl;
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int merge(std::vector<std::pair<int, int> >&, int, int)’:
./Main.cpp:45:1: warning: no return statement in function returning non-void [-Wreturn-type]
   45 | }
      | ^
./Main.cpp: In function ‘void convert(std::vector<std::__cxx11::basic_string<char> >&)’:
./Main.cpp:62:18: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::__cxx11::basic_string<char> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   62 |     for(int i=0;i<s.size();i++){
      |                 ~^~~~~~~~~
./Main.cpp:64:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   64 |          for(int j=0;j<s[i].size();j++){
      |                      ~^~~~~~~~~~~~
./Main.cpp:78:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   78 |          for(int j=0;j<s[i].size();j++){
      |                      ~^~~~~~~~~~~~
./Main.cpp:89:19: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   89 |      for(int i=0;i<s[0].size();i++){
      |                  ~^~~~~~~~~~~~
./Main.cpp:91:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::__cxx11::basic_string<char> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   91 |          for(int j=0;j<s.size();j++){
      |                      ~^~~~~~~~~
./Main.cpp:99:26: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::__cxx11::basic_string<char> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   99 |             for(int j=0;j<s.size();j++){
      |                         ~^~~~~~~~~
./Main.cp...

Judge Result