제출 #477826

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
477826		sumit_kk10	걷기 (NOI12_walking)	C++17	3 / 25	5078 ms	4140 KiB

walking

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
int len, n, temp[N];
pair<int, int> tim[N];
map<pair<int, int>, bool> mp;
 
bool is_clique(int b){
    for (int i = 1; i < b; i++)
        for (int j = i + 1; j < b; j++)
            if (!mp[{temp[i], temp[j]}])
                return false;
    return true;
}
 
int maxclique(int node, int l){
    int ans = 0;
    for(int i = node + 1; i <= n; ++i){
        temp[l] = i;
        if(is_clique(l + 1)){
            ans = max(ans, l);
            ans = max(ans, maxclique(i, l + 1));
        }
    }
    return ans;
}
 
void solve(){
    cin >> len >> n;
    for(int i = 1; i <= n; ++i)
        cin >> tim[i].first >> tim[i].second;
    sort(tim + 1, tim + n + 1);
    for(int i = 1; i <= n; ++i){
        long double cur = (ld) ((ld) len/(ld) tim[i].second) + tim[i].first;
        for(int j = i + 1; j <= n; ++j){
            if(cur > ((ld) ((ld) len / (ld) tim[j].second) + tim[j].first)){
                mp[{i, j}] = true;
                mp[{j, i}] = true;
            }
        }
    }
    cout << maxclique(0, 1) << "\n";
}
 
int main(){
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 5
• Subtask 4: 0 / 7
• Subtask 5: 0 / 7