my solution for kickstart 2019 prob cherries mesh
#include<iostream>
#include<set>
#include<utility>
using namespace std;
int main()
{
int t;
cin>>t;
for(int i=0;i<t;i++)
{
int n;
cin>>n;
set<pair<int,int>> s;
int m;
cin>>m;
int sum=0;
pair<int,int> p1,p2;
for(int i=0;i<m;i++)
{
int b,c;
cin>>b>>c;
p1.first=b;p2.first=c;
p1.second=c;p2.second=b;
if(s.find(p1)==s.end()&&s.find(p2)==s.end())
{
s.insert(p1);s.insert(p2);sum++;
}
}
if(sum>=n)
sum=n-1;
else
sum=(n-1-sum)*2+sum;
cout << "Case #" << (i+1) << ": " << sum<< endl;
}
return 0;
}
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/google-code/ba29d46a-d05f-423f-86a7-b1bfc5077fa7%40googlegroups.com.
