Submission #1095852

# Submission time Handle Problem Language Result Execution time Memory
1095852 2024-10-03T10:32:42 Z Ahmed57 timeismoney (balkan11_timeismoney) C++17
55 / 100
1817 ms 1608 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<array<int,4>>v;
int pr[201];
int sz[201];
int n,m;
int find(int x){
    if(x==pr[x])return x;
    return pr[x] = find(pr[x]);
}
bool mergegroup(int a,int b){
    a = find(a);
    b = find(b);
    if(a==b)return 0;
    if(sz[a]<sz[b])swap(a,b);
    pr[b] = a;
    sz[a]+=sz[b];
    return 1;
}
pair<int,int> solve(int x,int y){
    vector<array<int,2>> lol;
    for(int i = 0;i<v.size();i++){
        lol.push_back({v[i][2]*x+v[i][3]*y,i});
    }
    sort(lol.begin(),lol.end());
    for(int i = 1;i<=n;i++){
        pr[i] = i;
        sz[i] = 1;
    }
    long long a = 0 , b = 0;
    for(auto i:lol){
        if(mergegroup(v[i[1]][0],v[i[1]][1])){
            a+=v[i[1]][2];
            b+=v[i[1]][3];
        }
    }
    return {a,b};
}
void print(int x,int y){
    vector<array<int,2>> lol;
    for(int i = 0;i<v.size();i++){
        lol.push_back({v[i][2]*x+v[i][3]*y,i});
    }
    sort(lol.begin(),lol.end());
    for(int i = 1;i<=n;i++){
        pr[i] = i;
        sz[i] = 1;
    }
    long long a = 0 , b = 0;
    for(auto i:lol){
        if(mergegroup(v[i[1]][0],v[i[1]][1])){
            cout<<v[i[1]][0]-1<<" "<<v[i[1]][1]-1<<endl;
        }
    }
}
long long all = 1e18;
map<pair<int,int>,int> mp;
int nx = 0 , ny = 0;
bool ss = 0;
void rec(pair<int,int>a,pair<int,int> b){
    mp[a] = 1;
    mp[b] = 1;
    if(ss==0){
    if(all>a.first*a.second){
        all = a.first*a.second;
        nx = 1 , ny = 0;
    }
    if(all>b.first*b.second){
        all = b.first*b.second;
        nx = 0 , ny = 0;
    }
    }
    ss = 1;
    int Y = a.second-b.second;
    int X = a.first-b.first;
    int gc = __gcd(abs(X),abs(Y));
    X/=gc;Y/=gc;
    X = -X;
    pair<int,int> lol = solve(X,Y);
    if(lol.first*lol.second<all){
        all = lol.first*lol.second;
        nx = X;
        ny = Y;
    }
    if(mp[lol])return ;
    else {
        rec(a,lol);
        rec(lol,b);
    }
}
signed main(){
    cin>>n>>m;
    for(int i = 0;i<m;i++){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        a++;b++;
        v.push_back({a,b,c,d});
    }
    rec(solve(1,0),solve(0,1));
    cout<<solve(nx,ny).first<<" "<<solve(nx,ny).second<<endl;
    print(nx,ny);
    return 0;
}

Compilation message

timeismoney.cpp: In function 'std::pair<long long int, long long int> solve(long long int, long long int)':
timeismoney.cpp:23:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(int i = 0;i<v.size();i++){
      |                   ~^~~~~~~~~
timeismoney.cpp: In function 'void print(long long int, long long int)':
timeismoney.cpp:42:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i = 0;i<v.size();i++){
      |                   ~^~~~~~~~~
timeismoney.cpp:50:15: warning: unused variable 'a' [-Wunused-variable]
   50 |     long long a = 0 , b = 0;
      |               ^
timeismoney.cpp:50:23: warning: unused variable 'b' [-Wunused-variable]
   50 |     long long a = 0 , b = 0;
      |                       ^
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 8
2 Runtime error 0 ms 360 KB Execution killed with signal 8
3 Runtime error 0 ms 348 KB Execution killed with signal 8
4 Runtime error 1 ms 436 KB Execution killed with signal 8
5 Runtime error 1 ms 604 KB Execution killed with signal 8
6 Runtime error 1 ms 428 KB Execution killed with signal 8
7 Runtime error 2 ms 860 KB Execution killed with signal 8
8 Runtime error 8 ms 1608 KB Execution killed with signal 8
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 1 ms 348 KB Output isn't correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 428 KB Output is correct
14 Correct 11 ms 440 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 175 ms 656 KB Output is correct
17 Correct 176 ms 624 KB Output is correct
18 Correct 171 ms 604 KB Output is correct
19 Correct 1744 ms 1392 KB Output is correct
20 Correct 1817 ms 1392 KB Output is correct