oj.uz

Submission #477813

# Submission time Handle Problem Language Result Execution time Memory
477813 2021-10-04T01:54:26 Z sumit_kk10 Walking (NOI12_walking) C++14
0 / 25
 17 ms 23912 KB 
#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, v[N], res;
vector<int> graph[N];
vector<bool> vis(N);
pair<int, int> tim[N];

void dfs(int node){
    vis[node] = true;
    ++res;
    for(auto k : graph[node]){
        if(!vis[k])
            dfs(k);
    }
}

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);
    int ans = 0;
    for(int i = 1; i <= n; ++i){
        res = 1;
        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)){
                ++res;
            }
        }
        ans = max(ans, res);
    }
    cout << ans << "\n";
}

int main(){
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 23884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 23884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 23884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 23884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 23912 KB Output isn't correct
2 Halted 0 ms 0 KB -