Submission #33665237

Source Code Expand

#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define put(i) cout << i << endl
#define rep(i, s, n) for (long long i = s; i < (long long)(n); i++)
using namespace std;
using ll = long long;

int main() {
    ll n, m;
    cin >> n >> m;
    vector<ll> u(m), v(m);
    rep(i,0,m) cin >> u[i] >> v[i];

    vector<vector<ll>> g(n+1);
    map<pair<ll,ll>,ll> mp;
    rep(i,0,m){
        g[u[i]].push_back(v[i]);
        g[v[i]].push_back(u[i]);
        mp[{u[i],v[i]}]++;
    }

    ll ans = 0;

    rep(a,1,n+1){
        rep(b,a+1,n+1){
            rep(c,b+1,n+1){
                if ((mp.count({a,b}) or mp.count({b,a})) and
                    (mp.count({b,c}) or mp.count({c,b})) and 
                    (mp.count({a,c}) or mp.count({c,a}))){
                        ans++;
                    }
            }
        }
    }    
    put(ans);
}

Submission Info

Submission Time
Task B - Triangle (Easier)
User aoken_7
Language C++ (GCC 9.2.1)
Score 200
Code Size 860 Byte
Status AC
Exec Time 30 ms
Memory 3984 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 9
Set Name Test Cases
Sample example_00.txt, example_01.txt, example_02.txt
All example_00.txt, example_01.txt, example_02.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt
Case Name Status Exec Time Memory
example_00.txt AC 8 ms 3496 KiB
example_01.txt AC 2 ms 3492 KiB
example_02.txt AC 2 ms 3568 KiB
test_00.txt AC 30 ms 3984 KiB
test_01.txt AC 23 ms 3904 KiB
test_02.txt AC 19 ms 3604 KiB
test_03.txt AC 3 ms 3432 KiB
test_04.txt AC 2 ms 3632 KiB
test_05.txt AC 9 ms 3544 KiB