제출 #43755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
43755		imaxblue	무제 (POI11_imp)	C++14	100 / 100	1431 ms	65536 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>dazaq
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() ((rand() << 14)+rand())
#define scan(X) do{while((X=getchar())<'0'); for(X-='0'; '0'<=(_=getchar()); X=(X<<3)+(X<<1)+_-'0');}while(0)
char _;
#define pi 3.14159265358979323846

int n, m, a, b;
bool adj[3005][3005], u[3005];
int main(){
    scanf("%i%i", &n, &m);
    fox(l, m){
        scanf("%i%i", &a, &b);
        adj[a][b]=adj[b][a]=1;
    }
    fox1(l, n){
        if (u[l]) continue;
        fox1(l2, n){
            if (u[l2] || l==l2) continue;
            if (!adj[l][l2]){
                u[l]=1; u[l2]=1;
                //cout << l << ' ' << l2 << endl;
                break;
            }
        }
    }
    int c=0;
    fox1(l, n){
        if (u[l]) continue;
        c++;
        printf("%i ", l);
        if (c==n/3) break;
    }
    return 0;
}

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

imp.cpp: In function 'int main()':
imp.cpp:33:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i", &n, &m);
                          ^
imp.cpp:35:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i", &a, &b);
                              ^

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9
• Subtask 11: 10 / 10