제출 #1207907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1207907		dksnfjkfnwkfw	Marshmallow Molecules (CCO19_day2problem2)	C++20	10 / 25	2781 ms	126764 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define sonic ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define IO(main) if(fopen(main".inp","r")){freopen(main".inp","r",stdin);freopen(main".out","w",stdout);}
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define ins insert
#define pb push_back
#define el cout << endl
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define MASK(i) ((1LL)<<(i))
#define BIT(x,i) (((x)>>(i))&(1LL))
#define FOR(i, a, b) for(int (i)=(a);(i)<=(b); i++)
#define FORD(i, a, b) for(int (i)=(a);(i)>=(b); i--)


using ll = long long;
using ull = unsigned long long;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;

const int N = 1e6 + 9;
const int mod = 1e9 + 7;
const ll INF = 1e18 + 7;
const int base = 31;
const int LOG = 20;
const ll MOD = 1e9 + 7;

int mul(int x, int y) {return 1LL * x * y % mod;}
int calPw(int x, int y)
{
    int ans = 1;
    while(y)
    {
        if (y&1) ans = 1LL * ans * x % mod;
        x = 1LL * x * x % mod;
        y >>= 1;
    }
    return ans;
}
int d4x[4] = {1, 0, -1, 0};
int d4y[4] = {0, 1, 0, -1};
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
///Author: Le Chi Thien Luong The Vinh high school 2008
///code
template<class X, class Y>
bool minimize(X &x , Y y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool maximize(X &x , Y y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool add(X &x , Y y){
    if((x + y ) >= mod){
        ll tmp  = x + y;
        x = tmp - mod;
        return true;
    }
    return false;
}
void Solve(){

}
int n, m;
pii a[N];
bool used[5005][5005];
int pre[5005][5005];
bitset<5005>dp[5005];
void Read(){
    cin >> n >> m;
    FOR(i, 1, m){
        cin >> a[i].fi >> a[i].se;
        used[a[i].fi][a[i].se] = 1;
        used[a[i].se][a[i].fi] = 1;
        int x = a[i].fi;
        int y = a[i].se;
        if(x > y)swap(x, y);
        dp[y][x] = 1;
        pre[y][x] =1;
    }
    FOR(i, 1, n){
        FOR(j, 1, n)pre[i][j] += pre[i][j - 1];
    }
//    FOR(i, 0, n)cout << dp[3][i] << " " ;el;
//    FOR(i, 0, n)cout << dp[6][i] << " " ;el;
//    bitset<5005>cnt = (dp[3] & dp[6]);
//    FOR(i, 0, n)cout << cnt[i] << " ";el;
///    el;el;el;
    ll ans = m;
    FOR(i, 2, n){
        FOR(j, i + 1, n){
            if(used[i][j] == 1)continue;
            bitset<5005> igg = (dp[i] & dp[j]);
            if(igg.count() > 0){
                ans++;
                 dp[j][i] = 1;
            }
        }
    }
   /// el;
    cout << ans;
}



int main()
{
    sonic;

    int TEST = 1;
   // cin >> TEST;
    while(TEST--)
    {

        Read();
        Solve();
    }
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 10