oj.uz

답안 #335851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335851 2020-12-14T06:51:41 Z hackxsaras 꿈 (IOI13_dreaming) C++14
0 / 100
 89 ms 14572 KB 
#include "bits/stdc++.h"
#include "dreaming.h"
// #include "chrono"

using namespace std;
// using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define pb push_back
#define galen_colin {ios_base::sync_with_stdio(false);}
#define orz {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define all(v) v.begin(), v.end()

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;

template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
    cout << ""; for(int i = 0; i < v.size(); i++) {if (i) cout << " "; cout << v[i];} return cout << "\n";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
    cin >> p.first;
    return cin >> p.second;
}
template<typename A> istream& operator>>(istream& cin, vector<A> &v) {
    for(auto &x:v)cin>>x;
    return cin;
}

ll min(ll a, int b){return min(a, (ll) b);}
ll min(int a, ll b){return min(b, (ll) a);}
ll max(ll a, int b){return max(a, (ll) b);}
ll max(int a, ll b){return max(b, (ll) a);}

void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}
 
const ld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
const ll INF = 1e9+7;
 


ll n, m, k, q, l, r, x, y, z;

const ll sz = 1e5 + 1;
string s, t;
ll ans = 0, gc = 0;

vector<pair<int,int>> far;
vector<int> full, half;
vpi adj[sz];
vi path, vis(sz);

void getccs(int no, int dep){
    vis[no]=1;
    
    if(dep>far[gc].second){
        far[gc]=make_pair(no,dep);
    }
    for(auto i:adj[no]){
        if(!vis[i.f]){
            getccs(i.f,dep+i.s);
        }
    }
    
}
//the max.....in this cc
//if sum > anything else up till now, but say there are only two edges we can't do better ig

int binary_searc(vi& v){
    int halfdiff = v.back()/2;
    int l=0, r = v.size()-1;
    int ret = v.back() - halfdiff;
    int idx = r;
    while(l<=r){
        int m = (l+r)/2;
        if(abs(v[m] - halfdiff) < ret){
            ret = abs(v[m] - halfdiff);
            idx = m;
        }
        ret = min(ret, abs(v[m] - halfdiff));
        if(v[m] - halfdiff <= 0){
            l = m+1;
        } else {
            r = m-1;
        }
    }
    return max(v[idx], v.back() - v[idx]);
}
void farfar(int no, int dep){
    
    vis[no]=1;
    
    path.push_back(dep);

    full[gc] = max(full[gc], path.back());
    half[gc] = max(half[gc], binary_searc(path));

    for(auto i:adj[no]){
        if(!vis[i.f]){
            farfar(i.f, dep + i.s);
        }
    }
    path.pop_back();
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    for(int i=0;i<M;i++){
        adj[A[i]].pb({B[i], T[i]});
        adj[B[i]].pb({A[i], T[i]});
    }

    n = N;
    for(int i=0;i<n;i++){

        if(!vis[i]){
            far.push_back(make_pair(-1,-1));
            getccs(i,0);
            gc++;
        }
    }

    gc=0;
    
    vis.clear();
    vis.resize(sz, 0);

    for(int i=0;i<far.size();i++){
        full.pb(0), half.pb(0);
        farfar(far[i].first, 0);
        gc++;
    }

    
    sort(all(full));
    sort(all(half));

    ans = full.back();
    if(half.size() >= 2)
        ans = max(ans, half[half.size()-1] + half[half.size()-2] + L);

    return ans;
}
 
// int main() {
//     int N,M,L;
//     cin>>N>>M>>L;
//     int A[M], B[M], T[M];
//     for(int i=0;i<M;i++)cin>>A[i]>>B[i]>>T[i];
//     cout<< travelTime(N, M, L, A, B, T);
// } 

/*

12 8 2
0 8 4
8 2 2
2 7 4
5 11 3
5 1 7
1 3 1
1 9 5
10 6 3 

*/

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:153: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]
  153 |     for(int i=0;i<far.size();i++){
      |                 ~^~~~~~~~~~~
dreaming.cpp: In function 'void usaco(std::string)':
dreaming.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((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dreaming.cpp:58:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   58 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 14572 KB Output is correct
2 Correct 65 ms 14568 KB Output is correct
3 Correct 39 ms 10600 KB Output is correct
4 Correct 10 ms 4844 KB Output is correct
5 Correct 8 ms 3948 KB Output is correct
6 Correct 15 ms 5740 KB Output is correct
7 Correct 2 ms 3052 KB Output is correct
8 Correct 30 ms 7404 KB Output is correct
9 Correct 40 ms 9324 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 59 ms 11244 KB Output is correct
12 Correct 89 ms 13424 KB Output is correct
13 Incorrect 3 ms 3180 KB Output isn't correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 14572 KB Output is correct
2 Correct 65 ms 14568 KB Output is correct
3 Correct 39 ms 10600 KB Output is correct
4 Correct 10 ms 4844 KB Output is correct
5 Correct 8 ms 3948 KB Output is correct
6 Correct 15 ms 5740 KB Output is correct
7 Correct 2 ms 3052 KB Output is correct
8 Correct 30 ms 7404 KB Output is correct
9 Correct 40 ms 9324 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 59 ms 11244 KB Output is correct
12 Correct 89 ms 13424 KB Output is correct
13 Incorrect 3 ms 3180 KB Output isn't correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 14572 KB Output is correct
2 Correct 65 ms 14568 KB Output is correct
3 Correct 39 ms 10600 KB Output is correct
4 Correct 10 ms 4844 KB Output is correct
5 Correct 8 ms 3948 KB Output is correct
6 Correct 15 ms 5740 KB Output is correct
7 Correct 2 ms 3052 KB Output is correct
8 Correct 30 ms 7404 KB Output is correct
9 Correct 40 ms 9324 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 59 ms 11244 KB Output is correct
12 Correct 89 ms 13424 KB Output is correct
13 Incorrect 3 ms 3180 KB Output isn't correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 6764 KB Output is correct
2 Incorrect 39 ms 6760 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 14572 KB Output is correct
2 Correct 65 ms 14568 KB Output is correct
3 Correct 39 ms 10600 KB Output is correct
4 Correct 10 ms 4844 KB Output is correct
5 Correct 8 ms 3948 KB Output is correct
6 Correct 15 ms 5740 KB Output is correct
7 Correct 2 ms 3052 KB Output is correct
8 Correct 30 ms 7404 KB Output is correct
9 Correct 40 ms 9324 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 59 ms 11244 KB Output is correct
12 Correct 89 ms 13424 KB Output is correct
13 Incorrect 3 ms 3180 KB Output isn't correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 14572 KB Output is correct
2 Correct 65 ms 14568 KB Output is correct
3 Correct 39 ms 10600 KB Output is correct
4 Correct 10 ms 4844 KB Output is correct
5 Correct 8 ms 3948 KB Output is correct
6 Correct 15 ms 5740 KB Output is correct
7 Correct 2 ms 3052 KB Output is correct
8 Correct 30 ms 7404 KB Output is correct
9 Correct 40 ms 9324 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 59 ms 11244 KB Output is correct
12 Correct 89 ms 13424 KB Output is correct
13 Incorrect 3 ms 3180 KB Output isn't correct