| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 84162 | nikolapesic2802 | 무제 (POI11_smi) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int N=1e5+5;
vector<int> degree(N);
vector<vector<int> > graf(N);
unordered_map<int,int> visited[N];
vector<vector<int> > sol;
stack<int> stk;
vector<int> vis(N);
void solve(int tr)
{
//printf("Usao za %i\n",tr);
vis[tr]++;
stk.push(tr);
if(vis[tr]==2)
{
vector<int> t;
t.pb(tr);
vis[tr]--;
stk.pop();
while(stk.top()!=tr)
{
t.pb(stk.top());
vis[stk.top()]--;
stk.pop();
}
t.pb(stk.top());
sol.pb(t);
}
for(auto p:graf[tr])
{
if(!visited[tr][p])
{
visited[tr][p]=1;
visited[p][tr]=1;
degree[tr]--;
degree[p]--;
solve(p);
return;
}
}
}
void fastscan(int &number)
{
//variable to indicate sign of input number
bool negative = false;
register int c;
number = 0;
// extract current character from buffer
c = getchar();
if (c=='-')
{
// number is negative
negative = true;
// extract the next character from the buffer
c = getchar();
}
// Keep on extracting characters if they are integers
// i.e ASCII Value lies from '0'(48) to '9' (57)
for (; (c>47 && c<58); c=getchar())
number = number *10 + c - 48;
// if scanned input has a negative sign, negate the
// value of the input number
if (negative)
number *= -1;
}
int main()
{
int n,m;
//scanf("%i %i",&n,&m);
fastscan(n);
fastscan(m);
for(int i=0;i<m;i++)
{
int a,b,s,t;
fastscan(a);
fastscan(b);
fastscan(s);
fastscan(t);
//scanf("%i %i %i %i",&a,&b,&s,&t);
if(s!=t)
{
graf[a].pb(b);
graf[b].pb(a);
degree[a]++;
degree[b]++;
//printf("Dodajem iz %i u %i\n",a,b);
}
}
for(int i=1;i<=n;i++)
{
if(degree[i]%2==1)
{
printf("NIE\n");
return 0;
}
}
for(int i=1;i<=n;i++)
{
while(degree[i]!=0)
{
while(stk.size())
stk.pop();
solve(i);
vis[i]--;
}
}
printf("%i\n",sol.size());
for(auto p:sol)
{
printf("%i ",p.size()-1);
set<int> v;
for(auto d:p)
{
if(v.count(d)&&d!=p[0])
{
//assert(false);
}
v.insert(d);
printf("%i ",d);
}
printf("\n");
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int N=1e5+5;
vector<int> degree(N);
vector<vector<int> > graf(N);
unordered_map<int,int> visited[N];
vector<vector<int> > sol;
stack<int> stk;
vector<int> vis(N);
void solve(int tr)
{
//printf("Usao za %i\n",tr);
vis[tr]++;
stk.push(tr);
if(vis[tr]==2)
{
vector<int> t;
t.pb(tr);
vis[tr]--;
stk.pop();
while(stk.top()!=tr)
{
t.pb(stk.top());
vis[stk.top()]--;
stk.pop();
}
t.pb(stk.top());
sol.pb(t);
}
for(auto p:graf[tr])
{
if(!visited[tr][p])
{
visited[tr][p]=1;
visited[p][tr]=1;
degree[tr]--;
degree[p]--;
solve(p);
return;
}
}
}
void fastscan(int &number)
{
//variable to indicate sign of input number
bool negative = false;
register int c;
number = 0;
// extract current character from buffer
c = getchar();
if (c=='-')
{
// number is negative
negative = true;
// extract the next character from the buffer
c = getchar();
}
// Keep on extracting characters if they are integers
// i.e ASCII Value lies from '0'(48) to '9' (57)
for (; (c>47 && c<58); c=getchar())
number = number *10 + c - 48;
// if scanned input has a negative sign, negate the
// value of the input number
if (negative)
number *= -1;
}
int main()
{
int n,m;
//scanf("%i %i",&n,&m);
fastscan(n);
fastscan(m);
for(int i=0;i<m;i++)
{
int a,b,s,t;
fastscan(a);
fastscan(b);
fastscan(s);
fastscan(t);
//scanf("%i %i %i %i",&a,&b,&s,&t);
if(s!=t)
{
graf[a].pb(b);
graf[b].pb(a);
degree[a]++;
degree[b]++;
//printf("Dodajem iz %i u %i\n",a,b);
}
}
for(int i=1;i<=n;i++)
{
if(degree[i]%2==1)
{
printf("NIE\n");
return 0;
}
}
for(int i=1;i<=n;i++)
{
while(degree[i]!=0)
{
while(stk.size())
stk.pop();
solve(i);
vis[i]--;
}
}
printf("%i\n",sol.size());
for(auto p:sol)
{
printf("%i ",p.size()-1);
set<int> v;
for(auto d:p)
{
if(v.count(d)&&d!=p[0])
{
//assert(false);
}
v.insert(d);
printf("%i ",d);
}
printf("\n");
}
return 0;
}