题目
思路:先求出k对不重复的情况(n*(n-1)/2),在计算重复的去重(i*(i-1)/2)
AC代码:
package 练习;
import java.io.*;
import java.lang.*;
import java.util.*;
import java.io.*;
import java.util.*;
public class Main{
static Scanner scanner=new Scanner(new BufferedReader(new InputStreamReader(System.in)));
public static void main(String[] args) {
int t=scanner.nextInt();
while(t-->0) {
int n=scanner.nextInt();
int m=scanner.nextInt();
int k=scanner.nextInt();
int a[]=new int [n];
for(int i=0;i<k;i++)a[scanner.nextInt()-1]++;
int b[]=new int [m];
for(int i=0;i<k;i++) {
int x=scanner.nextInt()-1;
b[x]++;
}
long ans=show(k);
for(long i:a)ans-=show(i);
for(long i:b)ans-=show(i);
System.out.println(ans);
}
}
static long show(long n) {
return n*(n-1)/2;
}
}
原思路:就是直接用set去重没找规律,虽然暴力但也算是O(n)的复杂度,但是第五个样例过不去
import java.util.*;
import java.io.*;
public class MM {
public static void main(String[] args) throws IOException {
StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
while(in.nextToken()!=StreamTokenizer.TT_EOF) {
int t=(int)in.nval;
while(t-->0) {
in.nextToken();
int n=(int)in.nval;
in.nextToken();
int m=(int)in.nval;
in.nextToken();
int k=(int)in.nval;
Integer a[]=new Integer [k];
for(int i=0;i<k;i++) {
in.nextToken();
a[i]=(int)in.nval-1;
}
Integer b[]=new Integer[k];
for(int i=0;i<k;i++) {
in.nextToken();
b[i]=(int)in.nval-1;
}
long ans=0;
Set[]aSets=new Set[n];
for(int i=0;i<n;i++)aSets[i]=new HashSet<Integer>();
Set[]bSets=new Set[m];
for(int j=0;j<m;j++)bSets[j]=new HashSet<Integer>();
for(int i=0;i<k;i++) {//
aSets[a[i]].add(i);
bSets[b[i]].add(i);
}
for(int i=0;i<k;i++) {
Set<Integer>set=new HashSet<Integer>();
set.addAll(aSets[a[i]]);
set.addAll(bSets[b[i]]);
//System.out.println(set.size());
ans+=(k-set.size());
}
// for(int i=0;i<k;i++) {
// for(int j=i+1;j<k;j++) {
// if(a[i]!=a[j]&&b[i]!=b[j]) {
// //System.out.println(a[i]+" "+a[]);
// ans++;
// }
// }
// }
System.out.println(ans/2);
}
}
}
}