| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 581888 |
2022-06-23T07:44:23 Z |
조영욱(#8367) |
전압 (JOI14_voltage) |
C++14 |
|
142 ms |
17212 KB |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
vector<P> edge;
vector<int> adj[100001];
int n,m;
int p[100001];
int find(int a) {
return p[a]<0?a:p[a]=find(p[a]);
}
void merge(int a,int b) {
a=find(a);
b=find(b);
if (a==b){
return;
}
p[b]=a;
}
int dep[100001];
int par[100001];
vector<int> vec;
void dfs(int v,int prev){
par[v]=prev;
for(int i=0;i<adj[v].size();i++) {
int nt=adj[v][i];
if (nt!=prev) {
dep[nt]=dep[v]+1;
dfs(nt,v);
}
}
}
int ind[100001];
int mn[100001];
bool vis[100001];
int f=1;
void dfs1(int v,int prev) {
vis[v]=true;
ind[v]=f++;
mn[v]=ind[v];
int cnt=0;
for(int i=0;i<adj[v].size();i++) {
int nt=adj[v][i];
if (vis[nt]) {
if (nt==prev) {
cnt++;
}
if (nt!=prev||cnt>1)
mn[v]=min(mn[v],ind[nt]);
continue;
}
dfs1(nt,v);
mn[v]=min(mn[v],mn[nt]);
}
}
int value[100001];
void dfs2(int v,int type) {
vis[v]=true;
value[v]=type;
for(int i=0;i<adj[v].size();i++) {
int nt=adj[v][i];
if (!vis[nt])
dfs2(nt,-type);
}
}
int pl[100002];
int temp[100002];
int main(void){
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++) {
int u,v;
scanf("%d %d",&u,&v);
edge.push_back(P(u,v));
}
memset(p,-1,sizeof(p));
for(int i=0;i<m;i++) {
if (find(edge[i].first)!=find(edge[i].second)) {
adj[edge[i].first].push_back(edge[i].second);
adj[edge[i].second].push_back(edge[i].first);
merge(edge[i].first,edge[i].second);
}
}
for(int i=1;i<=n;i++) {
if (dep[i]==0) {
dfs(i,0);
}
}
for(int i=1;i<=n;i++) {
adj[i].clear();
}
bool flag=false;
int d=0;
for(int i=0;i<m;i++) {
adj[edge[i].first].push_back(edge[i].second);
adj[edge[i].second].push_back(edge[i].first);
if (dep[edge[i].first]%2==dep[edge[i].second]%2) {
if (flag) {
continue;
}
flag=true;
int lca=-1;
int a=edge[i].first;
int b=edge[i].second;
if (dep[a]<dep[b]) {
swap(a,b);
}
while (dep[a]>dep[b]) {
a=par[a];
d++;
}
while (a!=b) {
a=par[a];
b=par[b];
d+=2;
}
d++;
lca=a;
P save=edge[i];
while (edge[i].first!=lca) {
vec.push_back(edge[i].first);
edge[i].first=par[edge[i].first];
}
vec.push_back(lca);
vector<int> temp;
while (edge[i].second!=lca) {
temp.push_back(edge[i].second);
edge[i].second=par[edge[i].second];
}
edge[i]=save;
reverse(temp.begin(),temp.end());
for(int j=0;j<temp.size();j++) {
vec.push_back(temp[j]);
}
}
}
if (!flag) {
int ret=0;
for(int i=1;i<=n;i++) {
if (!vis[i]) {
dfs1(i,0);
ret--;
assert(ind[i]==mn[i]);
}
}
for(int i=1;i<=n;i++) {
if (ind[i]==mn[i]) {
ret++;
}
}
printf("%d",ret);
return 0;
}
for(int i=0;i<d;i++) {
vis[vec[i]]=true;
}
for(int i=0;i<d;i++) {
dfs2(vec[i],i+1);
}
for(int i=1;i<=n;i++){
if (!vis[i]) {
dfs2(i,d+1);
}
//printf("%d ",value[i]);
}
for(int i=0;i<m;i++) {
if (value[edge[i].first]==value[edge[i].second]) {
printf("0");
return 0;
}
int one=value[edge[i].first];
int two=value[edge[i].second];
if (one>0&&two>0&&one<=d&&two<=d&&vec[one-1]==edge[i].first&&vec[two-1]==edge[i].second&&(one+1==two||two+1==one||two-one==d-1||one-two==d-1)) {
int small;
if (abs(one-two)!=1) {
small=d;
}
else {
small=min(one,two);
}
temp[small]++;
if (temp[small]>1) {
pl[small]++;
pl[small+1]--;
}
continue;
}
if (one+two==0) {
continue;
}
if (one<0&&two>0) {
swap(one,two);
}
if (1LL*one*two>0) {
one=abs(one);
two=abs(two);
bool flag=false;
if (two>one&&(two-one)%2==1) {
flag=true;
}
if (two<one&&(two-one)%2==0) {
flag=true;
}
if (flag) {
swap(one,two);
}
if (one<two) {
pl[1]++;
pl[one+1]--;
pl[two+1]++;
pl[d+1]--;
}
else {
pl[two+1]++;
pl[one+1]--;
}
}
else {
one=abs(one);
two=abs(two);
one=abs(one);
two=abs(two);
bool flag=false;
if (two>one&&(two-one)%2==1) {
flag=true;
}
if (two<one&&(two-one)%2==0) {
flag=true;
}
if (!flag) {
swap(one,two);
}
if (one<two) {
pl[1]++;
pl[one+1]--;
pl[two+1]++;
pl[d+1]--;
}
else {
pl[two+1]++;
pl[one+1]--;
}
}
}
int ret=0;
int val=0;
for(int i=1;i<=d;i++) {
val+=pl[i];
if (val==0) {
ret++;
}
}
printf("%d",ret);
}
Compilation message
voltage.cpp: In function 'void dfs(int, int)':
voltage.cpp:29:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
29 | for(int i=0;i<adj[v].size();i++) {
| ~^~~~~~~~~~~~~~
voltage.cpp: In function 'void dfs1(int, int)':
voltage.cpp:48:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
48 | for(int i=0;i<adj[v].size();i++) {
| ~^~~~~~~~~~~~~~
voltage.cpp: In function 'void dfs2(int, int)':
voltage.cpp:68:18: 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=0;i<adj[v].size();i++) {
| ~^~~~~~~~~~~~~~
voltage.cpp: In function 'int main()':
voltage.cpp:141:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
141 | for(int j=0;j<temp.size();j++) {
| ~^~~~~~~~~~~~
voltage.cpp:79:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
79 | scanf("%d %d",&n,&m);
| ~~~~~^~~~~~~~~~~~~~~
voltage.cpp:82:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
82 | scanf("%d %d",&u,&v);
| ~~~~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
3156 KB |
Output is correct |
| 2 |
Correct |
2 ms |
3028 KB |
Output is correct |
| 3 |
Correct |
2 ms |
3028 KB |
Output is correct |
| 4 |
Correct |
2 ms |
3028 KB |
Output is correct |
| 5 |
Correct |
3 ms |
3156 KB |
Output is correct |
| 6 |
Correct |
3 ms |
3156 KB |
Output is correct |
| 7 |
Correct |
3 ms |
3156 KB |
Output is correct |
| 8 |
Incorrect |
2 ms |
3028 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
40 ms |
8948 KB |
Output is correct |
| 2 |
Correct |
115 ms |
13144 KB |
Output is correct |
| 3 |
Correct |
46 ms |
8624 KB |
Output is correct |
| 4 |
Correct |
88 ms |
13136 KB |
Output is correct |
| 5 |
Correct |
7 ms |
3796 KB |
Output is correct |
| 6 |
Correct |
74 ms |
11124 KB |
Output is correct |
| 7 |
Correct |
84 ms |
13264 KB |
Output is correct |
| 8 |
Correct |
75 ms |
16416 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
9008 KB |
Output is correct |
| 2 |
Correct |
40 ms |
16444 KB |
Output is correct |
| 3 |
Correct |
40 ms |
16444 KB |
Output is correct |
| 4 |
Correct |
2 ms |
3028 KB |
Output is correct |
| 5 |
Correct |
50 ms |
9256 KB |
Output is correct |
| 6 |
Correct |
71 ms |
8728 KB |
Output is correct |
| 7 |
Correct |
83 ms |
12116 KB |
Output is correct |
| 8 |
Correct |
87 ms |
9960 KB |
Output is correct |
| 9 |
Correct |
81 ms |
12140 KB |
Output is correct |
| 10 |
Correct |
89 ms |
11748 KB |
Output is correct |
| 11 |
Correct |
67 ms |
8232 KB |
Output is correct |
| 12 |
Correct |
72 ms |
10500 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
51 ms |
10612 KB |
Output is correct |
| 2 |
Correct |
74 ms |
17212 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4308 KB |
Output is correct |
| 4 |
Correct |
77 ms |
10476 KB |
Output is correct |
| 5 |
Correct |
68 ms |
13352 KB |
Output is correct |
| 6 |
Correct |
78 ms |
10152 KB |
Output is correct |
| 7 |
Correct |
142 ms |
14128 KB |
Output is correct |
| 8 |
Correct |
121 ms |
12412 KB |
Output is correct |
| 9 |
Correct |
128 ms |
11256 KB |
Output is correct |
| 10 |
Correct |
117 ms |
15668 KB |
Output is correct |
| 11 |
Correct |
127 ms |
11524 KB |
Output is correct |
| 12 |
Correct |
116 ms |
13192 KB |
Output is correct |
| 13 |
Incorrect |
92 ms |
11580 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
