Submission #1155827
Source Code Expand
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cmath>
#include <complex>
#include <cctype>
#include <cassert>
#include <sstream>
#include <ctime>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, int> P;
#define INF (1<<29)
#define INFL (1ll<<60)
#define EPS (1e-8)
#define PI (acos(-1))
const ll MOD = 1000000007ll;
int n;
int a[112345], b[112345];
vector<pii> v[1123456];
pii dp[1123456];
int main() {
cin >> n;
REP(i, n) {
scanf("%d %d", a + i, b + i);
v[a[i]].push_back(pii(b[i], i + 1));
}
for (int i = 1000000; i >= 0; i--) {
chmax(dp[i], dp[i + 1]);
REP(j, v[i].size()) chmax(dp[i], pii(dp[v[i][j].first].first + 1, -v[i][j].second));
}
vector<int> ans;
int now = 0;
REP(i, dp[0].first) {
int tmp = -dp[now].second - 1;
ans.push_back(tmp + 1);
now = b[tmp];
}
cout << ans.size() << endl;
REP(i, ans.size()) printf("%d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
return 0;
}
Submission Info
Submission Time
2017-03-12 15:11:13+0900
Task
C - 仕事計画
User
tkmst201
Language
C++ (GCC 5.4.1)
Score
100
Code Size
1498 Byte
Status
AC
Exec Time
58 ms
Memory
39928 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:45:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", a + i, b + i);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
100 / 100
Status
Set Name
Test Cases
Sample
sample1.txt, sample2.txt, sample3.txt
All
0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name
Status
Exec Time
Memory
0.txt
AC
15 ms
35328 KB
1.txt
AC
15 ms
35328 KB
10.txt
AC
16 ms
35328 KB
11.txt
AC
15 ms
35328 KB
12.txt
AC
16 ms
35328 KB
13.txt
AC
16 ms
35328 KB
14.txt
AC
16 ms
35456 KB
15.txt
AC
16 ms
35328 KB
16.txt
AC
16 ms
35328 KB
17.txt
AC
16 ms
35456 KB
18.txt
AC
30 ms
37376 KB
19.txt
AC
32 ms
37376 KB
2.txt
AC
16 ms
35328 KB
20.txt
AC
48 ms
39040 KB
21.txt
AC
30 ms
37376 KB
22.txt
AC
32 ms
37248 KB
23.txt
AC
58 ms
39928 KB
3.txt
AC
15 ms
35328 KB
4.txt
AC
15 ms
35328 KB
5.txt
AC
16 ms
35328 KB
6.txt
AC
16 ms
35328 KB
7.txt
AC
15 ms
35328 KB
8.txt
AC
15 ms
35328 KB
9.txt
AC
15 ms
35328 KB
sample1.txt
AC
15 ms
35328 KB
sample2.txt
AC
16 ms
35328 KB
sample3.txt
AC
16 ms
35456 KB