# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
937528 | guagua0407 | Making Friends on Joitter is Fun (JOI20_joitter2) | C++17 | 5053 ms | 29028 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int main() {_
int n,m;
cin>>n>>m;
vector<vector<bool>> adj(n,vector<bool>(n));
vector<vector<bool>> s1(n,vector<bool>(n));
vector<vector<bool>> s2(n,vector<bool>(n));
ll ans=0;
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
a--;
b--;
if(adj[a][b]){
cout<<ans<<'\n';
continue;
}
queue<pair<int,int>> q;
q.push({a,b});
adj[a][b]=true;
ans++;
while(!q.empty()){
auto tmp=q.front();
q.pop();
int v=tmp.f;
int u=tmp.s;
//cout<<v+1<<' '<<u+1<<'\n';
if(!s1[v][u]){
for(int i=0;i<n;i++){
if(i!=v and i!=u and adj[u][i] and adj[i][u]){
if(!adj[v][i]){
adj[v][i]=true;
ans++;
q.push({v,i});
}
}
}
s1[v][u]=true;
}
if(adj[v][u] and adj[u][v] and !s2[v][u]){
for(int i=0;i<n;i++){
if(i!=v and i!=u and adj[i][v]^adj[i][u]){
if(adj[i][v]){
adj[i][u]=true;
ans++;
q.push({i,u});
}
else{
adj[i][v]=true;
ans++;
q.push({i,v});
}
}
}
s2[v][u]=s2[u][v]=true;
}
}
cout<<ans<<'\n';
}
return 0;
}
//maybe its multiset not set
//yeeorz
//laborz
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |