oj.uz

답안 #373680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
373680 2021-03-05T12:13:30 Z NaimSS 시간이 돈 (balkan11_timeismoney) C++14
100 / 100
 739 ms 620 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define rep(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
typedef long long ll;
const int N = 205;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
pii e[10100];
pii cost[10100];
const int inf = 1e9;
pll ptRes = pll(inf,inf);
int n,m;
int res[N];
int used[N];
int pai[N],sz[N];
int f(int x){
  return pai[x] = (pai[x] == x ? x : f(pai[x]));
}
int join(int a,int b){
  a=f(a),b=f(b);
  if(a==b)return 0;
  if(sz[a] > sz[b])swap(a,b);
  pai[a]=b;
  sz[b]+=sz[a];
  return 1;
}

int ids[10100];

pll kruska(pll cur){
  rep(i,0,N){
    pai[i]=i,sz[i]=1;
  }
  sort(ids,ids+m,[&](int a,int b){
    return 1ll*cur.ss * (cost[a].ff - cost[b].ff) + 1ll*cur.ff * (cost[a].ss - cost[b].ss) < 0;
  });

  int ptr=0;
  pll c = pll(0,0);
  rep(it,0,m){
    int i = ids[it];
    if(join(e[i].ff,e[i].ss)){
      used[ptr++] = i;
      c.ff+=cost[i].ff;
      c.ss+=cost[i].ss;
    }
  }
  if(c.ff * c.ss < ptRes.ff * ptRes.ss){
    ptRes = c;
    rep(i,0,n-1)res[i] = used[i];
  }
  return c;
}
int iter=0;
void go(pll A,pll B){
  if(A==B)return;
  pll C = kruska(pll(B.ff - A.ff,A.ss - B.ss));
  if((B.ff - A.ff) * (C.ss - A.ss) - (B.ss - A.ss) * (C.ff - A.ff) == 0)return;
  go(A,C);
  go(C,B);
}

int main(){
  scanf("%d%d",&n,&m);
  rep(i,0,m){
    scanf("%d%d%d%d",&e[i].ff,&e[i].ss,&cost[i].ff,&cost[i].ss);
    ids[i] = i;
  }
  pll A = kruska(pll(0,1));
  pll B = kruska(pll(1,0));
 
  go(A,B);
  
  printf("%lld %lld\n",ptRes.ff,ptRes.ss);
  rep(i,0,n-1){
    printf("%d %d\n",e[res[i]].ff,e[res[i]].ss);
  }
}

Compilation message

timeismoney.cpp: In function 'int main()':
timeismoney.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   66 |   scanf("%d%d",&n,&m);
      |   ~~~~~^~~~~~~~~~~~~~
timeismoney.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   68 |     scanf("%d%d%d%d",&e[i].ff,&e[i].ss,&cost[i].ff,&cost[i].ss);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 6 ms 620 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 5 ms 364 KB Output is correct
15 Correct 4 ms 364 KB Output is correct
16 Correct 76 ms 364 KB Output is correct
17 Correct 82 ms 492 KB Output is correct
18 Correct 76 ms 364 KB Output is correct
19 Correct 717 ms 620 KB Output is correct
20 Correct 739 ms 620 KB Output is correct