제출 #161395

#제출 시각아이디문제언어결과실행 시간메모리
161395georgerapeanu무제 (POI11_imp)C++11
0 / 100
1125 ms42776 KiB
#include <cstdio> #include <vector> #include <algorithm> #include <ctime> #include <cstdlib> using namespace std; const int NMAX = 3000; int n,m; vector<int> graph[NMAX + 5]; int gr[NMAX + 5]; bool del[NMAX + 5]; int main(){ scanf("%d %d",&n,&m); for(int i = 1;i <= m;i++){ int x,y; scanf("%d %d",&x,&y); gr[x]++; gr[y]++; graph[x].push_back(y); graph[y].push_back(x); } vector<int> elim; for(int i = 1;i <= n;i++){ if(gr[i] < 2 * n / 3 - 1){ elim.push_back(i); del[i] = true; } } for(int i = 0;i < (int)elim.size();i++){ for(auto it:graph[elim[i]]){ gr[it]--; if(del[it] == false && gr[it] < 2 * n / 3 - 1){ del[it] = true; elim.push_back(it); } } } vector<pair<int,int> > nodes; for(int i = 1;i <= n;i++){ if(del[i] == false){ nodes.push_back({gr[i],i}); } } sort(nodes.begin(),nodes.end()); reverse(nodes.begin(),nodes.end()); elim.clear(); for(int i = 0;i < n / 3;i++){ elim.push_back(nodes[i].second); del[nodes[i].second] = true; } for(int i = 0;i < (int)elim.size();i++){ for(auto it:graph[elim[i]]){ gr[it]--; if(del[it] == false && gr[it] < n / 3 - 1){ del[it] = true; elim.push_back(it); } } } vector<int> ans; for(int i = 1;i <= n;i++){ if(del[i] == false){ ans.push_back(i); } } srand(time(NULL)); random_shuffle(ans.begin(),ans.end()); ans.resize(n / 3); for(auto it:ans){ printf("%d ",it); } return 0; }

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

imp.cpp: In function 'int main()':
imp.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
imp.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...