結果
| 問題 | No.801 エレベーター |
| ユーザー |
 fiord
|
| 提出日時 | 2019-06-07 22:04:42 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 3,468 bytes |
| コンパイル時間 | 992 ms |
| コンパイル使用メモリ | 116,680 KB |
| 最終ジャッジ日時 | 2024-11-14 21:28:20 |
| 合計ジャッジ時間 | 1,456 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of 'std::istream& operator>>(std::istream&, std::vector<_Tp>&) [with T = std::pair<int, int>; std::istream = std::basic_istream<char>]':
main.cpp:109:29: required from here
main.cpp:49:36: error: no match for 'operator>>' (operand types are 'std::istream' {aka 'std::basic_istream<char>'} and 'std::pair<int, int>')
49 | for (T& x : vec) is >> x;
| ~~~^~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:40,
from main.cpp:2:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:120:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(__istream_type& (*)(__istream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
120 | operator>>(__istream_type& (*__pf)(__istream_type&))
| ^~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:120:36: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'std::basic_istream<char>::__istream_type& (*)(std::basic_istream<char>::__istream_type&)' {aka 'std::basic_istream<char>& (*)(std::basic_istream<char>&)'}
120 | operator>>(__istream_type& (*__pf)(__istream_type&))
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:124:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(__ios_type& (*)(__ios_type&)) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>; __ios_type = std::basic_ios<char>]'
124 | operator>>(__ios_type& (*__pf)(__ios_type&))
| ^~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:124:32: note: no known conversion for argumen
ソースコード
#define _USE_MATH_DEFINES#include <iostream>#include <fstream>#include <cstdio>#include <cmath>#include <cstdlib>#include <cstring>#include <cassert>#include <string>#include <vector>#include <utility>#include <complex>#include <set>#include <map>#include <unordered_map>#include <queue>#include <stack>#include <deque>#include <tuple>#include <bitset>#include <limits>#include <algorithm>#include <array>#include <random>#include <complex>#include <regex>using namespace std;typedef long double ld;typedef long long ll;typedef vector<int> vint;typedef vector<ll> vll;typedef pair<int, int> pii;typedef pair<ll, ll> pll;typedef pair<double, double> pdd;typedef complex<ld> compd;#define quickIO() {cin.tie(0); cout.sync_with_stdio(false);}#define reach(i,a) for(auto i:a)#define rep(i,n) for(int i=0;i<((int)n);i++)#define REP(i,n) for(int i=0;i<=((int)n);i++)#define srep(i,a,n) for(int i=a;i<((int)n);i++)#define SREP(i,a,n) for(int i=a;i<=((int)n);i++)#define rrep(i,n) for(int i=n-1;i>=0;i--)#define RREP(i,n) for(int i=n;i>=0;i--)#define all(a) (a).begin(),(a).end()#define mp(a,b) make_pair(a,b)#define mt make_tuple#define pb push_backtemplate<typename T> istream & operator >> (istream & is, vector<T> & vec) {for (T& x : vec) is >> x;return is;}template<typename T> ostream& operator << (ostream & os, vector<T> & vec) {os << "[";rep(i, vec.size()) os << (i ? ", " : "") << vec[i];os << "]";return os;}template<typename T> istream & operator >> (istream & is, pair<T, T> & p) {is >> p.first >> p.second;return is;}template<typename T> ostream& operator << (ostream & os, pair<T, T> & p) {os << p.first << " " << p.second;return os;}int bitcnt(ll x) {x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);return x;}int bitcnt(int x) {x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);return x;}ll sqrtll(ll x) {ll left = 0, right = x;rep(i, 100) {ll mid = (left + right) >> 1;if (mid * mid <= x) left = mid;else right = mid;}return left;}ll gcd(ll a, ll b) {return b == 0 ? a : gcd(b, a % b);}#define debug(x) printf("Case #%d: ", x)#define DEBUG 0const ld infl = 1e100;const ll mod = 1e9 + 7;const ld eps = 1e-9;const ll inf = 1e18;const int dx[] = { 1,0,-1,0,0 };const int dy[] = { 0,1,0,-1,0 };ll dp[3010][3010];ll sum[3010];int main() {int n, m, k; cin >> n >> m >> k;vector<pii> dat(m); cin >> dat;dp[0][1] = 1;rep(i, k) {// dp[i]を累積和にsum[0] = 0;SREP(j, 1, n) sum[j] = (sum[j - 1] + dp[i][j]) % mod;// 各エレベーター毎にimosをdp[i+1]に貼るrep(j, m) {ll add = (sum[dat[j].second] - sum[dat[j].first - 1] + mod) % mod;(dp[i + 1][dat[j].first] += add) %= mod;(dp[i + 1][dat[j].second + 1] += mod - add) %= mod;}// imosSREP(j, 1, n) {dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i + 1][j]) % mod;}}cout << dp[k][n] << endl;return 0;}