Submission #980241

#TimeUsernameProblemLanguageResultExecution timeMemory
980241vjudge1Closing Time (IOI23_closing)C++17
0 / 100
53 ms5088 KiB
// hola soy Dember :D
// 31/03/2024

#include "closing.h"
#include <bits/stdc++.h>

#define ll long long 
#define pll pair<ll,ll>
#define f first
#define s second 
#define Z size()
#define pb push_back
#define bp pop_back
#define fo(x,y,z) for(ll x=y; x<=z; x++)
#define of(x,y,z) for(ll x=y; x>=z; x--)
#define all(n) n.begin(), n.end()
#define arr(x,y,z) x+y, x+y+z

using namespace std;

ll n, x, y, k;
ll ans;
vector<vector<pll>> a(n);
vector<map<ll,ll>> vis(n+1), dis(n+1);

void q1(){
    
    return;
}


int max_score(int N, int X, int Y, ll K, vector<int>U, vector<int>V, vector<int>W) {
    
    return ans;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...