제출 #713477

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
713477	2023-03-22 08:52:44	lam	ICC (CEOI16_icc)	C++14	100 / 100	142 ms	592 KiB

icc

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
typedef pair<int,int> ii;
#define ff first
#define ss second
const int maxn = 110;
vector<vector<int>> chan[maxn],le[maxn];
vector <int> comp[maxn];
int n,m;
int p[maxn],s[maxn];
//bool query(int x, int y, int a[], int b[])
//{
//    cout<<"query"<<endl;
//    for (int i=0; i<x; i++) cout<<a[i]<<' '; cout<<endl;
//    for (int i=0; i<y; i++) cout<<b[i]<<' '; cout<<endl;
//    bool has; cin>>has; return has;
//}
//void setRoad(int u, int v)
//{
//    cout<<"SetRoad "<<u<<' '<<v<<endl;
//}
int get(int x)
{
    return p[x]=(p[x]==x)?x:get(p[x]);
}
void hop(int x, int y)
{
    x=get(x); y=get(y); if (x==y) return;
    if (s[x]>s[y]) swap(x,y);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

icc.cpp: In function 'bool query3(int, int, std::vector<int>, std::vector<int>)':
icc.cpp:46:9: warning: unused variable 'x' [-Wunused-variable]
   46 |     int x=0,y=0;
      |         ^
icc.cpp:46:13: warning: unused variable 'y' [-Wunused-variable]
   46 |     int x=0,y=0;
      |             ^
icc.cpp: In function 'ii trace(std::vector<int>, std::vector<int>)':
icc.cpp:74:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for (int i=0; i<tmp_le.size(); i++) if (i<=mid) tmp_le1.push_back(tmp_le[i]);
      |                   ~^~~~~~~~~~~~~~
icc.cpp: In function 'ii trace2(std::vector<int>, std::vector<int>)':
icc.cpp:90:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for (int i=0; i<tmp_le.size(); i++) if (i<=mid) tmp_le1.push_back(tmp_le[i]);
      |                   ~^~~~~~~~~~~~~~
icc.cpp: In function 'void run(int)':
icc.cpp:106:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  106 |             if (p[i]==i) tmp.push_back(i); chan[i].clear(), le[i].clear();
      |             ^~
icc.cpp:106:44: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  106 |             if (p[i]==i) tmp.push_back(i); chan[i].clear(), le[i].clear();
      |                                            ^~~~
icc.cpp:129:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |             for (int i=mid; i<le[level].size(); i++)
      |                             ~^~~~~~~~~~~~~~~~~
icc.cpp:131:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |             for (int i=mid; i<chan[level].size(); i++)
      |                             ~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 22 / 22
• Subtask 4: 21 / 21
• Subtask 5: 29 / 29
• Subtask 6: 10 / 10