Submission #1294564
Source Code Expand
#include <iostream> #include <cstdio> #include <vector> #include <algorithm> using namespace std; int main(){ int n,a[100000]; vector<int> vec; scanf("%d",&n); for(int i = 0;i < n;i++){ scanf("%d",&a[i]); vec.push_back(a[i]); } sort(vec.begin(),vec.end()); vec.erase(unique(vec.begin(),vec.end()),vec.end()); for(int i = 0;i < n;i++){ int pos = lower_bound(vec.begin(),vec.end(),a[i]) - vec.begin(); cout << pos << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 座圧 |
User | hoget157 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 474 Byte |
Status | AC |
Exec Time | 190 ms |
Memory | 1784 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:10:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:12:20: 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 | 30 / 30 | 40 / 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 | 3 ms | 256 KB |
002.txt | AC | 3 ms | 256 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 3 ms | 256 KB |
005.txt | AC | 3 ms | 256 KB |
006.txt | AC | 3 ms | 256 KB |
007.txt | AC | 3 ms | 256 KB |
008.txt | AC | 3 ms | 256 KB |
009.txt | AC | 3 ms | 256 KB |
010.txt | AC | 178 ms | 1656 KB |
011.txt | AC | 171 ms | 1528 KB |
012.txt | AC | 182 ms | 1656 KB |
013.txt | AC | 179 ms | 1656 KB |
014.txt | AC | 185 ms | 1656 KB |
015.txt | AC | 181 ms | 1656 KB |
016.txt | AC | 182 ms | 1656 KB |
017.txt | AC | 184 ms | 1656 KB |
018.txt | AC | 183 ms | 1656 KB |
019.txt | AC | 184 ms | 1656 KB |
020.txt | AC | 190 ms | 1784 KB |
021.txt | AC | 185 ms | 1784 KB |
022.txt | AC | 181 ms | 1656 KB |
023.txt | AC | 188 ms | 1784 KB |
024.txt | AC | 188 ms | 1784 KB |
025.txt | AC | 183 ms | 1656 KB |
026.txt | AC | 183 ms | 1656 KB |
027.txt | AC | 188 ms | 1784 KB |
028.txt | AC | 180 ms | 1656 KB |
029.txt | AC | 185 ms | 1784 KB |