제출 #1263636

#제출 시각아이디문제언어결과실행 시간메모리
1263636piolkDetecting Molecules (IOI16_molecules)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; vector<int> find_subset(int l,int r,vector<int> w){ unordered_map<int,vector<int>> wyst; // value,index for (int i=0;i<w.size();i++) wyst[w[i]].push_back(i+1); sort(w.begin(),w.end()); int n=w.size(); int R=-1; int L=0; int sum=0; while (R<n-1){ R++; sum+=w[R]; while (sum>r && L<R){ sum-=w[L]; L++; } if (sum>=l && sum<=r){ vector<int> indices; for (int i=L;i<=R;i++){ int index=wyst[w[i]].back(); wyst[w[i]].pop_back(); indices.push_back(index); } return indices; } } return {}; }

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

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#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...