Submission #1257131

#	Time	Username	Problem	Language	Result	Execution time	Memory
1257131		denislav	Making Friends on Joitter is Fun (JOI20_joitter2)	C++20	0 / 100	0 ms	320 KiB

joitter2

# include <iostream>
# include <vector>
# include <set>
using namespace std;

const int MAX=2e3+11;

int n,m;
vector<int> adj[MAX];

int ans;
bool tab[MAX][MAX];
void add(int u, int v)
{
    if(u==v) return ;
    if(!tab[u][v]) ans++;
    tab[u][v]=1;
}
bool has(int u, int v)
{
    if(u==v) return false;
    return tab[u][v];
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int u,v;
        cin>>u>>v;
        add(u,v);

        if(has(v,u))
        {
            for(int x=1;x<=n;x++)
            {
                //if(x==u or x==v) continue;
                if(has(x,u)) add(x,v);
                else if(has(x,v)) add(x,u);
            }
        }
        for(int x=1;x<=n;x++)
        {
            //if(u==x) continue;
            if(has(v,x) and has(x,v)) add(u,x);
        }

        cout<<ans<<"\n";
        //for(pair<int,int> pa: s) cout<<pa.first<<" "<<pa.second<<"\n";
    }

    return 0;
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 16
• Subtask 3: 0 / 83