oj.uz

Submission #1004057

# Submission time Handle Problem Language Result Execution time Memory
1004057 2024-06-21T03:47:09 Z edogawa_something Flights (JOI22_flights) C++17
21 / 100
 280 ms 31064 KB 
#include "Ali.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first 
#define S second 
#define all(v) v.begin(),v.end()
#define pb push_back
const int M=1000000;
const ll inf=1e9+10;
vii adj[M];
ll id[M],dis[M];
ll t=0;
ll n;
vii v;
void dfs(ll x,ll pa){
  id[x]=t++;
  for(auto it:adj[x]){
    if(it==pa)
    continue;
    dfs(it,x);
  }
}
string res;
void ord(ll x,ll pa=-1,ll d=0){
  dis[x]=d;
  for(auto it:adj[x]){
    if(it==pa)
    continue;
    ord(it,x,d+1);
  }
}
void Init(int N, std::vector<int> U, std::vector<int> V) {
  n=N;
  for(int i=0;i<n;i++)
  adj[i].clear();
  for(int i=0;i<n-1;i++)
  adj[U[i]].pb(V[i]),adj[V[i]].pb(U[i]);
  dfs(0,-1);
  for(int i=0;i<n;i++)
  SetID(i,i);
}

string encode(ll x){
  string res;
  for(int i=0;i<14;i++){
    if((x&(1<<i))>0)
    res.pb('1');
    else
    res.pb('0');
  }
  return res;
}
std::string SendA(std::string S){
  res.clear();
  v.clear();
  v.pb(0);
  v.pb((1<<10));
  v.pb((1<<11));
  v.pb((1<<10)+(1<<11));
  v.pb((1<<12));
  v.pb((1<<12)+(1<<10));
  v.pb((1<<12)+(1<<11));
  v.pb((1<<12)+(1<<11)+(1<<10));
  v.pb((1<<13));
  v.pb((1<<13)+(1<<10));
  ll a=0,b=0;
  for(int i=0;i<10;i++)
  a+=(1<<i)*(S[i]=='1');
  for(int i=10;i<20;i++)
  b+=(1<<(i-10))*(S[i]=='1');
  for(auto it:v){
    for(int i=0;i<n;i++)
    dis[i]=0;
    ord(a+it,-1);
    for(auto itt:v){
    res+=encode(dis[b+itt]);
    }
  }
  return res;
}

#include "Benjamin.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first 
#define S second 
#define all(v) v.begin(),v.end()
#define pb push_back
namespace {
  const ll M=1e5;
  const ll inf=1e18;
  ll n,x,y,pa[M],dis[M];
  vii adj[M];
  vii v;
  void dfs(ll x,ll pa=-1,ll d=0){
    dis[x]=d;
    for(auto it:adj[x]){
      if(it==pa)
      continue;
      dfs(it,x,d+1);
    }
  }
}

std::string SendB(int N, int X, int Y) {
  n=N,x=X,y=Y;
  string r;
  for(int i=0;i<10;i++){
    if((x&(1<<i))>0)
    r+='1';
    else
    r+='0';
  }
  for(int i=0;i<10;i++){
    if((y&(1<<i))>0)
    r+='1';
    else
    r+='0';
  }
  return r;
}
int Answer(std::string T) {
  ll xx,yy;
  xx=0,yy=0;
  v.clear();
  v.pb(0);
  v.pb((1<<10));
  v.pb((1<<11));
  v.pb((1<<10)+(1<<11));
  v.pb((1<<12));
  v.pb((1<<12)+(1<<10));
  v.pb((1<<12)+(1<<11));
  v.pb((1<<12)+(1<<11)+(1<<10));
  v.pb((1<<13));
  v.pb((1<<13)+(1<<10));
  for(int i=0;i<10;i++){
    if((x&(1<<i)))
    xx+=(1<<i);
    if((y&(1<<i)))
    yy+=(1<<i);
  }
  ll ans=0;
  ll ind=0;
  bool chk=0;
  for(int i=0;i<10;i++){
    if(chk)
    break;
    for(int j=0;j<10;j++){
    if(xx+v[i]==x&&yy+v[j]==y){
    chk=1;
    break;
    }
    ind+=14;
    }
  }
  for(int i=ind;i<ind+14;i++){
  ans+=(1<<(i-ind))*(T[i]=='1');
  }
  return ans;
}
/*
g++ -std=c++17 -O2 -o grader grader.cpp Ali.cpp Benjamin.cpp
*/

Compilation message

grader_ali.cpp:10:8: warning: '{anonymous}::_randmem' defined but not used [-Wunused-variable]
   10 |   char _randmem[12379];
      |        ^~~~~~~~

Benjamin.cpp:14:12: warning: '{anonymous}::pa' defined but not used [-Wunused-variable]
   14 |   ll n,x,y,pa[M],dis[M];
      |            ^~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 29728 KB Output is correct
2 Correct 6 ms 29732 KB Output is correct
3 Correct 5 ms 29728 KB Output is correct
4 Correct 6 ms 29644 KB Output is correct
5 Correct 5 ms 29724 KB Output is correct
6 Correct 9 ms 30296 KB Output is correct
7 Correct 9 ms 30296 KB Output is correct
8 Correct 9 ms 30296 KB Output is correct
9 Correct 9 ms 30436 KB Output is correct
10 Correct 12 ms 30508 KB Output is correct
11 Correct 8 ms 30308 KB Output is correct
12 Correct 9 ms 30360 KB Output is correct
13 Correct 9 ms 30436 KB Output is correct
14 Correct 9 ms 30220 KB Output is correct
15 Correct 9 ms 30688 KB Output is correct
16 Correct 9 ms 30264 KB Output is correct

Subtask #2
6.0 / 85.0

# Verdict Execution time Memory Grader output
1 Partially correct 5 ms 29592 KB Output is partially correct
2 Partially correct 58 ms 30896 KB Output is partially correct
3 Partially correct 9 ms 29732 KB Output is partially correct
4 Partially correct 273 ms 30844 KB Output is partially correct
5 Partially correct 225 ms 30528 KB Output is partially correct
6 Partially correct 244 ms 30552 KB Output is partially correct
7 Partially correct 246 ms 31064 KB Output is partially correct
8 Partially correct 280 ms 30824 KB Output is partially correct
9 Partially correct 139 ms 30760 KB Output is partially correct
10 Partially correct 167 ms 30716 KB Output is partially correct
11 Partially correct 201 ms 30608 KB Output is partially correct
12 Partially correct 33 ms 30340 KB Output is partially correct
13 Partially correct 105 ms 30616 KB Output is partially correct
14 Partially correct 109 ms 30612 KB Output is partially correct
15 Partially correct 7 ms 29592 KB Output is partially correct
16 Partially correct 162 ms 30684 KB Output is partially correct
17 Partially correct 122 ms 30684 KB Output is partially correct
18 Partially correct 196 ms 30932 KB Output is partially correct
19 Partially correct 184 ms 30792 KB Output is partially correct
20 Partially correct 93 ms 30708 KB Output is partially correct
21 Partially correct 142 ms 30928 KB Output is partially correct
22 Partially correct 189 ms 30504 KB Output is partially correct
23 Partially correct 129 ms 30740 KB Output is partially correct
24 Partially correct 128 ms 30536 KB Output is partially correct
25 Partially correct 129 ms 30684 KB Output is partially correct
26 Partially correct 152 ms 30636 KB Output is partially correct
27 Partially correct 138 ms 30740 KB Output is partially correct
28 Partially correct 143 ms 30740 KB Output is partially correct
29 Partially correct 134 ms 30780 KB Output is partially correct
30 Partially correct 143 ms 30980 KB Output is partially correct
31 Partially correct 214 ms 30728 KB Output is partially correct
32 Partially correct 151 ms 30696 KB Output is partially correct
33 Partially correct 137 ms 30860 KB Output is partially correct
34 Partially correct 158 ms 30760 KB Output is partially correct
35 Partially correct 148 ms 30696 KB Output is partially correct
36 Partially correct 204 ms 30496 KB Output is partially correct
37 Partially correct 160 ms 30556 KB Output is partially correct
38 Partially correct 189 ms 30652 KB Output is partially correct
39 Partially correct 28 ms 30544 KB Output is partially correct
40 Partially correct 255 ms 30720 KB Output is partially correct