oj.uz

답안 #921640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921640 2024-02-04T08:38:46 Z 1075508020060209tc Meetings (JOI19_meetings) C++14
100 / 100
 658 ms 6524 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());
random_shuffle(vc.begin(),vc.end());
vector<int>vcb;vector<int>vca;
int md=vc[0];
int w=vc[1];
md=query(vc[0],vc[1],vc[2]);

for(int i=0;i<vc.size();i++){
    if(vc[i]==md){
        swap(vc[i],vc[0]);
    }
}
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:60:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 | for(int i=0;i<vc.size();i++){
      |             ~^~~~~~~~~~
meetings.cpp:68:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 | for(int i=2;i<vc.size();i++){
      |             ~^~~~~~~~~~
meetings.cpp:79:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 | for(int i=0;i<vc.size();i++){
      |             ~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 0 ms 344 KB Output is correct
7 Correct 1 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 1 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 0 ms 344 KB Output is correct
7 Correct 1 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 1 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 596 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 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 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 0 ms 344 KB Output is correct
7 Correct 1 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 1 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 596 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 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 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 7 ms 856 KB Output is correct
28 Correct 8 ms 856 KB Output is correct
29 Correct 8 ms 880 KB Output is correct
30 Correct 6 ms 600 KB Output is correct
31 Correct 7 ms 856 KB Output is correct
32 Correct 8 ms 856 KB Output is correct
33 Correct 9 ms 1112 KB Output is correct
34 Correct 11 ms 1112 KB Output is correct
35 Correct 10 ms 1028 KB Output is correct
36 Correct 7 ms 856 KB Output is correct
37 Correct 8 ms 632 KB Output is correct
38 Correct 8 ms 600 KB Output is correct
39 Correct 7 ms 600 KB Output is correct

Subtask #4
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 410 ms 3920 KB Output is correct
2 Correct 425 ms 4444 KB Output is correct
3 Correct 425 ms 4220 KB Output is correct
4 Correct 398 ms 4184 KB Output is correct
5 Correct 417 ms 3476 KB Output is correct
6 Correct 356 ms 4476 KB Output is correct
7 Correct 440 ms 4964 KB Output is correct
8 Correct 499 ms 5464 KB Output is correct
9 Correct 464 ms 6036 KB Output is correct
10 Correct 419 ms 6524 KB Output is correct
11 Correct 517 ms 6016 KB Output is correct
12 Correct 398 ms 3464 KB Output is correct
13 Correct 328 ms 3756 KB Output is correct
14 Correct 411 ms 5188 KB Output is correct
15 Correct 448 ms 5240 KB Output is correct
16 Correct 431 ms 5344 KB Output is correct
17 Correct 658 ms 6316 KB Output is correct
18 Correct 526 ms 5520 KB Output is correct
19 Correct 484 ms 5508 KB Output is correct
20 Correct 466 ms 5712 KB Output is correct
21 Correct 427 ms 5136 KB Output is correct
22 Correct 418 ms 5252 KB Output is correct
23 Correct 414 ms 4936 KB Output is correct
24 Correct 384 ms 5056 KB Output is correct
25 Correct 484 ms 4776 KB Output is correct
26 Correct 525 ms 5356 KB Output is correct
27 Correct 446 ms 4988 KB Output is correct
28 Correct 536 ms 6180 KB Output is correct
29 Correct 430 ms 6344 KB Output is correct
30 Correct 522 ms 6480 KB Output is correct
31 Correct 447 ms 5768 KB Output is correct
32 Correct 498 ms 3316 KB Output is correct
33 Correct 395 ms 3204 KB Output is correct
34 Correct 7 ms 856 KB Output is correct
35 Correct 8 ms 856 KB Output is correct
36 Correct 7 ms 856 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 7 ms 1108 KB Output is correct
39 Correct 8 ms 856 KB Output is correct
40 Correct 10 ms 1112 KB Output is correct
41 Correct 12 ms 1032 KB Output is correct
42 Correct 10 ms 1112 KB Output is correct
43 Correct 8 ms 856 KB Output is correct
44 Correct 8 ms 680 KB Output is correct
45 Correct 8 ms 600 KB Output is correct
46 Correct 7 ms 576 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 480 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 592 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct