oj.uz

Submission #203020

# Submission time Handle Problem Language Result Execution time Memory
203020 2020-02-19T03:37:34 Z galen_colin Dreaming (IOI13_dreaming) C++14
18 / 100
 1000 ms 12280 KB 
#include <bits/stdc++.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 f0r(a, b) for (long long a = 0; a < (b); a++)
#define f1r(a, b, c) for (long long a = (b); a < (c); a++)
#define f0rd(a, b) for (long long a = (b); a >= 0; a--)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define io {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < n; ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = lb; ele <= rb; ele++) { if (ele > lb) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
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;
 
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 << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
// template<typename A, typename B> ll max(A x, B y) {
//   return x > y ? x : y;
// }
// template<typename A, typename B> ll min(A x, B y) {
//   return x < y ? x : y;
// }
 
mt19937 rng(steady_clock::now().time_since_epoch().count());
/* usage - just do rng() */
 
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 lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;

// int travelTime(int n, int m, int l, int a[], int b[], int t[]);

// int main() {
//   int n = 3;
//   int m = 2;
//   int l = 5;
//   int a[2] = {0, 1};
//   int b[2] = {1, 2};
//   int t[2] = {3, 3};
//   int x = travelTime(n, m, l, a, b, t);
//   cout << x << endl;
// }

#include "dreaming.h"
 
ll n, m, k, q, Q, T, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;

vl tdists;
vpi edges[100005];
bool vis[100005];
int mk[100005];
int ngroup = 0;
ll mx[100005];

void mark(int x) {
  if (vis[x]) return;
  vis[x] = 1;
  mk[x] = ngroup;

  for (pii y: edges[x]) mark(y.f);
}

ll gdist(int x, ll d) {
  if (vis[x]) return 0;
  vis[x] = 1;

  ll mv = d;
  for (pii y: edges[x]) mv = max(mv, gdist(y.f, d + y.s));
  return mv;
}

int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
  f0r(i, m) {
    edges[a[i]].pb(mp(b[i], t[i]));
    edges[b[i]].pb(mp(a[i], t[i]));
  }
  
  f0r(i, n) mk[i] = -1;
  ms(vis, 0);
  f0r(i, n) {
    if (!vis[i]) {
      mark(i);
      ++ngroup;
    }
  }

  ll ans = 0;
  ms(mx, 0);
  f0r(i, n) {
    ms(vis, 0);
    ll v = gdist(i, 0);
    ans = max(ans, v);
    mx[mk[i]] = max(mx[mk[i]], v);
  }

  f0r(i, ngroup) tdists.pb(mx[i]);
  sort(all(tdists));
  reverse(all(tdists));
  if (tdists.size() == 2) ans = max(ans, tdists[0] + tdists[1] + l);
  else if (tdists.size() > 2) {
    ans = max(ans, tdists[0] + tdists[1] + l);
    ans = max(ans, tdists[1] + tdists[2] + 2 * l);
  }

  return ans;
}

// int main() {
//   io;
//   // freopen("case", "r", stdin);
//   // freopen("test.txt", "r", stdin);
//   // freopen("case", "w", stdout);
//   // freopen("file.in", "r", stdin);
 
//   // usaco("file");
 
  
// }

Compilation message

dreaming.cpp: In function 'void usaco(std::__cxx11::string)':
dreaming.cpp:65:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".in").c_str(), "r", stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dreaming.cpp:66:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".out").c_str(), "w", stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 6904 KB Output is correct
2 Correct 329 ms 7416 KB Output is correct
3 Correct 329 ms 7416 KB Output is correct
4 Correct 324 ms 7288 KB Output is correct
5 Correct 325 ms 7416 KB Output is correct
6 Correct 329 ms 8052 KB Output is correct
7 Correct 340 ms 7600 KB Output is correct
8 Correct 303 ms 7288 KB Output is correct
9 Correct 322 ms 7412 KB Output is correct
10 Correct 347 ms 7412 KB Output is correct
11 Correct 7 ms 3576 KB Output is correct
12 Correct 305 ms 5232 KB Output is correct
13 Correct 297 ms 5232 KB Output is correct
14 Correct 310 ms 5232 KB Output is correct
15 Correct 298 ms 5100 KB Output is correct
16 Correct 320 ms 5232 KB Output is correct
17 Correct 316 ms 5360 KB Output is correct
18 Correct 307 ms 5228 KB Output is correct
19 Correct 316 ms 5172 KB Output is correct
20 Correct 7 ms 3576 KB Output is correct
21 Correct 7 ms 3576 KB Output is correct
22 Correct 16 ms 3576 KB Output is correct
23 Correct 313 ms 5104 KB Output is correct

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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