Submission #4031011
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> using namespace std; int main() { int n, index; cin >> n; vector<int> a(n), s; for(int i = 0; i < n; i++){ scanf("%d", &a[i]); if(binary_search(s.begin(), s.end(), a[i]) == 0) s.push_back(a[i]); sort(s.begin(), s.end()); } for(int i = 0; i < n; i++){ index = lower_bound(s.begin(), s.end(), a[i]) - s.begin(); printf("%d\n", index); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 座圧 |
User | echt |
Language | C++14 (GCC 5.4.1) |
Score | 30 |
Code Size | 493 Byte |
Status | TLE |
Exec Time | 2107 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a[i]); ^
Judge Result
Set Name | Testset1 | Testset2 | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 30 / 30 | 0 / 30 | 0 / 40 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Testset1 | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt |
Testset2 | 000.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 1 ms | 256 KB |
001.txt | AC | 6 ms | 256 KB |
002.txt | AC | 13 ms | 256 KB |
003.txt | AC | 11 ms | 256 KB |
004.txt | AC | 11 ms | 256 KB |
005.txt | AC | 7 ms | 256 KB |
006.txt | AC | 2 ms | 256 KB |
007.txt | AC | 14 ms | 256 KB |
008.txt | AC | 1 ms | 256 KB |
009.txt | AC | 11 ms | 256 KB |
010.txt | TLE | 2103 ms | 768 KB |
011.txt | AC | 452 ms | 1024 KB |
012.txt | TLE | 2103 ms | 768 KB |
013.txt | TLE | 2107 ms | 768 KB |
014.txt | TLE | 2103 ms | 768 KB |
015.txt | TLE | 2103 ms | 768 KB |
016.txt | TLE | 2103 ms | 768 KB |
017.txt | TLE | 2103 ms | 768 KB |
018.txt | TLE | 2103 ms | 768 KB |
019.txt | TLE | 2103 ms | 768 KB |
020.txt | TLE | 2103 ms | 768 KB |
021.txt | TLE | 2103 ms | 768 KB |
022.txt | TLE | 2103 ms | 768 KB |
023.txt | TLE | 2103 ms | 768 KB |
024.txt | TLE | 2103 ms | 768 KB |
025.txt | TLE | 2103 ms | 640 KB |
026.txt | TLE | 2103 ms | 768 KB |
027.txt | TLE | 2103 ms | 768 KB |
028.txt | TLE | 2103 ms | 768 KB |
029.txt | TLE | 2103 ms | 768 KB |