oj.uz

Submission #469535

# Submission time Handle Problem Language Result Execution time Memory
469535 2021-09-01T09:12:27 Z Carmel_Ab1 Roads (CEOI20_roads) C++17
15 / 100
 1000 ms 6448 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t:a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}
#define x first
#define y second

pl norm(pl p){
    if(p.second==0)
        return {0,-1};
    ll g=gcd(p.first,p.second);
    return {p.first/g,p.second/g};
}
void solve() {
    ll n;
    cin >> n;
    vector<pair<pl,pl>>a(n);
    for(int i=0; i<n; i++) {
        cin >> a[i].first >> a[i].second;
        if(a[i].first.y>a[i].second.y)
            swap(a[i].first,a[i].second);
    }
    sort(all(a),[](pair<pl,pl>p1,pair<pl,pl>p2){
       if(p1.first.x<p2.first.x)
           return 1;
       else if(p1.first.x>p2.first.x)
           return 0;
        if(p1.second.y<p2.second.y)
            return 1;
        else
            return 0;
    });
    map<ll,map<pl,vector<pair<pl,pl>>>>mp;
    for(int i=0; i<n; i++){
        ll dx=a[i].first.x-a[i].second.x;
        ll dy=a[i].first.y-a[i].second.y;
        mp[a[i].first.x][norm({dy,dx})].pb(a[i]);
    }
    a.clear();

    for(auto it1:mp){
        for(auto it:mp[it1.first]){
            vector<pair<pl,pl>>v=it.second;
            for(int i=0; i<v.size()-1; i++)
                cout << v[i].second << " " << v[i+1].first << "\n";
            a.pb({v[0].first, v.back().second});
        }
    }
    sort(all(a),[](pair<pl,pl>p1,pair<pl,pl>p2){
        return p1.first.x<p2.first.x;
    });
    for(int i=0; i<a.size()-1; i++)
        cout << a[i].second << " " << a[i+1].second << "\n";
}
/*
 3
0 0 0 1
0 2 0 3
1 6 1 5
 */

Compilation message

roads.cpp: In function 'void solve()':
roads.cpp:181:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  181 |             for(int i=0; i<v.size()-1; i++)
      |                          ~^~~~~~~~~~~
roads.cpp:189:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  189 |     for(int i=0; i<a.size()-1; i++)
      |                  ~^~~~~~~~~~~
roads.cpp: In function 'void usaco(std::string)':
roads.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
roads.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 16 ms 3020 KB Output is correct
5 Correct 33 ms 6388 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 22 ms 3076 KB Output is correct
5 Correct 33 ms 6448 KB Output is correct
6 Execution timed out 1082 ms 204 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 17 ms 3072 KB Output is correct
5 Correct 33 ms 6388 KB Output is correct
6 Execution timed out 1085 ms 204 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -