# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1157149 | irmuun | Two Transportations (JOI19_transportations) | C++20 | 137 ms | 13760 KiB |
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define pii pair<int,int>
namespace {
int N;
int cnt;
const int maxq=58000,maxn=2000,inf=1e9;
bool stop=true;
int cur=0,pos=0,last=-1;
bool in[maxq];
int dist[maxn];
vector<pii>adj[maxn];
void send_number(int x,int bit){
for(int i=0;i<bit;i++){
SendA(x&(1<<i)?true:false);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |