oj.uz

답안 #845035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
845035 2023-09-06T11:29:47 Z alexdd 시간이 돈 (balkan11_timeismoney) C++17
45 / 100
 3 ms 604 KB 
#include<bits/stdc++.h>
using namespace std;
int n,m;
pair<pair<int,int>,pair<int,int>> edges[10005];

int father[300];
int siz[300];
int gas(int x)
{
    if(x!=father[x])
        father[x]=gas(father[x]);
    return father[x];
}
void unite(int x, int y)
{
    x = gas(x);
    y = gas(y);
    if(x==y)
        return;
    if(siz[x]<siz[y])
        swap(x,y);
    father[y]=x;
    siz[x]+=siz[y];
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);

    cin>>n>>m;
    for(int i=0;i<n;i++)
        father[i]=i,siz[i]=1;
    for(int i=0;i<m;i++)
    {
        cin>>edges[i].second.first>>edges[i].second.second>>edges[i].first.first>>edges[i].first.second;
    }
    sort(edges,edges+m);
    int sum0=0,sum1=0;
    vector<pair<int,int>> sol;
    for(int i=0;i<m;i++)
    {
        if(gas(edges[i].second.first)!=gas(edges[i].second.second))
        {
            unite(edges[i].second.first,edges[i].second.second);
            sol.push_back(edges[i].second);
            sum0+=edges[i].first.first;
            sum1+=edges[i].first.second;
        }
    }
    cout<<sum0<<" "<<sum1<<"\n";
    for(int i=0;i<sol.size();i++)
        cout<<sol[i].first<<" "<<sol[i].second<<"\n";
    return 0;
}

Compilation message

timeismoney.cpp: In function 'int main()':
timeismoney.cpp:50:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for(int i=0;i<sol.size();i++)
      |                 ~^~~~~~~~~~~

Subtask #1
45.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Incorrect 1 ms 464 KB Output isn't correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Incorrect 0 ms 344 KB Output isn't correct
13 Incorrect 0 ms 344 KB Output isn't correct
14 Incorrect 1 ms 344 KB Output isn't correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Incorrect 1 ms 344 KB Output isn't correct
17 Incorrect 1 ms 344 KB Output isn't correct
18 Incorrect 1 ms 344 KB Output isn't correct
19 Incorrect 3 ms 604 KB Output isn't correct
20 Incorrect 3 ms 600 KB Output isn't correct