oj.uz

Submission #921629

# Submission time Handle Problem Language Result Execution time Memory
921629 2024-02-04T08:32:56 Z 1075508020060209tc Meetings (JOI19_meetings) C++14
29 / 100
 1641 ms 17048 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()

unsigned seed=12345;
long long rnd(){
seed=seed^(seed<<7);
seed=seed^(seed>>4);
seed=seed^(seed>>3);
return seed;
}


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(vc[0]==vc[1]){return vc[0];}
if(vc[1]==vc[2]){return vc[2];}

if(mp[vc]){return mp[vc];}
mp[vc]=Query(vc[0]-1,vc[1]-1,vc[2]-1)+1;
return mp[vc];
}
set<pair<int,int>>ans;

int finmid(vector<int>&vc){
int a=rnd()%vc.size();
int b=rnd()%vc.size();
if(b==a){b++;b%=vc.size();}
int c=rnd()%vc.size();
if(c==a){
    c++;c%=vc.size();
}
if(c==b){
    c++;c%=vc.size();
}
return query(vc[0],vc[1],vc[2]);
}

void slv(vector<int>vc){
if(vc.size()==1){return;}
if(vc.size()==2){
    ans.insert({min(vc[0],vc[1]),max(vc[0],vc[1])});
    return;
}
random_shuffle(vc.begin(),vc.end());
vector<int>vcb;vector<int>vca;
int md=vc[0];
int w=vc[1];
set<int>st;
st.insert(w);
for(int i=2;i<vc.size();i++){
    int v=vc[i];
    if(v==w){
        st.insert(v);
        continue;
    }
    int vv=query(md,w,v);
    if(vv==md){continue;}
    st.insert(vc[i]);
    w=vv;
}
for(int i=0;i<vc.size();i++){
    if(st.find(vc[i])!=st.end()){
        vca.push_back(vc[i]);
    }else{
        vcb.push_back(vc[i]);
    }
}
ans.insert({min(md,w),max(md,w)});
slv(vca);
slv(vcb);
}


void Solve(int N){
n=N;
vector<int>vc;
for(int i=1;i<=n;i++){
    vc.push_back(i);
}
slv(vc);
for(auto it=ans.begin();it!=ans.end();it++){
    Bridge((*it).first-1, (*it).second-1);
}
}

Compilation message

meetings.cpp: In function 'void slv(std::vector<int>)':
meetings.cpp:59:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 | for(int i=2;i<vc.size();i++){
      |             ~^~~~~~~~~~
meetings.cpp:70:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 | for(int i=0;i<vc.size();i++){
      |             ~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 35 ms 2640 KB Output is correct
28 Correct 28 ms 2136 KB Output is correct
29 Correct 29 ms 2128 KB Output is correct
30 Correct 21 ms 1624 KB Output is correct
31 Correct 31 ms 2392 KB Output is correct
32 Correct 54 ms 3920 KB Output is correct
33 Correct 41 ms 3408 KB Output is correct
34 Correct 49 ms 3892 KB Output is correct
35 Correct 62 ms 4604 KB Output is correct
36 Correct 15 ms 1368 KB Output is correct
37 Correct 8 ms 840 KB Output is correct
38 Correct 8 ms 856 KB Output is correct
39 Correct 9 ms 676 KB Output is correct

Subtask #4
0 / 71.0

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