QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#728871 | #9573. Social Media | ucup-team3282# | WA | 21ms | 9380kb | C++14 | 2.1kb | 2024-11-09 16:07:19 | 2024-11-09 16:07:33 |
Judging History
answer
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
vector<int>link[200050];
int sum[800050];bool tb[200050];
void add(int p,int l,int r,int np,int op){
// if(p==1){
// cout<<np<<" "<<op<<endl;
// }
if(l>np||r<np)return;
if(l==r){
sum[p]+=op;
return;
}int mid=(l+r)>>1;
add(p<<1 ,l ,mid,np,op);
add(p<<1|1,mid+1,r ,np,op);
sum[p]=max(sum[p<<1],sum[p<<1|1]);
return;
}
int main(){
int t;cin>>t;while(t--){
int n,m,k;cin>>n>>m>>k;
for(int i=1;i<=k;i++){
link[i].clear();
tb[i]=0;
sum[i]=sum[i+k]=sum[i+k+k]=sum[i+k+k+k]=0;
}
for(int i=1;i<=n;i++){
int p;cin>>p;tb[p]=1;
}
int anser=0;
int cnt=0;
for(int i=1;i<=m;i++){
int f,t;cin>>f>>t;
link[f].push_back(t);
link[t].push_back(f);
if(tb[f]==1&&tb[t]==1){
cnt++;
}else{
if(tb[f]==1){
add(1,1,k,t,1);
}
if(tb[t]==1){
add(1,1,k,f,1);
}
}
}
anser=cnt;
for(int i=1;i<=k;i++){
if(tb[i])continue;
int th=0;
add(1,1,k,i,-114514);
int kk=0;
for(auto x:link[i]){
if(x==i){
kk++;
}else
if(tb[x]){
th++;
}else{
add(1,1,k,x,1);
}
}
th+=kk/2;
if(kk%2==1){
while(1);
}
// cout<<sum[1]<<"!";
anser=max(anser,cnt+th+sum[1]);
for(auto x:link[i]){
if(tb[x]||x==i){
th++;
}else{
add(1,1,k,x,-1);
}
}
// add(1,1,k,i,114514);
}
cout<<anser<<endl;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 8708kb
input:
5 4 12 7 5 7 3 6 3 6 2 2 1 4 2 4 1 3 7 6 4 1 5 4 1 1 1 1 2 1 3 7 2 7 6 2 4 1 2 3 2 2 5 5 4 2 6 4 6 2 6 1 1 2 1 1 2 2 1 2 1 2 1 2 2 1 100 24 11 11 24
output:
9 5 1 1 1
result:
ok 5 number(s): "9 5 1 1 1"
Test #2:
score: -100
Wrong Answer
time: 21ms
memory: 9380kb
input:
10000 19 12 20 8 12 1 5 11 7 17 13 19 6 3 9 10 15 14 20 4 18 16 4 11 7 1 8 4 16 19 1 13 15 2 16 2 8 7 3 15 11 13 5 20 18 14 17 14 20 2 9 1 12 8 11 10 17 18 16 3 15 5 14 20 13 7 15 10 3 2 5 16 7 8 6 1 6 4 18 16 1 8 4 1 20 6 6 9 4 15 7 5 14 9 1 3 18 9 15 18 17 15 11 14 7 19 7 3 1 2 5 6 4 7 5 1 4 5 3 1...
output:
12 14 1 19 6 5 1 11 19 4 3 10 4 1 4 19 15 2 18 4 17 5 1 2 5 17 3 2 6 15 6 2 5 4 4 7 3 7 4 1 15 15 2 3 6 12 12 7 6 8 8 6 8 11 16 1 3 9 8 14 2 6 19 19 16 8 20 14 8 12 7 9 6 8 2 17 9 5 5 3 5 6 20 8 13 11 10 5 3 6 3 1 8 5 8 11 7 14 10 9 8 11 7 9 5 2 7 14 10 5 3 5 4 10 1 6 8 16 5 3 19 1 4 8 7 10 3 2 1 15...
result:
wrong answer 32nd numbers differ - expected: '3', found: '2'