Submission #1180914

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180914		meicris	Marshmallow Molecules (CCO19_day2problem2)	C++17	0 / 25	0 ms	324 KiB

Main

#include <bits/stdc++.h>
#include <vector>
#include <unordered_set>

using namespace std;

const int MAX=10;
vector<int> grafo [MAX];
void revisar_vecinos(int nodo) {
    vector<int> vecinos = grafo[nodo];
    sort(vecinos.begin(), vecinos.end());
    for (int i = 0; i < vecinos.size(); ++i) {
        for (int j = i + 1; j < vecinos.size(); ++j) {
            int u = vecinos[i];
            int v = vecinos[j];
            if (u > nodo && v > nodo && u!=v) {
                swap(u, v);
                if (find(grafo[v].begin(), grafo[v].end(), u) == grafo[v].end()) {
                    grafo[v].push_back(u);
                    grafo[u].push_back(v);
                }
            }
        }
    }
}
int main() {
    int n, q;
    cin >> n >> q;
    int a, b;
    while (q--) {
        cin >> a >> b;
        swap(a, b);
        grafo[b].push_back(a);
        grafo[a].push_back(b);
    }
    int total=0;
    for (int i = 1; i <= n; i++) {
        total += grafo[i].size();
    }
    cout<<total;
    return 0;
}

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