oj.uz

답안 #126574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126574 2019-07-08T06:17:38 Z _Samir Ronald (COCI17_ronald) C++17
105 / 120
 197 ms 26756 KB 
//github.com/nya-nya-meow/CompetitiveProgramming/blob/master/CSES/CSES%201112%20-%20Substrings.cpp
#include<bits/stdc++.h>
#define pi 3.141592654
#define forr(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define input ios_base::sync_with_stdio(0);cin.tie(0);

using namespace std;
typedef pair<double,double>pdd;
typedef long long  ll;
typedef pair<ll, ll>pii;
typedef complex<double> point;
//int x[8]={1,0,0,-1,-1,-1,1,1};
//int y[8]={0,1,-1,0,-1,1,-1,1};

const double EPS= 1e-8;
const int N = 1e5+5, M = 2e5+5, OO = 0x3f3f3f3f;

int n,m,vis[2005],id,ck[5000000];
vector<int>a[2005];
void dfs(int u)
{
    vis[u]=id;
    for(auto v:a[u])
        if(vis[v]==-1)dfs(v);
}
 int main()
{

input;
cin>>n>>m;
int u,v;
forr(i,1,m)
{
    cin>>u>>v;
    a[u].push_back(v);
    a[v].push_back(u);
}
memset(vis,-1,sizeof vis);
forr(i,1,n)
{
    if(vis[i]==-1)
    {
        id++;
        dfs(i);
    }
}
set<pair<int,int>>c1,c2;
forr(i,1,n)
{
    if(vis[i]==1)
       for(auto v:a[i])
         c1.insert({min(i,v),max(i,v)});
    else if(vis[i]==2)
       for(auto v:a[i])
         c2.insert({min(i,v),max(i,v)});
}
for(int i=1;i*(i-1)/2<=4000000;i++)ck[i*(i-1)/2]=1;
if((id==1&&ck[(int)c1.size()])||(id==2&&ck[(int)c1.size()]&&ck[(int)c2.size()]))cout<<"DA"<<endl;
else cout<<"NE"<<endl;
return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9724 KB Output is correct
2 Correct 9 ms 9720 KB Output is correct
3 Correct 9 ms 9720 KB Output is correct
4 Incorrect 9 ms 9720 KB Output isn't correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9724 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 9 ms 9720 KB Output is correct
4 Correct 9 ms 9720 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9720 KB Output is correct
2 Correct 9 ms 9720 KB Output is correct
3 Correct 9 ms 9720 KB Output is correct
4 Correct 12 ms 9720 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9724 KB Output is correct
2 Correct 9 ms 9720 KB Output is correct
3 Correct 9 ms 9720 KB Output is correct
4 Correct 9 ms 9720 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9704 KB Output is correct
2 Correct 9 ms 9720 KB Output is correct
3 Correct 9 ms 9720 KB Output is correct
4 Correct 9 ms 9720 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9848 KB Output is correct
4 Correct 10 ms 9896 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 10360 KB Output is correct
2 Correct 49 ms 13944 KB Output is correct
3 Correct 24 ms 11220 KB Output is correct
4 Correct 18 ms 10616 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 10176 KB Output is correct
2 Correct 54 ms 12412 KB Output is correct
3 Correct 163 ms 20760 KB Output is correct
4 Correct 197 ms 26756 KB Output is correct