oj.uz

Submission #243358

# Submission time Handle Problem Language Result Execution time Memory
243358 2020-07-01T00:29:58 Z AmineWeslati City Mapping (NOI18_citymapping) C++17
41 / 100
 2000 ms 640 KB 
//Never stop trying
#include "citymapping.h"
#pragma GCC optimize("O3")
#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;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
//#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up


//int get_distance(int x, int y){  }

void find_roads(int N, int Q, int A[], int B[], int W[]){
   if(Q==12000){
      ll mx=0; int mxi;
      for(int i=2; i<=N; i++){
         ll x=get_distance(1,i);
         if(x>mx){mx=x; mxi=i;}
      }
      vector<pair<ll,int>> vec;
      vec.pb({0,mxi});
      for(int i=1; i<=N; i++) if(i!=mxi){
         ll x=get_distance(i,mxi);
         vec.pb({x,i});
      }
      sort(all(vec));
      for(int i=1; i<sz(vec); i++){
         A[i-1]=vec[i].se; B[i-1]=vec[i-1].se; W[i-1]=(int)(vec[i].fi-vec[i-1].fi);
      }
   }
   else{
      set <int> s;
      for(int i=2; i<=N;i++) s.insert(i);
      vi vec; vec.pb(1);
      int idx=0;

      while(!s.empty()){
         vi v;
         for(int i=0; i<sz(vec); i++){
            vi er;
            for(auto it: s){
               ll x=get_distance(it,vec[i]);
               if(x==1){
                  v.pb(it);
                  er.pb(it);
                  A[idx]=it; B[idx]=vec[i]; W[idx]=1; idx++;
               }
            }
            for(auto x: er) s.erase(x);
         }
         vec.assign(all(v));
      }
   }
   return;
}

Compilation message

citymapping.cpp: In function 'void find_roads(int, int, int*, int*, int*)':
citymapping.cpp:61:27: warning: 'mxi' may be used uninitialized in this function [-Wmaybe-uninitialized]
          ll x=get_distance(i,mxi);
               ~~~~~~~~~~~~^~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 512 KB Correct: 497580 out of 500000 queries used.
2 Correct 50 ms 512 KB Correct: 498083 out of 500000 queries used.
3 Correct 38 ms 512 KB Correct: 429147 out of 500000 queries used.
4 Correct 32 ms 512 KB Correct: 385496 out of 500000 queries used.
5 Correct 48 ms 512 KB Correct: 479673 out of 500000 queries used.

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 512 KB Correct: 497580 out of 500000 queries used.
2 Correct 50 ms 512 KB Correct: 498083 out of 500000 queries used.
3 Correct 38 ms 512 KB Correct: 429147 out of 500000 queries used.
4 Correct 32 ms 512 KB Correct: 385496 out of 500000 queries used.
5 Correct 48 ms 512 KB Correct: 479673 out of 500000 queries used.
6 Execution timed out 2081 ms 512 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Correct: 1980 out of 12000 queries used.
2 Correct 6 ms 512 KB Correct: 1984 out of 12000 queries used.
3 Correct 5 ms 512 KB Correct: 1998 out of 12000 queries used.
4 Correct 6 ms 640 KB Correct: 1984 out of 12000 queries used.
5 Correct 5 ms 512 KB Correct: 1980 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Correct: 1980 out of 12000 queries used.
2 Correct 6 ms 512 KB Correct: 1984 out of 12000 queries used.
3 Correct 5 ms 512 KB Correct: 1998 out of 12000 queries used.
4 Correct 6 ms 640 KB Correct: 1984 out of 12000 queries used.
5 Correct 5 ms 512 KB Correct: 1980 out of 12000 queries used.
6 Correct 6 ms 512 KB Correct: 1994 out of 12000 queries used.
7 Correct 6 ms 512 KB Correct: 1990 out of 12000 queries used.
8 Correct 5 ms 512 KB Correct: 1998 out of 12000 queries used.
9 Correct 6 ms 512 KB Correct: 1992 out of 12000 queries used.
10 Correct 6 ms 512 KB Correct: 1986 out of 12000 queries used.

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 512 KB Correct: 497580 out of 500000 queries used.
2 Correct 50 ms 512 KB Correct: 498083 out of 500000 queries used.
3 Correct 38 ms 512 KB Correct: 429147 out of 500000 queries used.
4 Correct 32 ms 512 KB Correct: 385496 out of 500000 queries used.
5 Correct 48 ms 512 KB Correct: 479673 out of 500000 queries used.
6 Execution timed out 2081 ms 512 KB Time limit exceeded
7 Halted 0 ms 0 KB -