結果
| 問題 | No.5 数字のブロック |
| コンテスト | |
| ユーザー |
aucuba_
|
| 提出日時 | 2018-12-19 20:04:24 |
| 言語 | C++11 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 454 bytes |
| 記録 | |
| コンパイル時間 | 356 ms |
| コンパイル使用メモリ | 77,232 KB |
| 実行使用メモリ | 7,976 KB |
| 最終ジャッジ日時 | 2026-04-12 12:44:22 |
| 合計ジャッジ時間 | 4,292 ms |
|
ジャッジサーバーID (参考情報) |
judge1_0 / judge2_1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | RE * 34 |
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:7:18: warning: 'n' is used uninitialized [-Wuninitialized]
7 | vector<int> w(n);
| ^
main.cpp:6:14: note: 'n' declared here
6 | long int l,n;
| ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/string:50,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/locale_classes.h:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ios_base.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ios:46,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ostream.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ostream:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/iostream:43,
from main.cpp:1:
In member function 'constexpr __gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = int*; _Container = std::vector<int>]',
inlined from 'int main()' at main.cpp:23:23:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_iterator.h:1148:47: warning: 'itr' may be used uninitialized [-Wmaybe-uninitialized]
1148 | { return __normal_iterator(_M_current + __n); }
| ^~~
main.cpp: In function 'int main()':
main.cpp:15:9: note: 'itr' was declared here
15 | int itr;
| ^~~
ソースコード
#include<iostream>
#include<vector>
using namespace std;
int main(){
long int l,n;
vector<int> w(n);
cin>>l>>n;
for(int i=0;i<n;i++){
cin>>w[i];
}
int count=0;
while(1){
int min=l;
int itr;
for(int i=0;i<w.size();i++){
if(min>w[i]){
min=w[i];
itr=i;
}
}
l=l-min;
w.erase(w.begin()+itr);
if(l<0)break;
if(w.size()<=0)break;
count++;
}
cout<<count<<endl;
return 0;
}
aucuba_