結果

問題 No.1477 Lamps on Graph
ユーザー 👑 Nachia
提出日時 2021-04-16 20:54:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 175 ms / 2,000 ms
コード長 902 bytes
コンパイル時間 1,056 ms
コンパイル使用メモリ 85,400 KB
最終ジャッジ日時 2025-01-20 19:08:07
ジャッジサーバーID
(参考情報)
judge2 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 38
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:17:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   17 |   scanf("%d%d",&N,&M);
      |   ~~~~~^~~~~~~~~~~~~~
main.cpp:19:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   19 |   rep(i,N) scanf("%d",&A[i]);
      |            ~~~~~^~~~~~~~~~~~
main.cpp:22:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   22 |     int u,v; scanf("%d%d",&u,&v); u--; v--;
      |              ~~~~~^~~~~~~~~~~~~~
main.cpp:26:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   26 |   scanf("%d",&K);
      |   ~~~~~^~~~~~~~~
main.cpp:28:25: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   28 |   rep(i,N){ int b; scanf("%d",&b); b--; X[b]=1; }
      |                    ~~~~~^~~~~~~~~

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
using ll=long long;
using ull=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int N,M;
vector<vector<int>> E;
vector<int> A;
int K;
vector<int> X;
int main(){
scanf("%d%d",&N,&M);
A.resize(N);
rep(i,N) scanf("%d",&A[i]);
E.resize(N);
rep(i,M){
int u,v; scanf("%d%d",&u,&v); u--; v--;
E[u].push_back(v);
E[v].push_back(u);
}
scanf("%d",&K);
X.assign(N,0);
rep(i,N){ int b; scanf("%d",&b); b--; X[b]=1; }
vector<pair<int,int>> Ord;
rep(i,N) Ord.push_back({A[i],i});
sort(Ord.begin(),Ord.end());
vector<int> ans;
rep(i,N){
int p = Ord[i].second;
if(X[p]==0) continue;
ans.push_back(p);
X[p] ^= 1;
for(int e:E[p]) if(A[e]>A[p]) X[e] ^= 1;
}
printf("%d\n",(int)ans.size());
for(int a:ans) printf("%d\n",a+1);
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0