# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
846368 | 2023-09-07T14:04:29 Z | vjudge1 | KOVANICE (COI15_kovanice) | C++ | 2000 ms | 52148 KB |
#include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); long long a,b,c,d,e,t,m; cin>>a>>b>>c; string kel; long long arr[b + 5]; vector <long long> es[b + 5]; queue <long long> que; vector <long long> ana; memset(arr,0,sizeof(arr)); string str[c + 5]; vector <pair <long long,long long> > adj[b + 5]; d=0; for(long long i=0;b>i;i++){ es[i].push_back(i); } for(long long i=0;c>i;i++){ cin>>kel; long long y=0; e=0; long long p=1; while(kel[y] != '=' && kel[y] != '<'){ y++; e++; } long long h=0; while(e--){ h+=((kel[e] - '0')*p); p*=10; } p=1; m=0; e=kel.length(); e--; while(e > y){ m+=((kel[e] - '0')*p); p*=10; e--; } if(kel[y] == '='){ adj[h-1].push_back(make_pair(m-1,0)); adj[m-1].push_back(make_pair(h-1,0)); } else{ adj[m-1].push_back(make_pair(h-1,1)); arr[h-1]++; } } for(long long i=0;b>i;i++){ if(arr[i] == 0){ ana.push_back(i); } } memset(arr,-1,sizeof(arr)); for(long long i=0;ana.size()>i;i++){ long long vis[b + 5]; memset(vis,0,sizeof(vis)); long long cakmaarr[b + 5]; memset(cakmaarr,-1,sizeof(cakmaarr)); que.push(ana[i]); cakmaarr[ana[i]] = 0; long long pivot,enb; enb=0; while(que.size()){ pivot = que.front(); que.pop(); if(vis[pivot] == 0){ vis[pivot] = 1; for(long long j=0;adj[pivot].size()>j;j++){ if(vis[adj[pivot][j].first] == 0 ){ cakmaarr[adj[pivot][j].first] = cakmaarr[pivot] + adj[pivot][j].second; if(enb < (cakmaarr[pivot] + adj[pivot][j].second)){ enb = cakmaarr[pivot] + adj[pivot][j].second; } que.push(adj[pivot][j].first); } } } } if(a == (enb + 1)){ for(long long j=0;b>j;j++){ if(cakmaarr[j] != -1){ arr[j]=cakmaarr[j]; } } } } for(long long i=0;b>i;i++){ if(arr[i] != -1){ cout<<"K"<<a - arr[i]<<"\n"; } else{ cout<<"?\n"; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 604 KB | Output is correct |
2 | Correct | 3 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2083 ms | 28900 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 6492 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2024 ms | 52148 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |