답안 #938678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938678 2024-03-05T12:18:04 Z groshi Meetings (JOI19_meetings) C++17
100 / 100
647 ms 2900 KB
#include"meetings.h"
#include<bits/stdc++.h>
using namespace std;
int N;
/*int Query(int x,int y,int z)
{
    cout<<x<<" "<<y<<" "<<z<<": ";
    int wynik;
    cin>>wynik;
    cout<<"\n";
    return wynik;
}
void Bridge(int x,int y)
{
    cout<<x<<" "<<y<<" buduje\n";
}*/
void dfs(int x,vector<int> Q)
{
    if(Q.size()==0)
        return;
    int strzal=rand()%(Q.size());
    strzal=Q[strzal];
    //cout<<x<<" "<<strzal<<"\n";
    vector<int> sasiad[N],sciezka;
    for(int i=0;i<Q.size();i++)
    {
        if(Q[i]==strzal)
            continue;
        int mam=Query(x,strzal,Q[i]);
        if(mam==Q[i])
            sciezka.push_back(Q[i]);
        else{
            //cout<<"wrzucam "<<mam<<" "<<Q[i]<<"\n";
            sasiad[mam].push_back(Q[i]);
        }
    }
    sort(sciezka.begin(),sciezka.end(),[&](int a,int b){return Query(x,a,b)==a;});
    sciezka.push_back(strzal);
    int pocz=x;
    for(int i=0;i<sciezka.size();i++)
    {
        Bridge(min(pocz,sciezka[i]),max(pocz,sciezka[i]));
        pocz=sciezka[i];
    }
    sciezka.push_back(x);
    for(int i=0;i<sciezka.size();i++)
        dfs(sciezka[i],sasiad[sciezka[i]]);
}
void Solve(int n)
{
    N=n;
    int korzen=rand()%n;
    vector<int> wszyscy;
    for(int i=0;i<n;i++)
        if(i!=korzen)
            wszyscy.push_back(i);
    dfs(korzen,wszyscy);
}

Compilation message

meetings.cpp: In function 'void dfs(int, std::vector<int>)':
meetings.cpp:25:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(int i=0;i<Q.size();i++)
      |                 ~^~~~~~~~~
meetings.cpp:40:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int i=0;i<sciezka.size();i++)
      |                 ~^~~~~~~~~~~~~~~
meetings.cpp:46:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i=0;i<sciezka.size();i++)
      |                 ~^~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 0 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 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 0 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 1 ms 344 KB Output is correct
14 Correct 0 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 0 ms 344 KB Output is correct
19 Correct 1 ms 344 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 600 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 0 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 1 ms 344 KB Output is correct
14 Correct 0 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 0 ms 344 KB Output is correct
19 Correct 1 ms 344 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 600 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 5 ms 600 KB Output is correct
28 Correct 3 ms 508 KB Output is correct
29 Correct 4 ms 344 KB Output is correct
30 Correct 3 ms 600 KB Output is correct
31 Correct 3 ms 344 KB Output is correct
32 Correct 4 ms 600 KB Output is correct
33 Correct 7 ms 644 KB Output is correct
34 Correct 10 ms 708 KB Output is correct
35 Correct 10 ms 600 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 8 ms 600 KB Output is correct
38 Correct 11 ms 596 KB Output is correct
39 Correct 5 ms 600 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 229 ms 1516 KB Output is correct
2 Correct 241 ms 1692 KB Output is correct
3 Correct 252 ms 1380 KB Output is correct
4 Correct 252 ms 1620 KB Output is correct
5 Correct 177 ms 1160 KB Output is correct
6 Correct 173 ms 1452 KB Output is correct
7 Correct 397 ms 2108 KB Output is correct
8 Correct 481 ms 2640 KB Output is correct
9 Correct 436 ms 2596 KB Output is correct
10 Correct 406 ms 2536 KB Output is correct
11 Correct 509 ms 2772 KB Output is correct
12 Correct 303 ms 1208 KB Output is correct
13 Correct 133 ms 1104 KB Output is correct
14 Correct 288 ms 1580 KB Output is correct
15 Correct 297 ms 1872 KB Output is correct
16 Correct 299 ms 1920 KB Output is correct
17 Correct 492 ms 2708 KB Output is correct
18 Correct 277 ms 1708 KB Output is correct
19 Correct 274 ms 1512 KB Output is correct
20 Correct 293 ms 1944 KB Output is correct
21 Correct 301 ms 1676 KB Output is correct
22 Correct 257 ms 1476 KB Output is correct
23 Correct 275 ms 1636 KB Output is correct
24 Correct 270 ms 1808 KB Output is correct
25 Correct 294 ms 2252 KB Output is correct
26 Correct 229 ms 1616 KB Output is correct
27 Correct 265 ms 1644 KB Output is correct
28 Correct 527 ms 2516 KB Output is correct
29 Correct 445 ms 2900 KB Output is correct
30 Correct 411 ms 2496 KB Output is correct
31 Correct 472 ms 2484 KB Output is correct
32 Correct 647 ms 1328 KB Output is correct
33 Correct 358 ms 1104 KB Output is correct
34 Correct 4 ms 600 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 4 ms 600 KB Output is correct
37 Correct 3 ms 344 KB Output is correct
38 Correct 4 ms 344 KB Output is correct
39 Correct 4 ms 640 KB Output is correct
40 Correct 7 ms 600 KB Output is correct
41 Correct 9 ms 668 KB Output is correct
42 Correct 12 ms 600 KB Output is correct
43 Correct 4 ms 344 KB Output is correct
44 Correct 9 ms 344 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 5 ms 600 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 0 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 0 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 0 ms 344 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 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 344 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 1 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct