oj.uz

Submission #921509

# Submission time Handle Problem Language Result Execution time Memory
921509 2024-02-04T03:37:33 Z 1075508020060209tc Meetings (JOI19_meetings) C++14
0 / 100
 9 ms 600 KB 
#pragma GCC optimize("O3")
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define X first
#define Y second
#define SZ(x) (int)(x).size()
map<vector<int>,int>mp;
int n;
int query(int a,int b,int c){
vector<int>vc={a,b,c};
sort(vc.begin(),vc.end());
if(mp[vc]){return mp[vc];}
mp[vc]=Query(vc[0],vc[1],vc[2]);
return mp[vc];
}

pair<int,int>slv(int st,int en){
int ret=en;
for(int i=1;i<=n;i++){
    if(i==st||i==ret){continue;}
    int v=query(st-1,i-1,ret-1);
    //v++;
    if(v==st||v==ret){continue;}
    ret=v;
}
return {min(st,ret)-1,max(st,ret)-1};
}


void Solve(int N){
set<pair<int,int>>ans;
n=N;
for(int i=1;i<=n;i++){
    for(int j=i+1;j<=n;j++){
        ans.insert(slv(i,j));
    }
}
for(auto it=ans.begin();it!=ans.end();it++){
    Bridge((*it).first, (*it).second );
}
}
/*
signed main(){


}
*/

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 600 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -