oj.uz

Submission #368476

# Submission time Handle Problem Language Result Execution time Memory
368476 2021-02-20T04:42:33 Z 1306439119 Traffic (IOI10_traffic) C++11
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define pi pair<int, int>
#define endl '\n'

void setIO(string name = "") { 
    ios_base::sync_with_stdio(0); 
	cin.tie(0);     
    if (name.length()) {
        freopen((name+".in").c_str(), "r", stdin); 
        freopen((name+".out").c_str(), "w", stdout);
    }
}

struct node{
    int id, person;
    vector<node*> adj;
    node(int i, int p, vector<node*> a){
        id = i;
        person = p;
        adj = a;
    }
};

int n;
node* A[1000000];

ll dfs(node* curr, int prev){
    ll sum = curr->person;
    for(node* next : curr->adj){
        if(prev != next->id){
            sum += dfs(next, curr->id);
        }
    }
    return sum;
}

ll root(node* root){    
    ll ret = 0;    
    for(node* next : root->adj){        
        ret = max(ret, dfs(next, root->id) - root->person);
    }
    return ret;
}

int LocateCentre(int n, int* p, int* s, int* d){
    for(int i = 0; i < n; i++){        
        A[i] = new node(i, p[i], vector<node*>());        
    }
    for(int i = 0; i < n-1; i++){        
        A[s[i]]->adj.push_back(A[d[i]]);
        A[d[i]]->adj.push_back(A[s[i]]);
    }        

    ll res = LLONG_MAX, ret = -1;
    for(int i = 0; i < n; i++){        
        ll curr = root(A[i]);        
        if(curr < res){            
            res = curr;
            ret = A[i]->id;
        }
    }

    return ret;
}

/*int main(){			 
    setIO("");               
    int* p = new int[5]; 
    int* s = new int[4]; 
    int* d = new int[4];
    p[0] = 10, p[1] = 10, p[2] = 10, p[3] = 20, p[4] = 20;
    s[0] = 0, s[1] = 1, s[2] = 2, s[3] = 3;
    d[0] = 2, d[1] = 2, d[2] = 3, d[3] = 4;    
    cout << LocateCentre(5, p, s, d) << endl;;

    return 0;
}*/

Compilation message

traffic.cpp: In function 'void setIO(std::string)':
traffic.cpp:12:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   12 |         freopen((name+".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
traffic.cpp:13:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   13 |         freopen((name+".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Incorrect 1 ms 364 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Incorrect 1 ms 364 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Incorrect 1 ms 364 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Incorrect 1 ms 364 KB Output isn't correct
11 Halted 0 ms 0 KB -